Electrical Engineering and Systems Science
See recent articles
Showing new listings for Monday, 16 November 2026
- [1] arXiv:2611.17397 [pdf, html, other]
-
Title: Admissibility-Preserving Control for Block Strict-Feedback Systems Under Time-Varying Asymmetric Actuator and State ConstraintsSubjects: Systems and Control (eess.SY); Dynamical Systems (math.DS)
This paper addresses the tracking control of block strict-feedback nonlinear systems subject to time-varying asymmetric actuator and full state constraints. To that end, we develop a time-varying Admissibility-Preserving Control (APC) framework, in which the Admissibility-Preserving Input Realization (APIR) generates the plant input through a dynamic realization. The APIR guarantees input admissibility under the moving actuator set whenever each actuator bound contracts slower than the decay rate of the realization, and a closed-form lower bound on its gain is derived. The state constraints are handled by a logarithmic barrier coordinate at every backstepping step, with widths measured from the virtual control to the moving envelope of the corresponding state. We prove that every state lies inside its envelope, with each virtual control only required to remain inside the envelope of the next state, while the tracking error converges to zero exponentially. Simulations demonstrate the efficacy of the proposed safety-critical control scheme.
- [2] arXiv:2611.17456 [pdf, html, other]
-
Title: Physical-Risk-Aware Decentralized Agents for Constrained Vehicle CommunicationsSubjects: Signal Processing (eess.SP); Multiagent Systems (cs.MA)
Decentralized V2X resource control is challenging because each vehicle has only local observations, while reliability depends on network-wide interactions. We develop a physical-risk-aware spatio-temporal graph attention (PA-STGAT) framework for agentic V2X control. Each vehicle perceives its local interaction graph, retains short-term temporal context, and independently selects its PC5 resource and power. Network outcomes are used during centralized training to refine the shared policy. Transmitter-specific credits map reliability failures to individual vehicles. A dual-priced graph term further converts network violations into coordination signals for discrete resource selection, with higher priority on short time-to-collision links. Experiments show higher raw-policy reliability than the tested graph-based baselines. Under filtered execution, PA-STGAT meets the nominal empirical communication requirements across all five seeds, with tradeoffs among utility, delivery reliability, resource occupancy, and filter-induced repair. Compared with GNN+MATD3, it requires fewer resource repairs but achieves lower utility and mean delivery reliability. Mechanism ablations show that removing dual-priced graph coordination causes resource-selection collapse. Density and mobility tests characterize the operating limits of empirical constraint satisfaction.
- [3] arXiv:2611.17468 [pdf, html, other]
-
Title: A thorough review on Deep Learning approaches to 2D-to-3D Registration in Medical ImagingAndrea Borghesi, Julia van Beurden, Maarten van Alphen, Michiel van den Brekel, Luc Karssemakers, Jan-Jakob Sonke, Baris Karakullukcu, Jonas Teuwen, George YiasemisComments: 51 pages, 4 tables, 8 figuresSubjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Medical Physics (physics.med-ph)
2D-to-3D image registration is a key component for several medical imaging purposes such as intraoperative guidance, enabling the alignment between preoperative 3D volumes and real-time 2D images. While conventional optimisation-based methods often struggle with non-convex objectives, sensitivity to initialisation, and high computational demands, deep learning (DL) has emerged as a promising alternative, offering improved alignment robustness and the potential for real-time performance. This review provides a comprehensive analysis of DL frameworks developed to address the challenges inherent in 2D-to-3D registration. We first outline how core concepts of DL are adapted to the registration problem. We then examine recent methodological advancements from multiple perspectives, including pipeline design, architectural innovations, and domain adaptation strategies. Particular attention is given to quantitative metrics, highlighting how performance is defined and measured across studies. Across the 41 included studies, we find that direct regression is the most common pipeline (23 studies, against 18 iterative ones), that hybrid CNN-attention architectures are gaining ground, and that research remains heavily concentrated on X-ray-to-CT registration. We conclude by identifying the absence of per-case uncertainty estimation and the strong neglect of temporal or sequential modelling as the two methodological gaps most consequential for clinical readiness, and discuss state-space models as a way to add temporal memory within intraoperative latency budgets. Further opportunities lie in more principled domain adaptation and in the integration of foundation models for representation learning.
- [4] arXiv:2611.17479 [pdf, html, other]
-
Title: RAZeR: Representation Aware Zonotope ReductionSubjects: Systems and Control (eess.SY)
Reachability analysis is a popular technique for verifying the safety of a dynamical system under uncertainty, where the uncertainty is often represented by zonotopes. As the size of the zonotope representation typically grows as the reachability analysis progresses, it must be repeatedly reduced at the cost of additional conservatism. While various methods exist to reduce the size of the representation, combined advantages are not fully leveraged as only a single reduction method is typically used throughout the analysis. In this work, we show how dynamically choosing which method to use can yield significantly tighter results, thereby easing verification. This is realized by introducing a heuristic, derived from model predictive control, that accounts for upcoming propagation of the current zonotope. We argue that order reduction is not merely a post-processing step after propagation but also a pre-processing step that shapes how the zonotope evolves under the system dynamics. We evaluate our approach, RAZeR, on nonlinear benchmarks taken from the ARCH-COMP, where we demonstrate that RAZeR produces tighter zonotopes at a negligible performance overhead.
- [5] arXiv:2611.17504 [pdf, html, other]
-
Title: Learning monotone game-theoretic linear MPCComments: 15 pages, 1 figureSubjects: Systems and Control (eess.SY); Optimization and Control (math.OC)
We propose a method to learn a game-theoretic model predictive control (GT-MPC) law by imitation from input and output data of a running multi-agent system. By interpreting the recorded inputs as the first moves of the equilibria of a game played by the agents, we learn the GT-MPC weights under hard input constraints and soft output constraints, without requiring the agents to reveal their objectives. We also impose that the resulting generalized Nash equilibrium (GNE) problem is strongly monotone, which ensures the existence and uniqueness of the equilibrium and, hence, that the learned GT-MPC law is well defined and can be evaluated efficiently online by variational GNE-seeking algorithms for linear-quadratic games. Moreover, strong monotonicity implies that the equilibrium is almost everywhere differentiable with respect to the references and the weights, which enables automatic differentiation for gradient-based optimization. In addition, we promote closed-loop stability of the unconstrained equilibrium feedback by incorporating a penalty that involves a jointly learned quadratic Lyapunov function. Learning a GT-MPC formulation enables us to explain the agents' objectives, reproduce their behavior in simulation in new scenarios, optimize their set-points, design mechanisms, and enforce additional constraints. A numerical example illustrates the approach.
- [6] arXiv:2611.17550 [pdf, html, other]
-
Title: Sub-Synchronous Control Interaction Risk of Large Data Center Loads: A Frequency-Scan Assessment with Cross-Model ValidationComments: 13 pages, 16 figures. Submitted for IEEE publicationsSubjects: Systems and Control (eess.SY)
Data centers are now one of the fastest-growing loads on the bulk power system, and most of their demand reaches the grid through power converters inside uninterruptible power supplies (UPS). Whether these loads can take part in sub-synchronous control interaction (SSCI), as wind and HVDC converters do, has not been studied extensively. We examine this question with impedance-based frequency scans at the point of common coupling (PCC). Using a detailed proprietary model (INS-ISU), we scan the motor, variable-frequency-drive (VFD), lighting, and UPS-fed information-technology (IT) branches of a representative facility separately. Only the UPS in double-conversion mode shows negative resistance; it covers the whole sub-synchronous band and continues up to about 170 Hz. The other branches, and the UPS in bypass mode, stay passive. We then repeat the scans on three public models from PNNL, TAMU, and NLR. None of them shows negative resistance in bypass mode, while three of the four models do in double-conversion mode. Lowering the load from rated to light load makes the negative resistance deeper, as expected for a constant-power load, so a lightly loaded facility in double-conversion mode is the worst case. Raising the UPS DC-link capacitance pushes the negative resistance into a narrow band around the fundamental. These findings give a basis for screening data centers for SSCI during interconnection studies.
- [7] arXiv:2611.17612 [pdf, html, other]
-
Title: Battery Energy Storage Sizing in PV Ramp-Rate Smoothing using Constraint-Aware Reinforcement Learning-Based ControllerSubjects: Systems and Control (eess.SY)
This paper presents a constraint-aware reinforcement learning (CARL) controller for battery energy storage system (BESS) sizing and photovoltaic (PV) ramp-rate smoothing. Rapid PV power fluctuations caused by cloud transitions can introduce operational and stability challenges in power systems. To mitigate these impacts, grid codes impose ramp-rate limits (RRL) on PV power injected to the grid. BESSs can support such grid codes by absorbing or supplying power during rapid variations. However, the extent to which BESSs can reduce PV-induced variability depends on (i) the BESS power and energy capacities; and (ii) the adopted controller. Thus, BESS sizing and controller design are coupled. Conventional moving-average control can increase battery usage due to filter-induced lag, while ramp-rate control is reactive and does not account for the long-term impact of actions on battery state of charge and future ramp events. Optimization-based methods can reduce BESS requirements by anticipating future PV variations, but their performance depends on accurate PV forecasts. To address these limitations, the CARL controller learns a causal state-feedback policy from historical PV data without requiring forecasts during deployment. Ramp-rate, converter-power, and state-of-charge constraints are incorporated into a causal feasibility interval that guarantees feasible actions by definition. A full-horizon input-convex neural network (ICNN)-based optimization is developed as a noncausal benchmark for the minimum achievable BESS requirements. Evaluation using three real-world PV datasets shows that, at a 10\%/min ramp-rate limit, CARL reduces peak BESS power by 8.7--10.4\% and energy capacity by 47.5--62.6\% relative to conventional ramp-rate control while maintaining the grid-codes compliance.
- [8] arXiv:2611.17654 [pdf, html, other]
-
Title: When to Move: Online Repositioning of Movable Antenna Arrays Under a Long-Term Actuation Energy BudgetComments: 14 pages, 4 figures, 4 tablesSubjects: Signal Processing (eess.SP)
Movable antenna (MA) arrays improve multiuser throughput by repositioning their elements, but mechanical movement reduces transmission time and consumes actuation energy. Changes in user configurations create nonuniform demand for repositioning over time, while each movement determines which positions are reachable in subsequent slots. Thus, online control must decide when to spend a limited actuation-energy budget, not only where to position the antennas. We formulate causal effective-throughput maximization under displacement-dependent movement delay, inter-slot reachability, and a long-term average actuation-energy constraint. We propose Lyapunov-based online movable-antenna repositioning (LOMA), which adjusts the price of movement through a virtual queue and solves the resulting nonconvex position problem via proximal minorization--maximization, accounting for nonsmooth movement delay and promoting sparse antenna updates. We establish monotone ascent of the smoothed per-slot objective, a finite-horizon sample-path energy bound, almost-sure long-term budget feasibility under a Gaussian fading model with bounded large-scale gains, and a state-matched throughput comparison separating temporal energy allocation from per-slot optimization error. Simulations show that LOMA concentrates actuation after intermittent user changes and improves effective throughput over optimized fixed arrays and a per-slot-budget counterpart, while continuous channel drift favors more frequent incremental repositioning. Additional simulations with pilot-based channel estimates in sparse millimeter-wave channels show that LOMA retains most of the throughput benefits of online repositioning while operating near its prescribed long-term actuation-energy budget.
- [9] arXiv:2611.17661 [pdf, html, other]
-
Title: Feasibility of Pareto-Improving Damping Control of Forced Oscillations: The Active-Power CaseSubjects: Systems and Control (eess.SY)
Damping control of a forced oscillation may reduce amplitudes at certain locations while increasing them elsewhere. This paper introduces Pareto improvement as a criterion for assessing such control: at least one nodal oscillation amplitude decreases, while none increases across all other nodes. The analysis considers active-power forcing sources and active-power control injections in connected swing networks with positive inertia and damping. Necessary conditions for Pareto improvement feasibility are derived from the normalized nodal responses. It is proven that for every network with a single oscillation source and a single actuator, at least one positive forcing frequency is shown to preclude Pareto improvement, regardless of the amplitude and phase of the control input. A three-node counterexample shows that this limitation does not persist with multiple actuators. PSS/E simulations of a 6-bus benchmark system and a modified IEEE 39-bus system validated the analysis. These findings suggest the value of assessing control effects across the network and further investigating multi-actuator damping control.
- [10] arXiv:2611.17666 [pdf, html, other]
-
Title: Brain-inspired Beam Selection for mmWave RIS CommunicationAris Karampelas Timotijevic, Christos G. Tsinos, Alexandros-Apostolos A. Boulogeorgos, Theodoros A. TsiftsisComments: 5 pages, 3 figuresSubjects: Signal Processing (eess.SP)
Beam selection at large passive reconfigurable intelligent surfaces (RISs) requires either full channel knowledge or beam training, both of which entail unwanted overhead. On the other hand, learned models that predict the optimal codeword from channels sampled at a few active elements avoid both, at the cost of energy-demanding multiply-and-accumulate operations. In this paper, we propose spiking neural network (SNN)-based beam selection for a semi-active RIS assisting a mmWave multiple-input single-output communication system. Direct and sigmoid rate coding are compared against a multi- layer perceptron (MLP) of identical architecture. Energy analysis further reveals that the input layer dominates SNN energy consumption.
- [11] arXiv:2611.17673 [pdf, html, other]
-
Title: Efficient Design of Flag Sequence Sets for Delay-Doppler Estimation via Riemannian OptimizationSubjects: Signal Processing (eess.SP)
This letter investigates the design of a Flag sequence set with peak-curtain auto-ambiguity functions to enable low-complexity delay-Doppler estimation. Given the predefined Curtain sequences, the Flag sequence set design problem is formulated as the minimization of the weighted integrated masked sidelobe level. To solve this problem, we first reformulate it as an unconstrained optimization problem on the unimodular manifold. Then, a tailored unimodular manifold conjugate gradient (UM-CG) algorithm is developed. Compared with the existing define algorithm, the proposed UM-CG algorithm reduces computational and storage requirements. Moreover, the global convergence of the proposed UM-CG scheme is theoretically derived under mild conditions. Numerical results demonstrate the superior optimization performance of the proposed UM-CG algorithm and show that the designed Flag sequences exhibit nearly ideal peak-curtain properties.
- [12] arXiv:2611.17689 [pdf, html, other]
-
Title: Orbit-AWARE: From Onboard AI Deployment to Sustainable In-Orbit IntelligenceYunxin Geng, Kaige Zhu, Tongtong Shu, Zhan Gao, Yanxiao Li, Yan Liu, Weiwei Jiang, Zhiqing Wei, Zhiyong FengComments: 10 pages, 4 figures, 2 tables, submitted to IEEE Wireless CommunicationsSubjects: Systems and Control (eess.SY)
The growing role of space computing in time-critical satellite services makes the long-term reliability of onboard artificial intelligence (AI) a mission-level requirement. Model drift can undermine this reliability through critical-observation suppression or noncritical priority flooding, displacing both mission information and evidence for model correction. To address this drift-induced evidence displacement, this article presents Orbit-AWARE, a safeguard-first lifecycle management (LCM) architecture. A comparison of existing approaches motivates cooperative Data, Cognitive, and Trust Planes for continuous monitoring, event-triggered agentic orchestration, and deterministic governance. The architecture retains a model-independent sample stream before degradation is confirmed and coordinates evidence selection and exchange for diagnosis and ground-assisted adaptation. Candidate updates are verified before control over data disposition is restored. In an xBD-based emergency Earth observation (EO) case study, Orbit-AWARE delivers 14.3\% more critical observations and achieves 8.3\% higher sustainable mission utility than the Rule-Based Drift Loop under a common 10\% downlink budget. Finally, we discuss future research directions for extending LCM through task-aware reliability assessment, memory- and tool-enabled onboard agents, and evidence-centric space networking. This work makes evidence availability and recovery authorization explicit design objectives for dependable onboard AI services.
- [13] arXiv:2611.17691 [pdf, html, other]
-
Title: Frequency-Security-Aware Real-Time Economic Dispatch with Data Center UPS Flexibility for Inertia and Primary Frequency Response ServicesSubjects: Systems and Control (eess.SY)
The increasing penetration of renewable energy and the rapid growth of AI data centers are introducing significant challenges to power system frequency security. There is an urgent need to identify grid-compatible resources capable of providing fast frequency support. This paper proposes a frequency-security-aware real-time economic dispatch (RTED) model that enables data center (DC) uninterruptible power supply (UPS) systems to provide steady-state power balancing, inertia response, and primary frequency response (PFR) services. Specifically, tractable analytical frequency-security constraints are derived and incorporated into the RTED framework through second-order cone programming (SOCP) formulation. The proposed model jointly optimizes energy, reserve, and inertia to minimize system operation cost while preventing under-frequency load shedding (UFLS). Numerical validation on a modified IEEE 39-bus system demonstrates that the proposed RTED model with UPS flexibility can economically support system operation and significantly improve frequency security under active-power deficit disturbances.
- [14] arXiv:2611.17712 [pdf, html, other]
-
Title: A Tumour-Aware Multimodal Framework for Explainable Prediction of IDH Mutation in Gliomas from Multi-Sequence MRIComments: 45 pages, 12 figures, 4 tables. Preprint of an article submitted for consideration in International Journal of Information Technology & Decision Making (World Scientific)Subjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
Accurate prediction of isocitrate dehydrogenase (IDH) mutation status is essential for glioma diagnosis, prognosis, and treatment planning. Although recent deep learning approaches have demonstrated promising performance, many rely on whole-brain feature extraction and provide limited interpretability. This study proposes a tumour-aware multimodal framework for explainable, non-invasive prediction of IDH mutation status from multiparametric magnetic resonance imaging (MRI). The proposed framework integrates four MRI sequences (T1, T1CE, T2, and FLAIR), tumour subregion segmentation, quantitative radiomic descriptors, and clinical information within a unified deep learning architecture. An ablation study was conducted to evaluate the contribution of tumour-aware learning, radiomic features, and clinical variables. Model performance was assessed using multiple complementary evaluation metrics, including accuracy, precision, recall, F1-score, balanced accuracy, receiver operating characteristic analysis, confusion matrix evaluation, and Grad-CAM visualisation. Experimental results demonstrated that the proposed multimodal framework consistently outperformed the baseline MRI-only model, with the Clinical Fusion model achieving the strongest overall predictive performance. The integration of tumour-aware learning, radiomic descriptors, and clinical information progressively improved classification performance, while Grad-CAM visualisations indicated that the model predominantly focused on biologically relevant tumour regions. These findings suggest that tumour-aware multimodal feature integration enables accurate, interpretable, and non-invasive molecular profiling of gliomas and provides a promising foundation for future clinical decision support in precision neuro-oncology.
- [15] arXiv:2611.17739 [pdf, html, other]
-
Title: State-of-Charge Targets for Storage Participation in Two-Settlement Markets: Reliability, Price, and Compensation ImpactsSubjects: Systems and Control (eess.SY)
As energy storage assumes a larger role in electricity systems, market operation must coordinate its use across time to support reliability during periods of system stress. Minimum state-of-charge (SOC) targets provide a means of preserving energy for these periods, but their design shapes reliability, operating efficiency, and storage compensation. This paper evaluates alternative SOC target designs in a California-based day-ahead and real-time electricity market model. The comparison examines targets based on day-ahead schedules or rolling centralized dispatch, enforced at the individual-resource or system level, across seasons, stress conditions, and participant information settings. The results show that retaining more energy does not necessarily reduce load shedding: targets that restrict discharge can limit storage support during shortages. Under critical summer conditions, individual targets derived from rolling centralized dispatch reduce weekly load shedding by approximately 83--84\% relative to operation without targets. Lower RT clearing costs and average prices can coexist with higher storage compensation, reflecting the role of day-ahead positions and real-time deviations in determining settlement outcomes. These findings highlight the importance of coordinating energy retention with timely discharge and network deliverability when designing SOC requirements for storage participation in electricity markets.
- [16] arXiv:2611.17743 [pdf, html, other]
-
Title: X-Strata: Separating Aneurysms and Overlapping Vessels into Layers from 2D X-ray AngiographyZhihong Wen, Congzhou Chen, Hucheng Li, Xun Han, Jianning Zhang, Yakun Chen, Hao Gao, Hao Zhao, Yudong Ma, Guanqiao Li, Yongping Liang, Shengli GuoComments: 22 pages, including 10 pages of supplementary materialSubjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
An X-ray angiogram sums every structure along a ray into one pixel. When vessels cross an aneurysm, they obscure part of it and mix their contrast into its filling curve. We present X-Strata, a network that separates a cine angiogram into three layers: the complete aneurysm sac, the vessels in front of it, and the vessels behind it. Contrast timing indicates how much each layer contributes to a pixel, and parallax between two views indicates their order, which a single view cannot determine. X-Strata first estimates the layers and their contrast curves, then uses the second view to assign vessels to the front or back layer, and lifts all layers into 3D. It learns from layer labels projected from same-session 3D rotational angiography, but needs only 2D cine runs and their acquisition geometry at inference. On 220 held-out patients from three centers (122 external), two-view X-Strata ranks first among 14 baselines, including VGGT and C$^2$RV, in recovering the sac where vessels overlap it (Dice 0.693 internal, 0.641 external) and in ordering the layers (balanced accuracy 0.703, 0.659). Its order accuracy exceeds that of all 11 end-to-end baselines by at least 4.1 points internally and 3.3 externally (Holm-adjusted $p < 0.001$) and grows with view separation. Recovered 3D sac surfaces have a median Chamfer distance of 0.34 mm on the internal cohort. X-Strata may therefore provide layered aneurysm and vessel information, including 3D sac shape, for patients who undergo only 2D angiography.
- [17] arXiv:2611.17757 [pdf, other]
-
Title: Graph Neural Network Prediction of Frequency Nadir and RoCoF Under Topology VariationsSubjects: Systems and Control (eess.SY)
Accurate prediction of frequency dynamics under varying network topologies is essential for rapid frequency security assessment, whereas repeated electromagnetic transient (EMT) simulations are computationally intensive. This paper develops a topology-aware graph neural network with a radial basis function Kolmogorov-Arnold network (RBF-KAN) regression head, termed RK-GNN, to predict frequency nadir and maximum absolute rate of change of frequency (RoCoF). Scenarios combine load scaling, regional load redistribution, and generator redispatch with intact, N-1, and N-2 transmission topologies. After checks for network connectivity, generator reference limits, and numerical consistency, the retained scenarios are simulated in PSCAD to construct the reference dataset. The RK-GNN is evaluated against a conventional deep neural network (DNN) and a baseline GNN. On the IEEE 39-bus system, the RK-GNN reduces the mean absolute errors (MAEs) of nadir and RoCoF by 48% and 59% relative to the DNN and by 42% and 61% relative to the baseline GNN. Incorporating the bridge indicator and disturbance hop distance yields further MAE reductions of 27% and 54%. These results show that the proposed topology-aware architecture provides accurate prediction of both frequency metrics under varying topologies and substantially reduces the need for repeated EMT simulations.
- [18] arXiv:2611.17815 [pdf, html, other]
-
Title: Improved Closed-Form Identification of the Air-Gap Permeance in Magnetic Equivalent Circuits of Rotor-Eccentric Electric MotorsComments: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibleSubjects: Systems and Control (eess.SY)
Fast and accurate simulation of electric motors is essential for their design, fault diagnosis and control. Magnetic equivalent circuits (MECs) offer a computationally efficient alternative to the finite element method (FEM), yet their flux tube representation poorly captures the air-gap field. This creates a challenge, as the air gap stores most of the magnetic energy and governs the electromagnetic torque and, in rotor-eccentric motors, the unbalanced magnetic pull (UMP). Existing air-gap permeance expressions vary widely in their results for torque ripple and UMP and account for tooth-normal eccentricity only. This paper proposes the dual-term air-gap permeance (DTAP) model, a closed-form expression for the air-gap permeance between a stator and a rotor tooth that accounts for tooth-normal and tooth-tangential eccentricity, with and without rotor skew. Its parameters are identified from a FEM model of the air gap and the complete set of tooth heads, which includes the shielding by the neighbouring teeth. For three motors, DTAP reproduces the FEM air-gap permeance with a 2.8-4.8 times smaller error than the state of the art, at a comparable computational cost. Implemented in the MEC of an eccentric induction motor, it reproduces the torque ripple within 1.6% and the peak UMP within 1.3% of the reference, i.e., with 2.8 and 27 times smaller deviations than the state of the art. DTAP thereby enables MEC to predict the torque pulsations and bearing loads of eccentric motors more accurately without sacrificing computational speed.
- [19] arXiv:2611.17863 [pdf, html, other]
-
Title: Implicit discretization of PID-like sliding-mode control with third-order output accuracyComments: Extended version of a paper submitted to Automatica. 20 pages, 3 figures, 2 tables. Code and verification records: this https URLSubjects: Systems and Control (eess.SY)
A digital PID-like sliding-mode controller is proposed for a double integrator with a Lipschitz matched disturbance. A proper implicit discretization, matched to the exact sampled dynamics of the plant, attains the accuracy of the continuous-time controller without discretization chattering. Global finite-step convergence to a discrete-time sliding mode is established for two gain designs and every sampling time, using an implicit Lyapunov function and a computer-assisted certificate in exact arithmetic. The resulting controller provides third-order output accuracy, second-order accuracy for its derivative, and exact finite-time rejection of constant matched disturbances. These accuracy orders are proved to be optimal among deterministic causal controllers using the same sampled information.
- [20] arXiv:2611.17889 [pdf, html, other]
-
Title: PLL-Less Synchronization of Grid-Following Converters Using a Voltage-Driven Frenet FrameSubjects: Systems and Control (eess.SY)
In grid-following converters, the synchronization path can transmit voltage disturbances to the current loop under weak or unbalanced grid conditions. This paper develops a Frenet-frame controller that derives its axes from the integral curve of the measured voltage at the point of common coupling. The tangential current governs active power, while the normal and binormal currents govern the transverse components of non-active power. Feedforward terms derived from the output filter model compensate curvature and torsion coupling, yielding identical nominal current dynamics across the axes. The controller operates without a phase-locked loop or sequence extraction. A reduced transverse model accounts for the finite bandwidth of geometric rate reconstruction and predicts a reduction in low-frequency coupling from voltage disturbances to current. Controller hardware-in-the-loop tests using real-time simulation of a three-phase four-wire converter show the shortest settling time after an active power reference step and the smallest peak power deviations during balanced voltage disturbances among the tested controllers. Under single-phase voltage unbalance, the method reduces peak binormal current and maximum phase-current total harmonic distortion relative to both benchmarks. It also settles to the commanded power in a weak-grid connection test where the phase-locked loop benchmark exhibits sustained oscillations.
- [21] arXiv:2611.17895 [pdf, html, other]
-
Title: Anomalous Sound Detection Using Separation Features and Paired-Mixture Representation LearningComments: 11 pages, 3 figures; 6-page supplementary material included as an ancillary file. Submitted to IEEE Sensors JournalSubjects: Audio and Speech Processing (eess.AS)
Acoustic condition monitoring often relies on normal recordings with limited operating-condition information. This study proposes an anomalous sound detection system that learns from normal recordings without external pre-training and uses machine-type information to organize training and normal references. A separator learns target-component estimation from mixtures of normal target and non-target recordings. With the separator frozen, regional attention and multi-stage fusion are trained on paired mixtures sharing a target, using contrastive and target-reference consistency objectives. Paired-mixture embedding differences provide covariance statistics for correction with normal-reference centering, followed by cosine nearest-neighbor scoring. On Task 2 development-test data from the 2022 Detection and Classification of Acoustic Scenes and Events challenge, the two-block, 64-channel system achieves an overall harmonic mean of 64.56% on average across three independent training and evaluation runs, with a sample standard deviation of 0.33 percentage points. This mean exceeds that of direct paired-mixture learning by 2.23 percentage points and is 0.31 percentage points below that of the evaluated distillation system using an externally pre-trained teacher. For the learned embeddings, cosine nearest-neighbor scoring outperforms the evaluated Mahalanobis scorers based on global normal statistics. These results demonstrate the effectiveness of combining separation-based representation learning, interference-based correction, and local normal-reference scoring for anomalous sound detection without detailed operating metadata.
- [22] arXiv:2611.17974 [pdf, other]
-
Title: Few-Shot Open-Set Hyperspectral Pixel-Wise Classification with Spatial Aware Label PropagationJournal-ref: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2026, 19, pp.30813-30836Subjects: Image and Video Processing (eess.IV); Neural and Evolutionary Computing (cs.NE)
Pixelwise classification of hyperspectral images (HSI) is a fundamental task in remote sensing, but its deployment in real-world applications is often limited by the scarcity of labeled data and the presence of unknown classes at inference time. In this work, we propose Few-shot Open-set hyperspectral recognition from Self-Supervised Learning training (FOSSeL), a unified framework for few-shot, open-set hyperspectral pixelwise classification that does not require supervised training. The proposed approach first leverages self-supervised learning to construct a discriminative feature space from unlabeled data. Then, given a small set of labeled seed pixels, class predictions are obtained through spatially-aware graph-based label propagation over superpixel representations, enabling the joint exploitation of spectral similarity and spatial consistency. To address the open-set scenario, we introduce simple yet effective strategies to identify pixels that do not belong to the known classes. We evaluate FOSSeL on three benchmark hyperspectral datasets under multiple few-shot settings. The results show that the proposed framework achieves competitive or superior performance compared to fully supervised methods while maintaining robustness in the presence of unknown classes. These findings highlight the potential of combining self-supervised feature learning with graph-based inference for practical HSI analysis in low-annotation and open-world scenarios.
- [23] arXiv:2611.17975 [pdf, html, other]
-
Title: Enhancing Transient Stability of VSG-Controlled Converters Under Grid Frequency DisturbancesSubjects: Systems and Control (eess.SY)
Strong damping feedback can substantially improve the transient synchronization stability of renewable energy converters employing virtual synchronous generator (VSG) control. However, conventional damping feedback uses the nominal frequency as its reference. When the frequency of a weak grid deviates from nominal, strong damping tends to keep the VSG frequency near nominal. This can sustain a frequency difference between the VSG and the grid and compromise transient synchronization. To address this problem, this paper proposes a complex-frequency-based method to estimate the grid reference frequency from local terminal measurements. The estimated frequency replaces the nominal reference in the VSG synchronization loop, so that damping acts on the frequency difference between the VSG and the real grid. Controller hardware-in-the-loop tests validate the effectiveness of the proposed method under grid frequency disturbances and its robustness to grid parameter uncertainty and adverse grid conditions.
- [24] arXiv:2611.17982 [pdf, html, other]
-
Title: BeST: Beta splatted tomography for direct reconstruction from coherent imaging measurementsJohannes Gruen, Philipp Paetzold, Andreas Schropp, Aknur Karabay, Shahin Sepanlou, Sebastian Eberle, Martin Seyrich, Felix Wittwer, Imke Greving, Silja Flenner, Ken Vidar Falch, Jan Garrevoet, Manuel Guizar-Sicairos, Christian G. Schroer, Johannes HagemannSubjects: Image and Video Processing (eess.IV); Mathematical Physics (math-ph); Data Analysis, Statistics and Probability (physics.data-an)
Conventional coherent X-ray tomography requires the phase of each projection to be reconstructed with high fidelity. However, individual reconstructed projections might be flawed, e.g. due to positioning errors, yielding inconsistent tomographic reconstructions. By directly coupling phase retrieval and tomography, consistency is enforced through a common object volume. But reconstructing a full volume demands substantial computational resources. To reduce this demand, we introduce Beta Splatted Tomography (BeST), which represents the common object volume using compactly supported beta primitives with closed-form analytical projections, enabling efficient reconstruction directly from coherent scattering images. This representation substantially reduces the number of optimizable parameters compared to a voxel grid. We demonstrate BeST on experimental datasets from hard X-ray near-field holography and far-field ptychography measurements. In both cases, the joint technique improves reconstruction quality compared to two-step methods.
- [25] arXiv:2611.18013 [pdf, html, other]
-
Title: Constant-Weight Sparse Vector Coded Augmented-AFDMSubjects: Signal Processing (eess.SP)
Sparse vector coding (SVC) and its variants convey information through sparse vectors (SVs), or sparse support patterns and detecting information by solving sparse recovery problems, making them attractive for short-packet ultra-reliable low-latency communications (URLLC). However, as the required information rate increases, conventional SVC schemes or the enhanced SVC (ESVC) schemes require a rapidly growing number of SVs, resulting in significant increase of complexity and receiver processing latency. On the other hand, when communicating in doubly selective channels, orthogonal frequency division multiplexing (OFDM) suffers from the Doppler spread induced inter-carrier interference, while affine frequency division multiplexing (AFDM) experiences the same peak-to-average power ratio (PAPR) problem as OFDM, although it allows diversity gain from channel's double selectivity. To address these issues, this paper proposes a constant-weight sparse vector coded augmented AFDM (CW-SVC/A$^2$FDM ) scheme, along with a corresponding joint support and symbol detection algorithm. In this scheme, SVs are represented by constant-weight codewords that feature a fixed Hamming weight and a large Hamming distance, resulting in relatively small SV sets. Simulation results compare various SVC/ESVC schemes and diverse coding schemes employed by the CW-SVC/A$^2$FDM, including Hamming, BCH, RS, and polar codes, for QAM symbol protection. The results demonstrate that the proposed scheme provides a distinct reliability advantage over conventional SVC/ESVC schemes, achieving a gain of up to 14 dB. Furthermore, the study indicates that the CWC's weight and minimum Hamming distance must be carefully selected to balance detection reliability, QAM modulation order, and sparse recovery feasibility, thereby maximizing the overall system's performance.
- [26] arXiv:2611.18020 [pdf, html, other]
-
Title: Data-Driven Output Regulation via Predictive ControlSubjects: Systems and Control (eess.SY)
This paper addresses constrained output regulation for unknown linear systems by means of predictive control directly from input-output data. The objective is to reject disturbances and track references generated by a known exosystem, without identifying a plant model or solving the output regulator equations. The first step is a trajectory parametrization for plants driven by exosignals with known dynamics. % By exploiting the known exosystem eigenstructure, Willems et al's fundamental lemma is extended from autonomous input-output trajectories to trajectories coupled with exogenous modes. By exploiting the known exosystem eigenstructure, input-output trajectories driven by an exosignal of known phase are parametrized directly from data, which contains the affine version of Willems et al.'s fundamental lemma as a special case. This parametrization yields a nominal data-driven predictive control (DDPC) regulator, for which a Lyapunov argument proves exponential convergence to the regulator manifold. For periodic exosignals, the steady-state feedforward input is eliminated from the online problem through an incremental-input regularization, leading to an implementable regulator based on measured data and known exosystem information. Bounded output noise is handled by slack and coefficient regularization, with a regularization center computed offline from data; the resulting robust DDPC law is recursively feasible and practically stabilizing, with an ultimate regulation error that vanishes with the noise bound. A constrained lateral vehicle-control example with periodic road curvature illustrates disturbance rejection, input-constraint satisfaction, and the transition from exact regulation with noise-free data to practical regulation with noisy data.
- [27] arXiv:2611.18031 [pdf, html, other]
-
Title: Latent resonances in oscillator networksComments: 22 pages, 5 figures, Supplementary Materials included (6 figures, 7 tables)Subjects: Systems and Control (eess.SY); Adaptation and Self-Organizing Systems (nlin.AO); Physics and Society (physics.soc-ph)
In networks of coupled oscillators, from neural circuits to power grids, damping is expected to suppress oscillations because of its dissipativity. Here we show that local damping can, counterintuitively, amplify oscillations along some input-output channels, while the network's global oscillation energy decreases and its spectral properties improve. The amplified oscillation arises from a latent resonance that lies in the spectrum yet barely manifests. The added passive damping reshapes this resonance by mixing it with adjacent eigenmodes. In random power-grid networks, damping can boost weakly responding channels by more than an order of magnitude, while subdominant channels can grow to exceed the originally strongest channel. Damping thus not only suppresses oscillations but also provides a way to redistribute oscillatory energy. For any passive network, the amplified response and its upper bound follow exactly from baseline quantities, offering a principled route for network design and control.
- [28] arXiv:2611.18039 [pdf, html, other]
-
Title: Recursive Semi-Blind Receivers for Wideband Array ProcessingSubjects: Signal Processing (eess.SP)
Using the commonly employed uniform rectangular array (URA) as an illustrative example, we have recently shown that the block-term tensor decomposition (BTD) model provides a natural representation for the output signal of a multi-dimensional separable sensor array structure in the presence of channel multipath. A palette of effective and efficient semi-blind joint channel estimation/data detection (JCD) algorithms for URA processing, which wed BTD modeling with existing JCD schemes, has thus been developed, and recently extended so as to be applicable in large-scale arrays and/or time-varying environments. However, both the model and the algorithms were based on the assumption of narrowband signals, arriving through paths of effectively the same delay. In this paper, recursive JCD algorithms for wideband sources are developed and evaluated through simulations in a time-varying setting and across different constellation sizes, in comparison with their batch counterparts and the training-only-based solution. They are seen to enjoy the ability to track channel variations and detect the transmitted symbols `on the fly', with the aid of only a short initial training stage.
- [29] arXiv:2611.18077 [pdf, html, other]
-
Title: Grid-Compliance Testing of Wind Turbines through Virtualized Component Tests: Testing Concept and Test BenchSimon Moritz, Yoga Viknesh Kannan, Florian Andresen, Laura Fuentes Grau, Manuel Fischer, Johannes-Martin Hördler, Sabri Özer, Martin Brennecke, Philipp Kersting, Andreas Thul, Simon Steentjes, Ferdinanda Ponci, Antonello Monti, Rik W. De Doncker, Heike Vallery, Maximilian BaslerComments: 10 pages, 7 figures, 5 tables, peer-reviewed journal articleJournal-ref: atp magazin 08/2026, pp. 48-61, 2026Subjects: Systems and Control (eess.SY)
As the proportion of inverter-connected wind turbines increases, test methods for evaluating their grid behavior are becoming increasingly important. This paper presents a Power Hardware-in-the-Loop (PHiL)-based method for grid connection testing of wind turbines. For the first time, geographically distributed simulations of aerodynamics via the Internet and of the grid model via a fiber-optic connection are integrated into certification-relevant tests. The concept expands upon the methods described in IEC TS 61400-21-4. Initial experimental results confirm high emulation quality and sufficiently low latencies, and meet the requirements for a standards-compliant grid emulation.
- [30] arXiv:2611.18085 [pdf, html, other]
-
Title: Distributed Output-Feedback Control for Linear Multichannel SystemsSubjects: Systems and Control (eess.SY)
This paper investigates distributed output-feedback stabilization of linear multichannel systems in which agents exchange state estimates without disclosing local control inputs or feedback gains. Remote control actions are treated as unknown inputs and geometrically decoupled from stable quotient-error dynamics. The proposed framework accommodates nontrivial intersections of local loss subspaces by retaining the coupling between the plant and common estimation errors. A Hurwitz condition on the coupled dynamics, together with a sufficient consensus-gain bound, guarantees exponential closed-loop convergence for every fixed feedback selection in a compact family. For polytopic feedback families, a quotient-preserving parameterization of output injections enables joint synthesis of nominal feedback and observer gains via alternating linear matrix inequalities, followed by a convex semidefinite program certifying a common consensus gain. A numerical example demonstrates the effectiveness of the proposed design.
- [31] arXiv:2611.18092 [pdf, html, other]
-
Title: Beyond Scalar Inertia: Frequency-Response-Based Assessment of Finite-Duration Inertial Support in Grid-Forming ConvertersComments: This paper has 6 pages with 5 figures. The target journal will be determined at a later stageSubjects: Systems and Control (eess.SY)
Conventional scalar inertia characterizes only the low-frequency terminal behavior of grid-forming converters (GFMs) and cannot fully predict inertial energy delivery during short-duration frequency disturbances. This letter proposes a frequency-response-based method to assess finite-duration inertial support using complex terminal power--frequency responses, such as those provided by Network Frequency Perturbation (NFP) plots. For GFMs with nonzero steady-state droop, a duration-dependent energy-equivalent inertia is defined after subtracting the ideal static-droop contribution. An exact spectral relationship is established, expressing this metric as a duration-weighted integral of frequency-dependent inertia, without requiring knowledge of the internal controller structure and parameters. The duration dependence of the metric is further shown to encode observable oscillation frequencies and damping ratios. A coefficient-decoupling GFM control with identical scalar inertia and droop across different settings is used for verification.
- [32] arXiv:2611.18094 [pdf, html, other]
-
Title: Controllability-Informed Distributed Electric Propulsion Aircraft Design Using Probabilistic Attainable Moment SetsSubjects: Systems and Control (eess.SY); Optimization and Control (math.OC)
Integrated aircraft design combines models of aerodynamics, propulsion, mass, and mission performance in one design loop, so that the disciplines can be traded against each other from the earliest stage. For configurations with distributed electric propulsion (DEP), part of the control authority comes from the propulsion system itself, which directly affects the required size of the tail and should therefore be known while the aircraft is being sized. This paper presents a controllability measure that is evaluated for every design in the loop and returned to it as a design signal. The attainable moment set of each candidate design is computed from the surrugate models of the loop and it is compared with a required moment set. Since the low-fidelity surrugate models are uncertain, the comparison is formulated with probabilistic attainable moment sets: the uncertainty is propagated to the boundary of the set, which yields a margin for every direction in the moment space and the probability of violating the requirement. The design loop thereby informed whether a configuration provides sufficient control authority, on which axes it falls short, and how this changes with the design variables. The approach is demonstrated on a DEP regional aircraft, where the signal is used to assess the size of the vertical tail.
- [33] arXiv:2611.18103 [pdf, other]
-
Title: Reproduction of Simulated Acoustics Scenes Using Acoustics Room Transformer for speech intelligibility tests in ClinicsComments: This paper is submitted to Acta Acustica and is currently under reviewSubjects: Audio and Speech Processing (eess.AS); Medical Physics (physics.med-ph)
An Acoustic Room Transformation (ART) method is proposed for clinical applications to render simulated acoustic environments using six loudspeakers in a reverberant room. In typical clinical settings, testing rooms are not acoustically treated and only a limited number of loudspeakers are available. The ART approach enables control of the playback-room reverberation, allowing speech intelligibility tests to be performed under realistic and perceptually compensated conditions. The method focuses on the two most common Speech Reception Threshold (SRT) configurations: S0N90 and S0N90. One front and one side loudspeaker reproduce the direct sound components, while the remaining four loudspeakers (two in front and two behind the listener) generate the reverberant sound field. The direct sound is optimized in terms of energy, and the reverberant field is adjusted based on both energy and interaural coherence. An additional direct-sound gain is applied to match the clarity index (C50) of the reproduced signals to that of the reference target. Results from speech intelligibility tests demonstrate that, with ART processing, the reproduced scenarios achieve SRT values very close to those of the reference signal in both S0N0 and S0N90 conditions and therefore allow for comparable speech test results independent of the particular test room acoustics.
- [34] arXiv:2611.18155 [pdf, html, other]
-
Title: Dynamic Structural Causal Models for Delay PredictionComments: Accepted in IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN) 2026Subjects: Signal Processing (eess.SP)
Dynamic network key performance indicators (KPIs) such as end-to-end (E2E) delay are shaped by both contemporaneous interactions and temporal persistence. While standard predictors can forecast KPIs under a fixed regime, proactive network management requires reasoning about the effects of explicit actions (interventions) and, in time series, executing a model forward over multiple horizons. We study dynamic structural causal models (DSCMs) for E2E delay in a 5G measurement campaign, where payload and background traffic are intentionally manipulated and thus treated as do-interventions. We learn DSCM scaffolds using four time-series causal discovery methods representing score-based and constraint-based paradigms and common lag-based baselines. Using gradient-boosted decision trees, we evaluate true multi-step DSCM rollout, which recursively simulates the full system state, and a direct target-only ablation that predicts the KPI without recursive simulation. Across two held-out intervention scenarios, including high payload and 10 Mbps background traffic, we find that the inferred target parent/lag sets differ substantially across methods and that rollout behavior is strongly scenario-dependent. In particular, PCMCI+ achieves the best short-horizon rollout accuracy under the payload intervention (RMSE 2.97~ms) but exhibits pronounced horizon-dependent degradation under the background-traffic intervention (root mean squared error (RMSE) ~4.75 ms for long horizon), yielding a large positive rollout tax of up to ~0.78 ms relative to direct prediction; DyNoTEARS and VAR-based DSCMs remain comparatively stable under rollout. These results highlight that evaluating causal scaffolds only via direct prediction can be misleading, and therefore, executability under intervention and long-horizon error propagation are critical for DSCM-based KPI reasoning.
- [35] arXiv:2611.18171 [pdf, html, other]
-
Title: Channel Prediction Using Deep Recurrent Neural Network with EVT-based Adaptive Quantile Loss FunctionComments: Published in: IEEE Communications Letters ( Volume: 29, Issue: 7, July 2025)Journal-ref: IEEE Communications Letters, vol. 29, no. 7, pp. 1699-1703, July 2025Subjects: Signal Processing (eess.SP)
Ultra-reliable low latency communication (URLLC) systems are pivotal for applications demanding high reliability and low latency, such as autonomous vehicles. In such contexts, channel prediction becomes essential to maintaining communication quality, as it allows the system to anticipate and mitigate the effects of fast-fading channels, thereby reducing the risk of packet loss and latency spikes. This letter presents a novel framework that integrates neural networks with extreme value theory (EVT) to enhance channel prediction, focusing on predicting extreme channel events that challenge URLLC performance. We propose an EVT-based adaptive quantile loss function that integrates EVT into the loss function of the deep recurrent neural networks (DRNNs) with gated recurrent units (GRUs) to predict extreme channel conditions efficiently. The numerical results indicate that the proposed GRU model, utilizing the EVT-based adaptive quantile loss function, significantly outperforms the traditional GRU. It predicts a tail portion of 7.26%, which closely aligns with the empirical 7.49%, while the traditional GRU model only predicts 2.4%. This demonstrates the superior capability of the proposed model in capturing tail values that are critical for URLLC systems.
- [36] arXiv:2611.18181 [pdf, html, other]
-
Title: Linear Dynamic Range Extension for Rydberg Atomic Receiver via Band-Limited ReconstructionComments: 6 pages, 7 figuresSubjects: Signal Processing (eess.SP); Information Theory (cs.IT)
Rydberg-atom receiver offers a promising approach to radio-frequency (RF) signal reception in wireless communication and sensing systems, combining high sensitivity with the potential for broad frequency coverage. However, the limited linear dynamic range (LDR) of the atomic system causes nonlinear distortion at high input signal levels, thereby restricting the receiver's effective linear input range. To address this issue, we analyze the mechanisms underlying nonlinear distortion in Rydberg atomic receivers and propose a physics-informed band-limited iterative reconstruction (PI-BLIR) method. Specifically, by exploiting the known nonlinear atomic response and signal bandwidth prior, we formulate a constrained maximum-likelihood problem to reconstruct the distorted complex intermediate-frequency (IF) waveform. With the bandwidth constraint absorbed into the frequency-domain parameterization, the constrained maximum-likelihood problem is transformed into an unconstrained optimization problem, which is solved using gradient descent. The proposed method relies solely on digital post-processing and requires no changes to the local-oscillator (LO) field strength, optical parameters, or atomic operating conditions. Simulation results demonstrate that PI-BLIR extends the receiver's LDR by more than 14 dB and enhances the demodulation performance of the atomic receiver.
- [37] arXiv:2611.18184 [pdf, html, other]
-
Title: PTMTD: A Topology-Aware Temporal-Graph Attention Network for Joint Cyber-Attack Detection and Relay-Level Localization in Power System Protection NetworksSubjects: Systems and Control (eess.SY); Signal Processing (eess.SP)
The digitization of protection relays exposes power grids to sophisticated cyberattacks, yet existing GNN detectors omit temporal encoding, rely on static topologies, and lack relay localization. We propose PTMTD-a Pearson-driven Temporal Multimodal Topology-aware Detection Network-coupling a dilated TCN with multi-head GATv2 in a dual-head architecture for simultaneous 37-class detection and four-relay localization. PTMTD constructs its graph from measurement correlations (no impedance data) and is trained with a composite loss jointly optimizing both tasks. On the MSU-ORNL benchmark (78,377 samples, 37 classes), it achieves 99.27% accuracy, 99.25% macro F1, and 95.98% localization, outperforming GraphKAN, LSTM, GCN, and Random Forest by 5.64-11.15 percentage points (p < 0.05). Ablations confirm gains from temporal encoding (+2.38%), graph attention (+2.69%), residuals (+2.07%), and correlation-driven supervision. With 639k parameters and 2.5 ms CPU inference, PTMTD is lightweight and deployment-ready. While validated on a transmission testbed, the architecture applies to microgrids with similar relay structures. Code and models are publicly available.
- [38] arXiv:2611.18197 [pdf, html, other]
-
Title: Data-Driven Sparse Identification and Robust Tube-Based Predictive Control for Multivariable Chaotic SystemsSubjects: Systems and Control (eess.SY)
This paper addresses the data-driven synchronization and robust control of multivariable chaotic systems subject to strict actuation constraints, modeling uncertainties and bounded input disturbances. Using empirical data collected from a four-dimensional chaotic Rossler response system, Sequentially Thresholded Least Squares (STLSQ) sparse regression is employed to recover a nominal control-affine model, achieving an identification accuracy of R^2 = 1.0000 across all channels with root-mean-square error within [4.15e-6, 8.33e-4]. To establish a mathematically rigorous bridge between data-driven identification and robust synthesis, all structural discrepancies in the drift vector field and input matrix are unified into a single lumped uncertainty field delta(x,u). A computable scalar bound delta_bar is established based on library truncation error, regression residuals, input bounds, and Lipschitz constants (Lemma 1). We subsequently prove that input-output feedback linearization maps delta(x,u) into a state- and control-dependent additive disturbance d(z,nu) in Brunovsky canonical coordinates, bounded by ||d(z,nu)||_2 <= alpha_1 delta_bar + alpha_2 delta_bar ||nu||_2 with closed-form expressions for alpha_1 and alpha_2 (Theorem 1). This certified bound, together with a bounded input disturbance and a zero-order-hold margin, yields a compact disturbance set that seeds a robust tube-based model predictive controller. We prove that the resulting tightened quadratic program is recursively feasible, that the physical actuator limit (|u_i| <= 1100) remains inactive under an explicit sufficient condition, and that the closed-loop tracking error is Input-to-State Stable (ISS) with an asymptotic gain that is linear in delta_bar plus a term due to the exogenous input disturbance (Theorems 2 and 3).
- [39] arXiv:2611.18205 [pdf, html, other]
-
Title: How Robust are Pinching-Antenna Systems to Practical Deployment Imperfections?Subjects: Signal Processing (eess.SP)
This paper investigates the robustness of pinching-antenna systems (PASSs) to three practical deployment imperfections: pinching-antenna (PA) positioning errors, imperfect channel state information (CSI), and line-of-sight (LoS) blockages. We develop analytical frameworks to quantify the performance degradation caused by each imperfection. For PA positioning errors, we employ a Brownian meander model to characterize the distribution and mean of the resulting signal-to-noise ratio (SNR) loss. The results show that positioning errors can diminish the gains from long-term position selection, with the loss becoming more pronounced under stronger shadow fading. For imperfect CSI, we characterize the distribution and moments of the true scattered channel power at the position selected using noisy channel estimates. The resulting selection penalty is governed by the ratio of noise variance to the number of channel measurements, while the upper tail of the selected channel power retains the same behavior as under perfect CSI. Finally, we develop a spatially consistent blockage model and derive the distribution of the optimum long-term SNR for arbitrary blockage configurations, together with a numerically tractable expression for a single blockage. Simulation results validate the analyses and highlight a fundamental property of PASSs: although positioning errors and imperfect CSI can reduce the gains from position selection, good performance can still be achieved provided that an LoS link is available. In particular, even when a large proportion of the waveguide is blocked, PA repositioning can establish LoS links and enable performance close to that of a fully unblocked system for the considered configurations.
- [40] arXiv:2611.18220 [pdf, html, other]
-
Title: From Pen-and-Paper to Machine-Checked Proofs: Lean for System IdentificationSubjects: Systems and Control (eess.SY); Artificial Intelligence (cs.AI)
Mathematical proofs in scientific papers are often long and intricate, relying on chains of references to earlier results. This makes it difficult for readers and reviewers to verify each and every step. Interactive theorem proving offers a complement: the theorem and its proof are written as code, and every inference is checked by a small, trusted piece of software called the kernel. This paper serves as an introduction to the Lean 4 proof assistant for a system identification and control audience, assuming no prior exposure to formal methods. We first show how a Lean proof is read using two elementary examples: the first on identifiability, the second on set invariance. We then illustrate how Lean can be used to analyse results from the literature, taking as example a classic lemma on the inversion of the noise filter in prediction-error identification (Ljung, 1999, Lemma 3.1). Since in Lean every step must be justified, the formalization brings to light a subtle point: the original claim of that lemma holds almost surely, although not for every realisation, as its statement may suggest. A simple counterexample makes this concrete. Finally, the paper discusses guidelines and perspectives on the use of Lean in system identification research.
- [41] arXiv:2611.18223 [pdf, html, other]
-
Title: Characterisation of the DQsym Framework Against Harmonic State-Space and Dynamic Phasor Models for Modular Multilevel ConvertersComments: Submitted to the 25th IET International Conference on AC and DC Power TransmissionSubjects: Systems and Control (eess.SY)
Modern power systems rely on power converters that exhibit multifrequency periodic dynamics, such as modular multilevel converters (MMCs). Such converters are commonly analysed using harmonic state-space (HSS) and dynamic phasor (DP) representations. Both approaches rely on building state matrices based on the system topology, whose size grows with the number of harmonics retained in the model. This paper shows that a symmetrical direct-quadrature (dq) dynamic phasor formulation for time-domain simulation, named DQsym, has a smaller solver state matrix than HSS and DP, and whose size is independent of the truncation order K. This reduction results from evaluating harmonic coupling outside the state matrix, in the nonlinear signal blocks. The open-loop MMC model used in this paper is derived in three harmonic-domain (HD) formulations and validated against a three-phase time-domain reference model. The models are compared in terms of state-space size and sparsity, harmonic content, steady-state accuracy and eigenvalues. For truncation at K = 4, the DQsym solver has 45 states against 135 for HSS and DP, stays within about 4% of the reference, and, once closed with its coupling blocks, yields eigenvalues identical to those of HSS and DP.
- [42] arXiv:2611.18229 [pdf, html, other]
-
Title: A Reinforcement Learning Approach to Space-Filling Input Design for Nonlinear System IdentificationSubjects: Systems and Control (eess.SY)
In this paper, we propose a reinforcement learning (RL) approach to space-filling input design for nonlinear system identification, in which an agent learns a control policy that actively drives the system to explore its state space. Classical input design, developed mainly for linear models, minimises the covariance of the estimated parameters. For nonlinear black-box models, however, the dominant error is the bias induced by the model structure over the region of interest, which motivates space-filling strategies that seek to cover the system state space. Existing space-filling approaches rely on predefined input signal classes and require solving explicit optimisation problems. Unlike these methods, the proposed approach requires no input class to be selected and no frequency band to be tuned for the system at hand, satisfies an amplitude bound by construction, and adapts to varying initial conditions through its observation-based policy without re-optimisation. The learned excitation signals exhibit physically meaningful behaviours, such as resonance excitation and amplitude modulation. The approach is evaluated against tuned swept sine and crest-factor-optimised multisine excitations, and against a state-of-the-art space-filling multisine design, on two nonlinear benchmark systems: a mass-spring-damper with nonlinear stiffness and a Van der Pol oscillator. Under the same amplitude bound, the learned policy achieves the best overall space-filling performance on both systems and distributes its samples more uniformly than the state-of-the-art design.
- [43] arXiv:2611.18243 [pdf, html, other]
-
Title: D2ToF: One-Step Diffusion for Depth Super-Resolution from Lightweight Single-Photon LiDAR WaveformsSubjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
Single-photon LiDAR (SPL) sensors offer exceptional temporal resolution and single-photon sensitivity for depth imaging. However, cost-effective SPL arrays typically suffer from extremely low spatial resolutions (e.g. $8\times 8$ pixels), limiting their real-world utility. In this paper, we propose a novel, one-step super-resolution framework, D2ToF, Distilled Diffusion for Time-of-Flight, that bridges the gap between high-fidelity generative modeling and real-time execution. Our approach uses an amortized variational distillation strategy that allows for a measurement-based data consistency term to be incorporated directly into the one-step training objective. This encourages that the synthesized high-resolution depth maps are consistent with the captured low-resolution Time-of-Flight (ToF) histograms. To overcome the severe ill-posedness of upsampling extremely degraded inputs, we introduce a multimodal guidance strategy. By leveraging a foundational monocular depth model to extract structural priors from a high-resolution reflectivity image, our network is guided by a rich triad of the ToF histogram, reflectivity map, and relative depth estimate. Experimental results outperform evaluated baselines, achieving $16\times$ spatial super-resolution (from $8\times 8 \times 100$ histograms to $128\times 128$ depth maps) at an accelerated inference speed of approximately $83$ milliseconds.
- [44] arXiv:2611.18255 [pdf, html, other]
-
Title: Linear Modeling of Hybrid Shipboard Power Systems under Pulsed Power Load OperationComments: Accepted and presented at ESARS-ITEC 2026. Copyright 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other usesSubjects: Systems and Control (eess.SY)
A model-based approach is a valuable tool in the power system design process, enabling the integration of component models and the evaluation of dynamic interactions. Simplified models support rapid preliminary assessments by allowing parameters and configurations to be adjusted. This paper investigates the effects of high-bandwidth loads in hybrid AC--DC shipboard power systems. The problem is addressed by developing a linear model aimed at capturing the relevant dynamics over the time scale of interest with reduced computational effort. A LVDC subsystem has been developed with a battery energy storage system that supports the grid during pulsed power load operation. A control strategy has been proposed to satisfy transient requirements. The proposed approach is validated under different pulsed power load conditions using a high-fidelity model developed in DIgSILENT PowerFactory, which preserves nonlinearities and includes converter switching effects and digital control implementation. The validation shows that the model captures the relevant transient behavior with significantly reduced simulation time, while maintaining acceptable accuracy, making it suitable for rapid preliminary design studies.
- [45] arXiv:2611.18313 [pdf, html, other]
-
Title: Hierarchical Interactions in Mobility Networks: A Model-Free Feedback ApproachComments: 12 pagesSubjects: Systems and Control (eess.SY); Optimization and Control (math.OC)
Urban mobility systems are large-scale networked systems whose performance emerges from hierarchically coupled decisions of public authorities, competing mobility operators, and travelers. Existing approaches to policy design either collapse one of these levels or assume that the authority can model and differentiate through the equilibrium responses of operators and travelers. In this paper, we model policy design as a tri-level game on a multimodal network, in which a municipality sets taxes, licenses, and integration subsidies, a public transport and a taxi operator compete on prices and service supply, and heterogeneous travelers reach a stochastic user equilibrium. We prove that the traveler equilibrium is unique and continuously differentiable in the operator strategies, that the variational inequality characterizing operator equilibria admits a solution for every policy, and that the resulting tri-level game admits a Stackelberg equilibrium. Building on this structure, we design a model-free hierarchical controller in which the municipality and the operators update their decisions from zeroth-order evaluations of observed equilibrium outcomes. On the Zurich multimodal network, operator equilibria computed from different initializations differ by a median of 0.3% in the municipal objective. On a grid of 3,125 policies, only those that subsidize transfers between public transport and taxis benefit both operators, and 24 of them also lower travel costs without degrading the municipal objective. Finally, the controller matches the best policies of three black-box optimizers and terminates at the most consistent policies across runs.
- [46] arXiv:2611.18322 [pdf, html, other]
-
Title: Power Management of Electrically Driven Centrifugal Compressors for Flexible OperationSubjects: Systems and Control (eess.SY)
We present a control strategy for power management of a variable-speed 15MW (rated power) centrifugal compressor, and investigate how quickly it can follow a reduced electrical power reference without entering surge. We use a Greitzer-Gravdahl type model scaled to industrial size with rate-limited valve actuators as a simulation environment and propose an advanced regulatory control structure using feedback control loops with dynamically scaled feedforward mechanisms and a structure of min/max selectors. In simulated experiments, a 6MW power reduction from varying initial operating points on a 12MW iso-power line is delivered at rates of up to 10MW/s, this http URL 90% in 0.54s, without opening the recycle valve. Depending on the initial operating point, a large power reduction can be delivered at once or with a restricted ramp rate. The stroking rate of the discharge side valve is identified as the limiting factor for how fast the power can be reduced in the studied configuration. A limited sensitivity study on the impact of rotor inertia for power shedding performance is also provided.
- [47] arXiv:2611.18330 [pdf, html, other]
-
Title: Marimba: A System One Model for SpeechSubjects: Audio and Speech Processing (eess.AS); Computation and Language (cs.CL); Sound (cs.SD)
Speech applications require decisions about term presence, turn completion, and language within an audio window. We present Marimba, an interface for typed speech decisions built on frozen Qwen3-ASR 0.6B features. Lexical questions use zero-shot scoring of ASR transcripts; non-lexical questions use a question-conditioned head and a separate layer-18 turn-end readout. Language identification uses the ASR model's own language scores. On private conversational test sets, decoder AUROC is 0.80-0.92; on public read speech it is 0.92-0.97. Speech Commands four-way accuracy is 0.93; binary lexical ECE is at most 0.08. Personal-information detection, which passes the greedy transcript to a private, curated PII pipeline, reaches item-level F1 0.904 on synthetic Brazilian Portuguese speech (1.000 on reference transcripts). Layer-12 speaker readouts detect speaker change with AUROC 0.966-0.980 on AMI and VoxConverse, above an ECAPA baseline, and count speakers (0, 1, 2, or 3+) more accurately than pyannote 3.1. The turn-end readout reaches AUROC 0.930 versus Smart Turn v3.2 at 0.982 on Smart Turn's own test set. On a subset of ICSI meetings labeled by next speaker, AUROC is 0.716 versus 0.712; the paired confidence interval includes zero.
- [48] arXiv:2611.18339 [pdf, html, other]
-
Title: Control Invariance on Manifolds through Tangent Bundle SplittingSubjects: Systems and Control (eess.SY)
Control invariance for interconnected non-linear systems on manifolds requires conditions under which subsystem safety constraints can be combined to form an invariant set. This paper develops local product type control invariant sets on manifolds using tangent bundle splitting, adapted product coordinates, and subsystem tangency conditions satisfied simultaneously by one admissible input at each state. The resulting conditions establish control invariance of product sets without requiring independent subsystem dynamics, with separate control choices possible when inputs are independently constrained and each acts only on its subsystem. This provides a way to verify subsystem safety without discarding dynamic coupling and is illustrated by a torus example in which adapted coordinates give a curved constraint region a product representation.
- [49] arXiv:2611.18364 [pdf, html, other]
-
Title: Reinforcement Learning for Null-Space Exploitation in Pseudo-Inverse Control AllocationSubjects: Systems and Control (eess.SY)
Pseudo-inverse methods are widely used to solve control allocation problems for overactuated aircraft with redundant control effectors. These methods reliably satisfy the primary command tracking objective, while the remaining null-space degrees of freedom are in principle available for secondary objectives such as drag reduction or actuator wear balancing. However, exploiting this freedom in practice requires hand-tuned weighting matrices or a priori preferred deflections that are difficult to specify across a wide flight envelope with nonlinear, state-dependent dynamics. This paper presents a hybrid architecture in which a reinforcement learning agent operates exclusively within the null space of the control effectiveness matrix, learning secondary objective strategies directly from interaction with the flight dynamics. The null-space projector guarantees by construction that primary command tracking remains invariant regardless of the agent output, providing a principled separation between certified primary control and adaptive secondary optimization. The approach is demonstrated on a nonlinear six-degree-of-freedom distributed electric propulsion aircraft model with aero-propulsive effects across diverse mission scenarios, achieving measurable drag reduction compared to the baseline allocation while preserving tracking integrity and respecting actuator constraints. The proposed architecture forms a foundation for future extensions toward multi-objective, mission-conditioned policies.
- [50] arXiv:2611.18376 [pdf, html, other]
-
Title: Physical Prior Mismatch in Variational Dual-Polarization Quantum SATCOM Channel EstimationSubjects: Signal Processing (eess.SP)
Dual-polarization quantum satellite communications require accurate estimation of complex polarization channels. We investigate physical latent-prior mismatch in variational estimation of a $2\times 2$ complex channel, using eight Cartesian latent coordinates and a fixed latent-to-channel mapping. Gaussian, matched and sharpened Rician, Laplace, and Cauchy priors are compared under a fixed neural architecture and forward Kullback-Leibler objective. Models are trained for 300,000 updates with $\zeta=1/(2N_{\mathrm{est}})$ and evaluated using three training seeds and 10,000 shared held-out blocks per operating point. The Gaussian and Rician priors coincide at the Rayleigh limit. At higher Rician factors, the matched prior improves estimation accuracy, especially with fewer pilots. At $K=100$ and $N_{\mathrm{est}}=32$, the matched Rician variational estimator reduces mean squared Frobenius error by 2.50% relative to linear minimum mean-square error (LMMSE). We also derive a joint Rician Bayesian posterior-mean estimator that incorporates the complete least-squares noise covariance and reduces posterior integration to one-dimensional quadrature. It improves on LMMSE by 3.33% at the same operating point and achieves lower observed error than the scalar Rician and both neural estimators at all 12 operating points. Additional Rician prior sharpening increases error, while Laplace and Cauchy controls remain near the Gaussian baseline.
- [51] arXiv:2611.18379 [pdf, html, other]
-
Title: DecompJSCC: Joint Source-Channel Coding With Decoupled SNR and Rate AdaptationComments: 5 pages,5 figures,1 table. Submitted to IEEE Transactions on Vehicular TechnologySubjects: Image and Video Processing (eess.IV); Signal Processing (eess.SP)
Deep joint source-channel coding (DeepJSCC) for image transmission must adapt to changes in the signal-to-noise ratio (SNR) and available transmission resources. However, some existing joint-adaptive methods condition the encoder on the requested rate, while others apply static masks after encoding. The former couples latent formation to the rate request, whereas the latter cannot adapt channel selection to image content. To address these limitations, we propose DecompJSCC, which decomposes joint adaptation into SNR-conditioned latent formation and post-encoding rate control within a single model. The encoder applies SNR-conditioned block attention residuals across all stages, aggregating intra-stage and cross-stage semantic representations. At the receiver, an adapter performs SNR-conditioned affine correction. We introduce a post-encoding rate-adaptive channel semantic budgeting (RCSB) module whose shared gate selects channels of the formed latent by image content, adjusts their gains, and keeps exactly the requested count. This keeps the encoder output independent of the rate request for a fixed image and SNR. Experimental results show that DecompJSCC outperforms SwinJSCC and SA-RA-JSCC in peak signal-to-noise ratio (PSNR) across a range of SNR and rate settings, by 0.64 and 1.00 dB over SwinJSCC and by 0.97 and 0.96 dB over SA-RA-JSCC on Kodak and CLIC2021, while using only 7.5% of SwinJSCC's Adaptive ModNet parameters.
- [52] arXiv:2611.18390 [pdf, html, other]
-
Title: CS-MPC: Contraction-Certified Sampling-Based MPC for Nonlinear Systems Under UncertaintySubjects: Systems and Control (eess.SY); Robotics (cs.RO)
We present contraction-certified sampling-based model predictive control (CS-MPC) for tracking and safety of nonlinear robotic systems under parametric uncertainty, disturbances, and safety constraints that are revealed online. CS-MPC uses a contraction-certified tracking feedback inside every sampled rollout, which concentrates the rollouts around the reference, and an execution layer that verifies the applied input using a quantile-tightened discrete-time control barrier function condition. We derive a verification procedure for nonlinear contraction of the feedback-closed dynamics, and we prove a finite-sample stochastic stability bound and a mission-level probabilistic safety guarantee. We validate CS-MPC in simulation on a rover, a quadrotor, and an asteroid landing. When compared with standard model predictive path integral (MPPI) control, CS-MPC attains the same tracking error with 7 to 20 times fewer rollouts for the rover, and a 2 to 4 times lower tracking error for the quadrotor, with no safety violations in 200 Monte Carlo missions.
- [53] arXiv:2611.18405 [pdf, html, other]
-
Title: Joint Optimization of Antenna Partitioning and Distortion-Aware Precoding for Massive MIMO-OFDM with Peak Cancellation and In-Band Distortion CompensationComments: This work has been submitted to the IEEE for possible publicationSubjects: Signal Processing (eess.SP)
In massive MIMO-OFDM systems, peak cancellation (PC) reduces the peak-to-average power ratio but introduces in-band distortion, where compensation signals transmitted from a subset of antennas can suppress this distortion at the users. However, their effectiveness depends on the antenna partition and compensation precoder, while nonlinear power amplifiers (PAs) generate additional distortion. This paper proposes a joint optimization method for antenna partitioning and distortion-aware compensation precoding. To enable this joint optimization, we derive a covariance-based analytical model of PC and PA distortion to predict the per-user, per-subcarrier signal-to-interference-plusdistortion- and-noise ratio (SIDNR). The predicted SIDNR is used to select the compensation precoder regularization, the disjoint antenna partition, and the number of compensation antennas. Numerical results demonstrate that joint optimization of the antenna partition and compensation precoder regularization improves BER and SIDNR-based spectral efficiency compared with fixed-partition designs, particularly at high signal-to-noise ratios.
- [54] arXiv:2611.18428 [pdf, html, other]
-
Title: Grid-Forming AI Data Centers: Coordinated Grid Support Control from IT Loads and Energy StorageSubjects: Systems and Control (eess.SY)
To exploit the grid-support capability of AI data centers (AIDCs), this paper proposes a grid-forming (GFM) control scheme which coordinates the IT loads and energy storage (ES) in the AIDC. First, the framework of a grid-connected AIDC is presented, with the multi-stage power conversion from the grid to the IT loads presented. A dual GFM scheme is then proposed for the back-to-back converters to provide grid support through coordinated power adjustments from IT loads and ES. In addition, an aggregated power response model is established to characterize the IT-load flexibility considering multiple IT servers executing diverse tasks. Time-domain simulations of a 100 MW grid-connected AIDC demonstrate that the proposed control scheme can effectively support the grid.
- [55] arXiv:2611.18451 [pdf, html, other]
-
Title: Policy-Conditioned Koopman Representations for Parameterized Closed-Loop SystemsSubjects: Systems and Control (eess.SY)
Predicting the response of a nonlinear system across different feedback controllers requires a model that captures how the closed-loop dynamics change with the controller parameters. In a finite-dimensional Koopman model, these changes may affect both the latent dynamics and the observable coordinates used to represent them. In this paper, we propose a policy-conditioned Koopman representation framework to address this problem. This framework allows a single learned model to predict a family of closed-loop trajectories without retraining for each controller. We test the framework on four nonlinear prediction benchmarks, where the model stays below a 15% error threshold on every system, while each baseline exceeds it on at least one. As an example application, the resulting surrogate supports one-shot feedback-parameter selection: an optimization at the initial state selects a controller that then operates with fixed parameters and ongoing state feedback. On nonlinear control benchmarks including MuJoCo, the selected controllers stabilize every system with 3 to 97 times less online computation than nonlinear model predictive control. These results demonstrate how policy-dependent coordinates can support both prediction across closed-loop systems and controller selection without repeated online trajectory optimization.
- [56] arXiv:2611.18460 [pdf, html, other]
-
Title: BladeSEI: A Multi-Channel and Multi-Day Dataset for Robust Specific Emitter Identification of RadarsComments: 7 pages, 8 figuresSubjects: Signal Processing (eess.SP)
This paper introduces "BladeSEI", a multi-channel receiver, multi-day dataset of radar pulses recorded over-the-air from 12 Software Defined Radios (SDRs) for the purpose of Specific Emitter Identification (SEI). The aim of this dataset is to enable investigation into robust SEI techniques that are able to generalise across different receiver channels and recording sessions.
The dataset consists of two waveform types per emitter, a 50 microsecond chirped pulse of 40 MHz bandwidth and a 10 microsecond unmodulated pulse. Pulses are captured simultaneously on four synchronised analogue-to-digital converter (ADC) channels of a multi-channel receiver over three recording sessions on two days: a baseline session, an identical repeat on the following day, and a session in which the emitters were thermally conditioned to alter their operating temperature.
Initial results using Principal Component Analysis (PCA), Inception and ResNet based classifiers, trained and tested on a single ADC channel and recording session, show that the BladeRF emitters can be discriminated at high signal-to-noise ratio (SNR), with ResNet achieving a macro-F1 above 0.98 at 25 dB for both waveforms, and performance degrading towards random guessing at 0 dB. - [57] arXiv:2611.18502 [pdf, html, other]
-
Title: EPIGRIDS: Documentation and Validation of Seven Open Synthetic Transmission Grid CasesJonathan M. Snodgrass, Scott Greene, Thomas J. Overbye, Christopher L. DeMarco, Bernard C. LesieutreComments: 10 pages, 2 figures, 6 tables. Submitted to the IEEE Open Access Journal of Power and Energy. Cases: this https URL load series: this https URL construction method: arXiv:2611.16222Subjects: Systems and Control (eess.SY); Optimization and Control (math.OC)
This paper documents and checks EPIGRIDS, seven open synthetic transmission grid cases from four independently built networks, made with an optimization-based construction method instead of the graph-statistics method behind most large public synthetic grids. The cases range from 250 to 78,484 buses, with geolocated substations, voltages up to 765 kV, and line parameters taken from conductor data. Each ships under an open license in three common power flow formats that agree at the solved operating point, and the six larger cases have a companion hourly, bus-level load series for one year. The Texas, Florida, and Michigan, Ohio, and Indiana cases are sub-networks of the Eastern case. Every case solves an alternating-current power flow from its stored operating point. With parallel circuits merged, the Eastern and Western cases are 9 and 16% denser than the real interconnections, while graph-statistics cases on the same footprints lie within 6% and meet more published realism criteria. A full single-outage contingency analysis completes on every case, and in an optimal power flow benchmark every case except the New England base case and one of its 12 operating points solves in polar form.
- [58] arXiv:2611.18509 [pdf, html, other]
-
Title: An All-Digital Coherent AFSK Demodulator for CubeSat ApplicationsRubem Vasconcelos Pacelli, Rodrigo de Lima Florindo, Felix Antreich, Antônio Macilio Pereira de LucenaComments: Preprint of an article published in Digital Signal Processing (Elsevier), 2025Journal-ref: Digital Signal Processing, vol. 162, art. no. 105147, 2025Subjects: Signal Processing (eess.SP)
Audio frequency-shift keying (AFSK) is a widely adopted modulation scheme for CubeSat systems due to its favorable bandwidth efficiency and implementation simplicity. However, coherent detection usually is avoided because synchronization impairments, caused by intense line-of-sight (LOS) dynamics inherent in low Earth orbit (LEO), may significantly degrade the bit error rate (BER). This paper presents a new all-digital coherent AFSK demodulator based on a Kalman filter (KF) for carrier phase and timing delay synchronization and the Viterbi algorithm for bit detection. The Viterbi algorithm is employed for maximum likelihood sequence detection, and the detected bit statistics are fed back to the KF to estimate phase shift, Doppler frequency shift, and Doppler drift induced by the LOS dynamics. Original mathematical analyses are derived to provide a theoretical foundation for the proposed demodulator's operation, specifically addressing its synchronization accuracy in dynamic LEO environments. The proposed demodulator is evaluated considering an additive white Gaussian noise channel with real CubeSat orbits. The performance results obtained through computer simulations demonstrate that the proposed model can withstand such scenarios with a gain of 5 dB in terms of BER compared to the conventional noncoherent AFSK demodulator. The KF performance is assessed using a moving root-mean-square error (MRMSE) statistic and the trace of its state error covariance matrix estimate.
- [59] arXiv:2611.18534 [pdf, html, other]
-
Title: Impact of Grid-Forming Inverter Placement and Penetration on Local and Aggregate FrequencySubjects: Systems and Control (eess.SY)
Modern power systems are undergoing a huge shift in generation mix, including inverter-based resources that are fundamentally changing the stability dynamics of the grid. Thus, synchronous Generators (SG) are gradually being displaced by Grid-forming inverters (GFM) that are proposed as a solution to continue supporting grid stability. However, the effect of GFM placement in the network on frequency performance and how well aggregate-frequency assessment captures placement sensitivity observed in local frequency metrics remains unclear. This paper evaluates all SG and droop-controlled GFM assignments in the IEEE 39-bus system. A reduced-order model is used for the exhaustive search with load disturbances applied separately at every eligible load bus while considering nadir and Rate of Change of Frequency (RoCoF) derived from both device rating weighted aggregate frequency and local bus frequencies. Results reveal that at fixed GFM penetration, placement produced up to 104 mHz variation in worst-case local nadir and 0.21 Hz/s in maximum local RoCoF. Aggregate-frequency assessment reduced the apparent across placements by 89\% for nadir and 88\% for RoCoF at 50\% GFM penetration. These results indicate that aggregate-frequency assessment alone may obscure favorable or adverse placement effects on local frequency performance.
New submissions (showing 59 of 59 entries)
- [60] arXiv:2607.18772 (cross-list from cs.CL) [pdf, html, other]
-
Title: RF-Agent: A Practical Framework for Building Language Agents for RFIC DesignComments: Accepted at ICLAD (IEEE International Conference on LLM-Aided Design), 2026Subjects: Computation and Language (cs.CL); Signal Processing (eess.SP)
Large language models (LLMs) have driven rapid progress in electronic design automation (EDA), yet their application to radio-frequency (RF) circuit design remains limited by the scarcity of domain-specific datasets and standardized benchmarks. We present RF-Agent, which addresses this gap through textbook-driven knowledge distillation. A multi-agent Question-Thinking-Solution-Answer (QTSA) pipeline converts a subsection-level corpus from seven canonical RF textbooks into the first-of-its-kind RF-domain reasoning dataset (over 11,000 samples) with a dedicated multiple-choice benchmark. On this benchmark we study two adaptation strategies: supervised fine-tuning (SFT) and three retrieval-augmented generation (RAG) configurations (semantic, keyword, hybrid). Across multiple LLM families, domain-specific SFT significantly improves RF reasoning, especially for small and medium-sized models; among RAG configurations, semantic retrieval performs best, indicating embedding-based context alignment suits RF reasoning better than naive fusion. The dataset and benchmark provide a reusable foundation for future work on LLM-aided RF circuit design.
- [61] arXiv:2611.15781 (cross-list from cs.RO) [pdf, html, other]
-
Title: Prediction-Error-Tightened MPC for Socially Compliant Crowd NavigationComments: 9 pages, 3 figures, 4 tables. Submitted to the European Control Conference (ECC 2027)Subjects: Robotics (cs.RO); Systems and Control (eess.SY)
Autonomous navigation of mobile robots in crowded environments, while preserving pedestrians' psychological comfort, requires distinguishing pedestrians from other obstacles, predicting their future motion, and accounting for uncertainty in the predicted trajectories of both pedestrians and the robot. This work extends a previous MPC framework by integrating obstacle and pedestrian detection, Koopman-based motion prediction, and online prediction-error estimation directly within the collision-avoidance mechanism. To reduce collision-avoidance complexity in crowded scenarios, nearby obstacles are aggregated, thereby reducing the number of collision-avoidance constraints. Simulation studies evaluate the prediction-error margins and the computational benefits of semantics-aware aggregation. In a paired 300-seed closed-loop comparison with a moving generic obstacle, Markov residual tightening reduces the fraction of runs with physical contact from $10.0\%$ to $1.33\%$, at a mean travel-time cost of $0.68$ s. In a separate crowd-navigation semantic ablation, the offline robot-footprint/personal-space overlap occupies $2.11\%$ of observed time with pedestrian-aware handling versus $22.84\%$ with generic-obstacle handling.
- [62] arXiv:2611.17361 (cross-list from physics.ins-det) [pdf, html, other]
-
Title: Design and Experimental Evaluation of a Low-Cost Immersion Cooling SystemPramukto Mandal, Bhavya Jain, M. U. Kusheetha, Nikhil Meena, Ravindra Kumar, M. P. Sabarish, Amit Verma, Gaurav BhutaniComments: 20 pages, 12 figures, 3 tables. CAD files: this https URL ; firmware and data: this https URLSubjects: Instrumentation and Detectors (physics.ins-det); Systems and Control (eess.SY); Applied Physics (physics.app-ph)
This paper presents a low-cost, open-source, single-phase immersion cooling testbed for studying liquid cooling of data center hardware. A 500 W titanium heater, standing in for server load, is submerged in a glass tank of mineral oil, a dielectric fluid. The heated oil is circulated by a magnetic drive pump through an air-cooled radiator. An ESP32 microcontroller logs three DS18B20 temperature sensors (heater surface, bulk fluid and ambient) and switches the pump, fan and heater through a relay module. The complete system costs INR 35,318 (about USD 380), built entirely from components available in India. At quasi-steady state under the full 500 W load, the heater surface reached 118.3 °C while the bulk oil stayed at 29.3 °C, only 8.0 °C above ambient. Thermal-resistance analysis shows that the heater-to-oil interface, limited by natural convection, accounts for about 92% of the total resistance (178.0 vs 16.0 m°C/W). The external loop therefore has spare capacity. CAD files, firmware and data are openly available, so the setup can be reproduced and used to compare dielectric fluids, loads and flow arrangements.
- [63] arXiv:2611.17449 (cross-list from physics.chem-ph) [pdf, html, other]
-
Title: Methanol substitution suppresses deflagration-excited knock and increases the efficiency of a hydrogen-fuelled CFR engineComments: 20 pages 8 figuresSubjects: Chemical Physics (physics.chem-ph); Systems and Control (eess.SY); Mathematical Physics (math-ph)
Knock restricts the performance of hydrogen spark-ignition engines and is usually attributed to end-gas autoignition. To the authors' knowledge, this is the first study in which methanol is used to replace part of the hydrogen in a hydrogen engine at constant fuel energy addition, and it shows that near the knock boundary the limiting oscillation is excited by the deflagration itself, which methanol removes without derating the performance. Port-injected methanol replaced 20--50% of the hydrogen energy in a variable-compression Cooperative Fuel Research engine at 600 rpm and compression ratios of 8--12. With pure hydrogen, oscillation in the 4--15 kHz range began before 10% of the charge had burned in 97--100% of cycles, and its maximum amplitude (MAPO) followed the maximum pressure-rise rate across 2499 cycles (Spearman $\rho=0.94$). Methanol slowed the deflagration: it replaced high-flame-speed hydrogen, cooled the intake by 24--25 K and, at unchanged intake pressure, enleaned the mixture by 10--13%. At 50% methanol, the 10--90% combustion duration lengthened 2.7--3.0-fold, oscillation onset moved 4.5--8.3$^\circ$CA after CA10 and mean MAPO fell by 89--93% although the spark timing was advanced by 13--19$^\circ$CA, and IMEP and indicated thermal efficiency rose by 2.4--7.8%. Methanol was thus worth more than this advance, and at matched CA50 MAPO was still about 90% lower. The measured combustion duration of all 25 data sets scaled with the computed laminar flame speed as $S_L^{-0.58}$ ($R^2=0.99$); fuel replacement accounted for about three quarters of the reduction in $S_L$, and the end-gas autoignition integral stayed below 0.07, against 1 at autoignition. The chamber kept its cylindrical acoustic modes, whose frequencies fell by 8--9%. The trade-off is formaldehyde emissions, which rose five- to sixfold while NO$_x$ fell by 49--85%.
- [64] arXiv:2611.17488 (cross-list from math.OC) [pdf, html, other]
-
Title: Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain DynamicsSubjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Signal Processing (eess.SP)
This paper establishes a layered mathematical char acterisation of PF-Exec, the algorithm of the companion system paper. Demand-proportional bandwidth allocation yields an exact first-order homogeneous decomposition, from which the equal-load bandwidth target and its feasibility bound follow in closed form. The logarithmic knee view preserves strict load order and shares its global optimum with the Jain fairness index, while the demand-weighted centroid minimises the position potential. The damped softmax association block possesses a fixed point on the product of simplices. The truncated one-dimensional gain iteration admits a complete characterisation, with geomet ric convergence below the critical gain, initial-value-dependent bounded oscillation at it, and a family of bounded two-state cycles above it. A global invariant error ball and an explicit tracking recursion complete the execution guarantee. A numerical audit confirms the structural identities on every measured state and quantifies the local amplification of the coupled association and resource dynamics. Together, the results explain how closed form recovery directions and bounded adaptive gains provide stable execution without requiring a global Euclidean contraction assumption.
- [65] arXiv:2611.17492 (cross-list from cs.LG) [pdf, html, other]
-
Title: PF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning ExecutorSubjects: Machine Learning (cs.LG); Information Theory (cs.IT); Signal Processing (eess.SP)
Relay load balancing in large-scale UAV networks requires joint decisions on association, bandwidth, power and hovering position, while the dimension grows with the number of UAVs and each UAV sees only its local state. This paper splits the decision into two layers. An anchored potential direction decider emits a closed-form target at every instant and returns its direction only. A gain-learning executor maps a local observation into a positive gain per dimension, composes gain and target, and clips the action against the physical single-step bound; the two layers form PF-Exec. The unit gain is the default start, so the executor reduces to the pure potential policy before training. The load is first-order homogeneous in bandwidth, making the bandwidth target closed form, and the position target is the demand-weighted centroid of the served users. The system uses a two-hop access and millimetre-wave backhaul link with soft association, a 3GPP UMa-AV channel with two shadowing layers, an OU-type social-force crowd and a quadrotor physical layer. Evaluation spans all fleet sizes, two crowd scenarios, independent seeds, the published baselines in their own settings and a degraded-information line. In the highest-pressure burst setting the fixed-step comparison breaks down on part of the seeds, losing fairness and mean load at once, while PF-Exec holds fairness near one. Among the ten comparison methods only the greedy heuristic survives that setting; its load variance stays far higher. Under stale global state and position noise the fairness index stays high at both largest-scale scenarios. Flight energy is nearly identical between the learned and the fixed-step executor, and three constants are fixed once across all settings. The convergence properties of both layers, from the truncated gain iteration to the perturbed tracking bound, are proved in the companion analysis.
- [66] arXiv:2611.17575 (cross-list from cs.RO) [pdf, html, other]
-
Title: Natural Swing-Up of an Underpowered Double PendulumSubjects: Robotics (cs.RO); Systems and Control (eess.SY)
Robots with weak motors must ride their natural dynamics rather than fight them. We swing up a direct-drive planar two-link robot, whose motors deliver only about 6\,\% of its shoulder gravity torque, along its nonlinear normal modes, two-dimensional invariant manifolds consisting of periodic orbits. On a non-strict mode, injecting energy necessarily moves the state off the manifold, so pumping and stabilization compete for the same bounded torque. We split the input torque into a power-neutral steering component and a scalar pumping input, the only component that changes the energy. The allocation then becomes a linear program in two variables: maximize pumping subject to the torque limits and one control-Lyapunov constraint. The constraint uses the model-based rate of the error, so no stabilizing feedback gain is needed. Experiments in hardware show swing-ups along both modes and compare the allocation with summing-and-clipping and with prioritized stabilization.
- [67] arXiv:2611.17577 (cross-list from cs.LG) [pdf, html, other]
-
Title: Fair and Efficient Distributed EV Charging Coordination Using Threshold Cryptography and Machine LearningComments: 16 pagesSubjects: Machine Learning (cs.LG); Cryptography and Security (cs.CR); Systems and Control (eess.SY)
Distributed coordination of electric vehicle (EV) charging with the alternating direction method of multipliers (ADMM) keeps EV constraints private but assumes that every participant follows the algorithm. This assumption fails in practice, where a biased operator or a man-in-the-middle (MITM) attacker can send inconsistent signals to different EVs, and compromised EVs can deviate from their prescribed updates. We first prove that attacks by such arbitrarily malicious, i.e., Byzantine, participants do not prevent convergence and therefore remain undetected, and derive the most damaging attack in closed form. We then propose a framework that combines a threshold-signed broadcast with upload recomputation, which detects every deviation without false alarms at linear instead of quadratic communication cost. To keep the optimization running, each affected EV recovers locally with a certified, fleet-aware machine learning price forecast, and we prove that the optimization remains convergent with a recovery cost bounded by the shape of the forecast error. Simulation results with real-world load, price, and charging data show that a biased operator raises the annual cost of disadvantaged EVs by 132.7% and lowers that of advantaged EVs by 49.3% without changing the aggregate load, whereas the defense limits all cost changes to 2.6%. An external MITM attacker raises the cost of its victims by 57.6%, the peak load by 5.8%, and the grid cost by 15.8%, whereas the defense keeps them within 1.1%, 0.2%, and 0.3% of benign operation. With up to 70% of the EVs attacked, the recovery converges in at least 97.8% of the runs.
- [68] arXiv:2611.17599 (cross-list from physics.bio-ph) [pdf, html, other]
-
Title: Multiple spontaneous otoacoustic emissions as a single standing wave unstable to modulationSubjects: Biological Physics (physics.bio-ph); Audio and Speech Processing (eess.AS)
Spontaneous otoacoustic emissions (SOAEs) have been interpreted either as cochlear standing waves or as local oscillations of hair cells. Multiple SOAE lines test both views, because each view must explain how the lines coexist. In the standing-wave view, each line is a separate resonance. In the intermodulation view, some lines are distortion products of others. Both explanations assume several independent oscillations. Independent oscillations, however, compete through the saturating cochlear amplifier, and the dominant oscillation suppresses the others. The saturation has another role besides suppression. The saturation also induces an oscillation of the gain at twice the frequency of the oscillation. In lasers, this oscillation of the gain, called the \textit{pump}, creates sidebands. This paper examines whether a cochlear standing wave can pump the gain by itself. A two-dimensional cochlear model with a step in the gain produced a single standing wave. The pump destabilized a pair of lines near the neighboring resonances. The other lines were phase-locked intermodulation products of the main line and the pair. A group of equally spaced SOAEs can thus arise from one self-sustained oscillation. The spacing follows the resonances of the standing wave, and the two explanations can hold together.
- [69] arXiv:2611.17710 (cross-list from cs.AI) [pdf, html, other]
-
Title: Cross-Linguistic Acoustic Biomarkers of Cognitive Impairment Across Interactive and Single-Speaker Speech TasksKenyu Ikeuchi, Tomoaki Ohtsuki, Michelle Cohn, Alyssa Weakley, Yui Ishihara, Joseph Hoang, Taishiro Kishimoto, Sarah Tomaszewski Farias, Jet M. J. Vonk, Chen-Nee ChuahComments: 7 pages, 1 figure, 5 tables. Accepted for publication in Proc. 48th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC 2026)Subjects: Artificial Intelligence (cs.AI); Audio and Speech Processing (eess.AS)
Multilingual dementia detection is essential for scalable and equitable screening. In recent years, automated speech analysis has emerged as a promising approach for supporting dementia detection by enabling non-invasive and scalable assessment of cognitive function. However, existing studies that use automated speech analysis often rely on one type of task, such as picture description, and use black-box models. These studies often neglect the role of task and language. To address these gaps, we performed a cross-linguistic and cross-task acoustic analysis that integrates a conversational dataset with structured speech tasks across four languages (Spanish, Mandarin, English, Japanese). We applied statistical, linguist-/clinician-guided, and machine learning model-based feature selection to derive compact acoustic feature sets while maintaining classification performance. This enabled systematic comparison of cognitive impairment-relevant features across datasets and tasks. Our results revealed that acoustic features did not generalize uniformly across tasks and languages. Temporal features remained robust across all datasets, consistently capturing timing disruption regardless of language or task. In contrast, speech rate showed strong task dependence -- emerging as informative mainly in single-speaker tasks with externally anchored content and pacing, but becoming less reliable when speech content was highly individualized. Pitch-related features further exhibited language-specific patterns, favoring chroma-related features in tonal languages (e.g., Mandarin) and F0-related features in non-tonal languages. These findings caution against indiscriminate pooling of heterogeneous speech data and underscore the need for interpretable, context-aware approaches to multilingual dementia detection using automated speech analysis.
- [70] arXiv:2611.17723 (cross-list from cs.NI) [pdf, html, other]
-
Title: uhd-rfsoc: Bringing Off-the-Shelf RFSoC Boards to Unmodified UHD ApplicationsSubjects: Networking and Internet Architecture (cs.NI); Hardware Architecture (cs.AR); Signal Processing (eess.SP)
Next-generation wireless research relies on software-defined radios (SDRs) with more channels and larger bandwidth. The USRP family is one of the most widely used SDR platforms, and much of the wireless software ecosystem is built on top of the USRP hardware driver (UHD). However, each USRP model comes with a fixed channel count, bandwidth, and streaming capability. Off-the-shelf radio frequency system-on-chip (RFSoC) boards, on the other hand, integrate up to 16 analog-to-digital converters (ADCs) and 16 digital-to-analog converters (DACs) operating at several gigasamples per second (GS/s), but existing UHD applications cannot directly use them. We present uhd-rfsoc, an open-source FPGA design and host software stack that turns these boards, including the 16-channel ZCU216 and the RFSoC 4x2, into standard UHD devices without modifying UHD. Through standard UHD calls, applications can configure the carrier frequency, channel count, the per-channel I/Q sample rate, and the wire format. uhd-rfsoc combines timestamped, flow-controlled sample transport in the FPGA with data plane development kit (DPDK) packet processing and vectorized sample conversion on x86 and Arm hosts. The built bitstreams for a number of RFSoC board configurations with varying RF data converter rates, channel counts, I/Q sample rates, and wire formats all successfully pass UHD's built-in streaming benchmarks. We further demonstrate compatibility with unmodified GNU Radio flowgraphs, a custom GPU-accelerated transceiver digital signal processing pipeline, as well as the OCUDU and Duranta 5G radio access network stacks using both software and commodity user equipment.
- [71] arXiv:2611.17760 (cross-list from physics.bio-ph) [pdf, other]
-
Title: A passive, battery-free flexible metasurface for implantable millimetre-wave radar glucose sensingKavya Saravanan, Rohini Ramachandran, Jean Pierre Ndabakuranye, Isabelle Shearer, Gursimran Singh, Bobbi Fleiss, Omid Kavehei, Akram Al-Hourani, Francisco J. Tovar Lopez, Margaret Lech, Arman AhnoodSubjects: Biological Physics (physics.bio-ph); Signal Processing (eess.SP)
Continuous glucose monitors (CGM) break the skin barrier and require periodic sensor replacement. We investigated whether a passive, battery-free flexible metasurface, implanted beneath tissue and read by a commercial 60 GHz radar, can track blood glucose levels. The metasurface contained no electronics or reagents. We fitted a conical helix to the in-phase and quadrature radar signals across the frequency sweep and used its mean radius (the spiral radius) as the glucose-dependent feature. We tested glucose concentrations of 25 to 400 mg/dL in saline solution with and without the metasurface, and 196 to 596 mg/dL of total glucose in porcine whole blood beneath ex vivo porcine tissue and in a murine cadaver model with pulsatile blood flow. The metasurface was essential for achieving a monotonic sensor response; in saline, the coefficient of determination ($R^2$) of a logarithmic fit increased from 0.18 without the metasurface to 0.90 with it. In a murine (rat) cadaver model, the signal's spiral radius increased monotonically with glucose concentration despite pulsatile flow ($R^2$ = 0.91), and this monotonic behavior persisted through up to 6 mm of tissue. Although sensitivity decreased at higher glucose levels, each discrete concentration step remained clearly detectable. These results demonstrate that a shallow, passive implant paired with a commercial radar can effectively track blood glucose without requiring onboard electronics or batteries.
- [72] arXiv:2611.17761 (cross-list from cs.CR) [pdf, html, other]
-
Title: Inferring Sensitive Events in Multi-Mode Cyber-Physical Systems via Scheduling Side ChannelsSubjects: Cryptography and Security (cs.CR); Systems and Control (eess.SY)
Many cyber-physical systems (CPS) are multi-mode: they switch between operating modes with different tasksets and timing parameters in response to physical events or user activity. We show that these mode changes create a timing side channel: by altering the interference experienced by co-running tasks, they let an unprivileged co-resident observer infer sensitive events, such as a homeowner's arrival or a vehicle's route, from its own execution timing and, on multicore platforms, its core assignment. Existing schedule-based attacks and defenses miss this channel because they assume single-mode systems or target a specific, known victim task. We present STAMP, a lightweight attack that needs no knowledge of task parameters or scheduling policy, and works whether or not the system exposes its modes. On a ZoneMinder home-security deployment, STAMP identifies the modes with 94.7% accuracy on unseen hardware, using under 0.5% of one core. On ROS 2 AMCL with the Oxford RobotCar dataset, it identifies which of seven route segments a vehicle traversed with 86.0% accuracy on unseen platforms. A schedule-randomization defense lowers detection recall to 0.53, at which setting only 53.9% as many jobs finish on time. At higher noise ($\epsilon=10$), on-time job completion reduces to 14.4%, while introducing new leakage in 14.1% of the tasksets.
- [73] arXiv:2611.17850 (cross-list from cs.DC) [pdf, html, other]
-
Title: OrbitWeaver: LLM Agent Planning with Simulation Feedback for Optically Interconnected Orbital GPU ClustersSubjects: Distributed, Parallel, and Cluster Computing (cs.DC); Systems and Control (eess.SY)
Space-based data-center designs increasingly consider GPU computing formations connected by inter-satellite optical links. With limited neighboring connections, jobs assigned disjoint GPUs can still contend on shared relay paths. Rank placement and communication priorities jointly affect this contention and the readiness of downstream computation. We present OrbitWeaver, an offline large language model (LLM) agent planner that jointly optimizes rank placement and communication order. Guided by communication structure, execution dependencies, and simulation feedback, the agent constructs and refines plans that coordinate shared-link access with computation progress. This coordination reduces contention and dependency blocking, shortening mean job completion time (JCT). Simulation experiments on optically interconnected orbital GPU clusters show that OrbitWeaver reduces aggregate mean JCT by 6.2-33.5% relative to the state-of-the-art baselines CASSINI, Crux, and Symphony. These results demonstrate the value of LLM-guided planning for efficient concurrent computing in orbital GPU clusters.
- [74] arXiv:2611.17872 (cross-list from cs.LG) [pdf, html, other]
-
Title: Protection-Oriented Assessment of Machine Learning-Based Fault Detection in Power SystemsJulian Oelhaf, Georg Kordowich, Changhun Kim, Christian Bergler, Andreas Maier, Johann Jäger, Siming BayerComments: 9 pages, 3 figures, 5 tables. Accepted for oral presentation at the 21st International Conference on Developments in Power System Protection (DPSP APAC 2027), Hong Kong, 6-9 January 2027Subjects: Machine Learning (cs.LG); Signal Processing (eess.SP)
Machine learning (ML)-based fault detectors are increasingly proposed for power system protection, yet aggregate metrics can obscure the consequences of false and missed trips. We present a protection-oriented assessment of three ML detectors and a sequence-current reference on PROTECT-90, comprising 9,022 simulated fault episodes on a 90 kV double-circuit line. The assessment combines five window conditions, causal window-end labelling, episode-grouped cross-validation, and operating-point selection under a fixed security budget. It reports security, dependability, detection timing, decision margins, and episode-level nuisance assertions. Gradient-boosted trees, a convolutional neural network, and logistic regression achieve AUC-ROC values above 0.999, yet at a security budget of $10^{-3}$ their developed-fault missed-trip rates range from 0.007% to 1.99%. Post-clearing false-trip rates of approximately 0.12-0.16% per window coexist with nuisance assertions in 11.3-19.1% of episodes. Among the analysed physical descriptors, missed trips are most consistently associated with higher fault resistance within the sampled range. An analytical current proxy suggests a fault-current gradient only partly reproduced by waveform-derived current (rank correlation 0.62). No single topology state or faulted phase consistently dominates within the sampled domain. Because PROTECT-90 contains fault episodes only, security is assessed on pre-fault and post-clearing windows rather than independent non-fault disturbances.
- [75] arXiv:2611.17908 (cross-list from cs.AR) [pdf, html, other]
-
Title: DiffusionSSD: Achieving Extreme Visual Compression with Dual-stage Diffusion and Cross-level Near-Data ProcessingComments: 15 pages, 19 figuresSubjects: Hardware Architecture (cs.AR); Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
Growing visual data overwhelms storage on resource-constrained edge devices, making compression essential. Traditional codecs offer inadequate rate-distortion performance, motivating the exploration of diffusion codecs. Diffusion codecs face two limitations: (1) At the algorithm level, diffusion decoders preserve perceptual quality under extreme compression, but require substantial computation. (2) At the architecture level, in NPU-centered devices, neural codecs occupy the NPU, interfering with other AI applications. Meanwhile, the complex codec pipeline incurs long I/O paths, leading to additional overhead and energy cost.
To address these issues, we propose DiffusionSSD, a cross-level near-data processing framework for extreme visual data compression on edge devices, using an algorithm-architecture co-design method. Specifically, (1) at algorithm level, we present Dual-stage Diffusion, a lightweight solution tailored for diffusion codecs that employs patchification and single-step diffusion, reducing computation cost while preserving perceptual quality; (2) at architecture level, we introduce a Cross-level Near Data Processing architecture that integrates the proposed computational universal flash storage (cUFS) and LPDDR-PIM, enabling codecs to be entirely offloaded to data side while reducing visual-data movement and avoiding SoC redesign; (3) at system level, combining both the algorithm and the underlying architecture, we propose a Patch-Workload co-aware scheduling scheme to enable more efficient system-level execution. Experiments show that Dual-stage Diffusion maintains comparable perceptual quality while reducing computation cost by up to 92.7%. Compared with NPU+DRAM and near-data-processing design such as SmartSSD, cUFS+PIM improves coding throughput by 2.32 times and 2.91 times on average, respectively. - [76] arXiv:2611.17950 (cross-list from cs.AI) [pdf, html, other]
-
Title: Toward Interference-Agnostic RF Source SeparationComments: 5 pages, 3 figures, 1 tabs. Submitted to ICASSP2027Subjects: Artificial Intelligence (cs.AI); Signal Processing (eess.SP)
Separating a radio-frequency signal of interest from a co-channel interference is mostly addressed with specialized separators, each trained for one pair of signal and interference types and therefore relying on a label that a heavily jammed receiver cannot identify. We show that this reliance is not benign: applied to an interference it was not trained on, such a separator usually fails to recover the signal, and in most of the cases we measure it leaves the signal worse than no processing at all. We then train a single separator over every pair, giving it no indication at test time of which one it faces, on two architectures with no component in common: the convolutional WaveNet of the ICASSP 2024 RF Challenge, and a band-split transformer that we adapt from music source separation. Both behave the same way. At the size of one specialized model, the unified separator stays close to the whole models it replaces, keeping the bit error rate close on almost every pair, better on one and worse on another. On an interference absent from every training set, it does as well as the best specialized model, without anyone having to choose which one to deploy.
- [77] arXiv:2611.18050 (cross-list from cs.CL) [pdf, html, other]
-
Title: FEND: Far-End Detection in Outbound Voice AI CallsComments: Submitted to EACL 2027Subjects: Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
When a conversational Voice AI agent places an outbound call, the far end may be a live person, a voicemail greeting, an interactive voice response (IVR) system, or increasingly another AI system answering on the callee's behalf. Standard Answering Machine Detection (AMD) reports only whether a human or a machine picked up, a design meant for human call centres, where one machine is as uninteresting as another. That single bit does not tell a Voice AI agent what to do, since leaving a voicemail message, navigating an IVR and holding a short exchange with another AI are three different actions and a two-valued label cannot distinguish them. In 1,000 randomly sampled calls from our own outbound deployment, a live person answered 48.1%, a voicemail system 44.6%, an AI 6.9% and an IVR 0.4%. Our proposed framework, FEND, reads the far end's audio and its streaming transcript and runs one detector for each automated class (voicemail, IVR, AI callee), with human the default when nothing fires, returning a single label within 20 seconds. On a public benchmark the voicemail components reach 100% accuracy without ever misclassifying a live human, where Asterisk's AMD misclassifies 30 to 66% of them. For the AI callee, acoustic features do not transfer across recording conditions, but speech timing does, separating AI from human at 0.952 ROC-AUC, because synthesised speech leaves far shorter gaps between words. On production traffic, separating a live person from any automated far end reaches F1 0.979, and only 2.9% of live people are given an automated label, the error that matters most for an agent acting on the result.
- [78] arXiv:2611.18173 (cross-list from math.OC) [pdf, html, other]
-
Title: Safety Certificates for Systems under Attack via Stackelberg Set GamesSubjects: Optimization and Control (math.OC); Systems and Control (eess.SY)
We study a Stackelberg set selection game for linear systems subject to bounded disturbances and additive attacks. The defender selects the vector parameter of a polytopic safe set template; the attacker, after observing this choice, selects the vector parameter of an admissible attack set. The payoff is a signed, facet-normalised invariance margin that tests invariance exactly and quantifies either the available contraction or the facet inflation needed when invariance fails. Both controlled and robust controlled invariance are treated, corresponding to different information patterns for the control input. Exploiting the structure of parameterised polyhedra, we show that within each validity region the margin is concave in the attack parameter, which reduces the follower minimisation to finitely many extreme parameters. The complete max--min game is then solved by a finite family of LPs, one per defender validity region, each enforcing all attacker regions under a common defender decision and guaranteed margin. The framework handles hard state constraints and additional costs related to the safe set size, and recovers optimal set parameters together with state and attack realisations that activate the certificate. A load frequency control example under false data injection illustrates the construction, the validity decomposition, and the two information patterns.
- [79] arXiv:2611.18352 (cross-list from math.OC) [pdf, html, other]
-
Title: Online Switching Control as Learning with ExpertsSubjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Systems and Control (eess.SY)
This paper addresses the problem of online switching control for discrete-time nonlinear systems where a controller is sequentially selected from a finite set of candidates. The goal is to generate an adaptive sequence of controllers to minimize the cumulative cost under unknown disturbances and cost functions. Specifically, we consider a full-information feedback setting where realized disturbance effects and cost functions are available after each selection. Using counterfactual costs computed from historical data, we reduce the online switching control problem to the experts problem with switching costs. Then, we propose an adaptive switching algorithm based on the Hedge algorithm with a switching suppression mechanism. Notably, the proposed algorithm achieves an expected regret of $O(\sqrt{T\log N})$, where $T$ is the time horizon and $N$ is the number of candidate controllers, while ensuring uniform boundedness of the state. This matches the optimal regret order for the standard experts problem.
- [80] arXiv:2611.18429 (cross-list from cs.CV) [pdf, html, other]
-
Title: Do Underwater Image Quality Metrics Agree with Human Perception? A Benchmark with Human Choices, Simple Edits and Generative DriftComments: Accepted at the 6th WVAQ Workshop, WACV 2027. 18 pages including appendixSubjects: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
Underwater image enhancement is challenging to evaluate due to the lack of clean reference images, so researchers rely on no-reference image quality assessment (NR-IQA) metrics. However, it remains unclear whether these metrics agree with human judgments. We evaluate 73 handcrafted underwater, learned underwater, vision-language and general-purpose metrics against human preferences on five references: four published opinion-score sets and a new paired-comparison study. For each metric, we measure how often it selects the same image as people when comparing versions of the same scene. We further test whether simple image edits and small adversarial perturbations raise metric scores above the enhancement people preferred, and whether scores decrease as repeated generative edits add noise. Our results show that no metric consistently matches human preferences. The best worst-case Cohen's kappa over the five references is only 0.23 (Q-Align), while two raters in our study agree with a median kappa of 0.41. The widely used UCIQE often favors edits that people reject. On a Nano Banana Pro replica chain that should leave the image unchanged, only 22 of 73 scores decrease at every checkpoint, while noise grows by 2.5 times. We also introduce TrustUIQA, a benchmark that combines the human references, our study choices, the edited, attacked and generated images, and the scores of every metric on every image. The code is available at this https URL and TrustUIQA at this https URL.
- [81] arXiv:2611.18434 (cross-list from cs.AI) [pdf, html, other]
-
Title: Towards Explainable Sleep Stage Classification using Single-Channel ElectroencephalogramComments: 8 pages, 4 figures. Accepted at AgIA4BioHealth Workshop, IEEE BIBM 2026, Dallas, Texas, December 1-4, 2026Subjects: Artificial Intelligence (cs.AI); Signal Processing (eess.SP)
Automated sleep staging has achieved strong bench- mark accuracy; however, clinical adoption remains limited due to a lack of interpretability. In this work, we fill the research gap by extending the SleepXAI sleep staging framework to systematically compare five different XAI methods. Further, attribution fidelity is evaluated using Spearman rank correlation with AASM-defined EEG frequency bands, serving as clinically grounded reference signals. In this paper, we focus on single- channel Electroencephalogram (EEG), which is more amenable to practical clinical deployment compared to full polysomnography setups. Experiments are conducted on the Sleep-EDF benchmark dataset and the DREAMT dataset. In DREAMT, we stratified subjects based on OSA into four Apnea-Hypopnea Index (AHI) severity groups. We observed that the SleepXAI model achieves strong classification performance on both datasets. Among the evaluated methods, Integrated Gradients (IG) consistently achieves the highest mean attribution fidelity across all five sleep stages on Sleep-EDF and across all AHI groups on DREAMT, outperforming all other evaluated methods under the Spearman rank correlation metric. These findings highlight the importance of attribution method selection as a key factor for ensuring reliable and clinically interpretable automated sleep staging systems.
- [82] arXiv:2611.18450 (cross-list from cs.LG) [pdf, html, other]
-
Title: PACT: A Decoder-Confidence-Guided Two-Round Receiver for Joint Channel and Phase-Noise Estimation in Sub-THz OFDMSubjects: Machine Learning (cs.LG); Signal Processing (eess.SP)
Frequency-selective fading and oscillator phase noise (PN) jointly impair coded sub-THz OFDM reception. We propose a decoder-confidence-guided two-round receiver combining a {pilot-aware complex transformer} (PACT) estimator, banded linear minimum mean-square error equalization, and neural normalized min-sum decoding. PACT jointly estimates the frequency-domain channel and effective time-domain PN through interacting complex-valued branches. Decoder-derived pseudo-pilots and continuous constellation-aware confidence guide second-round refinement through PACT inputs and attention, with parameters shared across rounds. At $E_b/N_0=30$~dB, the PACT receiver achieves approximately $70\%$ and $57\%$ lower code-block error rates than the best-performing learning-based baseline in the two benchmark settings, respectively. Frozen-weight tests further demonstrate applicability across channel/PN models, carrier frequencies, and FFT/bandwidth configurations.
- [83] arXiv:2611.18484 (cross-list from cs.RO) [pdf, other]
-
Title: From AI-Enabled Remote Patient Monitoring Toward Agentic Robotics: Embodiment, Governance, and Care IntegrationComments: 34 pages, 6 figures, 3 tables. Accepted for publication in Annual Review of Control, Robotics, and Autonomous Systems, Volume 10 (2027)Subjects: Robotics (cs.RO); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA); Software Engineering (cs.SE); Systems and Control (eess.SY)
AI-enabled remote patient monitoring is evolving beyond passive data collection toward agentic AI systems that interpret patient states, coordinate care, and initiate action across domestic and clinical settings. This structured scoping review finds that mature agentic care has not yet emerged: Most systems remain human led, while stronger decision-action coupling and embodied AI remain largely confined to prototypes and pilots. Healthcare robotics makes the transition from monitoring to action especially visible by translating AI-generated recommendations and decisions into speech, movement, prompting, physical assistance, escalation, and care coordination, making embodiment, clinical integration, human oversight, and governance fundamental design requirements. Further progress requires safe and interoperable care architectures in which intelligent components operate through clinically validated and accountable workflows. We propose agentic robotics as a future direction for supervised systems embedded in the care ecosystem, connecting AI agents and robots with clinicians, caregivers, and patients through auditable workflows that can be interrupted and remain subject to human oversight and explicit AI governance.
- [84] arXiv:2611.18507 (cross-list from cs.LG) [pdf, html, other]
-
Title: Asymptotic Margins and Feature Confinement in Conic Classification Heads under Softmax Cross-EntropyComments: 22 pages, 2 figures. Companion paper: to be uploaded. Code: this https URLSubjects: Machine Learning (cs.LG); Signal Processing (eess.SP)
Classification heads built on conic functions give each class a bounded region of the feature space, and such regions are used to reject samples of unseen classes. We ask whether these regions also keep the features bounded when the head is trained with softmax cross-entropy. For a head whose class scores combine a linear term with a Euclidean norm, we first show that the region of each class is bounded by a quadric of revolution, whose eccentricity is the reciprocal of one learned ratio. We then attach to each class an asymptotic margin, which compares the growth of its score with the growth of all the other scores and can be computed by a second-order cone program. The loss of a class has infimum zero exactly when its margin is positive, and it then approaches zero only along diverging features. When the margin is negative, the loss is coercive and its minimizers lie in an explicit ball. Since softmax depends only on the differences between scores, a class with a bounded region can still have a positive margin, so bounded regions do not confine the features. The result extends to other norms, including the polyhedral conic functions. On CIFAR-10 and CIFAR-100, all 1210 cells of 67 trained conic heads have positive margins, whereas a prototype head keeps nine of its ten cells bounded, as the theory predicts.
Cross submissions (showing 25 of 25 entries)
- [85] arXiv:2101.00834 (replaced) [pdf, html, other]
-
Title: Symbolic Control for Stochastic Systems via Finite Parity GamesJournal-ref: Majumdar, R., Mallik, K., Schmuck, A.K. and Soudjani, S., 2024. Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems, 51, p.101430Subjects: Systems and Control (eess.SY); Logic in Computer Science (cs.LO)
We consider the problem of computing the maximal probability of satisfying an omega-regular specification for stochastic nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region. The heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a 2.5-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract 2.5-player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve 2.5-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability. We have implemented the abstraction-based algorithm in Mascot-SDS (Majumdar et al., 2020), where we combined the outlined abstraction step with our recent tool FairSyn. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We outperform a recently proposed tool for solving this problem by a large margin.
- [86] arXiv:2506.03410 (replaced) [pdf, html, other]
-
Title: An iterative tangential interpolation algorithm for model reduction of MIMO systemsComments: 14 pages, 4 figures Submitted to IEEE TAC. Revision 2Subjects: Systems and Control (eess.SY)
We consider model reduction of large-scale Multi-Input, Multi-Output (MIMO) systems using low-rank barycentric tangential interpolation on the frequency axis. Our scheme is related to the recently-developed Adaptive Antoulas--Anderson (AAA) algorithm, which is an iterative algorithm that uses concepts related to the Loewner framework.
One feature of our algorithm is optimization of the interpolation weight matrices to minimize a proxy for the \(L_2\) system error. We use the freedom in interpolation point selection to provide multiple minimum-error-based algorithms with trade-offs between computational complexity and approximation performance. We prove that a weighted \(L_2\) norm of the proxy error system is non-increasing as interpolation points are added, and that the reduced-order system is stable whenever the original system is. Computational results are provided demonstrating the closeness of the proxy system and true system \(L_2\) errors. Comparisons with prior work demonstrate performance on par with standard model reduction methods. - [87] arXiv:2507.09134 (replaced) [pdf, html, other]
-
Title: Integrating Planning and Predictive Control Using the Path Feasibility GovernorComments: 16 pages, 12 figures, accepted as a Full Paper in IEEE Transactions on Automatic ControlSubjects: Systems and Control (eess.SY)
The motion planning problem of generating dynamically feasible, collision-free trajectories in non-convex environments is a fundamental challenge for autonomous systems. Decomposing the problem into path planning and path tracking improves tractability, but integrating these components in a theoretically sound and computationally efficient manner is challenging. We propose the Path Feasibility Governor (PathFG), a framework for integrating path planners with nonlinear Model Predictive Control (MPC). The PathFG manipulates the reference passed to the MPC controller, guiding it along a path while ensuring constraint satisfaction, stability, and recursive feasibility. The PathFG is modular, compatible with replanning, and improves computational efficiency and reliability by reducing the need for long prediction horizons. We prove safety and asymptotic stability with a significantly expanded region of attraction, and validate its real-time performance through simulated case studies of unicycle and quadrotor navigation in cluttered environments.
\c{opyright}2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. - [88] arXiv:2511.11131 (replaced) [pdf, html, other]
-
Title: Expert-Guided Online Reinforcement Learning for Stable and Sample-Efficient Control of Dynamical SystemsComments: Submitted to L4DCSubjects: Systems and Control (eess.SY)
Online reinforcement learning (RL) often requires extensive interactions with the environment, which makes the training costly. Additionally, exploration can destabilise the dynamical system, which may be unsafe. On the other hand, offline learning from expert demonstrations avoids unsafe exploration but is limited by the quality and coverage of the offline dataset. In this paper, we propose a model-free RL approach that combines expert demonstrations with limited online interactions. Specifically, we optimise a policy objective consisting of an online performance term and a behavioural cloning regulariser computed from offline expert demonstrations. The regulariser encourages the learned policy to stay close to expert behaviour, reducing the need to explore unfamiliar actions. Expert demonstrations guide policy learning and reduce the need for many online interactions and exploration. For stochastic linear time-invariant (LTI) systems, we establish conditions for linear convergence of exact policy gradient updates and for all intermediate policies to remain stabilising. Although our theoretical analysis focuses on linear systems, we also evaluate the proposed approach on nonlinear systems to demonstrate its effectiveness beyond the linear setting. \rev{Numerical results show that the proposed method reaches comparable performance in fewer gradient steps and with less number of samples than a purely online RL baseline.
- [89] arXiv:2511.23385 (replaced) [pdf, html, other]
-
Title: Strong nonlinear detectability and moving horizon estimation for nonlinear systems with unknown inputsComments: 19 pages,3 figuresSubjects: Systems and Control (eess.SY)
This paper investigates state estimation for general nonlinear discrete-time systems subject to measurement noise and possibly unbounded unknown inputs. To approach this problem, we first propose the concept of strong nonlinear detectability, which proves to be a nonlinear counterpart to strong* detectability. Based on the proposed detectability notion, an unknown input state estimator (UISE), which yields bounded estimation error even for unbounded unknown inputs, is designed via a moving horizon estimation strategy using past and current measurements. Next, we tighten this detectability notion to develop a two-stage MHE-based UISE that is computationally more efficient. In a simulation example, both variants of MHE-based UISEs are compared with a conventional MHE to illustrate the merits of the proposed methods.
- [90] arXiv:2601.08113 (replaced) [pdf, html, other]
-
Title: Coordinated Cooling and Compute Management for AI DatacentersComments: Accepted at IEEE Transactions on Cloud ComputingSubjects: Systems and Control (eess.SY); Distributed, Parallel, and Cluster Computing (cs.DC)
The AI datacenters are currently being deployed on a large scale to support the training and deployment of power-intensive large-language models (LLMs). Extensive amount of computation and cooling required in datacenters increase concerns about the energy use and carbon emissions of AI datacenters. Although current state-of-the-art has examined the energy efficiency of LLM inference, most prior research focused on optimizing compute-side scheduling without considering thermal objectives or constraints. Since GPU-intensive inference generates substantial heat that can degrade datacenter performance, ignoring thermal effects can increase total energy consumption and reduce the efficiency of LLM serving. To fill this gap, we profile the characteristics of GPU servers under varying cooling and AI jobs, and develop a joint cooling and computing modeling approach for AI datacenters. Built upon such workload and thermal dynamics models, a novel hierarchical control framework is proposed to co-optimize computing and thermal management by identifying the optimal GPU parallelism, frequency (DVFS), and cooling control knobs. Using real Azure inference traces and detailed GPU profiling, our model balances serving latency and thermal constraints in AI datacenters while significantly improving AI datacenters' energy efficiency.
- [91] arXiv:2602.05483 (replaced) [pdf, html, other]
-
Title: Toward Operationalizing Rasmussen in Evolving Software SystemsSubjects: Systems and Control (eess.SY); Computers and Society (cs.CY); Applications (stat.AP)
Rasmussen's qualitative drift model explains how successive, locally successful adaptations under efficiency pressures can move a system toward unacceptable operation. Brooker and Hochstein applied this perspective conceptually to software operations without specifying a quantitative procedure for observing drift. We take a step in this direction and propose a runtime observer that quantitatively operationalizes the model's observable part for evolving software. The proposed observer is intended to give engineers evidence for pausing or revising adaptation before declared operating limits are crossed. It tracks how activity or resource use is distributed across components and types of work. Measurement history quantifies accumulated change and recent movement toward or away from current limits. Assuming that direction and limits remain unchanged, the proposed observer calculates the first constraint ahead and the amount of further change required to reach it. Measurements remain comparable across supported component changes, while policy revisions are distinguished from changes in execution. Preliminary runtime studies demonstrated these distinctions under annotated software changes and revised retry limits. A separate multivariate exponentially weighted moving average (MEWMA) experiment detected CPU redistribution earlier with log-ratio coordinates than with raw shares, motivating investigation of representation-dependent observation. Further work will ground constraints in service outcomes, investigate runtime-model acquisition, and test whether decisions informed by observed drift reduce violations at acceptable useful-work loss and intervention cost.
- [92] arXiv:2602.23539 (replaced) [pdf, html, other]
-
Title: Multi-Band Sensing in FR3 with Background Dense Multipath ComponentsComments: Accepted for publication in IEEE Transactions on Wireless Communications, 2026Subjects: Signal Processing (eess.SP)
Multi-band sensing has emerged as a key enabler of integrated sensing and communication (ISAC), one of the six primary usage scenarios defined for IMT-2030 (6G). The introduction of frequency range 3 (FR3, 7-24 GHz), comprising non-contiguous sub-bands across a wide frequency span, further reinforces the importance of multi-band operation. In such scenarios, frequency-dependent propagation effects that are collectively referred to as dense multipath components (DMC), including clutter, diffraction, and diffuse scattering, must be carefully considered. Building on prior literature and our experimental observations, this paper proposes a novel ISAC channel analysis tailored to multi-band sensing, based on a channel model with background DMCs. It also assesses the sensing trade-offs among sub-bands by analyzing Cramér-Rao bound (CRB)-based fundamental limits. Furthermore, a scalable multi-band estimator is proposed that resolves angular ambiguities arising from the grating lobes effect. Simulation results of the multi-band estimator demonstrate substantial gains in estimation accuracy and reductions in false alarm rate over single-band estimators operating on each constituent sub-band within the CRB-achieving regime. In a representative test case, the proposed estimator achieves reductions of 37.41% and 17.04% in the root mean squared error of delay estimation compared to single-band estimators operating at 8.75 GHz and 21.7 GHz, respectively.
- [93] arXiv:2603.03729 (replaced) [pdf, html, other]
-
Title: Timing-Aware Satellite Association for Multi-LEO Direct-to-Handset CommunicationsComments: 16 pages, 12 figures, 1 tableSubjects: Signal Processing (eess.SP)
The rapid deployment of large-scale low Earth orbit (LEO) satellite constellations has positioned direct-to-handset (D2H) communications as a key enabler of future non-terrestrial networks. However, the limited link budget of handheld devices makes broadband service delivery challenging, and multi-satellite cooperative transmission is often required to provide sufficient power gain. In practice, such cooperation is severely hindered by asynchronous reception across satellites. This paper analyzes the received-signal model under the 3rd Generation Partnership Project (3GPP) transmitter structure and shows that satellite-dependent propagation delays prevent simultaneous timing alignment for multiple user terminals (UTs). This timing mismatch induces severe inter-carrier interference (ICI) and inter-symbol interference (ISI), even from the intended signals, which fundamentally constrains the achievable cooperative gain. To address this issue, we propose a timing-aware satellite association strategy that enables cooperation only with satellites expected to satisfy a UT-side timing tolerance, thereby avoiding dominant asynchronous interference by design. Simulation results demonstrate that the proposed strategy improves throughput performance compared to single-satellite transmission and fully connected multi-satellite baselines.
- [94] arXiv:2603.09424 (replaced) [pdf, html, other]
-
Title: System-wide Dynamic Performance Metric for Converter-Dominated Power SystemsSubjects: Systems and Control (eess.SY)
Fast controller dynamics in Inverter-Based Resources (IBRs)-dominated power networks couple frequency and voltage, making traditional decoupled analysis inadequate. We introduce a unified system-wide metric---the complex frequency of system losses-to evaluate dynamic performance and synchronization. Composed of device- and network-driven terms, it expresses voltage and injected-current phasor variations weighted by bus complex powers. Validated on an IBR-modified IEEE 39-bus system and the Irish transmission grid, the framework effectively assesses R/X sensitivities, dynamic support limits, and data-center load impacts.
- [95] arXiv:2604.06463 (replaced) [pdf, html, other]
-
Title: A Control Barrier Function-Constrained Model Predictive Control Framework for Safe Reinforcement LearningComments: 10 pages; additional theoretical results and expanded discussionSubjects: Systems and Control (eess.SY)
Ensuring safety under unknown and stochastic dynamics remains a significant challenge in reinforcement learning (RL). In this paper, we propose a model predictive control (MPC)-based safe RL framework, called Probabilistic Ensembles with CBF-constrained Trajectory Sampling (PECTS), to address this challenge. PECTS jointly learns stochastic system dynamics with probabilistic neural networks (PNNs) and control barrier functions (CBFs) with Lipschitz-bounded neural networks. Safety is enforced by incorporating learned CBF constraints into the MPC formulation while accounting for the model stochasticity. This enables probabilistic safety under model uncertainty. To solve the resulting MPC problem, we utilize a sampling-based optimizer together with a safe trajectory sampling method that discards unsafe trajectories based on the learned system model and CBF. We also derive a finite-horizon exit-probability bound using tail information for centered barrier increments. We validate PECTS in various simulation studies, where it outperforms baseline methods.
- [96] arXiv:2605.00215 (replaced) [pdf, html, other]
-
Title: Multi-Objective Adaptive Beamforming Using Partial Knowledge of Dynamic Dielectric Media for Non-Invasive Microwave HyperthermiaSubjects: Signal Processing (eess.SP)
We investigate multi-objective adaptive beamformer design strategies for non-invasive microwave hyperthermia. Our focus is to address the challenges of maintaining focused power deposition in desired locations while reducing unwanted heating elsewhere under conditions of changing dielectric properties. The process of heating the media causes changes in the dielectric properties of the media, which can degrade the effectiveness beamformers with static weights. Typical hyperthermic beamformer designs calculate antenna beamforming weights using patient-specific high resolution dielectric maps obtained by MRI or microwave tomography, however this process is time consuming and difficult to perform in real-time. In this work, we explore the efficacy of microwave hyperthermia in various inhomogeneous media under changing dielectric conditions, with the goal of informing the design of future adaptive real-time microwave hyperthermia techniques. We aim to achieve cell apoptosis by obtaining temperatures of $\sim$ 45 $^\circ\text{C}$ through selective absorption of electromagnetic wave focusing at a 2.5 GHz carrier frequency with little to no knowledge of the changes in the dielectric media and simultaneously place nulls to avoid unwanted heating outside of the treatment zone. We investigate the effectiveness of the linear constrained minimum power (LCMP) algorithm for near-field multi-objective beamforming and examine the power density obtained from finite-difference time-domain (FDTD) simulations on simple analytical models and anatomically realistic numerical breast phantoms. To gain a comprehensive knowledge of the efficacy of the beamformer we evaluate the resulting thermal maps of the models in simple homogeneous cases, heterogeneous cases and MRI-derived phantom breast models.
- [97] arXiv:2606.00277 (replaced) [pdf, html, other]
-
Title: Sensing-Aided Beam Selection for UAV NetworksComments: Submitted to IEEE ICC 2027Subjects: Signal Processing (eess.SP)
Fast and low-overhead beam management is essential for the practical deployment of unmanned aerial vehicle (UAV) communication networks operating at millimeter-wave and higher frequencies. In this paper, we propose a radar-assisted beam selection framework for UAV networks that exploits spatial sensing information, including angle-of-departure and distance estimates, to efficiently identify communication beams. Specifically, a digitally beamformed radar array with a relatively small number of antennas provides rapid, coarse UAV localization, while an analog-beamformed communication array, requiring fewer radio-frequency chains, exploits coarse localization to narrow the beam-search region and establish a communication link with the UAV. To provide theoretical insight into the expected overhead, we conduct a probabilistic analysis in which an approximation of the nearest-first beam selection overhead under idealized conditions is proposed and its statistics are derived for a Gaussian error model. The simulation results demonstrate that the proposed radar-assisted beam selection significantly reduces the number of beams that need to be examined, requiring on average at most 1.64 candidate beams even under per-element radar phase errors of up to 100°.
- [98] arXiv:2607.02797 (replaced) [pdf, html, other]
-
Title: RCOA Extension and ApplicationsComments: 11 pages, 9 figures, multimediaSubjects: Systems and Control (eess.SY)
The Relaxed Convex Obstacle Avoidance (RCOA) formulation is the first approach to enable a fully convex optimal control problem (OCP) for obstacle avoidance. Convergence analysis of RCOA yields an analytical framework that defines a unique characteristic: the ability to maintain obstacle avoidance (OA) efficacy even when obstacles reside beyond the controller's prediction horizon. In this paper, RCOA is extended to three-dimensional environments and apply it to Unmanned Aerial Vehicle (UAV) navigation. Furthermore, the formulation is enhanced to incorporate vehicle geometries, moving beyond point-mass representations to enable collision avoidance between 3D objects. Numerical simulations demonstrate that RCOA provides computational performance on par or exceeding state-of-the-art methods. Notably, RCOA is demonstrated to enable a Nonlinear Model Predictive Controller (NMPC) to execute aggressive maneuvers through narrow passages with reduced prediction horizons, ensuring real-time feasibility at frequencies exceeding 30~Hz.
- [99] arXiv:2609.06351 (replaced) [pdf, html, other]
-
Title: A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and CoordinationComments: 32 pages, 6 figures. Manuscript source and complete reproduction materials are available at this https URLSubjects: Systems and Control (eess.SY); Networking and Internet Architecture (cs.NI); Optimization and Control (math.OC)
A broader view of a network can help agents coordinate, but collecting that view takes time. When is a fresh local observation more useful than an older view of the whole network, and when should an agent look only partway across it? We study agents that repeatedly minimize a shared quadratic cost in an environment that evolves independently of their actions. An information architecture specifies what each agent observes and how old those observations are. Each agent uses a synchronized neighborhood snapshot, so extending its scope also ages the nearby readings used in the decision. We assume that the optimal action with complete information is affine in the state, and that the conditional mean of the current state equals the old state scaled by a common exponential decay factor. Using the classical Marschak--Radner decomposition, we derive the delay threshold beyond which fresh local information outperforms a complete but older global view. This comparison allows non-Gaussian states and nonlinear decision rules. We then determine how far an agent should look by balancing the benefit of additional observations against their greater age. In a Gaussian spatial model on a line, we derive the optimal observation radius: looking beyond the local node pays only when information travels more than twice the spatial correlation length in one coherence time. The preferred information architecture also depends on the decision being made. On a fixed 64-node ring, increasing only the reach of the decision weights from 0.7 to 6 hops shifts the optimal observation radius from one to five hops.
- [100] arXiv:2609.23579 (replaced) [pdf, html, other]
-
Title: Contract-Based Decomposition of Temporal Logic Specifications for Networked Systems under Arbitrary PartitionsSubjects: Systems and Control (eess.SY)
Computational complexity is an inherent limitation of formal synthesis for networked systems, and decomposing the global specification into local ones relaxes this limitation at the cost of conservatism. Since the granularity of the partition governs this trade-off, it is reasonable to treat the partition as a design variable, which calls for local specifications that remain correct for every partition. To this end, this paper gives each agent a local specification, written as an assume-guarantee contract that the agent can establish from local information. We first derive a necessary and sufficient condition for these contracts to decompose the global specification under a given partition. Building on this, we then present a condition under which the decomposition is correct for every partition, so that the partition becomes a free design variable. For linear dynamics and signal temporal logic formulas with affine predicates, we further synthesize a controller for each coalition by a tube-based approach. Finally, simulations on a network of input-coupled tanks show how the choice of partition trades computational cost against conservatism.
- [101] arXiv:2610.12654 (replaced) [pdf, html, other]
-
Title: Symbolic-Permutation-Based Direct Sparse Jacobian Assembly for Accelerated Power-Flow AnalysisComments: 11 pages, 3 figuresSubjects: Systems and Control (eess.SY); Performance (cs.PF); Numerical Analysis (math.NA)
The repeated assembly of the sparse Jacobian matrix constitutes a primary computational bottleneck in the Newton-Raphson power-flow analysis. Through an algebraic operator equivariance analysis of the Jacobian matrix, this paper formalizes the reduction process and proposes a direct sparse Jacobian assembly method based on symbolic permutation. By pre-applying the permutation to the admittance matrix during a fast one-time symbolic phase via its sparse prefix-sum property, the runtime bus-type projection overhead and indirect mapping caches are entirely eliminated. Consequently, complex Jacobian differentiation and global matrix assembly fuse into a single operation, yielding a single-pass, branchless algorithm that streams values directly into contiguous memory. The proposed algorithm is implemented in the open-source RustPower solver. Benchmarks on IEEE test systems and PEGASE 9241 demonstrate that the proposed assembly is 28.1-37.9 times faster than the MATPOWER-style baseline and 8.9-9.7 times faster than the in-house Schäfer-Braun-inspired assembly (V1); on PEGASE 9241, it outperforms optimized traditional C++ assembly routines by 3.72 times in cold construction and 2.59 times across iterations. End-to-end, the iteration-loop solve time with KLU is 1.16-1.97 times faster than the native C++ LightSim2Grid and up to 95.5 times faster than pandapower, while leaving numerical results and convergence behavior unchanged. The method extends directly to general problems where a sparse Jacobian inherits its structure from a static network operator, including transient stability analysis, EMT simulation, and OPF Hessian assembly.
- [102] arXiv:2610.13357 (replaced) [pdf, html, other]
-
Title: ECGGuard: Deep Watermarking of Electrocardiogram Signals With Error-CorrectingComments: 12 pages, 4 figures, 5 tablesSubjects: Signal Processing (eess.SP); Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV)
Wearable electrocardiogram (ECG) recordings pass through multiple networks and systems before automated interpretation, leaving patient metadata vulnerable to loss. Digital watermarking can embed this metadata in the signal, but conventional methods fail under time shifts, and high waveform similarity does not guarantee the same downstream diagnosis. We present \rev{ECGGuard}, a deep watermarking framework for single-lead ECG. A fully convolutional generator embeds the payload without signal quantization, a detector decodes the message frame by frame and checks for watermark presence, and during training a frozen arrhythmia classifier penalizes changes that would alter its predictions. Because high bit accuracy does not ensure whole-message recovery, the payload is protected by extended Hamming codes, \rev{a validation-selected channel ordering}, and soft-decision decoding. On the MIT-BIH Arrhythmia Database, \rev{averaged over three training runs, ECGGuard} keeps bit accuracy above \rev{98\%} under time shifts of 10 to 50 samples, where transform-domain baselines drop to chance. The coded 16-bit payload is recovered exactly in \rev{99.95\%} of clean segments\rev{, in over 96\%} under time shifts, 10\% sample deletion, or 10\% packet loss\rev{, and in 99.1\% for unseen subjects}. \rev{For the guiding classifier, the diagnostic loss limits the drop in ventricular-beat sensitivity to 1.6 percentage points on the test records (35.0 without it) and to 12.2 points for unseen subjects (67.0 without it); the drop grows to 10.3 points for independently trained classifiers, and the protection does not transfer to an external database.} \rev{ECGGuard} has 0.56 million parameters and needs about \rev{19}~ms per segment on a desktop CPU.
- [103] arXiv:2610.35581 (replaced) [pdf, html, other]
-
Title: Integrate the Reward, Don't Sample It: Window Likelihood for Interruptions and Backchannels in Full-Duplex Speech ModelsGuoqiang Hu, Lichao Zhang, Yizhou Peng, Yuhao Luo, Haifeng Hu, Zhongqian Sun, Wei Yang, Eng Siong ChngSubjects: Audio and Speech Processing (eess.AS); Computation and Language (cs.CL); Sound (cs.SD)
When a user talks over a full-duplex dialogue model, it must decide whether the user is interrupting (stop) or backchannelling (carry on). Post-training can improve this discrimination or change how readily it stops. In our GRPO runs the second dominates: no configuration lowers both error rates on more than one model, and two released checkpoints discriminate no better than their bases. We trace this partly to how the reward is estimated. The probability of stopping inside a short window is a known function of a few stop probabilities the policy emits, yet GRPO estimates it by sampling. A group of rollouts that all agree gives no gradient, even when all fail; the push on the stop threshold is strongest where the model is unsure, whichever outcome is right; and whole-rollout credit reaches decisions the reward never judges. Confining the credit to the window removes only that leakage. Window likelihood (WL) samples the words but integrates over the stop decisions, so the probability of the correct outcome is computed exactly and its logarithm maximised. On HumDial-FDBench, across four open models, WL gives the best F1 and lowers both error rates by more than their confidence intervals, without talking into silence.
- [104] arXiv:2611.03869 (replaced) [pdf, other]
-
Title: Beyond TR 38.811 for 6G NTN Channel ModelsComments: Withdrawn by the submitting author: this version was posted without the approval of all co-authorsSubjects: Signal Processing (eess.SP)
As the 3rd Generation Partnership Project (3GPP) expands 6G non-terrestrial network (NTN) to S, Ku, and Ka bands for integration with existing terrestrial cellular networks, the necessary satellite channel model for link and network performance evaluation remains tied to TR 38.811, last revised in 2020. We identify issues on multiple fronts: inappropriate parameter specifications based on very limited site-specific environments considered, omission of satellite-induced Doppler spread and directional antenna effects and lack of a transparent channel model generation procedure. To address these limitations, we re-derive the channel parameters using ray tracing (RT) over urban and rural environments based on ITU-R building statistics. Our results show that TR 38.811 substantially overestimates the K-factor at low elevations and predicts a decreasing trend with elevation, which is inconsistent with RT. The Ka-band clutter loss (CL) also exceeds the RT estimates by more than 15 dB in urban cases. It also underestimates rural delay spread (DS) at low elevations and predicts an elevation trend inconsistent with RT. We further quantify the previously neglected satellite-induced Doppler spread. Finally, we demonstrate that the conventional TR 38.811 channel generator significantly underestimates the K-factor in the presence of directional antenna (beamforming), while our modified generator substantially reduces this discrepancy.
- [105] arXiv:2611.13971 (replaced) [pdf, html, other]
-
Title: TransGHOST: Real-Time, Synthesis-Free Reconstruction of Instrument-Occluded Regions in Ophthalmic MicrosurgeryComments: 20 pages, 10 figures, 11 tablesSubjects: Image and Video Processing (eess.IV); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
Intraoperative scene perception in ophthalmic microsurgery is limited by instrument occlusion: when a tool enters the high-magnification field, it conceals tissue from both the surgeon and the perception components of robot-assisted systems that process the video. Generative inpainting can remove the occluder but replaces the missing image content with synthesis, which is unsuitable when visual provenance matters. Many video inpainters also depend on future frames and cannot operate online. We present TransGHOST, a causal reference-guided reconstruction pipeline whose non-generative safe mode operates in real time. Every restored value is obtained by resampling a recorded frame using geometric transforms fitted only to visible regions. The system provides per-pixel confidence and provenance and marks unsupported pixels as abstentions. We evaluate TransGHOST on a new veterinary clinical corpus of canine cataract surgery with pixel-level instrument and anatomy labels. Only the occluded region is scored, and each scoring target is verified to differ from the reference supplied to the system. Safe mode reaches 31.89 dB masked PSNR and 0.915 masked SSIM at 51.7 ms median and 85.5 ms 95th-percentile latency. On a pre-declared held-out cohort using instrument cutouts excluded from segmentation training, it reaches 29.83 dB masked PSNR, while matched-mask evaluation on validation shows a 3.45 dB advantage over LaMa. Region-aware reference selection improves masked PSNR by 3.60 dB over recency when candidate references can themselves be occluded. Reference-age analysis further defines the operating interval for the brief, repeated occlusions targeted by TransGHOST.
- [106] arXiv:2603.09600 (replaced) [pdf, html, other]
-
Title: A Variational Latent Equilibrium for Learning in Neuronal CircuitsSubjects: Neurons and Cognition (q-bio.NC); Artificial Intelligence (cs.AI); Neural and Evolutionary Computing (cs.NE); Systems and Control (eess.SY); Biological Physics (physics.bio-ph)
Brains remain unrivaled in their ability to recognize and generate complex spatiotemporal patterns. While AI is able to reproduce some of these capabilities, deep learning algorithms remain largely at odds with our current understanding of brain circuitry and dynamics. This is prominently the case for backpropagation through time (BPTT), the go-to algorithm for learning complex temporal dependencies. In this work we propose a general formalism to approximate BPTT in a controlled, biologically plausible manner. Our approach builds on, unifies and extends several previous approaches to local, time-continuous, phase-free spatiotemporal credit assignment based on principles of energy conservation and extremal action. Our starting point is a prospective energy function of neuronal states, from which we calculate real-time error dynamics for time-continuous neuronal networks. With this, as a first contribution we provide a simple and straightforward derivation of the adjoint method dynamical equations, the time-continuous equivalent to BPTT. Importantly, additional approximations are necessary to avoid unphysical temporal non-localities. One such approximation was recently proposed in Generalized Latent Equilibrium (GLE), but enforcing temporal locality of the backpropagating dynamics induces an error in the gain that becomes problematic when processing complex signals. Thus, our second contribution is to design a learning rule for the backward weights to find a fully local (in space and time) set of equations for neuron and synapse dynamics that corrects for this gain difference. With this inclusion of backward weight learning, our theory provides a rigorous framework for spatiotemporal deep learning in the brain, while simultaneously advancing a blueprint for physical circuits capable of carrying out these computations.
- [107] arXiv:2603.16411 (replaced) [pdf, html, other]
-
Title: RECOVER: Robust Entity Correction via agentic Orchestration of hypothesis Variants for Evidence-based RecoveryComments: Accepted to EMNLP 2026 Industry TrackJournal-ref: Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: Industry Track, pages 2939-2951, Budapest, HungarySubjects: Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
Entity recognition in Automatic Speech Recognition (ASR) is challenging for rare and domain-specific terms. In domains such as finance, medicine, and air-traffic control, these errors are costly. If an entity is entirely absent from the ASR output, text-only post-correction has little signal to recover it. To address this, we introduce RECOVER, an agentic post-ASR entity-correction framework. It leverages multiple hypotheses as evidence from ASR, retrieves relevant entities, proposes Large Language Model (LLM) correction under constraints, filters them through deterministic guardrails and uses an LLM critic that judges each surviving edit and can trigger a targeted feedback round to recover an entity the first pass missed. The hypotheses are used by one of several strategies, namely 1-Best, Entity-Aware Select, Recognizer Output Voting Error Reduction (ROVER) Ensemble, LLM-Select and Adaptive Routing. Evaluated across five diverse datasets over a Whisper-large-v3 baseline, it achieves up to 49% relative reduction in entity-phrase word error rate (E-WER) and increases entity recall by up to 14 percentage points while preserving the overall word error rate (WER), with LLM-Select the strongest strategy.
- [108] arXiv:2603.20891 (replaced) [pdf, html, other]
-
Title: Auto-differentiable data assimilation: Co-learning of states, dynamics, and filtering algorithmsSubjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Signal Processing (eess.SP); Dynamical Systems (math.DS)
Data assimilation algorithms estimate the state of a dynamical system from partial observations, where the successful performance of these algorithms hinges on costly parameter tuning and on employing an accurate model for the dynamics. This paper introduces a framework for jointly learning the state, dynamics, and parameters of filtering algorithms in data assimilation through a process we refer to as auto-differentiable filtering. The framework leverages a theoretically motivated loss function that enables learning from partial, noisy observations via gradient-based optimization using auto-differentiation. We further demonstrate how several well-known data assimilation methods can be learned or tuned within this framework. To underscore the versatility of auto-differentiable filtering, we perform experiments on dynamical systems spanning multiple scientific domains, such as the Clohessy-Wiltshire equations from aerospace engineering, the Lorenz-96 system from atmospheric science, the generalized Lotka-Volterra equations from systems biology, and the two-layer quasi-geostrophic model from geophysical fluid dynamics. Finally, we provide guidelines for practitioners to customize our framework according to their observation model, accuracy requirements, and computational budget.
- [109] arXiv:2604.26741 (replaced) [pdf, html, other]
-
Title: Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated LearningJournal-ref: IEEE Transactions on Wireless Communications, vol. 25, pp. 25941-25958, 2026Subjects: Information Theory (cs.IT); Signal Processing (eess.SP); Optimization and Control (math.OC)
In next-generation wireless edge systems, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is envisioned, where a single waveform simultaneously supports sensing, computing and communication via over-the-air computation (AirComp). Meanwhile, federated learning (FL) is widely regarded as a promising distributed machine learning framework that enables network intelligence in a privacy-preserving and secure manner, and exhibits strong synergy with AirComp, which alleviates the communication bottleneck of FL. In this paper, we study uplink Sig-ISCC design for AirComp-FL with joint target detection. We formulate the joint power and receive-scaling control problem, where edge devices' transmitted signals should serve both sensing and AirComp purposes. The goal is to minimize the AirComp aggregation distortion subject to a joint target-detection requirement. Although the resulting problem is non-convex in the original variables, we show that it admits an equivalent convex reformulation after a suitable variable transformation. By exploiting analytical optimality properties, we develop a robust, optimal, and polynomial-time-complexity algorithm that efficiently achieves the optimal transmit powers and receive scaling factor. Simulation results validate the optimality and numerical robustness of the proposed algorithm and show its superior FL performance compared to baseline methods.
- [110] arXiv:2610.03713 (replaced) [pdf, html, other]
-
Title: What Should World Models Forget? Stratified Retention for Continual AdaptationComments: Accepted to NeurIPS 2026 Workshop on Continual World Models. Project Website: this https URLSubjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV); Signal Processing (eess.SP)
Continual learning treats any drop in performance on previously seen data as forgetting, a convention inherited from settings where the prediction target is stationary. World models violate this assumption: their target is the environment, which changes, so knowledge that was accurate when learned can later become false, and revising it is correct behavior rather than a defect. Non-stationary ground truth is well studied in the concept drift literature and in the temporal factuality of language models, but it has not been formulated for world models, which are distinctive in that they also encode structural knowledge, such as physical laws and object permanence, that must never be degraded. We argue that continual world models need retention stratified by invariance timescale, the time over which knowledge stays true: invariants should be refined but never degraded, while instance-level facts should be revised once the environment changes. We show that standard forgetting metrics, used alone, count correct revision as forgetting and so rank a frozen model highest. We propose differential retention, which reports two quantities separately: invariant retention, checked after every adaptation round, and revision latency, the number of observations a model needs to pick up a change.
- [111] arXiv:2610.05503 (replaced) [pdf, other]
-
Title: Lightweight Semantic EEG Foundation Model for Frozen Cross-Disorder TransferComments: Withdrawn pending administrative review of publication-related requirementsSubjects: Machine Learning (cs.LG); Signal Processing (eess.SP); Neurons and Cognition (q-bio.NC)
Large-scale EEG foundation models have demonstrated promising transferability across neurological disorders, but often require millions of parameters and substantial computational resources. In this paper, we present the Universal Semantic EEG Foundation Model (USE-FM), a lightweight EEG foundation model that learns transferable neural representations through self-supervised signal reconstruction on the Temple University Hospital EEG Corpus (TUEG). After pretraining, the encoder is frozen and evaluated on two clinically distinct downstream tasks, abnormal EEG detection (TUAB) and epileptic seizure recognition (TUEP), using a unified frozen-transfer protocol against recent EEG foundation models, including LUNA-Base and CBraMod. With only 1.46 million parameters, approximately one-fifth the size of existing models, USE-FM achieves competitive overall performance, including strong sensitivity and F1-score on TUEP (SEN $75.00 \pm 14.14$, F1 $70.37 \pm 4.01$), while maintaining competitive performance on TUAB (AUC $85.24 \pm 5.61$). Beyond downstream classification, latent representation analysis using $k$-means clustering together with PCA and t-SNE demonstrates that USE-FM learns organized semantic EEG representations comparable to substantially larger foundation models. These results suggest that large-scale self-supervised pretraining enables lightweight architectures to learn transferable semantic EEG representations, providing a computationally efficient foundation for cross-disorder analysis and future clinical decision support in neurological disorders.
- [112] arXiv:2610.10850 (replaced) [pdf, other]
-
Title: Similar Predictive Fit but Different Latent Dynamics: Characterizing Learned Dynamical Structure in Personalized Models of Brain DisordersComments: Withdrawn pending administrative review of publication-related requirementsSubjects: Machine Learning (cs.LG); Signal Processing (eess.SP); Neurons and Cognition (q-bio.NC)
As AI models move toward clinical decision-making and personalized treatment, understanding \emph{what} a model learns is important beyond predictive accuracy alone. We investigate whether personalized latent dynamics reveal clinically associated differences even when predictive fit is similar. A lightweight CNN--Transformer EEG foundation model pretrained on the Temple University EEG Corpus (TUEG) extracts segment-level representations. Using the Temple University Epilepsy Corpus (TUEP), representations are mapped to a shared latent-state space, and sparse multinomial logistic transition distributions (mLTD) are fit independently to each subject to obtain personalized transition-dependency graphs $W_n$. Analyses include $n{=}198$ subjects (99 epilepsy / 99 non-epilepsy). At $k{=}4$, epilepsy subjects exhibit substantially denser learned dependency structure ($p{=}1.1\times10^{-7}$), with the same pattern at $k{=}6$ (19.90 vs. 13.46; $p{=}5.2\times10^{-5}$). Graph-derived features provide moderate group discrimination under 5-fold subject-wise cross-validation (AUROC 0.68 at $k{=}4$; 0.65 at $k{=}6$). In contrast, held-out log-likelihood is nearly identical between groups at $k{=}4$ ($-0.992$ vs. $-0.991$; $p{=}0.95$), with similarly matched next-state prediction (AUROC 0.855 vs. 0.861; $p{=}0.54$). Thus, similar predictive fit does not imply similar learned dynamics: groups can be comparably predictable while differing substantially in the internal dynamical structure learned by personalized models. This distinction motivates evaluating learned structure alongside predictive performance in personalized clinical models.
- [113] arXiv:2611.13243 (replaced) [pdf, other]
-
Title: GigaEdge Spench: An SDK for Practical Streaming Speech EnhancementComments: Additional checking requiredSubjects: Machine Learning (cs.LG); Audio and Speech Processing (eess.AS)
We present GigaEdge Spench, an open-source SDK for streaming speech enhancement on CPU servers, mobile devices, and in browsers. Applications can build enhancement channels from neural denoising, normalization and dynamics blocks, sample-rate conversion, and acoustic echo cancellation where supported. These stages can be combined, while normalization can also run without a neural model. The release includes an 8 kHz INT8 denoiser and discriminative and hybrid 48 kHz FP32 models. A shared C++ core supports ONNX Runtime and TensorFlow Lite through native interfaces, Android and iOS SDKs, and WebAssembly integration. Independent stream contexts share model resources, and consecutive frames from one stream can be processed in a single inference call. We evaluate the released models on EARS-WHAM v2 and compare their quality and processing costs with RNNoise and DPDFNet2. All tested native and Web configurations process files faster than real time, although larger chunks require more time to collect input. We also measure how many streams a shared model can process on a CPU. Our contribution is a configurable deployment system and an experimental study of how model choice, chunk size, and execution environment affect its use. All reported SDK timing uses ONNX Runtime. Index Terms: speech enhancement, streaming inference, cross-platform deployment, temporal frame grouping, computational efficiency
- [114] arXiv:2611.15162 (replaced) [pdf, html, other]
-
Title: Stealthy, High-Impact False Data Injection Attacks in Smart Grid Using Physics-Constrained GAN with Limited System KnowledgeComments: 11 pagesSubjects: Machine Learning (cs.LG); Systems and Control (eess.SY)
False data injection (FDI) attacks can distort power system state estimation while retaining plausible measurement patterns. Existing FDI methods trade stealth for impact or vice versa. They often assume access to internal grids, all-bus sensing, or defender models. In this paper, we propose a detector-agnostic physics-constrained generative adversarial network (PCGAN) that learns decoupled power-flow sensitivities from historical measurements of deployed sensors. The learned active-power-angle and reactive-power-voltage-magnitude relationships guide perturbations restricted to compromised channels, while adversarial training promotes realistic spatiotemporal patterns. We implement PCGAN and seven existing FDI attacks on the IEEE 300-bus system using one year of observed hourly demand from PJM Interconnection, a regional transmission organization in the United States, and synthetic bus-level load profiles. We compare their performance across 10%, 30%, 60%, and 100% compromised sensors. Attack stealth is assessed against ten machine-learning (ML) detectors and conventional bad-data detection (BDD) methods, while physical impact is quantified through nonlinear alternating-current weighted least-squares state estimation. PCGAN achieves 84.28% mean ML evasion and 22.31% mean spatial load misperception across the four scenarios. Its mean stealth-impact trade-off score reaches 18.69%, compared with 5.61% for the strongest competing attack. PCGAN also achieves 83.45% chi-square BDD evasion and 86.02% largest-normalized-residual BDD evasion. These results demonstrate a favorable stealth-impact balance under varying sensor-access levels and provide challenging attack cases for evaluating FDI detectors.