Energy Matching has emerged as a powerful generative framework that combines flow model efficiency with the explicit likelihood of Energy-Based Models (EBMs) via a single, time-independent scalar potential. However, directly training this potential on high-dimensional 3D data remains computationally challenging. While distilling a pre-trained flow model circumvents some of the initial training costs, we demonstrate that velocity fields inevitably contain non-conservative rotational artifacts (curl). Forcing a strictly conservative scalar potential to match this unconstrained field creates a "structural conflict", which degrades generation quality and mode coverage. To solve this, we propose Projected Energy Matching, a scalable framework that resolves these structural and computational bottlenecks. We introduce Helmholtz Distillation, a structural relaxation that leverages a Hutchinson trace estimator to explicitly absorb rotational noise into an auxiliary residual network. We subsequently refine this landscape using Negative Caching, a memory-efficient strategy that reuses negative samples across micro-batches, rendering sampling tractable during contrastive training with gradient accumulation. We deploy our method as an unconditional prior for real-world medical CT inverse problems, specifically sparse-view reconstruction. Ultimately, our amortized pipeline reduces total compute to a small fraction of that required by standard energy matching, while achieving high-fidelity reconstructions and successfully resolving severe measurement artifacts.

This paper investigates semantic-aware neural joint source-channel coding (JSCC) for robust video transmission over block erasure channels. We propose a neural video compression framework exploring both spatial-domain and feature-domain designs. In the spatial domain, video frames are partitioned into blocks, enabling localized erasure handling and fine-grained robustness control via uniform erasure and two-level, semantic-guided non-uniform erasure strategies. In the feature domain, latent features are partitioned, enabling missing features to be semantically recovered while maintaining overall spatial consistency. Comprehensive experiments quantify reconstruction quality under varying uniform and non-uniform erasure probabilities. Our results show that spatial-domain JSCC excels at handling random localized losses, whereas feature-domain JSCC provides superior robustness to distributed erasures and maintains fidelity under low-loss scenarios. The analysis highlights the trade-offs between spatial continuity and semantic redundancy, offering insights for designing robust, task-aware video communication systems.

This paper presents a Multi-Map Dynamic-Entropy Intrusion-Aware Chaotic Modulation (MU-DE-IAEACM-MM) framework for adaptive physical-layer security in multi-user wireless systems. Unlike conventional chaos-based schemes that rely on static parameter secrecy, the proposed architecture treats entropy as a regulated security variable and dynamically updates chaotic control parameters using an entropy-driven adaptation law. Heterogeneous chaotic maps, including Logistic, Tent, Chebyshev, and Sine generators, are distributed across users to enlarge entropy dimensionality and reduce cross-user statistical dependence. A correlation-based intrusion metric is incorporated to detect improved adversarial reconstruction coherence and trigger controlled entropy escalation. Stability analysis establishes bounded convergence conditions for the adaptive update process. Monte Carlo simulations under AWGN, fading, impulsive, colored, and narrowband interference demonstrate a persistent BER gap between legitimate and mismatched receivers and measurable secrecy capacity gains over representative fixed-parameter chaotic modulation schemes. The framework maintains positive secrecy rates in dense deployments with up to 64 legitimate users and 30 passive eavesdroppers. The results indicate that entropy-regulated multi-map chaotic modulation provides a scalable and synchronisation-stable approach for adaptive physical-layer security in next-generation wireless and IoT networks.

Automated segmentation of cervical-spine MRI is increasingly used in clinical workflows, yet no fairness audit exists for this anatomy. We show that auditing these segmentation tasks is complicated by a common property of modern segmentation datasets: expert-annotated gold labels are expensive, so abundant machine-generated (silver) labels are added to limit annotation cost. This matters because the reference used to judge a model can itself be biased. In this study, we present the first fairness audit of cervical-spine MRI segmentation across sex, age, and race using the CSpineSeg dataset. We observe that the deployed model is demographically fair, but the choice of reference label, however, is not neutral. Because a dataset's silver labels are generated by a model trained on its gold labels, any new model trained on those same gold labels agrees more with the silver labels than with expert truth: scoring identical predictions against silver rather than gold overestimates performance by ~8 Dice points and turns the fairness verdict for age from non-significant to significant - not by the gap inflation Parikh et al. report (which we term false magnitude) but by collapsing within-group variance (which we term false confidence). Reference-label provenance is thus a first-order confounder in segmentation evaluation: performance and fairness should be reported against expert labels, and any fairness claim stated together with the provenance of its reference.

State estimates used in sampled monitoring and automation need bounds that remain valid between measurements. We develop a finite-horizon input-to-state-stability tube and observer co-design framework for continuous-time observers driven by sampled and held outputs. The sampled-data error model separates process disturbance, sampled measurement noise, and intersample mismatch. A horizon-level disturbance-envelope event is transferred through an ISS estimate to simultaneous containment of the complete error trajectory. Quadratic dissipation inequalities yield ellipsoidal and componentwise tubes, and semidefinite co-design minimizes normalized tube width across the three channels. A structured nonlinear extension preserves known nonlinear channels. Co-design reduces the worst normalized half-width by 31% in a linear compartment benchmark and by a factor of 22.4 in a flexible-joint benchmark.

Hamilton-Jacobi (HJ) reachability provides rigorous safety and reachability guarantees for continuous-time dynamical systems, but its numerical solution suffers from the curse of dimensionality. Deep reinforcement learning (DRL), by contrast, offers scalable sample-based methods. However, RL is typically built around additive cumulative rewards; whereas, reachability objectives are inherently non-additive. This mismatch makes a direct bridge between HJ reachability and RL nontrivial. Recent discounted formulations have either introduced contraction by altering the original reachability semantics, or preserved exact semantics on the HJ side without a corresponding Bellman fixed-point characterization. In this paper, we close this gap by building on a semantics-preserving discounted reach-based value function and deriving a non-additive Bellman operator whose unique fixed point exactly matches the value function in the HJ formulation. We prove that discounting makes this operator contractive, yielding existence, uniqueness, and convergence of value iteration. Furthermore, we establish the equivalence between the HJ and Bellman characterizations, and show that RL can be interpreted as a sample-based approximation scheme for the same fixed-point equation. This yields a principled and semantically exact connection between HJ reachability and RL, enabling learning-based methods to approximate reachability value functions while preserving their safety-critical meaning. As a result, the proposed framework opens the door to scalable, data-driven computation of reachable sets and safety certificates in high-dimensional systems. Numerical experiments demonstrate close agreement with HJ solutions, confirm preservation of reachability semantics via alignment of zero level sets, and support the interpretation of reinforcement learning as a sample-based solver of the proposed Bellman operator.

Grid codes increasingly require grid-forming (GFM) inverters to demonstrate prescribed active-power response to phase-angle jumps at the point of interconnection (POI). This paper shows that such requirements embed an implicit current-overload mandate whose severity depends on the test parameters but is nowhere made explicit in the specifications. First, an analytic expression for the instantaneous power is derived at an arbitrary measurement point, establishing that a momentary power excursion in the non-opposing direction is an inevitable physical consequence of the phase jump itself, independent of control action. Second, the phase-jump recovery is formulated as a constrained optimal control problem with the characteristic GFM objective of minimizing terminal voltage deviation from the pre-disturbance value while subject to a hard current limit. As the plant dynamics are linear and the constraints are convex, the solution constitutes a controller-architecture-independent physical bound on the achievable power-recovery trajectory. Sweeping the current limit, the phase-jump acceptance criterion is converted into an equivalent minimum overload ratio, making the implicit hardware mandate quantitative. The bound is validated against three WECC generic GFM inverter models (REGFM_A1, B1, C1) in electromagnetic transient simulations, confirming both validity and tightness of the bound. Recommendations are offered for interpreting compliance test results and for structuring test specifications to distinguish physical hardware limitations from control deficiencies.

The realization of the full potential of Reconfigurable Intelligent Surfaces (RIS) in a wireless system is tied to their strategic spatial deployment. While existing literature primarily focuses on enabling fairness by maximizing coverage to navigate through obstacles, these approaches often fail to exploit the spatial distribution of user density to maximize throughput. Thus, to enable fairness without loss in throughput, we formulate a novel hierarchical problem that maximizes the expected sum rate of the system while guaranteeing probabilistic coverage with the least possible number of RISs deployed. To solve this multi-layered non-convex problem, firstly, we obtain optimal regions where we can deploy RISs to provide the coverage guarantee by solving a constrained set-cover problem on a visibility graph. Then, the minimum number of RISs we require to satisfy the coverage guarantee is obtained by a greedy minimum partitioning on an intersection hypergraph formed using the optimal regions. Finally, a Bayesian Optimization based approach is used to compute the final optimal RIS placement. Numerical results are provided to show that the proposed framework consistently identifies placements that jointly achieve good coverage and throughput, without impractical system assumptions.

Continuous oxygen saturation (SpO$_2$) estimation from wearable photoplethysmography (PPG) is important for long-term health monitoring, but low-quality red and infrared PPG segments can distort waveform morphology and degrade SpO$_2$ prediction accuracy. Existing PPG denoising and reconstruction methods usually optimize waveform fidelity or heart rate characteristics, while time-domain waveform loss on PPG signals alone insufficiently preserves frequency structure and SpO$_2$-relevant information. This paper proposes a SpO$_2$ predictor-guided stage-wise time-frequency reconstruction framework for low-quality dual-wavelength PPG signals. The proposed method first selects high-quality PPG segments to pretrain a SpO$_2$ predictor. A masked reconstruction model is then trained to recover randomly masked PPG regions using a joint reconstruction objective that combines time-domain waveform loss with frequency-domain loss computed from the short-time Fourier transform (STFT). To make the reconstruction task physiologically relevant, the pretrained SpO$_2$ predictor is incorporated as an additional constraint, encouraging the reconstructed PPG to preserve SpO$_2$ information rather than only minimizing waveform reconstruction error. The SpO$_2$ predictor and PPG reconstructor model are optimized through four training stages. Experiments on the public OpenOximetry Repository and a private wearable PPG dataset show that the proposed approach achieves the lowest subject-level MAE, with 2.882\% on the public dataset and 2.359\% on the private dataset.

Continuous oxygen saturation (SPO2) monitoring from photoplethysmography (PPG) is important for wearable health sensing, but wrist-based SPO2 estimation remains challenging due to subtle wrist micro-perturbations and inter-subject differences in local perfusion status. These factors can destabilize the red-to-infrared ratio-of-ratios (R) and reduce the reliability of conventional fixed R-SPO2 mapping. This paper proposes a lightweight low-rate wrist SPO2 estimation framework that integrates motion-aware beat selection and perfusion-guided calibration. The proposed method extracts beat-level alternating-current/direct-current (AC/DC) components from dual-wavelength PPG signals, computes beat-level R values, and uses accelerometer-derived motion scores to weight beats within each sliding window. A subject-specific perfusion reference is further used to guide calibration across different perfusion conditions. Experiments on a private wearable dataset show that the proposed method achieves the best 25 Hz performance, with an MAE of 2.305$\pm$1.113% and an RMSE of 3.117$\pm$1.743%, while maintaining performance comparable to the 100 Hz sampling rate and reducing PPG sensor power consumption for energy-efficient wearable implementation. These results demonstrate the effectiveness of the proposed framework for low-rate wrist SPO2 estimation under micro-perturbations.

Galvanic skin response (GSR) is widely used for stress detection, but wrist-based GSR remains challenging because its absolute amplitude can differ substantially from laboratory-grade palmar measurements. In this paper, we propose a unit-independent low-rate wrist GSR processing pipeline to extract the number of skin conductance responses per minute (nSCR/min) as a stress-related feature. We collect paired wrist and palmar GSR recordings from 31 participants during sitting baseline, standing baseline, neutral speaking, and the Trier Social Stress Test (TSST), a laboratory social stressor task. The proposed pipeline cleans the raw GSR signal, decomposes it into tonic skin conductance level (SCL) and phasic skin conductance response (SCR), applies robust z-score normalization, and detects phasic SCR peaks to compute nSCR/min. Using random forest on 25Hz We-Be GSR, nSCR/min achieved balanced accuracies of 0.823 and 0.871 for binary classification between TSST and the sitting and standing baselines, respectively. Moreover, the 25Hz We-Be GSR features achieved comparable balanced accuracy to the original 100Hz features across the evaluated tasks. These results suggest the feasibility of low-rate, unit-independent wrist GSR processing for wearable stress detection.

