Medical diagnosis using Large Multimodal Models (LMMs) has gained increasing attention due to capability of these models in providing precise diagnoses. These models generally combine medical questions with visual inputs to generate diagnoses or treatments. However, they are often overly general and unsuitable under the wide range of medical conditions in real-world healthcare. In clinical practice, diagnosis is performed by multiple specialists, each contributing domain-specific expertise. To emulate this process, a potential solution is to deploy a dynamic multi-agent LMM framework, where each agent functions as a medical specialist. Current approaches in this emerging area, typically relying on static or predefined selection of various specialists, cannot be adapted to the changing practical scenario. In this paper, we propose MedRoute, a flexible and dynamic multi-agent framework that comprises of a collaborative system of specialist LMM agents. Furthermore, we add a General Practitioner with an RL-trained router for dynamic specialist selection, and a Moderator that produces the final decision. In this way, our framework closely mirrors real clinical workflows. Extensive evaluations on text and image-based medical datasets demonstrate improved diagnostic accuracy, outperforming the state-of-the-art baselines. Our work lays a strong foundation for future research. Code and models are available at this https URL.

Automated phoneme-level pronunciation assessment is vital for scalable speech therapy and language learning, yet validated tools for Arabic remain scarce. We present Harf-Speech, a modular system scoring Arabic pronunciation at the phoneme level on a clinical scale. It combines an MSA phonetizer, a fine-tuned speech-to-phoneme model, Levenshtein alignment, and a blended scorer using longest common subsequence and edit-distance metrics. We fine-tune three ASR architectures on Arabic phoneme data and benchmark them with zero-shot multimodal models; the best, OmniASR-CTC-1B-v2, achieves 8.92\% phoneme error rate. Three certified speech-language pathologists independently scored 40 utterances for clinical validation. Harf-Speech attains a Pearson correlation of 0.791 and ICC(2,1) of 0.659 with mean expert scores, outperforming existing end-to-end assessment frameworks. These results show Harf-Speech yields clinically aligned, interpretable scores comparable to inter-rater expert agreement.

Sign language recognition (SLR) is vital for bridging communication gaps between deaf and hearing communities. Vision-based approaches suffer from occlusion, computational costs, and physical constraints. This work presents a comparison of machine learning (ML) and deep learning models for a custom triboelectric nanogenerator (TENG)-based sensor glove. Utilizing multivariate time-series data from five flex sensors, the study benchmarks traditional ML algorithms, feedforward neural networks, LSTM-based temporal models, and a multi-sensor MFCC CNN-LSTM architecture across 11 sign classes (digits 1-5, letters A-F). The proposed MFCC CNN-LSTM architecture processes frequency-domain features from each sensor through independent convolutional branches before fusion. It achieves 93.33% accuracy and 95.56% precision, a 23-point improvement over the best ML algorithm (Random Forest: 70.38%). Ablation studies reveal 50-timestep windows offer a tradeoff between temporal context and training data volume, yielding 84.13% accuracy compared to 58.06% with 100-timestep windows. MFCC feature extraction maps temporal variations to execution-speed-invariant spectral representations, and data augmentation methods (time warping, noise injection) are essential for generalization. Results demonstrate that frequency-domain feature representations combined with parallel multi-sensor processing architectures offer enhancement over classical algorithms and time-domain deep learning for wearable sensor-based gesture recognition. This aids assistive technology development.

Four-dimensional scanning transmission electron microscopy (4D-STEM) generates multi-gigabyte datasets, creating a growing mismatch between acquisition rates and practical storage, transfer, and interactive visualization capabilities. We systematically benchmark 13 lossless compression implementations across 5 representative datasets (8~MiB to 8~GiB, 49.5--92.8\% sparsity), with 10 independent runs per method. HDF5 provides built-in gzip compression, of which gzip-9 typically achieves the highest compression ratio but is slow. We therefore evaluate widely available alternatives (via hdf5plugin), including the Blosc family. As a representative comparison, blosc\_zstd achieves compression comparable to gzip-9 (mean 13.5$\times$ vs 12.3$\times$) while compressing 19--69$\times$ faster and reading 1.9--2.6$\times$ faster across datasets. Compression ratios are deterministic, and timing measurements are highly reproducible (CV $<$2\%). Compression performance follows a power law with sparsity ($R^2 = 0.99$), ranging from 5$\times$ for moderately sparse data to 35$\times$ for highly sparse data. We identify six top-performing implementations optimized for different use cases and demonstrate that 4D-STEM data can be routinely compressed by $>$10$\times$. While these results provide practical guidance for lossless compression selection, the broader conclusion is that lossless compression preserves measurements but does not by itself guarantee sustainable high-throughput workflows. As detector rates rise, data handling will increasingly require inference-driven representations -- i.e., deciding what must be preserved to support a scientific inference, rather than defaulting to storing fully dense raw measurements.

We present an empirical case study of cinema SDR-to-HDR mapping using ASC StEM2, a rare common-source dataset containing EXR scene-referred images and matched SDR/HDR cinema release masters from the same ACES-based mastering workflow. Based on pixel-wise statistics over all 18,580 frames of the test film, we construct a three-domain comparison involving EXR source data, SDR release masters, and HDR release masters to characterize their luminance and color structural relationships within this controlled workflow. In the luminance dimension, SDR and HDR masters exhibit a highly stable global monotonic correspondence, with geometric structure remaining largely consistent overall; sparse and structured deviations appear in self-luminous highlights and specific material regions. In the color dimension, the two masters remain largely consistent in hue, with saturation exhibiting a redistribution pattern of shadow suppression, midtone expansion, and highlight convergence. Using EXR as a scene-referred anchor, we further define a pixel-level decision map that operationally separates EXR-closer recovery regions from content-adaptive adjustment regions. Under this operational definition, 82.4% of sampled image regions are classified as EXR-closer recovery, while the remainder require localized adaptive adjustment. Rather than claiming a universal law for all cinema mastering pipelines, the study provides an interpretable quantitative baseline for structure-aware SDR-to-HDR analysis and for designing learning-based models under shared-source mastering conditions.

This paper studies the co-design of actuators, sensors, and communication in the distributed setting, where a networked plant is partitioned into subsystems each equipped with a sub-controller interacting with other sub-controllers. The objective is to jointly minimize control cost (measured by LQ cost) and material cost (measured by the number of actuators, sensors, and communication links used). We approach this using an evolutionary algorithm to selectively prune a baseline dense LQR controller. We provide convergence and stability analyses for this algorithm. For unstable plants, controller pruning is more likely to induce instability; we provide an algorithm modification to address this. The proposed methods is validated in simulations. One key result is that co-design of a 98-state swing equation model can be done on a standard laptop in seconds; the co-design outperforms naive controller pruning by over 50%.

This paper first demonstrates that applying standard incremental nonlinear dynamic inversion (INDI) with incremental control allocation (ICA) to input nonaffine systems relies on an untenable linear approximation of the actuator model. It then shows that avoiding this issue, while retaining the static control allocation paradigm, generally requires solving a nonlinear programming (NLP) problem. To address the associated online computational challenges, the paper subsequently presents a supervised learning-based approach. Numerical experiments on an example problem validate the identified limitations of standard INDI + ICA for input nonaffine systems, while also demonstrating that the proposed learning-based method provides an effective and computationally tractable alternative.

Long-term beamforming (LTBF) is a widely-used scalable alternative to instantaneous multi-user MIMO processing that leverages slowly varying spatial channel statistics. VLSI implementations require matrix inversion that become computationally challenging for massive MIMO systems with large number of antennas. In this work, we show that dominant interferers significantly degrade the numerical conditioning of the LTBF covariance matrix, leading to severe performance loss in finite-precision implementations of polynomial and conjugate gradient (CG) based inversion methods. To address this issue, we propose a subspace nulling approach that operates solely on long-term channel statistics and acts as an implicit preconditioning step for LTBF. By projecting the received signal onto the orthogonal complement of the dominant interference subspace, the proposed method reduces the eigenvalue spread of the covariance matrix and improves numerical stability. Through ray-tracing simulations in a realistic 5G scenario, we demonstrate that the proposed method substantially reduces the number of CG iterations required to achieve near-optimal performance across floating-point and fixed-point implementations while preserving the low-overhead nature of LTBF.

The decarbonisation of heavy-duty railway networks requires maximising the capacity of existing electrical infrastructure. Integrating heavy freight alongside fast passenger services exposes the hard physical limits of conventional AC traction networks, causing severe localised power quality degradation, phase unbalance, and low-voltage behaviour that triggers protective substation tripping. Because upgrading physical hardware is highly capital-intensive, software-based Energy Management Strategies (EMS) have the potential to offer viable solution for preventing these power capacity challenges. This systematic review demonstrates that traditional, single-train optimisations are fundamentally "grid-blind", necessitating a shift toward multi-train simulations to protect the network's Firm Service Capacity (FSC). However, evaluating this shift reveals a critical tension between the computational bottlenecks of deterministic models and the latency of heuristic approaches. Furthermore, a fundamental operational gap exists: while current algorithms generate theoretically optimal speed profiles to increase efficiency and therefore reduce power consumption from the grid, these profiles are excessively complex and inappropriate for human execution. Consequently, future EMS frameworks must bridge this human-machine interface gap to realise capacity improvements on constrained mixed-traffic networks.

A multiobjective, multiperiod global optimization framework is developed for the design, sizing, and dispatch of an islanded hybrid microgrid. System sizing is optimized over a one-year horizon and operational dispatch over a representative day, both at hourly resolution. The formulation minimizes lifecycle levelized cost of energy, emissions, lost load, and dumped energy, while maximizing renewable penetration. The approach identifies optimal capacities of renewable generation, storage, and backup generation that balance affordability, sustainability, reliability, and efficiency. Among the methods evaluated, particle swarm optimization is well suited for the nonconvex, multiobjective sizing problem. Results show that a solar PV-wind microgrid with lithium-ion battery storage and diesel backup consistently outperforms alternatives. Cost considerations dominate allocation among renewable sources, while sizing of renewables and storage is influenced by standby generation ratings due to reliability constraints. Pareto-optimal solutions reveal key tradeoffs among economic, environmental, and reliability objectives, showing that cost-only optimization can yield poorer emissions, reliability, and curtailment outcomes. Sensitivity analyses highlight the impact of fuel prices and storage costs on optimal design. Accurate sizing reduces unnecessary oversizing used to ensure reliability in off-grid systems, lowering upfront capital needs and improving affordability of clean electricity access. The dispatch model produces day-ahead schedules generally robust to short-term uncertainty, though disturbances increase reliance on fossil backup. Effective dispatch of batteries and backup generators is critical. The study also reviews microgrid design tools and methods, and addresses applications in sub-Saharan Africa.

In this work, we propose an efficient and transparent green learning pipeline to address the automatic modulation classification (AMC) problem. This pipeline aims to enable receivers to blindly identify the modulation modes of the incoming signals in a computationally efficient way with a small model size. Our method includes the following steps. First, the input signal is transformed into a precise representation through the sparse coding method. Second, various features are extracted from the sparse coding representation with the statistics from the input signal. Third, the classification subspace is hierarchically partitioned with a tree structure to achieve a lightweight model size with good prediction accuracy. The experimental results demonstrate the effectiveness and efficiency in classifying the modulated features and representation of received signals. Compared to lightweight deep learning models, the number of model parameters is reduced by \textbf{41\%}, while the usage of Floating Point Operations (FLOPs) is only $\mathcal{O}(10^{-4})$ of the blind waveform recognition without pre-arranged knowledge of incoming waveforms.

We present a trajectory optimization algorithm for the traveling salesman problem (TSP) in graphs of convex sets (GCS). Our framework uses an augmented graph of convex sets to encode the TSP specification and solve it exactly as a shortest path problem in GCS. We establish a precise relationship between the landmark Bellman-Held-Karp algorithm and the augmented graph of convex sets with a TSP specification. Additionally, we present a branch and bound heuristic that uses minimum 1-trees to obtain certifiably optimal or near optimal solutions and scales to problems far larger than the exact framework can handle. To assess and certify performance, we explore several alternative lower bounds.

The declining synchronous inertia in power systems undergoing the energy transition increases the sensitivity of system frequency to generation and interconnector disturbances, making accurate frequency risk quantification increasingly important. Existing methods for frequency risk assessment, while valuable, lack formal uncertainty quantification, continuous hazard curves, and source-level disaggregation. This paper introduces Probabilistic Frequency Hazard Analysis (PFHA), a framework that adapts the mathematical architecture of Probabilistic Seismic Hazard Analysis (PSHA), the standard methodology in earthquake engineering, to power system frequency exceedance risk. The PFHA hazard integral computes annual exceedance rates by integrating over all combinations of loss sources, disturbance sizes, and system operating states through a frequency response prediction equation with calibrated aleatory variability. The framework is implemented with a 51-source catalogue constructed from operational data, empirical loss distributions from settlement-period generation records, Bayesian occurrence rate estimation, a dual analytical and physics-based frequency response prediction architecture, and a 324-path logic tree for epistemic uncertainty quantification. Application to the Great Britain power system using four years of operational data demonstrates agreement with the independently developed Frequency Risk and Control Report to within a factor of 1.5 at 49.2 Hz, while also quantifying the risk reduction from Dynamic Containment and Low-Frequency Demand Disconnection controls. To the author's knowledge, this is the first published explicit PSHA-style hazard-integral formulation for bulk power-system frequency exceedance risk.

Piezoelectric micromachined ultrasonic transducers (PMUTs) are widely utilized in applications that demand mechanical resilience, thermal stability, and compact form factors. Recent efforts have sought to demonstrate that single-crystal lithium niobate (LN) is a promising PMUT material platform, offering high electromechanical coupling (k^2) and bidirectional performance. In addition, advances in LN film transfer technology have enabled high-quality periodically poled piezoelectric films (P3F), facilitating a bimorph piezoelectric stack without intermediate electrodes. In this work, we showcase a bimorph PMUT incorporating a mechanically robust, 20 um thick P3F LN active layer. We establish the motivation for LN PMUTs through a material comparison, followed by extensive membrane geometry optimization and subsequent enhancement of the PMUT's k^2. We demonstrate a 775 kHz flexural mode device with a quality factor (Q) of 200 and an extracted k^2 of 6.4%, yielding a high transmit efficiency of 65 nm/V with a mechanically robust active layer. We leverage the high performance to demonstrate extreme-temperature resilience, showcasing stable device operation up to 600 degrees C and survival up to 900 degrees C, highlighting LN's potential as a resilient PMUT platform.