Marine hydrokinetic energy offers a promising solution to the growing demand for clean and reliable electricity. These systems can generate power from low-speed flowing water, and over a wide range of sites. This paper outlines a lifecycle-based framework for developing marine hydrokinetic systems. It emphasizes stakeholder needs, regulatory compliance, and site-specific factors critical to successful deployment. By integrating engineering, environmental, and economic viewpoints, this work provides a baseline and other considerations for advancing these technologies toward commercial viability. First, six quality attributes are listed, and then five general stakeholders, including the consumer, owner, government, energy distributor, and regulatory bodies. Next, a set of general requirements grouped into five categories is shown. Finally, several key design decisions are discussed. Much of this content is captured in a model using the Systems Modeling Language (SysML). Overall, this paper can serve as a baseline for marine hydrokinetic technology development and understanding. This content is not comprehensive; further work will be required to ensure specific site and technology considerations are accounted for. Keywords: marine hydrokinetic systems, system lifecycle, model-based systems engineering, requirements, design, product development, risk management

The dynamics of communication environments induce significant distribution shifts across domains, challenging the generalization of deep learning-based automatic modulation classification (AMC) models. While existing UDA methods alleviate this problem by aligning source and target features, they give limited consideration to modulation-specific structures that remain informative across domain conditions. In this paper, we consider signal prior knowledge, grounded in communication protocols and physical principles, as a potential way to enhance cross-domain representation learning. Given that different priors may vary in modulation discriminability, domain stability, and complementarity, this paper first analyzes five commonly adopted signal representations that instantiate different signal priors. From them, in-phase/quadrature (IQ), amplitude--phase (AP), and autocorrelation function (ACF) are selected as compact prior-guided inputs. Based on that, a dual knowledge and data-driven network (DKDNet) is proposed for cross-domain AMC. The multi-representation feature encoder (MRFE) and dynamic lightweight fusion unit (DLFU) are designed to achieve unified representation learning and adaptive feature fusion, and the resulting fused features are optimized with modulation classification and adversarial domain alignment objectives. Experiments on both simulated and public datasets validate the rationality of the prior selection and demonstrate the superiority of the proposed method.

Low-light visual perception acts as the core visual foundation for on-orbit servicing missions targeting non-cooperative spacecraft, supporting autonomous rendezvous, pose estimation, component detection and robotic capture operations. Spaceborne imagery suffers from severe low-light degradation, while the extreme scarcity of paired normal/low-light space samples severely limits the generalization capacity of supervised enhancement algorithms. To address this practical bottleneck, this paper proposes SCI-Mamba, an unsupervised enhancement network for low-light orbital spacecraft observations. The proposed framework unites self-calibrated unsupervised learning, linear-complexity VMamba architecture and Retinex physical priors, delivering a lightweight enhancement pipeline adaptable to resource-limited spaceborne hardware. We construct Space Dark-1.0, a dedicated low-light spacecraft dataset integrating real orbital footage, darkroom hardware-in-the-loop measurements and physically constrained synthetic data covering diverse illumination, motion and attitude conditions. Comprehensive comparisons with CNN-, Transformer- and prevailing Mamba-based approaches verify the advantages of SCI-Mamba in visual authenticity, color fidelity and inference speed. The proposed framework provides a practical low-light enhancement solution for close-proximity non-cooperative space operations. The code is available at this https URL

Integrated sensing and communication (ISAC) has emerged as a pivotal technology for sixth-generation wireless networks to empower high-precision sensing. The demand for superior sensing resolution and the reality of spectrum fragmentation have driven the research of multi-band ISAC. Multi-band ISAC provides frequency diversity through independent observations across disparate bands, mitigating sensing performance fluctuations caused by frequency-selective radar cross-section compared to single-band counterparts. In this paper, we propose a framework for analytical performance characterization and resource optimization in multi-band ISAC systems. Specifically, analytical closed-form detection and false alarm probabilities for multi-band OFDM signals are derived, providing a theoretical foundation for subsequent resource allocation. Then, a joint power and time-frequency resource allocation scheme is developed and solved via a proposed ADMM-based algorithm to maximize detection performance. Numerical results validate the accuracy of the closed-form derivations and demonstrate the superior robustness of multi-band signals. Notably, the proposed optimization scheme achieves an 18 dB detection gain over traditional single-band baselines at a 90\% detection probability.

Radiomic features derived from medical images and segmentation masks are used to support decision making in clinical imaging pipelines. In practice, these features are often computed from predicted masks, but segmentation models can be overconfident or poorly calibrated, making derived measurements appear more reliable than they are. Conformal prediction (CP) provides distribution-free prediction intervals with finite-sample marginal coverage guarantees, but black-box intervals for segmentation-derived radiomics can be inefficient because they ignore test-time information about image appearance, mask geometry, and segmentation uncertainty. We propose ConRad, a conformal framework for scalar radiomic targets that uses covariates derived from the predicted mask, input image, predicted radiomics, and boundary uncertainty to construct adaptive intervals while maintaining coverage. Across five 2D medical imaging datasets and 171 retained radiomic targets, we show that ConRad improves feature-level efficiency compared to baselines while maintaining near-nominal empirical coverage. Ablation results further indicate that segmentation boundary uncertainty features are the largest contributors to interval efficiency.

Submarine power and telecommunication cables constitute critical global infrastructure, yet they remain vulnerable to mechanical damage caused by maritime activities and intentional tampering. Continuous monitoring of these assets is therefore essential for early detection of anomalous events. This paper proposes a model-based framework for real-time anomaly detection in submarine cables using spatially distributed deformation measurements along the cable. The cable is modeled as a tensioned structure governed by a damped wave equation with fixed boundary conditions. A finite-dimensional state-space representation is obtained through spatial discretization, enabling the use of a Kalman filter to estimate the cable's dynamic state under stochastic environmental disturbances. Anomaly detection is then formulated as a statistical hypothesis test applied to the innovation sequence of the filter. Compared with purely data-driven alarms, the proposed framework provides an interpretable residual signal whose threshold can be related to a prescribed false-alarm probability. Numerical simulations demonstrate that the proposed framework can reliably identify localized disturbances while remaining robust to ambient environmental excitation.

Maritime anomaly detection is essential for navigational safety and for the protection of critical underwater infrastructure. This paper proposes a geometry-informed supervised framework for detecting anomalous vessel trajectories in the Baltic Sea using Automatic Identification System (AIS) data. A Probabilistic Roadmap (PRM) is constructed over the navigable maritime domain and used as a structural prior to project trajectories onto feasible corridors. This representation enables the extraction of interpretable voyage-level features capturing route efficiency, geometric deviation from nominal paths, kinematic variability, and proximity to submarine cables. To address the scarcity of labeled anomalous events, synthetic anomalies are generated through controlled trajectory perturbations and infrastructure-aware distortions, producing a balanced dataset for supervised training. A Random Forest classifier is trained on the resulting feature set and evaluated under cross-validation and a held-out test split. Experimental results show stable generalization performance, achieving a test ROC AUC of 0.837, indicating the effectiveness of embedding navigational feasibility constraints into the anomaly detection process. The proposed approach provides an interpretable and operationally relevant framework for infrastructure-aware maritime monitoring in geometrically complex environments.

Reconfigurable antenna arrays can provide enhanced spatial Degrees of Freedom (DoFs) for Integrated Sensing And Communication (ISAC) systems, enabling high-resolution Direction of Arrival (DoA) estimation. In highly dynamic scenarios, however, DoA estimation must be performed within short coherence intervals, which often restricts processing to a single snapshot. Conventional subspace methods then suffer from rank deficiency, while Hankel-based spatial smoothing incurs high computational cost when the array size is large. This paper proposes a low-complexity gridless Truncated Hankel NewtonMUSIC framework for single-snapshot DoA estimation. The proposed method constructs a truncated Hankel matrix with a fixed row dimension to recover an effective signal subspace while reducing the cost of correlation construction and subspace decomposition. When the truncation length is independent of the array size, the dominant complexity scales linearly with the number of antenna ports. To reduce grid-induced quantization errors, coarse grid estimates are further refined by a secondorder Newton update in the continuous angular domain. Simulation results show that the proposed method achieves DoA estimation accuracy close to square Hankel Newton-MUSIC while substantially reducing runtime. For large arrays, it provides more than two orders of magnitude runtime reduction compared with conventional square Hankel MUSIC, making it suitable for realtime sensing in reconfigurable antenna-enabled ISAC systems.

Atomic receivers, which leverage the quantum interference termed electromagnetically induced transparency (EIT) for radio-frequency (RF) to optical signal transduction, offer a revolutionary paradigm for next-generation wireless communications. However, current information-theoretic characterizations are predominantly restricted to the {\Xi}-type of EIT path and rely heavily on the weak-probe approximation, which fails to predict the behavior of the atomic receivers under high signal-to-noise ratio regimes. In this paper, we establish a unified analytical model for atomic receivers, and apply this model to three typical quantum interference paths, i.e., V -type, {\Lambda}-type, and {\Xi}-type configurations. To provide a universal characterization, we propose the quantum coherence transfer coefficient (QCTC) to model the equivalent channel response induced by atomic receivers, using a steady-state perturbation framework built on the three-level EIT solution. The closed-form expressions of equivalent channel gains are then derived for three paths. Our results provide an analytical foundation for future capacity analysis and waveform optimization in atomic radio communication.

Incorporating a notion of cost of sensing, or sensing-cost, within the optimal control framework is beneficial in controlling systems where the duration of sensing, and/or the cost of sensors themselves, have a considerable impact on the overall cost. In this regard, this paper presents multiple methods for incorporating an integral sensing-cost into the optimal control framework for Linear Time-Invariant (LTI) systems. Sensing-cost is traded off against the conventional costs of control and stabilization. Optimal sensing intervals are derived by applying the Pontryagin's Minimum Principle. Other formulations of the sensing-cost problem, and extension to nonlinear systems, are possible. The theoretical developments of this paper are validated through numerical solutions and demonstrated through simulations. A reduced-form expression for the infinite-horizon multi-dimensional case with single switching point is derived, and a closed-form solution is obtained for the infinite-horizon first-order case. Additionally, a Shrinking Horizon method is demonstrated for practical implementation of the proposed theory and as a means to address uncertainties. A practical case study of a wastewater treatment plant is introduced to examine the applicability of sensing-cost considerations in a real-world setting.

Ultra-dense indoor next-generation networks suffer severe interference from mobility-induced blockages and localized multi-user hotspots that conventional digital twins~(DTs) cannot anticipate. We propose a generative AI~(GenAI)-enhanced DT framework employing a conditional generative adversarial network~(cGAN) with a spatio-temporal generator and PatchGAN discriminator for proactive rare-event channel synthesis. A worst-case zero-forcing~(WC-ZF) beamformer driven by Monte Carlo synthetic trajectories realizes distributionally robust precoding, with control-channel overhead bounded to $\approx$2.1\,kB per 10\,ms slot. Sionna-based simulations confirm a 5--8\,dB median signal-to-interference-plus-noise-ratio (SINR) gain, 60--70\% packet-loss reduction, and 60--85\% closure of the perfect channel state information (CSI) oracle gap within a 2.8--4.1\,ms inference overhead.

Rydberg atomic receiver has emerged as promising candidate for next-generation wireless communication, due to the exceptional sensitivity and ability to overcome the physical limitations of traditional radio frequency antennas. Utilizing the resonant response of atomic energy levels for signal detection, Rydberg atomic receiver is inherently confined to a narrow instantaneous bandwidth. However, in high-mobility scenarios such as satellite communications, the severe Doppler effect induces carrier frequency offsets, which drive the signal beyond the instantaneous bandwidth and result in severe distortion. In this paper, we propose an adaptive local oscillator (LO) tracking Rydberg atomic receiver architecture designed to lock high-dynamic signals within the effective atomic response bandwidth. By employing a cross-product automatic frequency control (CPAFC) algorithm, the system dynamically estimates the instantaneous frequency offset, generates a corresponding error control signal, and adjusts the LO frequency through a feedback loop. Consequently, the intermediate frequency signal can always be locked close to the center of the atomic response bandwidth regardless of dynamics. Simulation results show that the proposed architecture significantly outperforms existing Rydberg atomic receiver, effectively alleviating performance degradation in high-dynamic environments.

Safe navigation in dynamic environments is challenging when system dynamics are unknown and actuator inputs are limited. Existing methods either rely on accurate models, require online optimization, or do not explicitly account for input constraints. This paper presents a real-time control framework for unknown Euler-Lagrange systems that guarantees finite-time reach-avoid-stay (FT-RAS) specifications while respecting actuator limits. We extend the spatiotemporal tube (STT) framework by incorporating input constraints into the controller design and derive offline-verifiable feasibility conditions that relate the available control authority to the tube design and uncertainty bounds. The resulting framework is approximation-free and computationally efficient, making it suitable for real-time implementation. The proposed approach is validated through simulations on a mobile robot, a quadrotor, and a spacecraft, together with hardware experiments on a mobile robot, demonstrating safe navigation while satisfying actuator constraints.

For continuous-time linear quadratic regulation with unknown system matrices, data-driven off-policy policy iteration typically estimates the value matrix and the improved feedback gain through a joint critic--actor regression. We show that the critic is not needed in the policy-improvement step. The key is to anchor the Riccati equation at a known stabilizing gain and express optimality as a policy-space residual. An endpoint null-space projection then removes the value-matrix term from the integral data equation. This yields a critic-free, actor-only least-squares update computed directly from input-state data. Under a verifiable projected rank condition, the resulting data equation is equivalent to the policy-space residual equation, and each update coincides with the Kleinman iteration. Thus, the stabilizing and convergence properties of Kleinman iteration are retained without a critic regression. We further show that the conventional off-policy full-rank condition decomposes into an endpoint critic rank condition and a projected actor rank condition. The proposed method removes the rank requirement needed for critic identification while retaining the one needed for policy improvement. The repeated least-squares dimension is reduced from $n(n+1)/2+mn$ to $mn$. Finally, comparative simulations validate the effectiveness of the proposed algorithm.

The current-constrained power-angle curve (PAC) is crucial for the transient synchronization stability (TSS) analysis of virtual admittance-based (VA) grid-forming (GFM) converters. Its formulation and application rely on the quasi-steady-state assumption critically, i.e., the active power can converge to its steady-state across the entire angle space in both a stable and fast manner. Despite this assumption is intuitively perceivable, it lack sufficient clarification, particularly on underlying behaviors if violated. To this end, this paper uncovers a new phenomenon on the non-uniform convergence of the VA-PAC. To achieve this, an eigen-sweep-based analysis of the full-order VA-PAC model with detailed controls is conducted, by which the existence of this issue is theoretically confirmed. On this basis, the open-loop stability and response-rate conditions of the full-order VA-PAC model for ensuring its convergence are clarified. Findings of this work can provide deeper insights into the existing TSS analyses of GFM converters, and are expected to provoke new analyses.

Dynamic grid stability is traditionally ensured with synchronous generators. Modern grids rely substantially more on inverter-based resources, which require grid-forming control to guarantee adequate system-wide synchronization and stability. Small-signal stability has granted various centralized and decentralized stability certificates - but these have primarily been limited to sufficient criteria only. In this work, we construct a necessary and sufficient small-signal stability criterion for lossless inverter-based power grids with arbitrary topology. We show that asymptotic stability is equivalent to the positive definiteness of a single matrix that combines network topology, operating point, and effective droop gains. We derive graph-theoretic stability criteria based on an augmented cone graph and show that the contribution of graph cycles is typically small, as illustrated for three IEEE test cases. The resulting framework yields decentralized stability criteria, quantifies the conservatism introduced by decentralization, and may support the development of future grid codes.

Synthetic multi-speaker conversations are widely used to train conversational automatic speech recognition (ASR) systems, but it remains unclear which timing properties make simulated data most useful. This paper studies conversational timing as a controllable training variable rather than merely as a corpus statistic to be reproduced. We parameterize pause and overlap timing distributions with an exponential-tilting family estimated from multiple conversational corpora, and then explore the resulting four-dimensional parameter space with Latin hypercube sampling and multi-objective Bayesian optimization. Each sampled timing configuration is used to generate simulated training conversations, train an ASR system, and evaluate concatenated-permutation word and character error rates (cpWER and cpCER) on a Hungarian dialogue corpus. The results show that downstream ASR behavior is explained more directly by induced timing statistics than by raw simulator coordinates or corpus proximity. In particular, higher overlap exposure is associated with lower cpWER, whereas longer and more variable gaps are associated with higher cpWER; cpCER follows the same trend, but with weaker statistical support. Bayesian optimization yields modest aggregate improvements, but its main value is analytical: it produces controlled timing interventions that reveal an overlap--gap trade-off in simulated conversational training data. These findings suggest that realistic simulation should be complemented by task-relevant diagnostics of overlap, gap, and timing-variability profiles.

The computational speed of electromagnetic transient programs (EMTP) is severely limited by both the curse of dimensionality and the ill-conditioned system matrix, which collectively degrade solver performance. However, existing research on EMTP acceleration has largely overlooked the issue of ill-conditioning. This letter presents a first systematic, EMT-oriented investigation of the ill-conditioning of the EMTP admittance matrix by establishing a link between its physical origins and mathematical pathologies, thereby revealing the underlying mechanism by which network topology induces ill-conditioning. Building upon these structural insights, a preconditioner-based strategy is developed that significantly accelerates computation while preserving numerical accuracy. Simulation results demonstrate the outstanding efficiency and robustness of the proposed approach.

This paper presents a Cramér-Rao lower bound (CRLB)-based performance bound analysis of cooperative multiple-input multiple-output (MIMO) integrated sensing and communications (ISAC) networks. We first show the CRLB transformation of the signal-level parameters to the state parameters (position and velocity) in cooperative ISAC networks. Unlike existing studies that primarily ignored coupling between position and velocity in the Fisher information matrix (FIM), we derive the full FIM and the corresponding exact CRLB. Particularly, the results of multi-monostatic sensing, multi-bistatic sensing, and their hybrid are discussed. Addressing the complexity and tractability, we simplify the FIM and CRLB by excluding the coupling terms between the position and velocity, and provide a criterion for determining whether the simplification is valid. The simplified CRLB benefits from low computational complexity and provides a tractable and reliable performance metric for optimization problems such as resource allocation and beamforming. Finally, the position and velocity CRLBs and the simplification-induced error are examined in the simulation. The results demonstrate that the simplified CRLB can be applied in general cases. Based on the simulation results, the impact of resource and geometric parameters on position and velocity error bounds, and the validity of the simplified CRLBs is explained through the corresponding CRLB expressions.

This paper presents a modular method for generating reference signals online for saturable synchronous machine drives. The method dynamically generates optimal references without precomputed lookup tables, following the maximum-torque-per-ampere (MTPA) trajectory while respecting maximum-torque-per-volt (MTPV), current, and voltage limits. The proposed tracking laws are formulated to yield exact, decoupled first-order error dynamics, ensuring predictable tracking responses and simplifying system tuning. The algorithm requires only the forward flux map, thereby eliminating the need for current-map inversion. By operating in a feedforward manner, the method ensures noise-free reference signals and structural separation from the feedback control. Both simulation and experimental results are presented, demonstrating that the proposed method achieves dynamic and steady-state performance on par with conventional lookup-table-based approaches, while avoiding the need for precomputed reference tables.

In future 6G vehicular networks, users employing orthogonal frequency division multiplexing (OFDM) and orthogonal time frequency space (OTFS) waveforms may coexist under diverse mobility conditions, where both can experience high-mobility and low-mobility profiles. Since OFDM users can suffer severe inter-carrier interference (ICI) and OTFS users occupy larger spectrum resources, rate-splitting multiple access (RSMA) is a flexible framework that can efficiently handle these heterogeneous aspects. In this work, we propose a novel RSMA-assisted system to provide downlink communication to multiple OFDM and OTFS users. A common stream comprising the common messages of OFDM users spans the whole bandwidth to help OFDM users manage the ICI induced by potential high Doppler effects. OTFS users do not participate in the common stream. The private streams of OFDM users and the streams of OTFS users are transmitted over disjoint frequency bands. During the SIC process implemented at all receivers, channel estimation errors are taken into account. The simulation results highlight the impact of the power allocation factors and channel estimation errors on the system performance, and demonstrate the superiority of the proposed framework over orthogonal multiplexing in terms of outage probability and rate performance.

We propose PreSPA (Partial-Reference Structural Prediction Approach), a Partial-Reference Image Quality Assessment framework that decomposes perceptual quality into two complementary indices. A structure-aware index, operating in a No-Reference manner, captures structural degradation through Hermite-Gauss prediction of the distorted gradient field and the angular variance of its curvature. A texture-sensitive index estimates local noise through a scalar prior $\mu$, obtained from energy differences between reference and distorted complex gradient maps on strong-edge regions and accumulated over weakly-structured ones, reflecting the perceptual leakage of degraded edges into surrounding textures. Crucially, $\mu$ is the only information extracted from the reference and is computed once per image pair, reducing the reference footprint to its information-theoretic minimum. The final score is produced by an affine fusion with only three interpretable parameters, making the method compact, transparent, and computationally efficient, with the viewing distance embedded into the operator scale and no dataset-specific calibration. Extensive evaluations on six standard benchmarks show that PreSPA consistently rivals or exceeds leading No-Reference approaches, while in several cases matching the accuracy of Full-Reference models.

This paper proposes a robust optimization formulation to calculate dynamic operating envelopes (DOEs) to safely operate unbalanced three-phase distribution systems. Unlike conventional formulations that satisfy network constraints only at the envelope bound, the robust formulation covers the entire envelope range. We formulate a robust non-linear programming (NLP) problem with the full AC power flow equations, as well as an approximate linear programming (LP) model. Numerical simulations are run with real-world data from Belgium and two different distribution test feeders. The paper compares the conventional approaches with their robust counterparts and examines the trade-off between constraint violation and envelope size as well as accuracy and solve time aspects.

As the accuracy of speech deepfake detection improves with the use of self-supervised representations such as wav2vec 2.0 and HuBERT, understanding why the speech is classified as bona fide or deepfake remains an open challenge. In pursuit of more trustworthy and interpretable artificial intelligence, we introduce a phoneme-level analysis framework that connects model predictions to measurable phonetic units. Our post-hoc explainability method is generally applicable to a variety of speech deepfake detection systems based on convolutional neural networks since it leverages Gradient-weighted Class Activation Mapping in conjunction with speech recognition to generate saliency maps aligned with phonemes and pauses. This pipeline reveals statistically significant attack- and speaker-dependent phonetic cues associated with spoofed speech in terms that humans can understand. Experiments using ASVspoof 5 show comparable detection performance to similar architectures while providing linguistic interpretations across speakers and spoofing conditions.