We study asynchronous distributed decision-making for scalable multi-agent bandit submodular maximization. We are motivated by distributed information-gathering tasks in unknown environments and under heterogeneous inter-agent communication delays. To enable scalability despite limited communication delays, existing approaches restrict each agent to coordinate only with its one-hop neighbors. But these approaches assume homogeneous communication delays among the agents and a synchronous global clock. In practice, however, delays are heterogeneous, and agents operate with mismatched local clocks. That is, each agent does not receive information from all neighbors at the same time, compromising decision-making. In this paper, we provide an asynchronous coordination algorithm to overcome the challenges. We establish a provable approximation guarantee against the optimal synchronized centralized solution, where the suboptimality gap explicitly depends on communication delays and clock mismatches. The bounds also depend on the topology of each neighborhood, capturing the effect of distributed decision-making via one-hop-neighborhood messages only. We validate the approach through numerical simulations on multi-camera area monitoring.

This paper presents a field-based evaluation of Long Range Wide Area Network (LoRaWAN) signal propagation conducted at two locations within the Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) testbed: Lake Wheeler Field and NC State University's Centennial Campus. Three distinct transmission platforms were deployed, a ground vehicle, a multirotor drone at 50 meters, and a helikite at a steady altitude of 150 meters and 300 meters approximately. These platforms enabled a comparative study on how altitude, mobility, and terrain influence wireless signal reception across a LoRaWAN gateway network. We analyze received signal strength (RSSI) and signal-to-noise ratio (SNR) as functions of distance and spreading factor (SF). Three complementary metrics are visualized: SNR versus distance with demodulation thresholds, probability of successful reception, and SNR boxplots grouped by distance bins. These plots reveal link degradation patterns and demonstrate the role of adaptive SF selection in maintaining communication reliability. To characterize propagation behavior, we apply a log-distance path loss model to empirical data from the ground vehicle experiment, which encompass both rural and urban non-line-of-sight (NLOS) conditions. Model parameters are optimized through error minimization techniques. Our results show that the helikite platform, due to its stable high-altitude position, provided the most reliable and consistent link performance. Conversely, the drone and vehicle exhibited higher variability due to movement, obstructions, and terrain-induced multipath. These findings demonstrate the influence of platform dynamics and altitude on LoRaWAN reception performance, providing support for future aerial network planning efforts.

Ensuring safety under unknown and stochastic dynamics remains a significant challenge in reinforcement learning (RL). In this paper, we propose a model predictive control (MPC)-based safe RL framework, called Probabilistic Ensembles with CBF-constrained Trajectory Sampling (PECTS), to address this challenge. PECTS jointly learns stochastic system dynamics with probabilistic neural networks (PNNs) and control barrier functions (CBFs) with Lipschitz-bounded neural networks. Safety is enforced by incorporating learned CBF constraints into the MPC formulation while accounting for the model stochasticity. This enables probabilistic safety under model uncertainty. To solve the resulting MPC problem, we utilize a sampling-based optimizer together with a safe trajectory sampling method that discards unsafe trajectories based on the learned system model and CBF. We validate PECTS in various simulation studies, where it outperforms baseline methods.

Large volumes of medical data remain underutilized because centralizing distributed data is often infeasible due to strict privacy regulations and institutional constraints. In addition, models trained in centralized settings frequently fail to generalize across clinical sites because of heterogeneity in imaging protocols and continuously evolving data distributions arising from differences in scanners, acquisition parameters, and patient populations. Federated learning offers a promising solution by enabling collaborative model training without sharing raw data. However, incorporating differential privacy into federated learning, while essential for privacy guarantees, often leads to degraded accuracy, unstable convergence, and reduced generalization. In this work, we propose an adaptive differentially private federated learning (ADP-FL) framework for medical image segmentation that dynamically adjusts privacy mechanisms to better balance the privacy-utility trade-off. The proposed approach stabilizes training, significantly improves Dice scores and segmentation boundary quality, and maintains rigorous privacy guarantees. We evaluated ADP-FL across diverse imaging modalities and segmentation tasks, including skin lesion segmentation in dermoscopic images, kidney tumor segmentation in 3D CT scans, and brain tumor segmentation in multi-parametric MRI. Compared with conventional federated learning and standard differentially private federated learning, ADP-FL consistently achieves higher accuracy, improved boundary delineation, faster convergence, and greater training stability, with performance approaching that of non-private federated learning under the same privacy budgets. These results demonstrate the practical viability of ADP-FL for high-performance, privacy-preserving medical image segmentation in real-world federated settings.

Physics-informed neural networks (PINNs) have emerged as a powerful framework for modeling physical systems and solving inverse problems. In such settings, sensors are deployed to capture observable system responses; however, the quality of reconstruction critically depends on how these sensors are selected. Existing sensor selection strategies for PINNs are closely related to active learning and experimental design, typically relying on iterative refinement schemes that sequentially add sensors and retrain the model. While effective under limited data regimes, these approaches incur substantial computational cost due to repeated retraining and primarily focus on selecting subsets of sensors, without providing a global characterization of sensor importance. In this work, we propose FOSSA, a first-order optimality-based sensor selection algorithm for inverse PINNs. Unlike existing methods, FOSSA evaluates sensor importance in a post-training manner, requiring only a single trained PINN. FOSSA assigns importance scores to all candidate sensing locations based on the first-order optimality condition at convergence. To improve robustness, a refinement scheme is further proposed to handle instability in the inverse solver. FOSSA facilitates a global assessment of the contribution of each sensor to reconstruction. We validate the proposed approach on the inverse electrocardiography (ECG) modeling and show that not all sensors contribute positively to predictive performance. Incorporating low-importance sensors can, in fact, degrade reconstruction accuracy. These findings highlight the need for principled sensor importance evaluation and provide a scalable pathway for guiding sensor deployment in physics-informed inverse modeling.

The increasing interconnection of power systems through AC and DC links enables energy storage units to access multiple electricity markets yet most existing arbitrage models remain limited to singlemarket participation This gap restricts understanding of the economic value and operational constraints associated with crossborder storage operation To address this an optimal multiregion energy storage arbitrage model is developed for a gridscale battery located at one end of an interconnector linking two distinct dayahead markets The formulation incorporates battery capacity and ramping limits converter and interconnector losses and marketspecific buying and selling prices Using disjunctive linearization of nonlinear terms this work exactly reformulates the multiregion energy arbitrage optimization as a mixedinteger linear programming problem The proposed formulation ensures that the battery either charges or discharges from all participating energy markets simultaneously at any given time Case studies using eight years of BelgianUK price data demonstrate that multiregion participation can increase arbitrage revenue by more than 40% compared to local energy arbitrage operation only while also highlighting the negative impact of interconnector congestion on achievable gains The results indicate that crossborder market access substantially enhances storage profitability while considering the cycle of battery and that the proposed formulation provides a computationally efficient framework for evaluating and operating storage assets in interconnected power systems Finally a pseudoefficiency term is introduced to improve battery utilization by discarding less profitable charging and discharging battery cycles

Decentralized Gaussian process (GP) methods offer a scalable framework for multi-agent scalar-field estimation by replacing a centralized global model with multiple local models maintained by individual agents. A team of agents operates through overlapping domains; neighboring agents generally produce inconsistent distributions over shared regions. This paper investigates whether these inter-agent posterior discrepancies can be systematically exploited to improve team-level predictive performance and answers this question positively through a novel decentralized intersection data-sharing and assimilation protocol. Specifically, each agent constructs neighbor-specific packets from its local GP together with the geometry of the overlap between subdomains and selectively assimilates information received from neighboring agents to improve consistency of its posterior over the shared regions. The proposed architecture preserves locality in both computation and communication, supports decentralized neighbor-to-neighbor data assimilation, and allows local GP models to evolve cooperatively across the network without requiring the exchange full packet exchange or centralized inference.

High-dimensional hyperspectral imaging (HSI) enables the visualization of ultrafast molecular dynamics and complex, heterogeneous spectra. However, applying this capability to resolve spatially varying vibrational couplings in two-dimensional infrared (2DIR) spectroscopy, a type of coherent multidimensional spectroscopy (CMDS), necessitates prohibitively long data acquisition, driven by dense Nyquist sampling requirements and the need for extensive signal accumulation. To address this challenge, we introduce a physics-informed neural representation approach that efficiently reconstructs dense spatially-resolved 2DIR hyperspectral images from sparse experimental measurements. In particular, we used a multilayer perceptron (MLP) to model the relationship between the sub-sampled 4D coordinates and their corresponding spectral intensities, and recover densely sampled 4D spectra from limited observations. The reconstruction results demonstrate that our method, using a fraction of the samples, faithfully recovers both oscillatory and non-oscillatory spectral dynamics in experimental measurement. Moreover, we develop a loss-aware adaptive sampling method to progressively introduce potentially informative samples for iterative data collection while conducting experiments. Experimental results show that the proposed approach achieves high-fidelity spectral recovery using only $1/32$ of the sampling budget, as opposed to exhaustive sampling, effectively reducing total experiment time by up to 32-fold. This framework offers a scalable solution for accelerating any experiments with hypercube data, including multidimensional spectroscopy and hyperspectral imaging, paving the way for rapid chemical imaging of transient biological and material systems.