This paper proposes an adaptive wavelet division multiplexing scheme for wireless systems serving users with heterogeneous mobility profiles over frequency-selective Rayleigh fading channels. By exploiting the multiresolution structure of the discrete wavelet transform (DWT), users are adaptively assigned to different decomposition levels according to their channel dynamics and Doppler conditions. A single-tap minimum mean square error (MMSE) equalizer is applied in the frequency domain, and the system performance is evaluated under realistic time-varying multipath fading environments. Simulation results demonstrate that the proposed adaptive allocation achieves balanced bit error rate (BER) across all user mobility classes while delivering substantial peak-to-average power ratio (PAPR) reductions relative to both conventional orthogonal frequency division multiplexing (OFDM) and orthogonal time-frequency space (OTFS) modulation. The proposed framework is further validated in a four-user heterogeneous-mobility scenario, confirming its scalability and effectiveness to mixed-mobility multi-user scenarios.

In 6G, MIMO dimensions continue to scale, yet the increased cost, power consumption, and hardware complexity associated with growing RF chains limit practical deployment. Parasitic antennas offer a promising alternative that can add spatial degrees of freedom and array gain without a proportional increase in RF chains. From a communication perspective, prior work on parasitic antennas has primarily focused on adjusting continuous reactance values using varactors, but such varactor-based tuning has increased cost and complexity in the analog control and practical RF circuit design. This paper proposes a multi-active multi-parasitic antenna (MAMP) architecture with binary controllers, where each parasitic element operates in one of two discrete reactance states. To validate the practicality of the system, we experimentally identify array geometries that best match the actual radiation patterns with those of the mathematical model through HFSS simulations. We express the induced current vector as a quadratic function of the binary state vector, and propose a pair of discrete reactance values that minimize the relative error of the proposed model while being implementable with off-the-shelf RF components. With these results, we develop two transmit beamforming codebook designs based on the generalized Lloyd algorithm. The first design exhaustively searches for all possible binary combinations to find the optimal solution, representing the theoretical upper limits of our framework. The second design leverages eigenvalue perturbation to significantly reduce computational complexity, making it suitable for online adaptation. Extensive simulations under various channel scenarios demonstrate that the proposed codebook designs enable MAMP with only few active antennas to achieve beamforming performance comparable to fully active antenna arrays with significantly more active antennas.

Asthma affects over 260 million people worldwide, yet diagnosis remains dependent on spirometry and specialist assessment, limiting accessibility in primary care and low-resource settings. Vocal biomarkers offer a promising non-invasive alternative, but prior studies have largely focused on acoustic features without integrating clinical context. We present a multimodal Mixture-of-Experts framework for asthma detection that adaptively combines acoustic embeddings from sustained vowel phonation and reading passage tasks with structured clinical and demographic data. The model was evaluated on a matched cohort of 1,218 asthma cases and healthy controls from the Colive Voice study. The multimodal model achieved an AUROC of 0.85 and Brier score of 0.17, outperforming unimodal and bimodal approaches. Adaptive gating analysis revealed increased reliance on audio features in participants with greater respiratory symptom burden, whereas clinical features contributed more strongly in less symptomatic individuals. These findings support scalable and explainable asthma screening using smartphone-collected voice recordings.

Photonic Integrated Circuits (PICs) are advancing high-performance computing, data centers, and sensing, yet three-dimensional (3D) PICs introduce critical thermal management challenges due to high-density bonding and heterogeneous materials. Traditional methods like thermal microscopes and in-package sensors yield sparse data, limiting full thermal profile visibility. This paper presents a dual-method solution combining an AI-driven thermal modeling framework with a design-based heuristic approach. The AI method integrates sparse sensor data with design layer and density information to predict multilayer temperature variations, while the heuristic approach uses localized material properties, design layout, component geometries, and sensor coordinates to refine thermal estimations in specific regions. A 2D thermal map of a 3D PIC is generated by interpolating sensor data and adjusting for local thermal resistivity using comparative analysis between design regions. The heuristic method complements the AI model, improving estimation accuracy without extensive training data. Together, these methods offer a scalable, accurate solution for real-time thermal mapping and design-time simulation, enabling reliable thermal management in next-generation 3D photonic systems.

Dynamic obstacle avoidance in unstructured outdoor environments remains a critical challenge for autonomous mobile robots, particularly when large-scale robot-specific training data and simulation-based policies are impractical. We present a data-efficient, interpretable method for vision-based dynamic obstacle avoidance that operates entirely on real-world data, avoiding the sim-to-real transfer problem inherent in simulation-trained policies. Our approach leverages UniDepth, a large pretrained monocular depth estimation model, to produce dense depth maps from RGB video without requiring stereo cameras or LiDAR at inference time. Dynamic obstacle avoidance is achieved by extending the SuperPoint and SuperGlue feature correspondence pipeline to track keypoints across long frame sequences, projecting their 2D pixel-space positions into 3D using camera intrinsics and predicted depth, running bundle adjustment initialized from these 3D keypoints, and computing per-keypoint time-to-collision (TTC). A 2D motion primitive in the ground plane is then selected to move the robot away from the closest point of approach of the minimum-TTC keypoint. Evaluated on real-world data from the M3ED dataset, our pipeline achieves a precision of 0.49 and a recall of 0.38 in identifying frames with a ground truth TTC below 1 second, and correctly generates the evasive motion direction in 84\% of true positive detections. Crucially, it detects at least one frame with TTC less than 1 second for 20 out of 22 unique physical obstacles present in our test sequences. Unlike end-to-end learned methods that demand thousands of hours of robot-specific training data, our approach eliminates model training entirely, requiring only 74 seconds of data for hyperparameter tuning. This demonstrates exceptional data efficiency while preserving interpretable and generalizable behavior across diverse obstacle types.

We report the empirical reliability of Gemini models as audio judges that score full-duplex agent conversations directly from the raw stereo waveform, tested across three models in the Gemini family: 2.5 Flash, 3.5 Flash, and 3.1 Pro. Our primary evidence base uses Gemini 2.5 Flash as the ground-truth model, validated against three calibrated human raters on 209 stereo sessions, scored on 8 production dimensions: 152 full-duplex conversations across 13 accent-and-condition strata, together with 57 adversarial defect-injected clips. The evidence for Gemini 2.5 Flash is consistent across three tests. (i) On 5 of 8 dimensions the LALM-human Spearman rho departs from the pairwise human-human rho by at most 0.07, and on 7 of 8 dimensions the two quantities 95 percent bootstrap confidence intervals overlap. (ii) The LALM agrees with the three-rater human mean within 1 point on 60 to 92 percent of sessions on 6 of 8 dimensions. (iii) On 45 of 48 (defect, dimension) cells the LALM is as sensitive as humans or better under Newcombe-Wilson 95 percent confidence intervals, though most of these are underpowered nulls rather than demonstrated parity. Rank-ordering ability transfers across the Gemini family: 3.5 Flash improves simple agreement to 8 of 8 dimensions, while 3.1 Pro rates several dimensions markedly lower than humans despite comparable rank correlation. A model swap should be re-validated on calibration specifically, not assumed from rank-correlation alone. We identify four areas where deployment requires care, and we estimate that human rating alone for our current evaluation cadence costs roughly two orders of magnitude more than the equivalent LALM workload. The data presented here provides a defensible empirical basis for deploying the LALM as a substitute or fourth rater on the dimensions where the evidence supports it.

Angular radio maps describe the received-power distribution over the angle of arrival and underpin beam selection and receiver localization in sixth-generation (6G) networks. Predicting the angular power spectrum (APS) from geometry is difficult, because the mapping is ill-posed in non-line-of-sight (NLOS) conditions and must generalize to unseen environments. Distortion-minimizing regressors return the conditional mean, which over-smooths the spectrum and erases the multipath structure that downstream tasks need. We cast the task as a perception-distortion problem and propose RadioDiff-v2, a dual-branch one-dimensional diffusion transformer trained with flow matching. It couples periodic angular encoding, adaptive layer-normalization conditioning, a Fourier angular mixer, and joint velocity and clean-signal heads. A per-metric estimator portfolio reads every deployment quantity from this single model, so that samples carry the distribution, the clean-signal head supplies a regression-grade point estimate, Bayes-optimal rules select beams, and the conditional likelihood localizes the receiver. We prove that a concentrated conditional yields a straight probability-flow trajectory that one step integrates exactly, identifying deterministic transport as the correct inductive bias. On a zero-shot test of 99 environments and one million links, RadioDiff-v2 leads every baseline on every metric, with a 0.39 dB Wasserstein-1 distance, per-bin error below the regression baseline, a 2.43 dB eight-beam NLOS sweep loss, and a 20.6-pixel localization error with four base stations. Code is available at this https URL.

Fetal electrocardiogram (fECG) and Doppler ultrasound provide complementary views of fetal cardiovascular function: fECG captures electrical activity while Doppler reflects mechanical hemodynamics shaped by factors such as placental resistance and vascular compliance. Understanding the recoverable and unrecoverable Doppler components through reconstruction from fECG offers insight into the relative contributions of electrical versus mechanical factors in fetal circulation, thereby informing clinical decisions. In addition, clinical evidence of maternal-fetal cardiac coupling suggests that maternal cardiovascular dynamics may also inform fetal hemodynamics. To computationally model these relationships, we propose a cross-modal generative framework combining dilated convolutions with cross-modal attention to selectively incorporate maternal ECG and self-attention to capture long-range temporal dependencies. Trained on 885 synchronized fetal/maternal ECG and Doppler envelope segments from 39 pregnancies, our model synthesizes Doppler envelopes with power spectral density mean squared error (PSD MSE) of 49.9 +/- 15.8 dB^2 (51% lower than two-channel baseline) and heart-rate error of 4.71 +/- 0.77 bpm (1.5% better than baseline; negligible relative to the 110-160 bpm physiological range). Cross-modal attention yields a 39% PSD MSE reduction over naive dual-channel concatenation, quantifying the contribution of maternal-fetal coupling. Our proposed framework advances computational modeling of the maternal-fetal cardiovascular system by enabling the synthesis of Doppler envelopes from dual-lead ECG. By analysis of both recoverable and residual Doppler components, this approach enables quantification of the purely mechanical contributions to Doppler waveforms -- those not recoverable from electrical recordings -- ultimately facilitating a more comprehensive fetal assessment.

An increase in earth observation missions has increased the demand of efficient design and optimization of satellite constellations. Maximizing coverage of the target while effectively utilizing the limited orbital resources is one of the critical design challenges for complex combinatorial optimization problems. The maximal covering location problem (MCLP), serves as a base for orbital coverage modeling, is NP-hard and computationally intractable for large-constellation instances. Using heuristics, metaheuristics, and mixed-integer linear programming, classical solvers have achieved optimal or near-optimal results, yet their scalability is limited as the problem size increases. Quantum computing advancements, including the quantum approximate optimization algorithms, offer a potential solution to NP-hard combinatorial optimization problems. Current quantum hardware limitations, such as low qubit counts and circuit depth, restrict solutions for small-scale instance problems. To address this challenge, this paper proposes a scalable quantum optimization framework for MCLP in satellite constellation design. A decomposition-based quantum methodology is proposed, in which large MCLP instances are partitioned into subgraphs by classical decomposition, optimized independently via quantum optimization circuits, and combined using quantum reconstruction strategies. Computational results across different constellation sizes reveal better scalability in less time while maintaining competitive coverage performance compared to classical solvers.

Through-the-wall radar (TWR) human activity recognition (HAR) is important for non-line-of-sight indoor sensing, security monitoring, and emergency rescue. However, structured distribution shifts caused by person variation, observation-view variation, and wall-condition variation severely degrade recognition generalization, while the origin of the target-domain error still lacks a rigorous theoretical explanation. To address this issue, a generalization-analysis framework for TWR HAR is proposed in this paper. First, models for indoor human kinematics, TWR echo generation, radar image formation, feature representation, and bounded-weight neural networks are established within a unified source-to-target learning formulation. Then, the source risk, target risk, empirical risk, and admissible physical domain descriptor are defined, and a unified target-domain generalization bound is derived. Next, the structured shift term is decomposed into cross-person, cross-view, and cross-wall components, and the bound-tightening effects of physical low-dimensional representations, multi-source training, and parameter-space coverage are analyzed. Simulated and measured experiments jointly support the resulting theoretical analysis and illustrate its application value.

In this paper, we consider the uplink of a multiuser Zak-OTFS system comprising users with heterogeneous delay-Doppler (DD) periods/frame sizes. Multiple access is achieved through time-frequency (TF) shifts that place the users in non-overlapping regions of the TF plane. Closed-form expressions for the effective DD domain channel between each user and the base station are derived for sinc and Gaussian pulse shaping filters. The inter-user interference (IUI) is shown to be negligible under the TF-shift-based multiple access, thereby decoupling the multiuser input-output relation (IOR) estimation problem into independent single-user estimation problems. For IOR estimation, a superimposed spread-pilot framework is employed. The spread-pilot sequence is obtained by applying FFT to a reshaped Zadoff-Chu sequence. To mitigate the pilot-data interference introduced by the superimposed spread-pilot, a DD dictionary-based IOR estimation scheme that iterates between IOR estimation and data detection is employed. Simulation results for a multiuser Zak-OTFS system demonstrate that the resulting IOR estimates achieve normalized mean-square error (NMSE) and bit error rate (BER) performances that closely match those of the corresponding single-user system. Furthermore, for sinc pulse shaping, the superimposed spread-pilot frame achieves higher spectral-efficiency compared to embedded pilot frame across a wide range of inter-user power ratios. For Gaussian pulse shaping, however, the embedded pilot frame achieves a higher spectral efficiency due to the combined effects of residual IUI and significant pilot-data interference in the case of superimposed spread-pilot. The robustness of the estimation framework to variations in channel power-delay profile and maximum Doppler shift is also demonstrated.

Robots are increasingly deployed in remote or hazardous areas for mission-critical control tasks. Due to their limited individual capabilities, they have to rely on other field sensors to obtain the state information of targets, and also a dedicated edge information hub (EIH) to enable information exchange, sensing data analysis and control command generation. Such configuration follows a sensing-communication-computing-control (SC3) closed loop. To optimize the whole closed-loop performance, this paper minimizes the linear quadratic regulator (LQR) control cost by designing the sensor-to-EIH bandwidth allocation. Specifically, we first model the distortion noise caused by limited communication data rate based on the mutual information theory. Next, under the control policy based on the Kalman filter and LQR controller, we formulate the control process as a partially observable Markov decision process (POMDP), and develop a deep reinforcement learning (DRL)-based sensor-to-EIH bandwidth allocation scheme. The proximal policy optimization (PPO) algorithm is utilized to train the DRL agent. Simulation results are provided to show the superiority of the proposed DRL-based scheme.

Integrated photonic neural networks require optical operators that are simultaneously compact, matrix-general and compatible with task-level reconfigurability. Here we introduce a meta processing unit (MPU), an inverse-designed near-field photonic device that implements local complex matrix transformations within a shallow-etched silicon region. Each 2x2 operator occupies 9.6 umx4.8 um and is designed as a reusable passive matrix primitive that can be combined with reconfigurable MZI neurons. We demonstrate a 3-bit quantized MZI-equivalent unitary device library with an effective reconstruction precision of 3.32 bits. Beyond unitary operators, we validate arbitrary complex 2x2 matrix fitting and a cascaded 4x4 matrix operation with 92.7% fidelity. We further integrate the MPU with active photonic components and hardware-in-the-loop training, achieving test accuracies of 83.5% and 80.9% on dual-task vowel recognition. In large-scale EMNIST simulations, a fine-grained neuron-level MPU replacement strategy reaches 87.64% average accuracy at 90% shared-MPU replacement, outperforming a layer-level baseline by 7.26 percentage points. These results establish inverse-designed MPUs as compact passive matrix operators for heterogeneous, hardware-adaptive photonic neural networks.

Quantifying how mirror-symmetric an image is about a given axis (symmetry scoring) underpins applications from visual aesthetics to medical imaging, yet proposed scoring methods have never been compared on a common, statistically grounded protocol. We benchmark 13 scoring methods (nine collected from literature, four introduced here) spanning from classical features to frozen deep features, across four single-axis and five multi-axis datasets under a reflection-exact protocol with a chance-anchored, significance-tested discrimination skill. Deep backbones perform best on single-axis and harder multi-axis protocols. However, a classical histogram-of-oriented-gradients (HOG) descriptor trails the best frozen-network readout by a small (but significant) margin, is not statistically separable from the runner-up (a CNN-filter measure), and runs ~300x faster on CPU. Our results show that discrimination concentrates in mid-scale oriented features, where deep backbones peak at a low or mid stage, and HOG peaks at a mid cell size. Among existing methods, frozen deep features thus offer little over a tuned classical descriptor for measuring symmetry; whether task-trained deep scorers can do better remains open. We release the scorers and harness in imgsym, an open toolkit for image symmetry detection and measurement.

Belief propagation (BP) is widely used for data association (DA) in target tracking. Existing convergence analyses of BP for DA address only the two-way correspondence between targets and measurements, where each target generates at most one measurement per scan. Multipath DA (MPDA) allows a single target to produce multiple measurements via distinct propagation paths, creating a three-way correspondence among targets, paths, and measurements, for which a complete convergence proof has not yet been provided. We provide such a proof for the BP updates in MPDA, establishing convergence to a unique fixed point. Simulations illustrate the convergence behavior of BP in MPDA and demonstrate a favorable accuracy--efficiency trade-off relative to both single-scan and two-scan variants of the multiple-detection multiple-hypothesis tracker.

OpenPLC, Arduino OPTA, CONTROLLINO, and Industrial Shields M-Duino bring IEC 61131-3 to low-cost microcontrollers used in real automation and industrial control system (ICS) security research. Existing open-source verifiers for IEC 61131-3, including ESBMC-PLC, prove safety over an abstract scan-cycle model with idealized unbounded integers. The board artifact runs on a resource-constrained microcontroller unit (MCU) with 16-bit words (8-bit AVR Arduinos), and sensors are read via a finite-resolution analog-to-digital converter (ADC). We show this deployment gap makes naive width-aware verification unsound: across 123 real programs, checking 16-bit overflow without a hardware input model yields 44% false alarms (54/123) and finds no genuine defects, because it explores sensor values no ADC can produce. Since the gap lies where computation meets the physical process - a bounded sensor reading scaled by finite-width arithmetic into an actuation command - an overflow can silently suppress a safety action, such as a high-level alarm. An unbounded input model fabricates alarms that no environment can trigger. We present hardware-faithful verification for IEC 61131-3 on open hardware: a declarative hardware abstraction layer (HAL) descriptor (width, ADC/PWM resolution, I/O binding) and a sound lowering that interprets arithmetic at target width and constrains inputs to hardware-realizable ranges. We instantiate it for Arduino as ArduinoTool, deriving HAL parameters from official cores and realizing the input-range model in the ESBMC Ladder Diagram (LD) frontend. On the 123-program corpus, the HAL annotator eliminates all 54 false alarms while preserving robustness proofs, and a controlled corpus demonstrates the rare width-dependent defects it detects with realizable witnesses.

Narrowband interference (NBI) severely degrades orthogonal frequency-division multiplexing (OFDM) systems by corrupting subcarriers and rendering classical soft demodulation ineffective. Conventional compressed-sensing (CS) mitigation exhibits high sequential latency and leaves structured, non-Gaussian residuals that cause log-likelihood ratio (LLR) unreliability, decoder saturation, and severe error floors when employing classical Gaussian demappers. We resolve this pipeline mismatch using a unified deep learning framework for joint NBI cancellation and robust soft demodulation. First, NBI-CNet employs a physics-informed convolutional architecture to estimate NBI parameters and remove multi-tone interference in a single forward pass. Without requiring prior knowledge of the active interferer count, NBI-CNet reduces computational complexity by up to 60% ($N{=}2048, Q{=}64$) compared to the state-of-the-art EOMP-IDS algorithm. Second, LLR-CNet acts as a structural whitener by mapping non-Gaussian post-mitigation residuals onto well-calibrated soft metrics. Simulations demonstrate that this joint framework eliminates the error floors inherent to traditional baselines across dense grids. Under severe interference ($\text{SIR}{=}{-}10$ dB), the pipeline operates within a $0.2$ to $0.5$ dB SNR margin of the optimal iterative baseline at a target block error rate (BLER) of $10^{-4}$. Under mild interference ($\text{SIR}{=}10$ dB) with heavy spectral overlap ($Q{=}12$), where classical greedy algorithms erroneously subtract valid data components and corrupt the payload, NBI-CNet avoids signal-peak confusion to deliver a coding gain exceeding $3$ dB. Finally, the architecture circumvents the $2{\times}10^{-4}$ error floor triggered by interferer-estimation errors, while its scale-invariant design enables robust generalization across arbitrary FFT sizes without retraining.

Recent years have witnessed a growing interest in tracking algorithms that augment Kalman Filters (KFs) with Deep Neural Networks (DNNs). By transforming KFs into trainable deep learning models, one can learn from data to reliably track a latent state in complex and partially known dynamics. However, unlike classic KFs, conventional DNN-based systems do not naturally provide an uncertainty measure, such as error covariance, alongside their estimates, which is crucial in various applications that rely on KF-type tracking. This work bridges this gap by studying error covariance extraction in DNN-aided KFs. We begin by characterizing how uncertainty can be extracted from existing DNN-aided algorithms and distinguishing between approaches by their ability to associate internal features with meaningful KF quantities, such as the Kalman Gain (KG) and prior covariance. We then identify that uncertainty extraction from existing architectures necessitates additional domain knowledge not required for state estimation. Based on this insight, we propose Bayesian KalmanNet, a novel DNN-aided KF that integrates Bayesian deep learning techniques with the recently proposed KalmanNet and transforms the KF into a stochastic machine learning architecture. This architecture employs sampling techniques to predict error covariance reliably without requiring additional domain knowledge, while retaining KalmanNet's ability to accurately track in partially known dynamics. Our numerical study demonstrates that Bayesian KalmanNet provides accurate and reliable tracking in various scenarios representing partially known dynamic systems.

We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP's main strength is an independent calibration step that provides a posteriori guarantees for the solution of this problem that are of conditional and marginal nature otherwise. These guarantees even apply in settings when assumptions required for obtaining standard a priori guarantees (e.g., in scenario optimization or sample average approximation) are unavailable, difficult to compute, or conservative. Another strength of CPP is that it can easily support different variants of conformal prediction which have been (or will be) proposed within the conformal prediction community. To illustrate this, we present robust CPP to deal with distribution shifts in the random variables and Mondrian CPP to deal with class conditional chance constraints. In a series of case studies, we show the validity of the aforementioned approaches, and illustrate the advantage of CPP as compared to scenario approach.

Federated learning seeks to foster collaboration among distributed clients while preserving the privacy of their local data. Traditional federated learning methods typically assume a fixed setting, where participating clients, client data, and learning objectives remain unchanged. However, in real-world scenarios, a federation may evolve over time, with changes in both its client composition and target label space. In this evolving federated setting, conventional round-wise model aggregation becomes inflexible, as each federation update requires repeated communication, repeated local computation, and synchronized participation from all accumulated clients. To address this limitation, we propose CA-MMDS, a continual multiple-model distillation framework for federated continual segmentation with asynchronous clients and evolving label spaces. Instead of repeatedly aggregating model parameters from all clients, CA-MMDS maintains a server-side archive of client models and updates the global model through proxy-based distillation from multiple archived local models. When new clients join or existing clients evolve, only the newly added or updated local models need to be uploaded, while unchanged clients can remain offline and continue to contribute through their archived models. This design substantially reduces communication and computation costs while enabling flexible asynchronous cooperation among evolving clients. Using multi-class 3D abdominal CT segmentation as an application task, we demonstrate that CA-MMDS efficiently incorporates evolving client knowledge while achieving competitive segmentation performance.