Implicit Neural Video Representation (INVR) has emerged as a novel approach for video representation and compression, using learnable grids and neural networks. Existing methods focus on developing new grid structures efficient for latent representation and neural network architectures with large representation capability, lacking the study on their roles in video representation. In this paper, the difference between INVR based on neural network and INVR based on grid is first investigated from the perspective of video information composition to specify their own advantages, i.e., neural network for general structure while grid for specific detail. Accordingly, an INVR based on mixed neural network and residual grid framework is proposed, where the neural network is used to represent the regular and structured information and the residual grid is used to represent the remaining irregular information in a video. A Coupled WarpRNN-based multi-scale motion representation and compensation module is specifically designed to explicitly represent the regular and structured information, thus terming our method as CWRNN-INVR. For the irregular information, a mixed residual grid is learned where the irregular appearance and motion information are represented together. The mixed residual grid can be combined with the coupled WarpRNN in a way that allows for network reuse. Experiments show that our method achieves the best reconstruction results compared with the existing methods, with an average PSNR of 33.73 dB on the UVG dataset under the 3M model and outperforms existing INVR methods in other downstream tasks. The code can be found at this https URL}{this https URL.

With the great success of diffusion models in image generation, diffusion-based image compression is attracting increasing interests. However, due to the random noise introduced in the diffusion learning, they usually produce reconstructions with deviation from the original images, leading to suboptimal compression results. To address this problem, in this paper, we propose a Noise Constrained Diffusion (NC-Diffusion) framework for high fidelity image compression. Unlike existing diffusion-based compression methods that add random Gaussian noise and direct the noise into the image space, the proposed NC-Diffusion formulates the quantization noise originally added in the learned image compression as the noise in the forward process of diffusion. Then a noise constrained diffusion process is constructed from the ground-truth image to the initial compression result generated with quantization noise. The NC-Diffusion overcomes the problem of noise mismatch between compression and diffusion, significantly improving the inference efficiency. In addition, an adaptive frequency-domain filtering module is developed to enhance the skip connections in the U-Net based diffusion architecture, in order to enhance high-frequency details. Moreover, a zero-shot sample-guided enhancement method is designed to further improve the fidelity of the image. Experiments on multiple benchmark datasets demonstrate that our method can achieve the best performance compared with existing methods.

Electromagnetic transient (EMT) models are index-2 differential-algebraic equations when they include certain topologies and are formulated with modified nodal analysis. Such systems are difficult to numerically integrate, a challenge that is currently addressed by applying model approximations or reformulating with index-reduction algorithms. These algorithms exist in general-purpose software tools, but their reliance on symbolic representation makes them computationally prohibitive for large network-wide EMT models. This paper derives and presents two modular index-reduced subsystem models that allow EMT models to be integrated with standard solvers, without approximations or symbolic algorithms. Both subsystems include a transformer, one isolated and one machine-coupled. We measure the computational performance of constructing EMT models with up to 1152 buses using the custom subsystem models and the symbolic algorithms. The custom approach reduces memory usage and runtime of model construction by several orders of magnitude compared to the general approach, shifting the bottleneck from construction to integration.

The rapid proliferation of data centers is reshaping modern power system dynamics. Unlike legacy industrial loads, data centers have power-electronic interfaces whose multi-timescale dynamics can interact strongly with the grid, inducing oscillatory behavior. However, analytical models that are grid-integratable for revealing the underlying resonance mechanisms remain largely unexplored. To fill this research gap, this paper derives an explicit, component-informed dynamic model of data-center power-delivery chains, which preserves component-level fidelity and captures inter-stage control interactions. This model is formulated as a time-invariant representation in the positive-sequence domain, enabling seamless integration with the phasor (or RMS) domain power-system dynamic models. The analytical derivation reveals how realistic server-load fluctuations at specific frequencies can excite coupled control modes, thereby inducing oscillation amplification and propagation in power grids with heterogeneous dynamic resources, including synchronous machines and grid-forming/following inverters. Case studies on test systems with some realistic data center data demonstrate the effectiveness of the proposed solutions.

Cost-effective, low-complexity and spectrally efficient interconnection can offer fundamental guiding law for future datacenter. In this work, we demonstrate a cost-efficient SSBI-free direct detection for datacenter interconnection, leveraging the phase diversity of residual optical carrier caused by finite-extinction ratio (ER) IQ modulators, combining the device cost-effective IQ modulator with finite-ER and efficient SSBI-free phase-diverse direct detection receiver. Specifically, the proposed solution transforms the inherent limitation of finite-ER of cost-effective IQ modulator into the residual optical carrier advantage of SSBI-free direct detection systems, eliminating SSBI without additional hardware and control complexity. A digital pre-distortion and offset correction algorithms, and a PD-thermal-noise constrained SSBI-free direct detection and signal recovery algorithms are derived and implemented. Comprehensive simulations are conducted. A Global-SNR gain of 1.78 dB and 400 Gb/s data rate are achieved in 100-km SSMF transmission when (ER_i, ER_o)= (7 dB, 25 dB) of IQ modulator. The proposed solution enables low-complexity, cost-effective, and spectrally-efficient interconnects for next-generation datacenters.

Accurate localization in non-line-of-sight (NLoS) environments remains challenging even with both angle-of-arrival (AoA) and time-of-arrival (ToA) measurements. In complex urban scenarios, the absence of line-of-sight (LoS) paths and the lack of environment prior knowledge make geometric based localization methods inapplicable, while prior-based approach such as fingerprinting is sensitive to environmental perturbations. This paper proposes a novel environment-aware localization framework enabled by the emerging concept called channel knowledge map (CKM). In the offline stage, AoA-ToA path signatures are learned by the CKM, with each path mapped to one candidate scatterer, thereby forming geometric priors within the environment. In the online stage, observed paths are matched to the CKM to extract high-confidence scatterers. Nonlinear least squares (NLS) method is then applied to jointly estimate the user and dominant scatterer locations. Even with imperfect CSI matching, geometric feasibility consistent with CKM scatterer priors provides corrective information and suppresses ambiguity. Simulations demonstrate that the proposed scheme outperforms fingerprinting and offers a robust and scalable solution to address the challenging NLoS localization for integrated sensing and communication (ISAC) systems.

The rigorous analysis of specialized physical processes often demands custom data acquisition architectures that offer flexibility and precision beyond the capabilities of general-purpose commercial loggers. This paper presents the design and implementation of a robust data acquisition system (DAQ) for a comparative analysis of the performance of two photovoltaic panels with two different cooling systems. The system integrates a custom PCB design for 20 thermistors, dual high-precision INA228 current/voltage sensors, environmental monitoring equipment, and a Raspberry Pi 4-based acquisition platform. The software architecture implements autonomous operation with enhanced fault recovery, dual storage redundancy (local CSV and InfluxDB), cloud synchronization via Google Drive, and real-time visualization through Grafana dashboards. Field deployment demonstrated system reliability, including automatic recovery from power interruptions, a 1-minute sampling rate, remote monitoring capabilities, and continuous operation during a 5 AM to 6 PM daily window. The modular hardware and software architecture enables simultaneous monitoring of two photovoltaic panels for research on direct performance comparison under identical environmental conditions.

Introduction: Mechanical thrombectomy can cause vessel deformation and procedure-related injury. Benchtop models are widely used for device testing, but time-resolved, full-field 3D vessel-motion measurements remain limited. Methods: We developed a nine-camera, low-cost multi-view workflow for benchtop thrombectomy in silicone middle cerebral artery phantoms (2160p, 20 fps). Multi-view videos were calibrated, segmented, and reconstructed with 4D Gaussian Splatting. Reconstructed point clouds were converted to fixed-connectivity edge graphs for region-of-interest (ROI) displacement tracking and a relative surface-based stress proxy. Stress-proxy values were derived from edge stretch using a Neo-Hookean mapping and reported as comparative surface metrics. A synthetic Blender pipeline with known deformation provided geometric and temporal validation. Results: In synthetic bulk translation, the stress proxy remained near zero for most edges (median $\approx$ 0 MPa; 90th percentile 0.028 MPa), with sparse outliers. In synthetic pulling (1-5 mm), reconstruction showed close geometric and temporal agreement with ground truth, with symmetric Chamfer distance of 1.714-1.815 mm and precision of 0.964-0.972 at $\tau = 1$ mm. In preliminary benchtop comparative trials (one trial per condition), cervical aspiration catheter placement showed higher max-median ROI displacement and stress-proxy values than internal carotid artery terminus placement. Conclusion: The proposed protocol provides standardized, time-resolved surface kinematics and comparative relative displacement and stress proxy measurements for thrombectomy benchtop studies. The framework supports condition-to-condition comparisons and methods validation, while remaining distinct from absolute wall-stress estimation. Implementation code and example data are available at this https URL

A conventional electric vehicle (EV) powertrain relies on a centralized high-voltage DC-AC inverter, thereby limiting cell-level control and potentially reducing overall driving range and battery lifetime. This paper studies an H-bridge-based cell-level inverter topology that performs power conversion at the cell level, enabling independent control of individual cells and expanding the design space for battery management. Leveraging these additional degrees of freedom, we propose a model-agnostic energy-throughput control strategy that extends EV range while improving battery-pack lifetime. Because usable energy (and thus driving range) and lifetime are governed by the cells with the lowest state-of-charge (SOC) and state-of-health (SOH), respectively, the proposed controller preferentially routes energy throughput to healthier cells. Specifically, during charging, it permits cell SOCs to diverge to promote SOH equalization; during discharging, it rebalances SOC to maximize usable capacity under per-cell constraints. The proposed SOC-SOH-aware control strategy is evaluated on two aging models representing lithium manganese oxide and lithium iron phosphate chemistries, using a Tesla Model 3 charge-discharge profile across 14 different parameter settings. Simulations show a 7-38% improvement in lifetime relative to a conventional SOC-only balancing baseline. More broadly, the results suggest a software-defined pathway to extend EV pack life through routine charging, with minimal reliance on specific degradation models or discharge profiles.

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.

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.

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 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.

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.

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.

Target Speaker Extraction (TSE) aims to isolate a specific speaker's voice from a mixture, guided by a pre-recorded enrollment. While TSE bypasses the global permutation ambiguity of blind source separation, it remains vulnerable to speaker confusion, where models mistakenly extract the interfering speaker. Furthermore, conventional TSE relies on static inference pipeline, where performance is limited by the quality of the fixed enrollment. To overcome these limitations, we propose EvoTSE, an evolving TSE framework in which the enrollment is continuously updated through reliability-filtered retrieval over high-confidence historical estimates. This mechanism reduces speaker confusion and relaxes the quality requirements for pre-recorded enrollment without relying on additional annotated data. Experiments across multiple benchmarks demonstrate that EvoTSE achieves consistent improvements, especially when evaluated on out-of-domain (OOD) scenarios. Our code and checkpoints are available.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Non-line-of-sight (NLOS) sensing has the potential to enable use cases like intrusion detection in occluded areas, increasing the value provided by Integrated Sensing and Communications (ISAC) in future 6G cellular networks. In this paper, we present a reliable NLOS intrusion detection system based on a millimeter-wave ISAC proof-of-concept. By leveraging reflections off a large surface, the proposed system addresses the challenge of detecting moving targets in cluttered indoor industrial scenarios where the direct line-of-sight is obstructed. A signal processing pipeline including a probability hypothesis density (PHD) filter is applied to detect targets and track movements in NLOS. Experimental validation conducted in the ARENA2036 industrial research campus demonstrates that our system can reliably detect target presence in NLOS while avoiding false alarms. Tests with synthetically generated false peaks further demonstrate the robustness of our system to false alarms. Overall, the results underline the potential of NLOS ISAC as a promising technology for enabling intrusion detection and monitoring use cases.

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.

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.

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.

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 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.

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.

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.

Conservation Voltage Reduction (CVR) relies on the effective coordination of slow-acting devices, such as OLTCs and CBs, and fast-acting devices, such as SVGs and PV inverters, typically implemented through a hierarchical multi-stage Volt-Var Control (VVC) spanning day-ahead scheduling, intra-day dispatch, and real-time control. However, existing sequential methods fail to account for the cas-cading impact of forecast errors on multi-stage decision-making. This oversight results in suboptimal day-ahead schedules for OLTCs and CBs that hinder the ef-fective coordination with fast-acting SVGs and inverters, inevitably driving a trade-off between real-time voltage security and CVR efficiency. To improve the Pareto front of this trade-off, this paper proposes a novel bi-level multi-timescale forecasting (Bi-MTF) framework for multi-stage VVC optimization. By integrating the downstream multi-stage VVC optimization into the upstream forecasting mod-els training, the decision-focused forecasting models are able to learn the trade-offs across temporal horizons. To solve the computationally challenging bi-level for-mulation, a modified sensitivity-driven integer L-shaped method is developed. It utilizes a hybrid gradient feedback mechanism that integrates numerical sensitivity analysis for discrete variables with analytical dual information for continuous fore-cast parameters to ensure tractability. Numerical results on a modified IEEE 33-bus system demonstrate that the proposed approach yields superior energy savings and operational safety compared to conventional MSE-based sequential paradigms. Specifically, as the capacity of fast-acting devices increases, the energy savings of the proposed method rise from 2.74% to 3.41%, which is far superior to the 1.50% to 1.76% achieved by conventional MSE-based sequential paradigms.

This paper studies the transmit waveform optimization for a quantized multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, where one-bit analog-to-digital converters (ADCs) are employed to enable a low-cost and power-efficient hardware implementation. Focusing on the parameter estimation task, we propose two novel Cramér-Rao bounds (CRBs) for both point-like target (PT) and extended target (ET) to characterize the impact of quantization distortion on the estimation accuracy, where associated estimation methods are also developed to approach these theoretical CRBs. Moreover, with the goal of jointly enhancing the sensing and communication performances, we formulate the bi-criterion ISAC waveform optimization problem by minimizing the derived CRB objectives subject to a communication symbol error probability (SEP) constraint and a total power constraint, which, due to the high nonlinearity of the one-bit CRBs, are extremely nonconvex. To yield a high-quality suboptimal solution, we develop an efficient alternating direction method of multipliers (ADMM) framework which exploits the majorization-minimization (MM) technique to address the nonconvex issue. Simulation results verify that the one-bit CRBs are tight for characterizing the quantized estimation performance and the proposed estimation methods also show clear performance advantages over the existing benchmark schemes. Furthermore, a flexible trade-off between the CRB and the SEP performance can be achieved by the developed ADMM framework, demonstrating the effectiveness of the optimized ISAC waveform.

On demand sensing is emerging as a key paradigm in Internet of Things (IoT) systems, where devices remain in low power states and transmit data only upon event triggers. Such an operation requires wireless communication schemes that provide low latency, minimal wake up overhead, and high energy efficiency. However, widely adopted protocols such as Bluetooth Low Energy (BLE) rely on connection oriented mechanisms that incur non negligible latency and energy overhead during sleep wake transitions, limiting their effectiveness for event driven sensing. In this work, Nordic Semiconductor's proprietary Enhanced ShockBurst (ESB) protocol is investigated as an alternative communication scheme for low power on demand IoT systems. A systematic experimental comparison between ESB and BLE is presented on the same hardware platform, evaluating packet level latency, transmission energy, achievable throughput, wake up overhead under duty cycled operation, and bidirectional communication characteristics. Results show that ESB achieves a packet latency of 0.68 ms for a 244 byte payload, reduces per packet transmission time and energy by nearly 2x, increases maximum throughput by approximately 2x, and lowers wake up time and energy by up to 10x compared with BLE. To demonstrate system level impact, an implantable loop recorder prototype with FIFO triggered electrocardiogram transmission is implemented. The ESB based system enables rapid event driven communication with a minimum communication power of 0.5 mW and reduces total system power consumption by approximately 60 percent relative to BLE. These results highlight the limitations of connection oriented protocols for on demand sensing and establish ESB as a lightweight and effective communication alternative for energy constrained IoT applications, including biomedical implants and event driven monitoring systems.

The definition of sixth-generation (6G) systems is being shaped by early standardization efforts, including the 3GPP TR 38.914 (Release 20) study on scenarios and requirements. This study introduces a comprehensive set of deployment environments, service classes, and performance targets that will guide the evolution toward IMT-2030. This article provides a design-oriented interpretation of these definitions, bridging the gap between standardized scenarios and system design. We first organize 6G deployment scenarios and emerging services into a unified framework. We then identify key design drivers derived from the 3GPP requirements, including terrestrial-non-terrestrial integration, GNSS-free operation, AI-native networking, and joint communication and sensing. Finally, we discuss the implications of these drivers on 6G architecture and highlight open challenges for future standardization and research.

Motivated by the need to develop fair and efficient schemes to facilitate the electrification of transport, this paper proposes a non-monetary karma economy for flexible Electric Vehicle (EV) charging, managing the intertemporal allocation of limited power capacity. We consider a charging facility with limited capacity that must schedule arriving EVs to charge in real-time. For this purpose, the facility adopts online karma auctions, in which each EV user is endowed with non-tradable karma tokens, places a karma bid in each time interval it is present in the facility, and capacity is allocated to the highest bidders, who must pay their bids. These payments are subsequently redistributed to the users to form a closed, indefinitely sustainable economy. The main contribution is to extend previous karma Dynamic Population Game (DPG) formulations to this setting which features novel State of Charge (SOC) dynamics and private trip deadlines in addition to urgency. A Stationary Nash Equilibrium (SNE) of the EV charging karma economy is guaranteed to exist, and it is demonstrated to provide pronounced benefits with respect to benchmark scheduling schemes as it balances between meeting deadlines and prioritizing high urgency.

Synchronization in networks of coupled oscillators is classically studied via the Kuramoto model, whose intrinsic nonlinearity limits analytical tractability and complicates control design. Complex-valued extensions circumvent this by embedding phase dynamics into a higher-dimensional linear state space, where regulating complex-state moduli to a common value recovers Kuramoto phase behavior. Existing approaches to address this problem correspond, within a unified control framework, to state-feedback and hybrid reset-based strategies, each with performance constraints. We propose two switched control designs that overcome these limitations: a switched feedforward law ensuring exact phase correspondence at all times, and a feedforward plus sliding-mode law achieving finite-time convergence without spectral gain tuning. Additionally, we present a non-autonomous complex-valued MIMO sliding-mode controller that enforces phase locking at a prescribed frequency in finite time, independent of natural frequencies and coupling strengths. Simulations confirm improved transient response, steady-state accuracy, and robustness, including synchronization of heterogeneous networks where the classical real-valued Kuramoto model fails.

A multi-hop amplify-and-forward (AF) relay network can emulate a fully connected (FC) neural network layer via over-the-air (OTA) computation. However, achieving high emulation accuracy requires accurate channel state information (CSI) across all links in the multi-hop network. In this work, we investigate the impact of CSI errors on classification performance. We propose five heuristic schemes for allocating the total channel training time (pilots) across hops and compare their effectiveness. Numerical results reveal a clear trade-off between channel training overhead and classification accuracy. In particular, with sufficient pilot power and balanced allocation of channel training resources, the system can achieve classification accuracy close to that of the digital baseline.

Secret key generation (SKG) from wireless channel reciprocity has been demonstrated on WiFi, LTE, and LoRaWAN, but has never been demonstrated on 5G New Radio (NR) Sounding Reference Signal (SRS) and CSI Reference Signal (CSIRS) measurements.

In rotary-wing aircraft, rotating blades are exposed to collisions and subsequent damage. The detection and isolation of blade damage constitute the first step in fault mitigation; however, they are particularly challenging when considerable input redundancy is available, as in the case of multirotors. In this article, we propose an active model-based approach that deliberately perturbs the control inputs to isolate blade faults in multirotor vehicles. By exploiting a model that captures the vibrations caused by blade damage, the isolation method relies solely on vibration data from the onboard inertial measurement unit. The strategy is tested in simulation using an octarotor platform, and both time-domain and frequency-domain features are analyzed. Several accuracy-related metrics of the technique are evaluated on a set of 9600 simulations and compared with the most relevant variables.

Conventional delay-Doppler (DD) communication and sensing systems require transmitting pilot frames at every channel coherence time interval in order to keep track of channel variations at the cost of spectral efficiency. In this paper, we propose an approach to utilize data transmissions modulated using arbitrary waveforms for DD channel estimation without requiring pilot transmissions in every coherence time interval. Numerical evaluation over practical doubly-selective channel models demonstrate $\sim 1.8 \times$ improvement in spectral efficiency with our proposed data-based approach over conventional pilot-based approaches across various 6G modulation schemes.

Distributed drive electric vehicles offer superior yaw moment control for autonomous drifting in extreme maneuvers. Conventional drift analysis constructs stability boundaries from open loop equilibria points and assumes a fixed envelope structure. However, coupling among control inputs reshapes the phase plane and shifts saddle point location, which can invalidate open loop envelopes when used for closed loop drifting. To address this issue, a saddle point coordinate model is established in this paper by combining a nonlinear tire model with the handling diagram and explicitly accounting for road adhesion coefficient, longitudinal velocity, front wheel steering angle, and additional yaw moment. Based on saddle point properties, an extended dual envelope framework is constructed in the phase plane of slip angle and yaw rate. Using the convergence tendency of state points toward saddle points under bounded control inputs, the outer envelope defines a recoverable set under constraints on front wheel steering angle and additional yaw moment. The inner envelope characterizes the non-drifting stability region associated with unsaturated tire forces. Finally, a nonlinear model predictive control (NMPC) controller is developed using the extended dual envelope constraint. Hardware-in-the-loop experiments show that, compared with NMPC without envelope constraints, the proposed method enables smoother convergence toward the drift saddle point, reduces the steady-state tracking errors of vehicle speed, sideslip angle, and yaw rate by 33.07%, 71.18%, and 31.27%, respectively, and decreases the peak tracking error by 63.66% under road-friction mismatch.

The rapid growth of generative artificial intelligence (AI) has introduced unprecedented computational demands, driving significant increases in the energy footprint of data centers. However, existing power consumption data is largely proprietary and reported at varying resolutions, creating challenges for estimating whole-facility energy use and planning infrastructure. In this work, we present a methodology that bridges this gap by linking high-resolution workload power measurements to whole-facility energy demand. Using NLR's high-performance computing data center equipped with NVIDIA H100 GPUs, we measure power consumption of AI workloads at 0.1-second resolution for AI training, fine-tuning and inference jobs. Workloads are characterized using MLCommons benchmarks for model training and fine-tuning, and vLLM benchmarks for inference, enabling reproducible and standardized workload profiling. The dataset of power consumption profiles is made publicly available. These power profiles are then scaled to the whole-facility-level using a bottom-up, event-driven, data center energy model. The resulting whole-facility energy profiles capture realistic temporal fluctuations driven by AI workloads and user-behavior, and can be used to inform infrastructure planning for grid connection, on-site energy generation, and distributed microgrids.

Purpose: Volumetric ultrafast ultrasound produces massive datasets with high frame rates, dense reconstruction grids, and large channel counts. Beamforming computational demands limit research throughput and prevent real-time applications in emerging modalities such as elastography, functional neuroimaging, and microscopy. Approach: We developed mach, an open-source, GPU-accelerated beamformer with a highly optimized delay-and-sum CUDA kernel and an accessible Python interface. mach uses a hybrid delay computation strategy that substantially reduces memory overhead compared to fully precomputed approaches. The CUDA implementation optimizes memory layout for coalesced access and reuses delay computations across frames via shared memory. We benchmarked mach on the PyMUST rotating disk dataset and validated numerical accuracy against existing open-source beamformers. Results: mach processes 1.1 trillion points per second on a consumer-grade GPU, achieving $>$10$\times$ faster performance than existing open-source GPU beamformers. On the PyMUST rotating disk benchmark, mach completes reconstruction in 0.23~ms, 6$\times$ faster than the acoustic round-trip time to the imaging depth. Validation against other beamformers confirms numerical accuracy with errors below $-60$~dB for Power Doppler and $-120$~dB for B-mode. Conclusions: mach achieves 1.1 trillion points per second throughput, enabling real-time 3D ultrafast ultrasound reconstruction for the first time on consumer-grade hardware. By eliminating the beamforming bottleneck, mach enables real-time applications such as 3D functional neuroimaging, intraoperative guidance, and ultrasound localization microscopy. mach is freely available at this https URL

This paper develops a sparsity-promoting integral concurrent learning (SP-ICL) adaptation law for a linearly parametrized uncertain nonlinear control-affine system. The unknown parameters are learned using ICL with sparsity-promoting $\ell_1$ regularization. The use of $\ell_1$ regularization for sparsity promotion is common in system identification and machine learning; however, unlike existing approaches, this paper develops an online parameter update law that integrates the regularization penalty with ICL via sliding modes. Using the SP-ICL update law, we show via non-smooth Lyapunov analysis that the trajectories of the closed-loop system are ultimately bounded. Simulations verify the effectiveness of the sparsity penalty in the SP-ICL update law on recovering sparse dynamics during trajectory tracking.

Accurate dietary assessment is critical for precision nutrition, yet most image-based methods rely on a single pre-consumption image and provide only coarse, meal-level estimates. These approaches cannot determine what was actually consumed and often require restrictive inputs such as depth sensing, multi-view imagery, or explicit segmentation. In this paper, we propose a simple vision-language framework for food-item-level nutritional analysis using paired before-and-after eating images. Instead of relying on rigid segmentation masks, our method leverages natural language prompts to localize specific food items and estimate their weight directly from a single RGB image. We further estimate food consumption by predicting weight differences between paired images using a two-stage training strategy. We evaluate our method on three publicly available datasets and demonstrate consistent improvements over existing approaches, establishing a strong baseline for before-and-after dietary image analysis.

Prime Video regularly conducts load tests to simulate the viewer traffic spikes seen during live events such as Thursday Night Football as well as video-on-demand (VOD) events such as Rings of Power. While these stress tests validate system capacity, they can sometimes miss service behaviors unique to real event traffic. We present a graph-based anomaly detection system that identifies under-represented services using unsupervised node-level graph embeddings. Built on a GCN-GAE, our approach learns structural representations from directed, weighted service graphs at minute-level resolution and flags anomalies based on cosine similarity between load test and event embeddings. The system identifies incident-related services that are documented and demonstrates early detection capability. We also introduce a preliminary synthetic anomaly injection framework for controlled evaluation that show promising precision (96%) and low false positive rate (0.08%), though recall (58%) remains limited under conservative propagation assumptions. This framework demonstrates practical utility within Prime Video while also surfacing methodological lessons and directions, providing a foundation for broader application across microservice ecosystems.

Spatiotemporal chaos in fluid systems exhibits severe parametric sensitivity, rendering classical adjoint-based optimal control intractable because each operating regime requires recomputing the control law. We address this bottleneck with hyperFastRL, a parameter-conditioned reinforcement learning framework that leverages Hypernetworks to shift from tuning isolated controllers per-regime to learning a unified parametric control manifold. By mapping a physical forcing parameter {\mu} directly to the weights of a spatial feedback policy, the architecture cleanly decouples parametric adaptation from spatial boundary stabilization. To overcome the extreme variance inherent to chaotic reward landscapes, we deploy a pessimistic distributional value estimation over a massively parallel environment ensemble. We evaluate three Hypernetwork functional forms, ranging from residual MLPs to periodic Fourier and Kolmogorov-Arnold (KAN) representations, on the Kuramoto-Sivashinsky equation under varying spatial forcing. All forms achieve robust stabilization. KAN yields the most consistent energy-cascade suppression and tracking across unseen parametrizations, while Fourier networks exhibit worse extrapolation variability. Furthermore, leveraging high-throughput parallelization allows us to intentionally trade a fraction of peak asymptotic reward for a 37% reduction in training wall-clock time, identifying an optimal operating regime for practical deployment in complex, parameter-varying chaotic PDEs.

In this work, we develop a control-theoretic framework for constrained optimization problems with composite objective functions including non-differentiable terms. Building on the proximal augmented Lagrangian formulation, we construct a plant whose equilibria correspond to the stationary points of the optimization problem. Within this framework, we propose two control strategies - a static controller and a dynamic controller - leading to two novel optimization algorithms. We provide a theoretical analysis, establishing global exponential convergence under strong convexity assumptions. Finally, we demonstrate the effectiveness of the proposed methods through numerical experiments, benchmarking their performance against state-of-the-art approaches.

The mean-field Schrödinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution from another by a fixed deadline. Unlike the standard Schrödinger bridge, the dynamical constraint for MFSB is the mean-field limit of a population of interacting agents with controls. It serves as a natural model for large-scale multi-agent systems. The MFSB is computationally challenging because the nonlocal interaction makes the problem nonconvex. We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm. We present numerical examples with repulsive and attractive interactions to illustrate the theoretical contributions.

The low-rank alternating direction implicit (ADI) method is an efficient and effective solver for large-scale standard continuous-time algebraic Riccati equations that admit low-rank solutions. However, the existing low-rank ADI algorithm for Riccati equations (RADI) cannot be directly applied to general-form Riccati equations, such as those involving indefinite quadratic terms. This paper introduces a generalized RADI algorithm based on an $LDL^\top$ factorization, which efficiently handles the general Riccati equations arising in important applications like state estimation and controller design. An approach for automatically and efficiently generating ADI shifts is also discussed, along with a MATLAB implementation of the generalized RADI method. Numerical examples solving several Riccati equations of order $10^6$ accurately and efficiently are presented, demonstrating the effectiveness of the proposed algorithm.

The purpose of this paper is to investigate the coherent feedback $H^\infty$ control problem for linear quantum systems. A key contribution is a simplified design methodology that guarantees closed-loop stability and a prescribed level of disturbance attenuation. It is shown that for general linear quantum systems, a physically realizable quantum controller can be obtained by solving at most four Lyapunov equations. In the passive case, a necessary and sufficient condition is provided in terms of two uncoupled pairs of Lyapunov equations. These results represent a significant simplification over the standard approach, which requires solving two coupled algebraic Riccati equations. The effectiveness of the proposed method is demonstrated through two typical quantum optical devices: an empty optical cavity and a degenerate parametric amplifier. These results provide a computationally efficient procedure for the robust and optimal control of quantum optical and optomechanical systems.

Monocular depth estimation (MDE) has attracted increasing interest in the past few years, owing to its important role in 3D vision. MDE is the estimation of a depth map from a monocular image/video to represent the 3D structure of a scene, which is a highly ill-posed problem. To solve this problem, in this paper, we propose a LiftFormer based on lifting theory topology, for constructing an intermediate subspace that bridges the image color features and depth values, and a subspace that enhances the depth prediction around edges. MDE is formulated by transforming the depth value prediction problem into depth-oriented geometric representation (DGR) subspace feature representation, thus bridging the learning from color values to geometric depth values. A DGR subspace is constructed based on frame theory by using linearly dependent vectors in accordance with depth bins to provide a redundant and robust representation. The image spatial features are transformed into the DGR subspace, where these features correspond directly to the depth values. Moreover, considering that edges usually present sharp changes in a depth map and tend to be erroneously predicted, an edge-aware representation (ER) subspace is constructed, where depth features are transformed and further used to enhance the local features around edges. The experimental results demonstrate that our LiftFormer achieves state-of-the-art performance on widely used datasets, and an ablation study validates the effectiveness of both proposed lifting modules in our LiftFormer.

Integrating renewable generation, hydrogen production, and renewable ammonia (RA) synthesis into power-to-ammonia (P2A) systems creates interactions across electricity and hydrogen markets. Limited operational flexibility, however, places RA at a disadvantage at the Nash equilibrium (NE). Recent advances in ammonia synthesis reactor design enable hot standby (HSB) operation, improving flexibility but introducing integer decision variables that complicate market equilibrium analysis. To address this challenge, we develop a potential game model and derive a convergent {\epsilon}-approximate equilibrium via an iterative best-response approach. Case studies show that HSB reduces RA's reliance on hydrogen purchases and increases its profit by 20.14%. More importantly, HSB shifts the market equilibrium toward a more mutually beneficial outcome.

Learning based multi-robot path planning methods struggle to scale or generalize to changes, particularly variations in the number of robots during deployment. Most existing methods are trained on a fixed number of robots and may tolerate a reduced number during testing, but typically fail when the number increases. Additionally, training such methods for a larger number of agents can be both time consuming and computationally expensive. However, analytical methods can struggle to scale computationally or handle dynamic changes in the environment. In this work, we propose to leverage a diffusion model based planner capable of handling dynamically varying number of agents. Our approach is trained on a limited number of agents and generalizes effectively to larger numbers of agents during deployment. Results show that integrating a single shared diffusion model based planner with dedicated inter-agent attention computation and temporal convolution enables a train small deploy-large paradigm with good accuracy. We validate our method across multiple scenarios and compare the performance with existing multi-agent reinforcement learning techniques and heuristic control based methods.

As a key capability of 6G, sensing-communication (S&C) coexistence over distributed infrastructure is expected to support next-generation ultra-reliable and low-latency communication (xURLLC) applications, which demand both robust connectivity and real-time environmental awareness. This paper investigates network-wide information freshness in large-scale cell-free massive multiple-input multiple-output (CF-mMIMO) with S&C coexistence. A challenge arises from the spatial partitioning of access points (APs) into S&C roles: allocating more APs to sensing improves update generation, whereas allocating more APs to communication enhances reliable short-packet delivery. To address this, we develop a unified analytical framework by combining stochastic geometry and stochastic network calculus (SNC) to characterize the peak age of information (PAoI) violation probability (PAVP). Specifically, we derive the moment generating functions (MGFs) of sensory packet inter-arrival and service times, accounting for the joint stochastic spatial distribution of APs and users, imperfect channel state information (CSI), and finite blocklength coding (FBC). This facilitates the derivation of a tractable upper bound on the PAVP, which is minimized to determine the optimal AP partitioning. The derived bound accurately captures the performance trend and yields a minimizing partition factor that closely matches simulations. Therefore, the framework provides an efficient and low-complexity tool for network-wide PAoI guarantee and coexistence-oriented design in CF-mMIMO networks toward xURLLC.

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.

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.

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 $\alpha = 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.

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 $\mu$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.

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.

Systems of differential equations have been used to model biological systems such as gene and neural networks. A problem of particular interest is to understand the number of stable steady states. Here we propose conjunctive networks (systems of differential equations equations created using AND gates) to achieve any desired number of stable steady states. Our approach uses combinatorial tools to predict the number of stable steady states from the structure of the wiring diagram. Furthermore, AND gates have been successfully engineered by experimentalists for gene networks, so our results provide a modular approach to design gene networks that achieve arbitrary number of phenotypes.

Accurate time synchronization is essential for Internet of Things (IoT) systems, where multiple distributed nodes must share a common time base for coordinated sensing and data fusion. However, conventional synchronization approaches suffer from nondeterministic transmission latency, limited precision, or restricted bidirectional functionality. This paper presents a protocol-independent wireless timer synchronization method that exploits radio timeslots to transmit precisely timestamped beacons in a proprietary radio mode. By decoupling synchronization from upper-layer packet retransmissions and leveraging hardware-timed radio events, the proposed approach significantly reduces scheduling uncertainty and achieves nanosecond-level synchronization accuracy. Comprehensive experiments evaluate the impacts of synchronization frequency, RSSI, BLE connection interval, and throughput on synchronization performance. The results demonstrate that an optimal synchronization frequency of 1000 Hz yields an approximately 20 ns delay in the absence of communication stack activity while maintaining sub-500 ns accuracy under most realistic BLE traffic conditions. Furthermore, larger connection intervals, lower application throughput, and higher RSSI consistently improve synchronization quality by reducing radio resource contention and packet loss. The proposed scheme provides a general and high-precision synchronization solution suitable for resource-constrained IoT systems.

Sub-terahertz (sub-THz) multi-user multiple-input multiple-output (MU-MIMO) systems unlock immense bandwidth for 6G wireless communications. However, practical deployment of wireless systems in sub-THz bands faces critical challenges such as increased atmospheric absorption, reduced channel coherence time due to increased Doppler spread at higher carrier frequencies, and hardware bottlenecks as low-loss sub-THz phase shifters are difficult to realize. To overcome the hardware and channel estimation challenges of sub-THz systems, this paper proposes a hybrid beamforming (BF) framework that integrates reconfigurable liquid crystal (LC) antennas with a liquid neural network (LNN) for transmitter. Specifically, we employ an LC antenna as the analog BF stage of a hybrid BF architecture, exploiting its voltage-driven permittivity tunability to achieve high-gain beam steering without the need for lossy phase shifters. For digital BF, we utilize an ordinary differential equations-defined LNN to learn temporal channel dynamics, and use a manifold optimization technique to compress the search space. We validated the proposed method on simulated site-specific 108 GHz ray-tracing channels in an urban scenario using NYURay, a ray-tracing simulator validated against 142 GHz propagation measurements. The 108 GHz carrier frequency matches the operating band of the LC antenna hardware. The proposed method achieves an 88.6\% spectral efficiency (SE) gain and higher robustness to imperfect channel estimation compared to the learning-aided gradient descent and gated recurrent unit machine learning baselines, and 1.9 times higher SE than the 3GPP TR~38.901 standard antenna model, highlighting the potential of LC-based hardware for sub-THz communications.

In this paper, we revisit the computation of controlled invariant sets for linear discrete-time systems through a trajectory-based viewpoint. We begin by introducing the notion of convex feasible points, which provides a new characterization of controlled invariance using finitely long state trajectories. We further show that combining this notion with the classical backward fixed-point algorithm allows us to compute the maximal controlled invariant set. Building on these results, we propose two MPC schemes that guarantee recursive feasibility without relying on precomputed terminal sets. Finally, we formulate the search for convex feasible points as an optimization problem, yielding a practical computational method for constructing controlled invariant sets. The effectiveness of the approach is illustrated through numerical examples.

Multiple Instance Learning (MIL) is the dominant framework for gigapixel whole-slide image (WSI) classification in computational pathology. However, current MIL aggregators route all instances through a shared pathway, constraining their capacity to specialise across the pathological heterogeneity inherent in each slide. Mixture-of-Experts (MoE) methods offer a natural remedy by partitioning instances across specialised expert subnetworks; yet unconstrained softmax routing may yield highly imbalanced utilisation, where one or a few experts absorb most routing mass, collapsing the mixture back to a near-single-pathway solution. To address these limitations, we propose ROAM (Region-graph OptimAl-transport Mixture-of-experts), a spatially aware MoE-MIL aggregator that routes region tokens to expert poolers via capacity-constrained entropic optimal transport, promoting balanced expert utilisation by construction. ROAM operates on spatial region tokens, obtained by compressing dense patch bags into spatially binned units that align routing with local tissue neighbourhoods and introduces two key mechanisms: (i) region-to-expert assignment formulated as entropic optimal transport (Sinkhorn) with explicit per slide capacity marginals, enforcing balanced expert utilisation without auxiliary load-balancing losses; and (ii) graph-regularised Sinkhorn iterations that diffuse routing assignments over the spatial region graph, encouraging neighbouring regions to coherently route to the same experts. Evaluated on four WSI benchmarks with frozen foundation-model patch embeddings, ROAM achieves performance competitive against strong MIL and MoE baselines, and on NSCLC generalisation (TCGA-CPTAC) reaches external AUC 0.845 +- 0.019.

Sizing a residential microgrid efficiently requires solving a coupled design-and-operation problem: photovoltaic (PV) and battery capacities should be chosen in a way that reflects how the system will actually be dispatched over time. This paper proposes BOOST, or Battery-solar Ordinal Optimization Sizing Technique, which combines ordinal optimization (OO) with mixed-integer linear programming (MILP). OO is used to screen a large set of candidate battery/PV designs with a simple linear model and then re-evaluate only the most promising designs with a more accurate MILP that captures diesel commitment logic. Relative to the original short paper, this expanded manuscript retains the full methodological narrative but refreshes the quantitative section using a new synthetic benchmark dataset suite generated from the released clean reimplementation. The suite contains five yearly synthetic datasets/configurations: base, cheap battery, cheap PV, expensive diesel, and high peak tariff. On the base synthetic dataset, the best accurate design is a 500 kWh battery with 1833.3 kW of PV, achieving 13.169 c/kWh, while BOOST improves upon dynamic programming and greedy baselines. Across the full 10 x 10 design grid, the LP and MILP rankings are effectively identical (rho = 1.000), the paper-style choice of N = 90 and s = 18 recovers the global accurate optimum, and the OO-based workflow reduces runtime by 51.8% relative to exhaustive accurate evaluation on the refreshed synthetic benchmark run. Because these added datasets are synthetic, they should be read as methodological stress tests rather than as direct empirical claims about any specific real-world site.

Colorectal cancer liver metastasis (CRLM) exhibits high postoperative recurrence and pronounced prognostic heterogeneity, challenging individualized management. Existing prognostic approaches often rely on static representations from a single postoperative snapshot, and fail to jointly capture tumor spatial distribution, longitudinal disease dynamics, and multimodal clinical information, limiting predictive accuracy. We propose DyPro, a deep learning framework that infers postoperative latent trajectories via residual dynamic evolution. Starting from an initial patient representation, DyPro generates a 12-step sequence of trajectory snapshots through autoregressive residual updates and integrates them to predict recurrence and survival outcomes. On the MSKCC CRLM dataset, DyPro achieves strong discrimination under repeated stratified 5-fold cross-validation, reaching a C-index of 0.755 for OS and 0.714 for DFS, with OS AUC@1y of 0.920 and OS IBS of 0.143. DyPro provides quantitative risk cues to support adjuvant therapy planning and follow-up scheduling.

Embodied AI systems, comprising AI models and physical plants, are increasingly prevalent across various applications. Due to the rarity of system failures, ensuring their safety in complex operating environments remains a major challenge, which severely hinders their large-scale deployment in safety-critical domains, such as autonomous vehicles, medical devices, and robotics. While achieving provable deterministic safety-verifying system safety across all possible scenarios-remains theoretically ideal, the rarity and complexity of corner cases make this approach impractical for scalable embodied AI systems. Instead, empirical safety evaluation is employed as an alternative, but the absence of provable guarantees imposes significant limitations. To address these issues, we argue for a paradigm shift to provable probabilistic safety that integrates provable guarantees with progressive achievement toward a probabilistic safety boundary on overall system performance. The new paradigm better leverages statistical methods to enhance feasibility and scalability, and a well-defined probabilistic safety boundary enables embodied AI systems to be deployed at scale. In this Perspective, we outline a roadmap for provable probabilistic safety, along with corresponding challenges and potential solutions. By bridging the gap between theoretical safety assurance and practical deployment, this Perspective offers a pathway toward safer, large-scale adoption of embodied AI systems in safety-critical applications.

This paper proposes a neural stochastic optimization method for efficiently solving the two-stage stochastic unit commitment (2S-SUC) problem under high-dimensional uncertainty scenarios. The proposed method approximates the second-stage recourse problem using a deep neural network trained to map commitment decisions and uncertainty features to recourse costs. The trained network is subsequently embedded into the first-stage UC problem as a mixed-integer linear program (MILP), allowing for explicit enforcement of operational constraints while preserving the key uncertainty characteristics. A scenario-embedding network is employed to enable dimensionality reduction and feature aggregation across arbitrary scenario sets, serving as a data-driven scenario reduction mechanism. Numerical experiments on IEEE 5-bus, 30-bus, and 118-bus systems demonstrate that the proposed neural two-stage stochastic optimization method achieves solutions with an optimality gap of less than 1%, while enabling orders-of-magnitude speedup compared to conventional MILP solvers and decomposition-based methods. Moreover, the model's size remains constant regardless of the number of scenarios, offering significant scalability for large-scale stochastic unit commitment problems.

This study explores the vulnerability of direct data driven control, particularly in the linear quadratic regulator (LQR) problem, to adversarial perturbations in offline collected data. We focus on stealthy attacks that subtly alter training data to destabilize the closed-loop system while evading detection. To craft such attacks, we propose Directed Gradient Sign Method (DGSM) and its iterative variant (I-DGSM), which adapt techniques from adversarial machine learning to align perturbations with the gradient of the closed-loop spectral radius. A key technical contribution is an efficient and exact gradient computation method using implicit differentiation through the Karush-Kuhn-Tucker conditions of the underlying semidefinite program. For defense, we introduce two strategies: (i) regularization to reduce controller sensitivity, and (ii) robust data-driven control that ensures stability under bounded perturbations. Experiments across benchmark systems reveal that even imperceptibly small perturbations, up to ten times smaller than random noise, can lead to instability, while the proposed defenses significantly reduce attack success rates with minimal performance loss. We also assess transferability under partial knowledge, demonstrating the importance of protecting training data. This work highlights critical security risks in data driven control and proposes practical methods for both attack and defense.

Two-stage stochastic unit commitment (2S-SUC) problems have been widely adopted to manage the uncertainties introduced by high penetrations of intermittent renewable energy resources. While decomposition-based algorithms such as column-and-constraint generation has been proposed to solve these problems, they remain computationally prohibitive for large-scale, real-time applications. In this paper, we introduce a Neural Column-and-Constraint Generation (Neural CCG) method to significantly accelerate the solution of 2S-SUC problems. The proposed approach integrates a neural network that approximates the second-stage recourse problem by learning from high-level features of operational scenarios and the first-stage commitment decisions. This neural estimator is embedded within the CCG framework, replacing repeated subproblem solving with rapid neural evaluations. We validate the effectiveness of the proposed method on the IEEE 118-bus system. Compared to the original CCG and a state-of-the-art commercial solver, Neural CCG achieves up to 130.1$\times$ speedup while maintaining a mean optimality gap below 0.096\%, demonstrating its strong potential for scalable stochastic optimization in power system.

Computed tomography (CT) is a cornerstone imaging modality for non-invasive, high-resolution visualization of internal anatomical structures. However, when the scanned object exceeds the scanner's field of view (FOV), projection data are truncated, resulting in incomplete reconstructions and pronounced artifacts near FOV boundaries. Conventional reconstruction algorithms struggle to recover accurate anatomy from such data, limiting clinical reliability. Deep learning approaches have been explored for FOV extension, with diffusion generative models representing the latest advances in image synthesis. Yet, conventional diffusion models are computationally demanding and slow at inference due to their iterative sampling process. To address these limitations, we propose an efficient CT FOV extension framework based on the image-to-image Schrödinger Bridge (I$^2$SB) diffusion model. Unlike traditional diffusion models that synthesize images from pure Gaussian noise, I$^2$SB learns a direct stochastic mapping between paired limited-FOV and extended-FOV images. This direct correspondence yields a more interpretable and traceable generative process, enhancing anatomical consistency and structural fidelity in reconstructions. I$^2$SB achieves superior quantitative performance, with root-mean-square error (RMSE) values of 49.8 HU on simulated noisy data and 152.0 HU on real data, outperforming state-of-the-art diffusion models such as conditional denoising diffusion probabilistic models (cDDPM) and patch-based diffusion methods. Moreover, its one-step inference enables reconstruction in just 0.19 s per 2D slice, representing over a 700-fold speedup compared to cDDPM (135 s) and surpassing DiffusionGAN (0.58 s), the second fastest. This combination of accuracy and efficiency indicates that I$^2$SB has potential for real-time or clinical deployment.

The integration of renewable energy via power electronics is transforming power grids into low-inertia systems, heightening the risks of frequency insecurity and widespread outages. Therefore, frequency security assessment (FSA) methods are urgently needed to ensure the reliable system operation. Recently, knowledge-data fusion models attempt to address the limitations of knowledge-driven (accuracy) and data-driven (generalization) FSA methods. However, current methods remain confined to shallow knowledge-data integration due to challenges in representing heterogeneous knowledge and establishing interactive mechanisms. Here, by classifing FSA domain knowledge into physics-guided and physics-constrained categories, we propose a guided learning-constrained network (GL-CN) framework, which deeply integrates domain knowledge across both network architecture and training process. In this framework, a data-driven model with dual input channels combining graph convolutional networks (GCN) and multilayer perceptrons (MLP) is proposed to extract both nodal and system-level power system features. Furthermore, guided learning enhances model generalization through data augmentation in pre-training utilizing physics-guided knowledge, while constrained network encodes physics-constrained knowledge into the network architecture and loss function to ensure physics-consistent and robust predictions. Validated on Yunnan Provincial Power Grid in China, our method reduces FSA time from days to seconds compared to traditional simulation, achieving 98% accuracy, robustness against 39.0% knowledge error, and generalization for 40%-60% renewable penetration. This provides a solid solution for mitigating blackouts caused by frequency insecurity and offers a generalizable paradigm for broader cross-domain problems.

At least ten emerging providers are developing satellite navigation systems for low Earth orbit (LEO). Compatibility with existing GNSS in L-band is critical to their successful deployment and for the larger ecosystem. Xona is deploying Pulsar, a near 260-satellite LEO constellation offering dual L-band navigation services near L1 and L5. Designed for interoperability, Pulsar provides centimeter-level accuracy, resilience, and authentication, while maintaining a format that existing GNSS receivers can support through a firmware update. This study examines Pulsar's compatibility with GPS and Galileo by evaluating C/N0 degradation caused by the introduction of its X1 and X5 signals. Using spectrally compact QPSK modulation, Pulsar minimizes interference despite higher signal power. Theoretical analysis is supported by hardware testing across a range of commercial GNSS receivers in both lab-based simulation and in-orbit live-sky conditions. The study confirms Pulsar causes no adverse interference effects to existing GNSS, supporting coexistence and integration within the global PNT ecosystem.

Music structure analysis (MSA) underpins music understanding and controllable generation, yet progress has been limited by small, inconsistent corpora. We present SongFormer, a scalable framework that learns from heterogeneous supervision. SongFormer (i) fuses short- and long-window self-supervised learning representations to capture both fine-grained and long-range dependencies, and (ii) introduces a learned source embedding to enable training with partial, noisy, and schema-mismatched labels. To support scaling and fair evaluation, we release SongFormDB, the largest MSA corpus to date (over 14k songs spanning languages and genres), and SongFormBench, a 300-song expert-verified benchmark. On SongFormBench, SongFormer sets a new state of the art in strict boundary detection (HR.5F) and achieves the highest functional label accuracy, while remaining computationally efficient; it surpasses strong baselines and Gemini 2.5 Pro on these metrics and remains competitive under relaxed tolerance (HR3F). Code, datasets, and model are open-sourced at this https URL.

Convolutional Neural Networks (CNNs) achieve remarkable accuracy in vision tasks, yet their computational complexity challenges low-power edge deployment. In this work, we present COMET, a framework of CNN models that employ efficient hardware offset-binary coding (OBC) techniques to enable co-optimization of performance and resource utilization. The approach formulates CNN inference using OBC representations applied separately to inputs (Scheme A) and weights (Scheme B), enabling exploitation of bit-width asymmetry. The shift-accumulate operation is modified by incorporating offset-term with the pre-scaled bias. Leveraging symmetries in Schemes A and B, we introduce four look-up table (LUT) techniques -- parallel, shared, split, and hybrid -- and evaluate their efficiency. Building on this foundation, we develop a general matrix multiplication core using the im2col transformation for efficient CNN acceleration. We consider LeNet-5 and All-CNN-C to demonstrate that the OBC-GEMM core efficiently supports modern workloads. Evaluation shows that COMET enables efficient FPGA deployment compared to state-of-the-art designs, with negligible accuracy loss, demonstrating its efficiency and scalability across diverse network architectures.

The integration of converter-interfaced generation introduces new transient stability challenges to modern power systems. Classical Lyapunov- and scalable passivity-based approaches typically rely on restrictive assumptions, and finding storage functions for large grids is generally considered intractable. Furthermore, most methods require an accurate grid dynamics model. To address these challenges, we propose a model-free, nonlinear, and dissipativity-based controller which, when applied to grid-connected virtual synchronous generators (VSGs), enhances power system transient stability. Using input-state data, we train neural networks to learn dissipativity-characterizing matrices that yield stabilizing controllers. Furthermore, we incorporate cost function shaping to improve the performance with respect to the user-specified objectives. Numerical results on a modified, all-VSG Kundur two-area power system validate the effectiveness of the proposed approach.

The increasing integration of intermittent distributed energy resources (DERs) has introduced significant variability in distribution networks, posing challenges to voltage regulation and reactive power management. This paper presents a novel neural two-stage stochastic Volt-VAR optimization (2S-VVO) method for three-phase unbalanced distribution systems considering network reconfiguration under uncertainty. To address the computational intractability associated with solving large-scale scenario-based 2S-VVO problems, a learning-based acceleration strategy is introduced, wherein the second-stage recourse model is approximated by a neural network. This neural approximation is embedded into the optimization model as a mixed-integer linear program (MILP), enabling effective enforcement of operational constraints related to the first-stage decisions. Numerical simulations on a 123-bus unbalanced distribution system demonstrate that the proposed approach achieves over 50 times speedup compared to conventional solvers and decomposition methods, while maintaining a typical optimality gap below 0.30%. These results underscore the method's efficacy and scalability in addressing large-scale stochastic VVO problems under practical operating conditions.

The integration of distributed energy resources (DERs) into wholesale electricity markets, as mandated by FERC Order 2222, imposes new challenges on system operations. To remain consistent with existing market structures, regional transmission organizations (RTOs) have advanced the aggregation of transmission-node-level DERs (T-DERs), where a nodal virtual power plant (VPP) represents the mapping of all distribution-level DERs to their respective transmission nodes. This paper develops a real-time economic dispatch (RTED) framework that enables multi-transmission-node DER aggregation while addressing computational efficiency. To this end, we introduce a spatio-temporal graph convolutional network (ST-GCN) for adaptive prediction of distribution factors (DFs), thereby capturing the dynamic influence of individual T-DERs across the transmission system. Furthermore, an iterative constraint identification strategy is incorporated to alleviate transmission security constraints without compromising system reliability. Together, these innovations accelerate the market clearing process and support the effective participation of T-DER aggregators under current market paradigms. The proposed approach is validated on large-scale test systems, including modified 118-, 2383-, and 3012-bus networks under a rolling RTED setting with real demand data. Numerical results demonstrate significant improvements in reducing operational costs and maintaining transmission network feasibility, underscoring the scalability and practicality of the proposed framework.

Multi-sensory systems for embodied intelligence, from wearable body-sensor networks to instrumented robotic platforms, routinely face a sensor-asymmetry problem: the richest modality available during laboratory data collection is absent or impractical at deployment time due to cost, fragility, or interference with physical interaction. We introduce PULSE, a general framework for privileged knowledge transfer from an information-rich teacher sensor to a set of cheaper, deployment-ready student sensors. Each student encoder produces shared (modality-invariant) and private (modality-specific) embeddings; the shared subspace is aligned across modalities and then matched to representations of a frozen teacher via multi-layer hidden-state and pooled-embedding distillation. Private embeddings preserve modality-specific structure needed for self-supervised reconstruction, which we show is critical to prevent representational collapse. We instantiate PULSE on the wearable stress-monitoring task, using electrodermal activity (EDA) as the privileged teacher and ECG, BVP, accelerometry, and temperature as students. On the WESAD benchmark under leave-one-subject-out evaluation, PULSE achieves 0.994 AUROC and 0.988 AUPRC (0.965/0.955 on STRESS) without EDA at inference, exceeding all no-EDA baselines and matching the performance of a full-sensor model that retains EDA at test time. We further demonstrate modality-agnostic transfer with ECG as teacher, provide extensive ablations on hidden-state matching depth, shared-private capacity, hinge-loss margin, fusion strategy, and modality dropout, and discuss how the framework generalizes to broader embodied sensing scenarios involving tactile, inertial, and bioelectrical modalities.

Age-related hearing loss (HL) reduces speech intelligibility (SI) in older adults (OAs). However, deficits in central and cognitive processing also substantially impact SI. Understanding these contributions is essential for explaining individual differences and developing effective assistive hearing strategies. This study presents a framework that distinguishes peripheral HL from central and cognitive influences on SI. This framework uses the Wakayama University Hearing Impairment Simulator (WHIS), and the Gammachirp Envelope Similarity Index (GESI), an objective measure of intelligibility. First, speech-in-noise tests were conducted with young, normal-hearing listeners (YNHs) using WHIS to simulate the audiogram of a target OA. The target OA achieved SI scores comparable to or higher than those of YNHs with simulated HL, suggesting contributions beyond peripheral hearing function. Then, GESI was used to predict SI scores for YNHs and OAs across different hearing levels. The prediction accuracy was comparable for both groups. Interestingly, many OAs' subjective SI scores were higher than those predicted using parameters derived from YNHs' experiments. This finding is inconsistent with previous research indicating that speech perception ability declines with age. This issue will be discussed. There was no significant correlation between the average hearing levels and the residual differences between the subjective and predicted SI scores. This suggests that GESI effectively absorbed the effects of peripheral HL. Thus, the proposed framework may facilitate systematic examination and comparison of central and cognitive factors beyond peripheral HL among individual YNHs and OAs with and without HL.

We study a two-player dynamic Stackelberg game where the follower's intention is unknown to the leader. Classical formulations of the Stackelberg equilibrium (SE) assume that the follower's best response (BR) function is known to the leader. However, this is not always true in practice. We study a setting in which the leader receives updated beliefs about the follower BR before the end of the game, such that the update prompts the leader and subsequently the follower to re-optimize their strategies. We characterize the optimality guarantees of the SE solutions under this belief update for both open loop and feedback information structures. Interestingly, we prove that in general, assuming an incorrect follower's BR may lead to a lower leader cost over the entire game than knowing the true follower's BR. We support these results with numerical examples in a linear quadratic (LQ) Stackelberg game, and use Monte Carlo simulations to show that the instances of incorrect BR achieving lower leader costs are non-trivial in collision avoidance LQ Stackelberg games.

Mobility systems are complex socio-technical environments influenced by multiple stakeholders with hierarchically interdependent decisions, rendering effective control and policy design inherently challenging. We bridge hierarchical game-theoretic modeling with online feedback optimization by casting urban mobility as a tri-level Stackelberg game (travelers, operators, municipality) closed in a feedback loop. The municipality iteratively updates taxes, subsidies, and operational constraints using a projected two-point (gradient-free) scheme, while lower levels respond through equilibrium computations (Frank-Wolfe for traveler equilibrium; operator best responses). This model-free pipeline enforces constraints, accommodates heterogeneous users and modes, and scales to higher-dimensional policy vectors without differentiating through equilibrium maps. On a real multimodal network for Zurich, Switzerland, our method attains substantially better municipal objectives than Bayesian optimization and Genetic algorithms, and identifies integration incentives that increase multimodal usage while improving both operator objectives. The results show that feedback-based regulation can steer competition toward cooperative outcomes and deliver tangible welfare gains in complex, data-rich mobility ecosystems.

This paper presents a novel approach for ensuring safe operation of systems subject to input nonlinearities and time-varying safety constraints. We extend the time-varying barrier function framework to address time-varying safety constraints and explicitly account for control-dependent nonlinearities at the plant input. Guaranteed bounds on the input-output behavior of these nonlinearities are provided through pointwise-in-time quadratic constraints. The result is a class of robust time-varying control barrier functions that define a safety filter. This filter ensures robust safety for all admissible nonlinearities while minimally modifying the command generated by a baseline controller. We derive a second-order cone program (SOCP) to compute this safety filter online and provide feasibility conditions for ball-constrained inputs. The proposed approach is demonstrated on a spacecraft docking maneuver.

In safety-critical control systems, ensuring both safety and feasibility under sampled-data implementations is crucial for practical deployment. Existing Control Barrier Function (CBF) frameworks, such as High-Order CBFs (HOCBFs), effectively guarantee safety in continuous time but may become unsafe when executed under zero-order-hold (ZOH) controllers due to inter-sampling effects. Moreover, they do not explicitly handle finite-time reach-and-remain requirements or multiple simultaneous constraints, which often lead to conflicts between safety and reach-and-remain objectives, resulting in feasibility issues during control synthesis. This paper introduces Sampling-Aware Control Barrier Functions (SACBFs), a unified framework that accounts for sampling effects and high relative-degree constraints by estimating and incorporating Taylor-based upper bounds on barrier evolution between sampling instants. The proposed method guarantees continuous-time forward invariance of safety and finite-time reach-and-remain sets under ZOH control. To further improve feasibility, a relaxed variant (r-SACBF) introduces slack variables for handling multiple constraints realized through time-varying CBFs. Simulation studies on a unicycle robot demonstrate that SACBFs achieve safe and feasible performance in scenarios where traditional HOCBF methods fail.

This paper addresses multi-object systems, where objects may occlude one another relative to the sensor. The standard point-object model for detection-based sensors is enhanced so that the probability of detection considers the presence of all objects. A principled tracking method is derived, assigning each object an expected probability of detection, where the expectation is taken over the reduced Palm density, which means conditionally on the object's existence. The assigned probability thus considers the object's visibility relative to the sensor, under the presence of other objects. Unlike existing methods, the proposed method systematically accounts for uncertainties related to all objects in a clear and manageable way. The method is demonstrated through a visual tracking application using the multi-Bernoulli mixture (MBM) filter with marks.

The transition from 5G to 6G requires frequency-dependent, physically consistent radio channel models across the FR1--FR3 span, particularly in the under-explored $4$--$8$~GHz region targeted in the current WRC-$27$ studies, where outdoor urban channel measurements and parameterizations remain scarce. This paper presents a $4.85$~GHz measurement-anchored study of urban channels and a literature-referenced cross-band analysis. Double-directional measurements were conducted at $4.85$~GHz in urban macrocell (UMa) and urban microcell (UMi) routes in Yokohama, Japan, from which path loss, delay spread (DS), azimuth spread of arrival/departure (ASA/ASD), $K$-factor, and route-dependent spatial-consistency statistics were extracted. To align these results in a broader cross-band context, the measured $4.85$~GHz large-scale parameter (LSP) means were combined with scenario-matched literature anchors to derive log-log trends for DS, ASA, and ASD over an approximately $4$--$28$~GHz range that spans the $7.125$~GHz FR1--FR3 boundary. The resulting trends were compared with 3GPP UMa/UMi reference parameterizations over the same interval. Because the cross-band analysis relies on a single in-house measurement band and a limited number of heterogeneous literature anchors, it is presented as measurement-informed and indicative, rather than as a definitive multi-band model. The paper therefore contributes both a detailed, parameterized $4.85$~GHz urban measurement reference and a bounded literature-referenced cross-band view of channel behavior near the FR1--FR3 transition.

Neuromorphic engineering makes use of mixed-signal analog and digital circuits to directly emulate the computational principles of biological brains. Such electronic systems offer a high degree of adaptability, robustness, and energy efficiency across a wide range of tasks, from edge computing to robotics. Within this context, we investigate a key feature of biological neurons: their ability to carry out robust and reliable computation by adapting their input responses and spiking patterns to context through neuromodulation. Achieving analogous levels of robustness and adaptation in neuromorphic circuits through modulatory mechanisms is a largely unexplored path. We present a novel current-mode neuron design that supports robust neuromodulation with minimal model complexity, compatible with standard CMOS technologies. We first introduce a mathematical model of the circuit and provide tools to analyze and tune the neuron behavior; we then demonstrate both theoretically and experimentally the biologically plausible neuromodulation adaptation capabilities of the circuit over a wide range of parameters. All theoretical predictions were verified in experiments on a low-power 180 nm CMOS implementation of the proposed neuron circuit. Due to the analog underlying feedback structure, the proposed adaptive neuromodulable neuron exhibits a high degree of robustness, flexibility, and scalability across operating ranges of currents and temperatures, making it a perfect candidate for real-world neuromorphic applications.

The optimal operation of modern microgrids, particularly those integrating stochastic renewable generation and battery energy storage system (BESS), relies heavily on load and disturbances forecasting to minimize operational costs. However, in environments with uncertainties in both generation and consumption, traditional numerical forecasting methods often fail to capture generation shifts and event-driven load surges. While contextual information regarding event schedules, system logs, and computational task records is easily obtainable, classic control paradigms lack a formal interface to integrate the unstructured, semantic data into the physical operation loop. This paper addresses this gap by introducing the InstructMPC framework, which utilizes a Large Language Model (LLM) paired with a tunable last layer mapping to translate unstructured operational context into predictive disturbance trajectories for the MPC controller. Unlike conventional forecasting methods, the proposed approach treats the last layer mapping as a tunable component, refined online based on the realized control cost. We establish a theoretical foundation for this closed-loop tuning strategy, proving a regret bound of $O(\sqrt{T \log T})$ for linear systems under a tailored task-aware loss function, together with robustness guarantees against uninformative or noisy textual inputs. The control strategy is experimentally validated on OpenCEM, a real-world microgrid with highly fluctuating generation and consumption. Experimental results demonstrate that the LLM-driven MPC significantly reduces cumulative grid electricity costs compared to classical context-agnostic baselines, validating the efficacy of integrating semantic information directly into physical control loops.

Conventional robust H2/H-infinity control minimizes the worst-case performance, often leading to a conservative design driven by very rare parametric configurations. To reduce this conservatism while taking advantage of the stochastic properties of Monte Carlo sampling and its compatibility with parallel computing, we introduce an alternative paradigm that optimizes the controller with respect to a stochastic criterion, namely the conditional value at risk. We present the problem formulation and discuss several open challenges toward a general synthesis framework. The potential of this approach is illustrated on a mechanical system, where it significantly improves overall performance by tolerating some degradation in very rare worst-case scenarios.

Electromagnetic formation flying (EMFF) is challenging due to the complex coupling between the electromagnetic fields generated by each satellite in the formation. To address this challenge, this article uses alternating magnetic field forces (AMFF) to decouple the electromagnetic forces between each pair of satellites. The key idea of AMFF is that a pair of alternating (e.g., sinusoidal) magnetic moments results in a nonzero time-averaged interaction force if and only if those alternating magnetic moments have the same frequency. Hence, the approach in this article is to drive each satellite's electromagnetic actuation system with a sum of sinusoids, where each frequency is common to only a pair of satellites. Then, the amplitudes of each sinusoid are modulated (i.e., controlled) to achieve the desired forces between each pair of satellites. The main contribution of this article is an experimental demonstration of 3-satellite decentralized closed-loop EMFF using AMFF. To the authors' knowledge, this is the first demonstration of AMFF with at least 3 satellites in open or closed loop. This is noteworthy because the coupling challenges of EMFF are only present with more than 2 satellites, and thus, a formation of at least 3 is necessary to evaluate the effectiveness of AMFF. The experiments are conducted on a ground-based testbed consisting of 3 electromagnetically actuated satellites on linear air tracks. The closed-loop experiments demonstrate decentralized EMFF with AMFF where the maximum steady-state formation error is less than $\pm $0.01 m and the settling time is less than 30 s. These experiments validate the decoupling of intersatellite forces through frequency-multiplexed AMFF. The closed-loop experimental results are compared with the behavior of numerical simulations.

Low-count positron emission tomography (PET) reconstruction is a challenging inverse problem due to severe degradations arising from Poisson noise, photon scarcity, and attenuation correction errors. Existing deep learning methods typically address these in the spatial domain with an undifferentiated optimization objective, making it difficult to disentangle overlapping artifacts and limiting correction effectiveness. In this work, we perform a Fourier-domain analysis and reveal that these degradations are spectrally separable: Poisson noise and photon scarcity cause high-frequency phase perturbations, while attenuation errors suppress low-frequency amplitude components. Leveraging this insight, we propose FourierPET, a Fourier-based unrolled reconstruction framework grounded in the Alternating Direction Method of Multipliers. It consists of three tailored modules: a spectral consistency module that enforces global frequency alignment to maintain data fidelity, an amplitude-phase correction module that decouples and compensates for high-frequency phase distortions and low-frequency amplitude suppression, and a dual adjustment module that accelerates convergence during iterative reconstruction. Extensive experiments demonstrate that FourierPET achieves state-of-the-art performance with significantly fewer parameters, while offering enhanced interpretability through frequency-aware correction.

Reinforcement Learning (RL) has empowered Multimodal Large Language Models (MLLMs) to achieve superior human preference alignment in Image Quality Assessment (IQA). However, existing RL-based IQA models typically rely on coarse-grained global views, failing to capture subtle local degradations in high-resolution scenarios. While emerging "Thinking with Images" paradigms enable multi-scale visual perception via zoom-in mechanisms, their direct adaptation to IQA induces spurious "cropping-implies-degradation" biases and misinterprets natural depth-of-field as artifacts. To address these challenges, we propose Q-Probe, the first agentic IQA framework designed to scale IQA to high resolution via context-aware probing. First, we construct Vista-Bench, a pioneering benchmark tailored for fine-grained local degradation analysis in high-resolution IQA settings. Furthermore, we propose a three-stage training paradigm that progressively aligns the model with human preferences, while simultaneously eliminating causal bias through a novel context-aware cropping strategy. Extensive experiments demonstrate that Q-Probe achieves state-of-the-art performance in high-resolution settings while maintaining superior efficacy across resolution scales.

Short-range reliable and secure communication is a major priority in the tactical, military and disaster response settings where the traditional communication infrastructure is either off-line or prone to interception. Current VHF/UHF radios and software-defined radios are popular but large-sized devices and require lots of power, making them not suitable to be used as lightweight wearable devices with seamless hand-free use. In this paper, the design and theoretical framework of a miniature, LoRa based encrypted intercommunication device that can be used in secure field communication over a range of 1-1.5km and under line-of-sight conditions is provided. The suggested system consists of a voice-activated acquisition block, digital audio compression, an embedded microcontroller processor, and AES-128 encryption followed by a low-power transmission via the LoRa protocol. Through the ability of chirp spread spectrum modulation to utilize the long-range and low-energy properties, the system is guaranteed reliable communications coupled with low power consumption and low electromagnetic footprint. The theoretical analysis of the proposed communication range is justified using a link-budget that justifies the practicability of the communication range in the real propagation conditions. This architecture focuses on infrastructural agnosticism, peer-to-peer security as well as wearable ergonomics. The given scheme shows the possibilities of LoRa technology in the scope of other traditional IoT telemetry, and it can be further extended to include secure tactical voice communication platforms.

Nonlinear parameter-varying (NPV) systems are a class of nonlinear systems whose dynamics explicitly depend on time-varying external parameters, making them suitable for modeling real-world systems with dynamics variations. Traditional synthesis methods for NPV systems, such as sum-of-squares (SOS) optimization, are only applicable to control-affine systems, face scalability challenges and often lead to conservative results due to structural restrictions. To address these limitations, we propose Neural-NPV, a two-stage learning-based framework that leverages neural networks to jointly synthesize a PD controller and a PD Lyapunov function for an NPV system under input constraints. In the first stage, we utilize a computationally cheap, gradient-based counterexample-guided procedure to synthesize an approximately valid PD Lyapunov function and a PD controller. In the second stage, a level-set guided refinement is then conducted to obtain a valid Lyapunov function and controller while maximizing the robust region of attraction (R-ROA). We demonstrate the advantages of Neural-NPV in terms of applicability, performance, and scalability compared to SOS-based methods through numerical experiments involving an simple inverted pendulum with one scheduling parameter and a quadrotor system with three scheduling parameters.

LLM-assisted modeling holds the potential to rapidly build executable Digital Twins of complex systems from only coarse descriptions and sensor data. However, resilience to LLM hallucination, human oversight, and real-time model adaptability remain challenging and often mutually conflicting requirements. We present three critical design principles for integrating resilience and oversight into such workflows, derived from insights gained through our work on FactoryFlow - an open-source LLM-assisted framework for building simulation-based Digital Twins of manufacturing systems. First, orthogonalize structural modeling and parameter fitting. Structural descriptions (components, interconnections) are LLM-translated from coarse natural language to an intermediate representation (IR) with human visualization and validation, which is algorithmically converted to the final model. Parameter inference, in contrast, operates continuously on sensor data streams with expert-tunable controls. Second, restrict the model IR to interconnections of parameterized, pre-validated library components rather than monolithic simulation code, enabling interpretability and error-resilience. Third, and most important, is to use a density-preserving IR. When IR descriptions expand dramatically from compact inputs hallucination errors accumulate proportionally. We present the case for Python as a density-preserving IR : loops express regularity compactly, classes capture hierarchy and composition, and the result remains highly readable while exploiting LLMs strong code generation capabilities. A key contribution is detailed characterization of LLM-induced errors across model descriptions of varying detail and complexity, revealing how IR choice critically impacts error rates. These insights provide actionable guidance for building resilient and transparent LLM-assisted simulation automation workflows.

With the development of 6G technologies, traditional uniform linear arrays (ULAs) and uniform planar arrays (UPAs) can hardly meet the demands of three-dimensional (3D) full-space coverage and high angular resolution. Spherical antenna arrays (SAAs), with elements uniformly distributed on a spherical surface, provide an effective solution. This article analyzes the issues of traditional arrays, summarizes the advantages and typical structures of SAAs, discusses their potential application scenarios, and verifies their superiority over UPAs via a case study. Finally, key technical challenges and corresponding research directions of SAAs are identified, providing a reference for their research and application in future wireless communications.

Addressing the critical need for intelligent, context-aware energy management in renewable systems, we introduce the OpenCEM Simulator and Dataset: the first open-source digital twin explicitly designed to integrate rich, unstructured contextual information with quantitative renewable energy dynamics. Traditional energy management relies heavily on numerical time series, thereby neglecting the significant predictive power embedded in human-generated context (e.g., event schedules, system logs, user intentions). OpenCEM bridges this gap by offering a unique platform comprising both a meticulously aligned, language-rich dataset from a real-world PV-and-battery microgrid installation and a modular simulator capable of natively processing this multi-modal context. The OpenCEM Simulator provides a high-fidelity environment for developing and validating novel control algorithms and prediction models, particularly those leveraging Large Language Models. We detail its component-based architecture, hybrid data-driven and physics-based modelling capabilities, and demonstrate its utility through practical examples, including context-aware load forecasting and the implementation of online optimal battery charging control strategies. By making this platform publicly available, OpenCEM aims to accelerate research into the next generation of intelligent, sustainable, and truly context-aware energy systems.

Industrial control systems (ICSs) often consist of many legacy devices, which were designed without security requirements in mind. With the increase in cyberattacks targeting critical infrastructure, there is a growing urgency to develop legacy-compatible security solutions tailored to the specific needs and constraints of real-time control systems. We propose a least significant bits (LSBs) coding scheme providing message authentication and integrity, which is compatible with legacy devices and never compromises availability. The scheme comes with provable security guarantees, and we provide a simple yet effective method to deal with synchronization issues due to packet dropouts. Furthermore, we quantify the control performance loss for both a fixed-point and floating-point quantization architecture when using the proposed coding scheme. We demonstrate its effectiveness in detecting cyberattacks, as well as the impact on control performance, on a hydro power turbine control system.

Sparse signal recovery deals with finding the sparsest solution of an under-determined linear system $\vx = \mQ\vs$. In this paper, we propose a novel greedy approach to addressing the challenges from such a problem. Such an approach is based on a characterization of solutions to the system, which allows us to work on the sparse recovery in the $\vs$-space directly with a given measure. With $l_2$-based measure, an orthogonal matching pursuit (OMP)-type algorithm is proposed, which significantly outperforms the classical OMP algorithm in terms of recovery accuracy while maintaining comparable computational complexity. An $l_1$-based algorithm, denoted as $\text{Alg}_{GL1}$, is derived. Such an algorithm significantly outperforms the classical basis pursuit (BP) algorithm. Combining with the CoSaMP-strategy for selecting atoms, a class of high performance greedy algorithms is also derived. Extensive numerical simulations on both synthetic and image data are carried out, with which the superior performance of our proposed algorithms is demonstrated in terms of sparse recovery accuracy and robustness against numerical instability of the system matrix $\mQ$ and disturbance in the measurement $\vx$.

Influenced by the complexity of volumetric imaging, there is a shortage of established datasets useful for benchmarking volumetric deep-learning models. As a consequence, new and existing models are not easily comparable, limiting the development of architectures optimized specifically for volumetric data. To counteract this trend, we introduce MozzaVID -- a large, clean, and versatile volumetric classification dataset. Our dataset contains X-ray computed tomography (CT) images of mozzarella microstructure and enables the classification of 25 cheese types and 149 cheese samples. We provide data in three different resolutions, resulting in three dataset instances containing from 591 to 37,824 images. While targeted for developing general-purpose volumetric algorithms, the dataset also facilitates investigating the properties of mozzarella microstructure. The complex and disordered nature of food structures brings a unique challenge, where a choice of appropriate imaging method, scale, and sample size is not trivial. With this dataset, we aim to address these complexities, contributing to more robust structural analysis models and a deeper understanding of food structure. The dataset can be explored through: this https URL

Two-time-scale stochastic approximation algorithms are iterative methods used in applications such as optimization, reinforcement learning, and control. Finite-time analysis of these algorithms has primarily focused on fixed point iterations where both time-scales have contractive mappings. In this work, we broaden the scope of such analyses by considering settings where the slower time-scale has a non-expansive mapping. For such algorithms, the slower time-scale can be viewed as a stochastic inexact Krasnoselskii-Mann iteration. We also study a variant where the faster time-scale has a projection step which leads to non-expansiveness in the slower time-scale. We show that the last-iterate mean square residual error for such algorithms decays at a rate $O(1/k^{1/4-\epsilon})$, where $\epsilon>0$ is arbitrarily small. We further establish almost sure convergence of iterates to the set of fixed points. We demonstrate the applicability of our framework by applying our results to minimax optimization, linear stochastic approximation, and Lagrangian optimization.

Agents for computer use (ACUs) are an emerging class of systems capable of executing complex tasks on digital devices -- such as desktops, mobile phones, and web platforms -- given instructions in natural language. These agents can automate tasks by controlling software via low-level actions like mouse clicks and touchscreen gestures. However, despite rapid progress, ACUs are not yet mature for everyday use. In this survey, we investigate the state-of-the-art, trends, and research gaps in the development of practical ACUs. We provide a comprehensive review of the ACU landscape, introducing a unifying taxonomy spanning three dimensions: (I) the domain perspective, characterizing agent operating contexts; (II) the interaction perspective, describing observation modalities (e.g., screenshots, HTML) and action modalities (e.g., mouse, keyboard, code execution); and (III) the agent perspective, detailing how agents perceive, reason, and learn. We review 87 ACUs and 33 datasets across foundation model-based and classical approaches through this taxonomy. Our analysis identifies six major research gaps: insufficient generalization, inefficient learning, limited planning, low task complexity in benchmarks, non-standardized evaluation, and a disconnect between research and practical conditions. To address these gaps, we advocate for: (a) vision-based observations and low-level control to enhance generalization; (b) adaptive learning beyond static prompting; (c) effective planning and reasoning methods and models; (d) benchmarks that reflect real-world task complexity; (e) standardized evaluation based on task success; (f) aligning agent design with real-world deployment constraints. Together, our taxonomy and analysis establish a foundation for advancing ACU research toward general-purpose agents for robust and scalable computer use.

The creation of high-quality multimodal datasets remains fundamental for advancing role-playing capabilities in large language models (LLMs). While existing works predominantly focus on text-based persona simulation, Audio Role-Playing (ARP) presents unique challenges due to the need for synchronized alignment of semantic content and vocal characteristics. To address this gap, we propose AudioRole, a meticulously curated dataset from 13 TV series spanning 1K+ hours with 1M+ character-grounded dialogues, providing synchronized audio-text pairs annotated with speaker identities and contextual metadata. In addition, to demonstrate the effectiveness of the dataset, we introduced ARP-Eval, a dual-aspect evaluation framework that assesses both response quality and role fidelity. Empirical validation showing GLM-4-Voice trained on AudioRole (which we called ARP-Model) achieve an average Acoustic Personalization score of 0.31, significantly outperforming the original GLM-4-voice and the more powerful model MiniCPM-O-2.6, which specifically supports role-playing in one-shot scenarios. The ARP-Model also achieves a Content Personalization score of 0.36, surpassing the untrained original model by about 38% and maintaining the same level as MiniCPM-O-2.6. AudioRole features dialogues from over 115 main characters, 6 trained ARP-Models that role-play different characters, and evaluation protocols. Together, they provide an essential resource for advancing audio-grounded role-playing research.

Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and cardinality constraints, among others. In particular, we cover also situations where parts of the constraints are nonconvex and possibly complicated, but it is practical to compute projections onto this nonconvex set. Our approach combines the augmented Lagrangian framework with a solver-agnostic structure-exploiting subproblem reformulation. While convergence guarantees follow from the former, the proposed condensing technique leads to significant improvements in computational performance.

High-dimensional reinforcement learning(RL) faces challenges with complex calculations and low sample efficiency in large state-action spaces. Q-learning algorithms struggle particularly with the curse of dimensionality, where the number of state-action pairs grows exponentially with problem size. While neural network-based approaches like Deep Q-Networks have shown success, they do not explicitly exploit problem structure. Many high-dimensional control tasks exhibit low-rank structure in their value functions, and tensor-based methods using low-rank decomposition offer parameter-efficient representations. However, existing tensor-based Q-learning methods focus on representation fidelity without leveraging this structure for exploration. We propose Tensor-Efficient Q-Learning (TEQL), which represents the Q-function as a low-rank CP tensor over discretized state-action spaces and exploits the tensor structure for uncertainty-aware exploration. TEQL incorporates Error-Uncertainty Guided Exploration (EUGE), which combines tensor approximation error with visit counts to guide action selection, along with frequency-aware regularization to stabilize updates. Under matched parameter budgets, experiments on classic control tasks demonstrate that TEQL outperforms both matrix-based low-rank methods and deep RL baselines in sample efficiency, making it suitable for resource-constrained applications where sampling costs are high.

This paper presents a tutorial and survey on Probabilistic Inference-based Model Predictive Control (PI-MPC). PI-MPC reformulates finite-horizon optimal control as inference over an optimal control distribution expressed as a Boltzmann distribution weighted by a control prior, and generates actions through variational inference. In the tutorial part, we derive this formulation and explain action generation via variational inference, highlighting Model Predictive Path Integral (MPPI) control as a representative algorithm with a closed-form sampling update. In the survey part, we organize existing PI-MPC research around key design dimensions, including prior design, multi-modality, constraint handling, scalability, hardware acceleration, and theoretical analysis. This paper provides a unified conceptual perspective on PI-MPC and a practical entry point for researchers and practitioners in robotics and other control applications.

While stochastic geometry provides a powerful framework for the analysis of cellular networks, standard Monte Carlo simulations often suffer from slow convergence due to the stochasticity of the infinite far-field. This work introduces the \textit{Rao-Blackwellized Hybrid Estimator} (RBHE), which enhances simulation efficiency by analytically marginalizing the residual far-field interference via the conditional Laplace functional. By partitioning the interference field into $K$ dominant interferers and an infinite tail, we derive an estimator that combines exact spatial sampling with a rigorous analytical representation. We prove that the RBHE is an unbiased estimator for any finite truncation, while its systematic bias relative to the infinite-plane benchmark decays at a rate of $\mathcal{O}(K^{1-\eta/2})$. Numerical results demonstrate significant sample parsimony; in the high-reliability regime ($T = -10$ dB) with $K=2$, the RBHE yields a variance reduction gain of $90.75\times$, enabling a $98.90\%$ reduction in the spatial realizations required to reach a target precision. This framework effectively bridges the gap between tractable analytical models and high-fidelity simulations.

Attitude control is essential for many satellite missions. Classical controllers, however, are time-consuming to design and sensitive to model uncertainties and variations in operational boundary conditions. Deep Reinforcement Learning (DRL) offers a promising alternative by learning adaptive control strategies through autonomous interaction with a simulation environment. Overcoming the Sim2Real gap, which involves deploying an agent trained in simulation onto the real physical satellite, remains a significant challenge. In this work, we present the first successful in-orbit demonstration of an AI-based attitude controller for inertial pointing maneuvers. The controller was trained entirely in simulation and deployed to the InnoCube 3U nanosatellite, which was developed by the Julius-Maximilians-Universität Würzburg in cooperation with the Technische Universität Berlin, and launched in January 2025. We present the AI agent design, the methodology of the training procedure, the discrepancies between the simulation and the observed behavior of the real satellite, and a comparison of the AI-based attitude controller with the classical PD controller of InnoCube. Steady-state metrics confirm the robust performance of the AI-based controller during repeated in-orbit maneuvers.

Online 3D reconstruction from streaming inputs requires both long-term temporal consistency and efficient memory usage. Although causal variants of VGGT address this challenge through a key-value (KV) cache mechanism, the cache grows linearly with the stream length, creating a major memory bottleneck. Under limited memory budgets, early cache eviction significantly degrades reconstruction quality and temporal consistency. In this work, we observe that attention in causal transformers for 3D reconstruction exhibits intrinsic spatio-temporal sparsity. Based on this insight, we propose STAC, a Spatio-Temporally Aware Cache Compression framework for streaming 3D reconstruction with large causal transformers. STAC consists of three key components: (1) a Working Temporal Token Caching mechanism that preserves long-term informative tokens using decayed cumulative attention scores; (2) a Long-term Spatial Token Caching scheme that compresses spatially redundant tokens into voxel-aligned representations for memory-efficient storage; and (3) a Chunk-based Multi-frame Optimization strategy that jointly processes consecutive frames to improve temporal coherence and GPU efficiency. Extensive experiments show that STAC achieves state-of-the-art reconstruction quality while reducing memory consumption by nearly 10x and accelerating inference by 4x, substantially improving the scalability of real-time 3D reconstruction in streaming settings.

BitNet b1.58 (Ma et al., 2024) demonstrates that large language models can operate entirely on ternary weights {-1, 0, +1}, yet no native binary wire format exists for such models. NativeTernary closes this gap. Benchmarked against GGUF on the real BitNet b1.58 2B4T architecture (24 layers, ~170 tensors, 2B parameters): NativeTernary encodes ternary weights at exactly 2.000 bits per weight -- 1.31x smaller than GGUF Q2_K and 4.0x smaller than GGUF int8 -- while reducing boundary and framing overhead by 460x (91 bytes vs ~42KB of GGUF tensor headers). Encode throughput: 47--69 MB/s. Decode throughput: 35--45 MB/s on commodity hardware. The decoder is a 10-line stateless state machine resilient to bitstream corruption.

We establish that temporal averaging over multiple observations is the degenerate case of algebraic group action with the trivial group $G=\{e\}$. A General Replacement Theorem proves that a group-averaged estimator from one snapshot achieves equivalent subspace decomposition to multi-snapshot covariance estimation. The Trivial Group Embedding Theorem proves that the sample covariance is the accumulation of trivial-group estimates, with variance governed by a $(G,L)$ continuum as $1/(|G|\cdot L)$. The processing gain $10\log_{10}(M)$ dB equals the classical beamforming gain, establishing that this gain is a property of group order, not sensor count. The DFT, DCT, and KLT are unified as group-matched special cases. We conjecture a General Algebraic Averaging Theorem extending these results to arbitrary statistics, with variance governed by the effective group order $d_{\mathrm{eff}}$. Monte Carlo experiments on the first four sample moments across five group types confirm the conjecture to four-digit precision. The framework exploits the $structure$ of information (representation-theoretic symmetry of the data object) rather than the content, complementing Shannon's theory. Five applications are demonstrated: single-snapshot MUSIC, massive MIMO with 64% throughput gain, single-pulse waveform classification at 90% accuracy, graph signal processing with non-abelian groups, and algebraic analysis of transformer LLMs revealing RoPE uses the wrong group for 70--80% of attention heads (22,480 observations across five models).

Finite element model updating is a mature discipline for linear structures, yet its extension to nonlinear regimes remains an open challenge. This paper presents a methodology that combines nonlinear model order reduction (NMOR) based on Taylor-series expansion of the equations of motion with the projection-basis adaptation scheme recently proposed by Hollins et al. [2026] for linear model updating. The structural equations of motion, augmented with proportional (Rayleigh) damping and polynomial stiffness nonlinearity, are recast as a first-order autonomous system whose Jacobian possesses complex eigenvectors forming a biorthogonal basis. Taylor operators of second and third order are derived for the nonlinear internal forces and projected onto the reduced eigenvector basis, yielding a low-dimensional nonlinear reduced-order model (ROM). The Cayley transform, generalised from the real orthogonal to the complex unitary group, parametrises the adaptation of the projection basis so that the ROM mode shapes optimally correlate with experimental measurements. The resulting nonlinear model-updating framework is applied to a representative wingbox panel model. Numerical studies demonstrate that the proposed approach captures amplitude-dependent natural frequencies and modal assurance criterion(MAC) values that a purely linear updating scheme cannot reproduce, while recovering the underlying stiffness parameters with improved accuracy.