This work proposes a data-driven nonlinear regulator design that achieves asymptotic reference tracking under external disturbances, where the reference and disturbances are generated by a linear exosystem. The key idea is to design a data-driven feedback controller such that the closed-loop system is incrementally passive with respect to the regulation error and a virtual input. By interconnecting the closed-loop system with an internal model and carefully designing the virtual input, we solve the data-driven nonlinear output regulation problem. We characterize the passivation feedback controller by a set of data-dependent linear matrix inequalities, which is independent of the internal model. This decoupled design offers high data efficiency and design flexibility. The proposed approach also solves the non-zero equilibrium stabilization problem of a class of nonlinear systems with unknown equilibrium input. Numerical examples are presented to illustrate the effectiveness of the proposed designs.

Total variation (TV) regularization is a classical edge-preserving technique widely used across image recovery and reconstruction problems; however, its convex $\ell_1$ gradient penalty tends to over-shrink large gradients, producing staircase artifacts and contrast loss. We propose a gradient-based regularization using the Transformed $\ell_1$ (TL1) penalty and apply it to image denoising. The TL1 penalty asymptotically interpolates between $\ell_1$ and the $\ell_0$ pseudo-norm, offering a principled alternative to TV that better preserves sharp edges and piecewise-smooth regions. Moreover, TL1 admits a tractable proximal operator, enabling an efficient algorithm based on a proximal splitting scheme with subproblems solved by the Alternating Direction Method of Multipliers (ADMM). The weak convexity of TL1 guarantees global convergence of the proximal iterates to a stationary point under mild conditions. Numerical experiments on image denoising demonstrate that the proposed method effectively preserves sharp edges, local contrast, and piecewise-smooth structures, outperforming other gradient-based approaches.

This paper presents finite-time and fixed-time stabilization results for inhomogeneous abstract evolution problems, extending existing theories. We prove well-posedness for strong and weak solutions, and estimate upper bounds for settling times for both homogeneous and inhomogeneous systems. We generalize finite-dimensional results to infinite-dimensional systems and demonstrate partial state stabilization with actuation on a subset of the domain. The interest of these results are illustrated through an application of a heat equation with memory term.

Accurate compensation of brain deformation is critical for reliable image-guided neurosurgery. Surgical manipulation and tumor resection induce tissue motion, causing preoperative planning images to become misaligned with the intraoperative anatomy. In this systematic review, we examine data-driven methods developed between 2020 and 2025 for brain deformation registration and modeling, with a particular focus on learning-based approaches. A comprehensive literature search was conducted in PubMed, IEEE Xplore, Scopus, and Web of Science using predefined inclusion and exclusion criteria for computational methods addressing brain deformation in neurosurgical imaging, resulting in 46 eligible studies. We provide a unified analysis of methodological strategies, including deep learning-based image registration, direct deformation field regression, synthesis-driven multimodal alignment, resection-aware architectures for handling missing correspondences, and hybrid models integrating biomechanical priors. We also examine dataset utilization, evaluation metrics, validation protocols, and the assessment of uncertainty and generalization across studies. While learning-based methods demonstrate promising accuracy and computational efficiency, current approaches remain limited by out-of-distribution robustness, standardized benchmarking, interpretability, and readiness for clinical deployment. Our review highlights these gaps and outlines future directions toward more robust, generalizable, and clinically translatable solutions for neurosurgical guidance. By organizing recent advances and critically assessing evaluation practices, this work provides a comprehensive reference for researchers and clinicians working on data-driven registration and modeling of brain deformation.

We present DRES: a 1.5-hour Dutch realistic elicited (semi-spontaneous) speech dataset from 80 speakers recorded in noisy, public indoor environments. DRES was designed as a test set for the evaluation of state-of-the-art (SotA) automatic speech recognition (ASR) and speech enhancement (SE) models in a real-world scenario: a person speaking in a public indoor space with background talkers and noise. The speech was recorded with a four-channel linear microphone array. In this work we evaluate the speech quality of five well-known single-channel SE algorithms and the recognition performance of eight SotA off-the-shelf ASR models before and after applying SE on the speech of DRES. We found that five out of the eight ASR models have WERs lower than 22\% on DRES, despite the challenging conditions. In contrast to recent work, we did not find a positive effect of modern single-channel SE on ASR performance, emphasizing the importance of evaluating in realistic conditions.

To support the high data rates for latency-critical applications, future wireless systems will employ fully digital beamforming multiple-input multiple-output (MIMO) architectures at millimeter wave (mmWave) frequencies. Moreover, mmWave MIMO deployments will coexist with conventional sub-6 GHz MIMO systems, creating opportunities to exploit out-of-band sub-6 GHz information to enhance channel estimation at mmWave frequencies. In this work, we analyze the pilot-aided channel estimation performance of mmWave MIMO systems under various pilot configurations in both static and dynamic environments. We evaluate the system performance in terms of spectral efficiency (SE) for line-of-sight and non-line-of-sight propagation conditions. Simulation results show that incorporating out-of-band sub-6 GHz information yields notable SE gains in both static and dynamic scenarios.

This paper presents a comparative study of four potential operating configurations for distributed cell-free massive multiple-input multiple-output (CF-mMIMO) ISAC, spanning separated (SE) and shared (SH) access point (AP) deployment with half-duplex (HD) and full-duplex (FD) paradigms. The system comprises distributed APs serving multiple downlink (DL) and uplink (UL) users while simultaneously detecting radar targets. The configurations incorporate realistic impairments at the AP receivers: residual self-interference (SI) from transmit--receive leakage under FD operation, imperfect interference cancellation (IC) of the known radar and DL waveforms due to channel-estimation errors, and environmental clutter. To establish a common analytical scale for communication and sensing, the Kullback--Leibler divergence (KLD) is adopted as a unifying measure that represents both subsystems in comparable quantities, thereby enabling consistent comparison between error-rate and detection metrics. A generalised likelihood ratio test (GLRT) framework is developed, yielding closed-form expressions that link the KLD to the detection probability. Our results confirm the derived KLD-to-symbol error rate (SER) and KLD-to-detection links: with adequate SI suppression and IC quality, FD attains substantial communication gains over HD while preserving strong radar detection, and SH deployment raises both communication and radar performance through its larger effective aperture, though its radar gain then depends on cancellation quality, which SE deployment avoids by isolating the subsystems. These trends persist under imperfect channel state information (CSI) and sensing estimation, and a complexity analysis attributes the SH deployment and FD gains to a higher per-configuration processing cost, yielding deployment guidelines and quantitative design thresholds for next-generation CF-mMIMO ISAC systems.

Recursive systems can enter collapse-like regimes -- self-reinforcing amplification, persistent recursion, and narrowing diversity that mask accelerating internal degradation -- before overt failure becomes visible. We introduce Loopzero, a claim-bounded benchmark framework for testing whether recursive failures follow a directional telemetry pattern: rising gain (G), recursive persistence (p), and declining diversity ($\delta$). The claim boundary is specified in Lean; the Lean artifact does not verify real telemetry, benchmark validity, or detector performance. We evaluate the bridge on two frozen public-artifact benchmarks: a segmented public-markets benchmark (Volmageddon 2018, COVID MWCB 2020) and a MovieLens-25M offline deterministic recommender replay. Detectors are evaluated under a locked equal-false-positive contract (FP $\in$ [0.03, 0.07], pre-registered) so all configurations face the same alert budget. Neither tested standard comparators nor Loopzero's pre-registered quantile detector achieved an accepted operating point. Directional witness alignment held on both canonical benchmarks, with adjacent-horizon and row-level limitations disclosed. Digitized Shumailov et al. (2024) LLM training-loop trajectories are directionally consistent with the pattern; matched-FP evaluation in that domain is deferred. The contribution is a reproducible, falsifiable benchmark framework for evaluating recursive-collapse warning claims under an explicit alert-budget contract -- non-acceptance reported as a first-class scientific outcome.

While discriminative models for multi-channel speech separation excel in reference-based metrics, they often exhibit suboptimal human listening quality. To address this, we propose a novel MeanFlow-based one-step generative corrector (MeCo). MeCo learns a conditional average velocity field to map discriminative estimates directly onto the clean speech manifold in a single step. To maximize one-step generation performance, we introduce Data-Space Optimization (DSO). DSO integrates an $\mathbf{x}_r$-loss, which penalizes prediction errors on longer displacement intervals to serve as a generative objective for human listening quality, with an Endpoint SI-SDR loss that directly optimizes terminal signal fidelity. Experiments demonstrate that MeCo achieves state-of-the-art (SOTA) performance with minimal computational overhead, simultaneously achieving superior signal fidelity and human listening quality in both in-domain and out-of-domain scenarios.

Diffusion-based speech enhancement architectures that pair a deterministic predictor with a learned score network, exhibit a sharp non-smooth transition (``kink'') in the SI-SDR degradation curve at the training-time noise amplitude. We give a pathwise variational-flow analysis that localizes this non-smoothness to the predictor stage. The central identity is an exact factorization of the parametric sensitivity, $\partial \sig^{(M)} / \partial M = K(M) \cdot \partial C_M / \partial M$, where $K(M)$ is a continuous matrix-valued functional of the score Jacobian along the reverse trajectory and $C_M = \Pi(y^{(M)})$ is the predictor output. Under three hypotheses on the reverse-process flow (score-Jacobian continuity, conditioning-Jacobian continuity, non-degeneracy of $K$), failure of $M \mapsto \sig^{(M)}$ to be $C^1$ at $M^\ast$ holds if and only if $M \mapsto \Pi(y^{(M)})$ fails to be $C^1$ at $M^\ast$. We extend the localization to the finite-step Euler--Maruyama sampler actually run at inference. The hypotheses translate into a concrete experimental program; this paper specifies the program and presents the variational structure. The empirical validation is deferred to a companion experimental report.

This paper derives exact closed-form feedforward inversion maps for the dual-bridge series resonant converter (DB SRC) using state-plane trajectory analysis. The converter employs four modulation variables: primary duty cycle $d$, secondary shorting time $s$, phase shift $\beta$, and switching frequency $\omega$. While the established first harmonic approximation (FHA) provides frequency-independent inversion, the exact state-plane approach yields frequency-dependent inversion model that is proven algebraically identical to FHA at resonance frequency. For practical above-resonance operation, the exact inversions eliminate the commutation angle errors inherent in the FHA-based feedforward. The resulting controller architecture mirrors the parallel nonlinear compensation structure of the FHA-based design, with feedforward maps now operating on resonant-time quantities that naturally couple commutation and frequency control. All results are expressed in closed form suitable for real-time implementation.

For nonlinear control systems on normed vector spaces, we characterize an incremental input-to-state stability (ISS) type property in which the overshoot constant multiplies both the initial-condition and the input terms. Working through the associated variational system, we show that two properties are equivalent: an ISS-type bound on the variational system, and the incremental ISS-type bound on the original system. We further establish the equivalence between an infinitesimal contraction condition, expressed through a Lyapunov-type function, and an incremental Lyapunov condition. Each of these equivalent conditions yields a necessary condition and a sufficient condition for the ISS-type bounds, differing only in the input Lipschitz constant of the vector field. When the overshoot constant equals one, the infinitesimal contraction condition reduces to the standard norm-based contraction conditions. We establish these implications under mere continuous differentiability of the vector field, and we illustrate the results through sensitivity matrices and Lyapunov characteristic exponents. Moreover, we develop similar implications for discrete-time systems.

Black-box modeling of inverter-based resources (IBRs) has become essential for real-time grid operation and control in the presence of proprietary electronic control architectures. Existing machine learning (ML)-based online dynamic trajectory prediction approaches using IBR black-box models either significantly accumulate prediction errors when multiple surrogates are simultaneously used or ignore measurement errors, limiting their deployment in practical grids. To address these limitations, this paper proposes a novel network interdependency-informed ML algorithm for online dynamic trajectory prediction in IBR-integrated power systems. A modular spatiotemporal attention network (STAN)-based predictor for the black-box modeling of each IBR unit is first proposed. Utilizing past measurements, the proposed STAN can effectively capture and predict the spatiotemporal dynamics of IBRs by employing an attention mechanism to attend to the most pertinent features for trajectory prediction. Furthermore, a novel hybrid physics-informed loss function that integrates a decoupled linearized AC power flow formulation is proposed. The proposed loss function effectively ensures physical consistency of predictions within network operation while avoiding the computational complexity of iterative power flow solving, thereby enabling efficient gradient backpropagation and overall improved prediction accuracy. Case studies on the IEEE 14- and WECC 179-bus systems demonstrate that the proposed method achieves significant accuracy enhancement and robustness against measurement errors, outperforming recent ML-based trajectory prediction methods.

Next-generation space-air-ground-sea integrated networks (SAGSIN) impose unprecedented demands on advanced radio frequency (RF) receivers for full-spectrum agility, ultra-high sensitivity, and anti-jamming resilience, pushing conventional electronic receivers to their physical limits. To address these challenges, the Rydberg atomic quantum (RAQ) radio has emerged as a promising quantum-enabled receiver paradigm that directly maps electromagnetic fields onto atomic quantum states, offering an alternative to alleviate bottlenecks of conventional RF front ends. To provide a clear research roadmap, this survey presents a comprehensive review of RAQ radios by bridging atomic physics and wireless communications. Specifically, we first introduce the underlying quantum mechanisms, representative architectures, and atomic response models of RAQ radio. On this basis, state-of-the-art techniques for enhancing sensitivity, instantaneous bandwidth, and operating frequency are systematically reviewed, with particular emphasis on the inherent trade-offs among these key metrics. To connect quantum response with communication theory, we further analyze equivalent channel modeling frameworks for characterizing systematic performance limits. From the wireless communication perspective, some RAQ-enabled advanced technologies including cognitive, interference-resilient, low-frequency and multiple-input multiple-output (MIMO) communications are reviewed, alongside emerging deployment scenarios such as satellite networks, integrated sensing and communications, and reconfigurable intelligent surface-assisted systems. Finally, we identify open challenges and provide potential future directions of RAQ radio to inspire the further exploration.

To achieve the desired coverage and capacity levels, future terahertz (THz) wireless systems are envisioned to utilize extremely large antenna arrays. At THz frequencies, the combination of short wavelengths and large array apertures often makes many of the conventional far-field assumptions invalid in practice. As a result, many UEs operate in the radiative near-field zone, where novel near-field beam synthesis methods become viable. This paper studies phase-only Bessel-like near-field beam configurations for downlink THz multiple-input multiple-output links under imperfect UE location knowledge. We first formulate a spectral efficiency maximization problem with respect to the "Bessel cone angle''. We then derive low-complexity closed-form approximations for the optimal Bessel beam configuration for: (i)deterministic UE location; (ii)Gaussian and (iii)uniform error in the UE location. Finally, through extensive simulations across multiple signal frequencies, UE locations, and array sizes, we show that our proposed simple closed-form approximations closely match (under 0.1% difference) the best performance achieved via exhaustive search, while simultaneously reducing the configuration complexity down to as low as O(1).

Accurate state-of-charge (SOC) estimation remains a fundamental challenge in lithium-ion battery management systems because battery dynamics are highly nonlinear, operating-condition dependent, and sensitive to parameter variations caused by aging and temperature. Conventional model-based estimators, such as equivalent circuit model (ECM) and Kalman-filter-based approaches, rely heavily on repeated parameter identification and accurate electrochemical modeling, whereas purely data-driven methods often sacrifice physical interpretability. This work proposes a Koopman-theoretic, data-driven framework for SOC estimation using Dynamic Mode Decomposition with control (DMDc) combined with Hankel time-delay embedding. Instead of explicitly identifying ECM parameters, the proposed approach reconstructs a lifted dynamical state space directly from measured terminal voltage and current obtained through Hybrid Pulse Power Characterization (HPPC) testing. Spectral decomposition of the identified DMDc operator reveals intrinsic battery dynamics in terms of Koopman modes and eigenvalues. The SOC dynamics naturally emerge as the slowest marginally stable mode whose eigenvalue lies closest to the unit circle, consistent with the integrator-type behavior of charge conservation. The corresponding modal coordinate is subsequently utilized as an SOC-sensitive observable.

Deploying deep learning-based imaging tools across various clinical sites poses significant challenges due to inherent domain shifts and regulatory hurdles associated with site-specific fine-tuning. For histopathology, stain normalization techniques can mitigate discrepancies, but they often fall short of eliminating inter-site variations. Therefore, we present Data Alchemy, an explainable stain normalization method combined with test time data calibration via a template learning framework to overcome barriers in cross-site analysis. Data Alchemy handles shifts inherent to multi-site data and minimizes them without needing to change the weights of the normalization or classifier networks. Our approach extends to unseen sites in various clinical settings where data domain discrepancies are unknown. Extensive experiments highlight the efficacy of our framework in tumor classification in hematoxylin and eosin-stained patches. Our explainable normalization method boosts classification tasks' area under the precision-recall curve(AUPR) by 0.165, 0.545 to 0.710. Additionally, Data Alchemy further reduces the multisite classification domain gap, by improving the 0.710 AUPR an additional 0.142, elevating classification performance further to 0.852, from 0.545. Our Data Alchemy framework can popularize precision medicine with minimal operational overhead by allowing for the seamless integration of pre-trained deep learning-based clinical tools across multiple sites.

This paper addresses the Direct Data-Driven Inverse Optimal Control (3DIOC) problem for linear time-invariant (LTI) systems under the linear quadratic (LQ) control. Unlike traditional approaches that require system identification, the proposed method learns the underlying objective function directly from measured input-output trajectories. Leveraging the input-output representation of LTI systems via the Fundamental Lemma, we derive a model-free optimality necessary condition (ONC) for the forward LQ problem, which forms the basis for formulating and solving an inverse optimal control problem. We also provide an identifiability condition to ensure the uniqueness of the inverse solution. While the ONC-based IOC approach is effective in the noise-free case, its performance is not promising when the data is corrupted with noises. We then reformulate the 3DIOC as a bi-level optimization problem, which is solved using iterative gradient descent and offers solution guarantees. Furthermore, we analyze the relationship between the solution sets of the two proposed formulations, providing practical insights into their selection. The simulation results validate the effectiveness and performance of our proposed methods.

Obtaining a reliable estimate of the joint probability mass function (PMF) of a set of random variables from observed data is a significant objective in statistical signal processing and machine learning. Modelling the joint PMF as a tensor that admits a low-rank canonical polyadic decomposition (CPD) has enabled the development of efficient PMF estimation algorithms. However, these algorithms require the rank (model order) of the tensor to be specified beforehand. In real-world applications, the true rank is unknown. Therefore, an appropriate rank is usually selected from a candidate set either by observing validation errors or by computing various likelihood-based information criteria, a procedure that could be costly in terms of computational time or hardware resources, or could result in mismatched models which affect the model accuracy. This paper presents a novel Bayesian framework for estimating the low-rank components of a joint PMF tensor and simultaneously inferring its rank from the observed data. We specify a Bayesian PMF estimation model and employ appropriate prior distributions for the model parameters, allowing the rank to be inferred without this http URL then derive a deterministic solution based on variational inference (VI) to approximate the posterior distributions of various model parameters. Numerical experiments involving both synthetic data and real classification and item recommendation data illustrate the advantages of our VI-based method in terms of estimation accuracy, automatic rank detection, and computational efficiency.

Token communications (TokenCom) is an emerging generative semantic communication paradigm, where tokens serve as compact representation units across modalities. Their contextual dependencies can be exploited by pretrained large models for semantic recovery. In this paper, we propose token-domain multiple access (ToDMA), a large-model-driven semantic multiple access scheme for massive token communications. ToDMA integrates unsourced random access with context-aware token processing. It enables massive uncoordinated devices to transmit tokenized source representations over common uplink resources. Specifically, each token index is associated with a shared modulation codeword, exposing token-level structure to the receiver for context-aware recovery. At the receiver, compressed sensing is first employed to jointly detect active tokens and estimate their corresponding channel state information (CSI) from the superposed signals. The source token sequences are then reconstructed by exploiting the consistency of token-associated CSI across multiple token positions. In the presence of token collisions, some active tokens may remain unassigned, leading to missing entries in the reconstructed token sequences. To recover these tokens, candidate-restricted masked-token prediction is performed using pretrained contextual models, thereby leveraging token-level context to mitigate collision effects. Simulation results on both image and text transmission tasks demonstrate that ToDMA reduces access latency while maintaining favorable token recovery and semantic reconstruction quality, showing its scalability for semantic multiple access.

We propose UtterTune, a lightweight method for adapting a multilingual text-to-speech (TTS) system built on a large language model (LLM). It improves control of pronunciation in the target language while preserving performance in the others. Although LLM architectures have enabled TTS models to achieve remarkable naturalness, accurately modeling grapheme-to-phoneme (G2P) mapping and prosody remains challenging, especially when the model omits an explicit G2P module and directly processes minimally encoded text (e.g., byte-pair encoding). UtterTune leverages low-rank adaptation to enable the control of segmental pronunciation and pitch accent at the phoneme level for Japanese speech, the target language in this paper, while maintaining naturalness and speaker similarity in a zero-shot setting. Objective and subjective evaluations confirm its effectiveness.

The secret protection problem (SPP) seeks to synthesize a minimum-cost policy ensuring that every execution from an initial state to a secret state includes a sufficient number of protected events. The problem is solvable in polynomial time under the assumption that transitions are uniquely labeled. When this assumption is relaxed, the problem becomes weakly \NP-hard. We first strengthen the result by showing that the problem is strongly \NP-hard even if all parameters are restricted to binary values. We then propose a formulation of SPP as an integer linear programming (ILP) problem, and empirically evaluate the scalability and effectiveness of the ILP-based approach on relatively large systems. Finally, we examine the complexity of a variant of SPP in which only distinct protected events contribute to clearance and show that its decision version is $\Sigma_{2}^{P}$-complete.

Recovery from linear measurements under sparse adversarial corruption is typically formulated as an exact-recovery problem: one seeks structural conditions on $\mathbf{A}$ (e.g., restricted isometry property) guaranteeing unique recovery of $\mathbf{x}^\star$ from $\mathbf{y} = \mathbf{A}\mathbf{x}^\star + \mathbf{e}$ with $\|\mathbf{e}\|_0 \leq q$. However, these guarantees provide no guidance once exact recovery fails. This limitation obscures simple robustness phenomena -- for instance, repeated rows in $\mathbf{A}$ can preserve nontrivial information about $\mathbf{x}^\star$ under sparse corruption. In this paper, we study what information about $\mathbf{x}^\star$ can be \emph{uniformly} recovered from $\mathbf{y} = \mathbf{A}\mathbf{x}^\star + \mathbf{e}$ for arbitrary $\mathbf{A}\in\mathbb{R}^{m\times n}$ and \emph{any} $q$-sparse $\mathbf{e}$. We show that the robust information is precisely $\mathbf{x}^\star + \ker(\mathbf{U})$, where $\mathbf{U}$ is the orthogonal projection onto the intersection of rowspaces of all submatrices of $\mathbf{A}$ obtained by deleting $2q$ rows. This clarifies how the row structure of $\mathbf{A}$ governs whether a $q$-sparse corruption allows exact, partial, or only trivial recovery. We further prove every $\mathbf{x}$ minimizing $\|\mathbf{y} - \mathbf{A} \mathbf{x}\|_0$ belongs to $\mathbf{x}^\star + \ker(\mathbf{U})$, yielding a constructive approach to recover this set. For i.i.d. Gaussian matrices, we establish a sharp phase transition between exact and trivial recovery. We sketch two applications: robust network tomography and signal reconstruction from oversampled DCT.

Camouflaged object detection is an emerging and challenging computer vision task that requires identifying and segmenting objects that blend seamlessly into their environments due to high similarity in color, texture, and size. This task is further complicated by low-light conditions, partial occlusion, small object size, intricate background patterns, and multiple objects. While many sophisticated methods have been proposed for this task, current methods still struggle to precisely detect camouflaged objects in complex scenarios, especially with small and multiple objects, indicating room for improvement. We propose a Multi-Scale Recursive Network that extracts multi-scale features using a Pyramid Vision Transformer backbone and combines them with specialized Attention-Based Scale Integration Units, thereby enabling selective feature merging. For more precise object detection, our decoder recursively refines features by incorporating Multi-Granularity Fusion Units. A novel recursive-feedback decoding strategy is developed to enhance the model's understanding of global context, thereby helping it overcome the challenges of this task. By jointly leveraging multi-scale learning and recursive feature optimization, our proposed method achieves performance gains, successfully detecting small and multiple camouflaged objects. Our model achieves state-of-the-art results on two benchmark datasets for camouflaged object detection and ranks second on the remaining two. Our code, model weights, and results are available at this https URL.

We propose PRISM-FCP (Partial shaRing and robust calIbration with Statistical Margins for Federated Conformal Prediction), a communication-efficient Byzantine-robust federated conformal prediction framework that uses partial model sharing to mitigate stochastic model-poisoning attacks during training and histogram-based filtering to mitigate adversarial calibration submissions. Existing approaches address adversarial behavior only in the calibration stage, leaving the learned model susceptible to poisoned updates. In contrast, PRISM-FCP mitigates attacks end-to-end. During training, clients partially share updates by transmitting only $M$ of $D$ parameters per round. This attenuates the expected energy of an adversary's perturbation in the aggregated update by a factor of $M/D$, yielding lower mean-square error (MSE) and tighter prediction intervals. During calibration, clients convert nonconformity scores into characterization vectors, compute distance-based maliciousness scores, and downweight or filter suspected Byzantine contributions before estimating the conformal quantile. Extensive experiments on both synthetic data and the UCI Superconductivity dataset demonstrate that PRISM-FCP maintains near-nominal empirical coverage in the studied Byzantine settings while avoiding the interval inflation observed in standard FCP, with reduced communication. These results support PRISM-FCP as a robust and communication-efficient approach to federated uncertainty quantification.

Non-conservative uncertainty bounds are essential for making reliable predictions about latent functions from noisy data, and thus, a key enabler for safe learning-based control. In this domain, kernel methods such as Gaussian process regression are established techniques, thanks to their inherent uncertainty quantification mechanism. Still, existing bounds either pose strong assumptions on the underlying noise distribution, are conservative, do not directly apply in the multi-output case, or are difficult to integrate into downstream tasks. This paper addresses these limitations by presenting a tight, deterministic bound for multi-output functions in Reproducing Kernel Hilbert Spaces (RKHSs) subject to bounded noise. It is obtained through an unconstrained, duality-based formulation, which shares the same structure as classic Gaussian process confidence bounds, and can thus be straightforwardly integrated into downstream optimization pipelines. We show that the proposed bound generalizes existing results and illustrate its application using an example inspired by quadrotor dynamics learning.

We introduce Echoes, a new dataset for music deepfake detection designed for training and benchmarking detectors under realistic and provider-diverse conditions. Echoes comprises 4,468 tracks (131 hours of audio) spanning multiple genres (pop, rock, electronic), and includes content generated by ten popular AI music generation systems. To prevent shortcut learning and promote robust generalization, the dataset is deliberately constructed to be challenging, enforcing semantic-level alignment between spoofed audio and bona fide references. This alignment is achieved by conditioning generated audio samples directly on bona-fide waveforms or song descriptors. We evaluate Echoes in a cross-dataset setting against three existing AI-generated music datasets using state-of-the-art Wav2Vec2 XLS-R 2B representations. Results show that (i) Echoes is the hardest in-domain dataset; (ii) detectors trained on existing datasets transfer poorly to Echoes; (iii) training on Echoes yields the strongest generalization performance. These findings suggest that provider diversity and semantic alignment help learn more transferable detection cues.

Modern audio-visual media rely on compact representations for efficient storage and transmission, whereas realistic digital touch still depends on high-resolution tactile recordings. Existing approaches for representing tactile signals constrain manipulation and limit the generation of new content. Here, we introduce two compact representations, spectral beta and spectral slope, that capture the temporal spectral structure of finger-surface friction signals while preserving perceptually relevant information. Spectral beta models spectral skewness using a two-parameter beta distribution, whereas spectral slope approximates the spectrum with an asymmetric bandpass filter defined by low- and high-pass orders. We evaluated these representations in a perceptual study with 14 participants using five virtual textures rendered on a friction-modulation display and compared them with physical textures and high-fidelity reproductions of recorded signals. Spectral beta achieved perceptual similarity ratings comparable to those of the original high-fidelity reproductions. Regression analysis further showed that matching spectral energy across nine critical frequency bands was the strongest predictor of perceived realism. Together, these findings suggest that tactile texture perception depends primarily on fundamental temporal spectral patterns and that modeling these patterns is sufficient for perceptually realistic rendering. These results establish an efficient and scalable framework for haptic compression, communication, and synthetic texture generation.

In this work, we present a compact surrogate circuit for electro-quasi-static (EQS) head modeling. A three-shell geometry (brain, skull, scalp) is considered, and each layer is modeled through radial and tangential pathways, implemented as RC branches. Frequency-dependent tissue conductivity and permittivity are mapped into dispersive resistive and capacitive elements. The model is validated against a semi-analytical spherical-harmonics reference solution over multiple geometrical configurations and operating frequencies, demonstrating good agreement. Neglecting dispersion and capacitive pathways can lead to an overestimation of scalp potentials over the considered frequency range, highlighting the need for dispersive RC circuit modeling.

Continuous control policies trained with off-policy reinforcement learning frequently exhibit high-frequency action jitter, impractical for direct deployment on physical actuators. Post-hoc filtering attenuates jitter but adds phase lag; embedding smoothness penalties in the actor's loss couples them with the RL gradient and conflates reward regression with over-aggressive smoothing. We present ZAPS-DA, which reduces action jitter at deployment with negligible phase lag and no post-processing. ZAPS-DA pairs an unmodified main actor (trained by the base RL loss) with a separate decoupled actor trained via supervised imitation of zero-phase filtered targets stored in the replay buffer. The deployed policy is the decoupled actor: a feed-forward map from observation to smooth action, with no inference-time filter and no action-history input -- causal distillation of a non-causal filter. A magnitude-matched MSE loss gives zero-hyperparameter portability across optimizer classes. Validated with Soft Actor-Critic and a Savitzky-Golay filter in two driving simulators (paired n=150): on MetaDrive (anchor protocol), ZAPS-DA cuts steering jitter 14-21x and throttle jitter 3-5x (all $p<10^{-4}$, Bonferroni) while matching task-completion (p=0.28 success, p=0.31 crash) at 6.3% reward cost; on a custom Webots adaptive cruise control task, the same configuration yields a Pareto improvement -- reward parity (p=0.121), 8-45x steering-jitter reduction, task-failure rate 2.0% to 0.7%. Against CAPS, the standard penalty-based baseline -- at both its auto-entropy and native fixed-entropy operating points, with penalty weight, spatial noise, and entropy coefficient re-tuned per environment -- ZAPS-DA reaches 14.7x steering-jitter reduction versus CAPS's best 3.2x at matched seeds, a ~4.6x gap, with no per-environment tuning of the smoothness signal and post-hoc applicability to trained policies.

The monomial parameterization of finite-memory Volterra identification is ill-conditioned under non-Gaussian input, and the Wiener--Hermite expansion removes this ill-conditioning only for Gaussian white-noise input. We construct the distribution-matched Volterra--Wiener--Kunchenko (VWK) basis by oriented Gram--Schmidt orthogonalization of monomials in $L^2(P)$ and use it as an arbitrary-polynomial-chaos coordinate system for finite-memory Volterra identification from data, following the generalized polynomial chaos of Xiu and Karniadakis (2002) and the data-driven arbitrary polynomial chaos of Oladyshkin and Nowak (2012). The basis itself is classical; the contribution is the Volterra-estimation reading. First, an order-2 misspecification-penalty theorem shows that a self-normalized diagonal estimator in the variance-matched Gaussian basis incurs an excess $L^2(P)$ risk governed by the skew coefficient $\delta=\mu_3/\sigma^2$, vanishing exactly for symmetric inputs. Second, conditioning experiments separate the constructional fact that the population matched Gram is the identity from the finite-sample design Gram: at $n=2000$, the centered-exponential empirical VWK Gram remains far better conditioned than the power Gram, although it degrades with degree. Third, a machine-checked Lean 4 proof establishes the Binomial$(N,p)$ Krawtchouk row for arbitrary $N$. Full least squares over a fixed span is basis-invariant, so VWK stabilizes diagonal cross-correlation and regularized coordinate fits rather than claiming universal prediction superiority. The analysis is moment-based, finite-memory, and restricted to product input laws.

Neural ordinary differential equations (neural ODE) gained attention in safety critical settings such as continuous-time controllers for cyber-physical systems and classifiers integrated into automated decision pipelines, raising the question whether their behavior can be formally verified. Existing tools dedicated to neural ODE provide only a single reachability call without iterative input-set refinement, limiting the precision of their verdicts to whatever one reachability call can deliver. We present TNODEV, the first formal verifier for neural ODE that integrates a falsification checker, a fast interval-based reachability backend based on continuous-time mixed monotonicity, a verification and refinement loop with three input-set splitting heuristics, and a parallel scheduler in a single end-to-end pipeline. TNODEV supports safe-set inclusion verification on pure neural ODE, neural ODE in closed loop with a neural network controller and general neural ODE (GNODE), with the safe set specified either as an interval or as the half-space intersection induced by a target classification label. We evaluate TNODEV on a range of benchmarks across safe-set inclusion and classification-robustness properties, including a direct reachability comparison against NNV 2.0 and CORA and a verification comparison against NNV 2.0 on MNIST general neural ODE classifiers.

Learning-based single-shot fringe projection profilometry (FPP) has been studied almost entirely at close range, and the networks used are evaluated only on aggregate error, leaving open whether they recover depth from fringe phase or from object-level shape cues that correlate with depth. This paper diagnoses that question mechanistically in the long-range regime (standoff beyond 1 m). Using FPP-ML-Bench, an open photorealistic synthetic benchmark (15,600 fringe images, 50 objects at 1.5--2.1 m), we first formalize why the single-shot fringe-to-depth mapping is more severely ill-posed at long range: it is non-injective without fringe-order information, and the depth error from an incorrect fringe order grows as $Z^2$ in the working distance. Systematic ablations, extended with a multi-frame study, establish a best UNet baseline at 14.54 mm object mean absolute error (MAE), 18% of the 80 mm object depth range, with only a 1.9$\times$ spread across four architectures, indicating a representational rather than a capacity-bound limit. A mechanistic interpretability study, the first applied to an FPP network, localizes the cause: linear probing shows edges are 2.82$\times$ more decodable than depth, Grad-CAM shows attention favoring boundaries over fringes by 1.28$\times$, and an in-range flat-plane test collapses a featureless plane to background depth despite valid fringes. The baseline solves the task via object-boundary shape priors rather than fringe-phase decoding. Because the shortcut is a hypothesis-space property, additional data or larger models will not remove it, motivating an architectural repair that removes the shape-prior solution by construction.

During hot tests on a production line, engine-sound analysis is crucial to ensuring product quality and performance. However, background noise often interferes with accurate sound analysis, leading to potential errors in engine diagnostics. Traditionally, skilled technicians listen to engine sounds to assess engine health, but this is prone to significant inaccuracies. This study presents an innovative deep learning-based approach to address this issue by removing background noise from engine sound recordings using a U-Net neural network structure enhanced with Residual Attention Blocks (RAB-U-Net). Our intelligent noise removal system significantly improves the accuracy of engine noise detection, outperforming traditional techniques and providing a robust solution for real-time applications in production line environments. This study proposes a novel system for engine noise detection in production lines, marking a valuable advancement for the automotive industry in applying deep learning methods to improve the quality of engine diagnostics.