Papers

Recursive parameter identification in nonlinear stochastic state-space models is challenging because unknown parameters affect the measurements through latent-state dynamics. This paper develops a sequentialized ensemble Kalman inversion method for recursive parameter identification from streaming measurements. The proposed method represents the parameter posterior by an evolving ensemble and updates it sequentially as new measurements become available. For each parameter ensemble member, implicit particle filtering is used to approximate the predictive observation statistics required for parameter correction. This formulation enables recursive parameter learning. The method is evaluated on a strongly nonlinear benchmark, with comparison to several existing methods, and then on a nonlinear double-capacitor lithium-ion battery model. The numerical results demonstrate accurate recursive parameter identification and latent-state estimation.

Adaptive-sampling control balances control performance with resource efficiency. However, existing methods either fail to guarantee robust constraint satisfaction during rate transitions or require computationally expensive online optimization. This paper proposes an adaptive-sampling control framework for linear systems subject to polytopic state and input constraints and bounded additive disturbances. Given a time-varying reference control update rate provided by a reasoner, our framework continuously calculates Model Predictive Control (MPC) update rates that ensure robust constraint satisfaction at all time steps. Offline, robust M-step hold control invariance is used to precompute invariant sets for a list of update rates and transition sets between them. Online, these sets are used in real time to guarantee recursive feasibility and finite-time transitions to the reference update rate. The utility of the architecture is demonstrated in a cruise control simulation.

Recently, text-to-speech systems have made significant progress in speech expressiveness and controllability. However, the speaking style of generated speech typically relies on clear user-specified instructions. In natural conversations, speaking style should be naturally inferred from the preceding conversational context. Therefore, we propose COT-TTS, a context-aware, reasoning-based text-to-speech task. Given historical conversation audio, target text, and a reference speech, the system should comprehend the conversational context, infer an explicit intermediate reasoning, and finally synthesize the target speech with the specified timbre. To support this task, we constructed a large-scale bilingual conversational speech dataset comprising 9 million training samples, including a high-quality subset of 1 million samples. We further constructed a source-disjoint benchmark with 800 human-verified samples and established strong task-specific baselines. Additionally, we developed end-to-end autoregressive models with parameter sizes of 0.6B and 1.7B, generating emotion-labeled transcripts, editable speech style inferences, and speech tokens. Experimental results show that the proposed model achieves performance comparable to large-scale baseline systems with significantly fewer parameters. At the same time, the model performs well in terms of duration consistency and emotional consistency, and can generate appropriate emotional, stress, and rhythmic variations based on the conversational context. To facilitate future research, we will publicly release the data construction pipeline, dataset, trained models, and related resources. The demo page and additional resources are available at https://luckybian.github.io/COT-TTS

Density-Driven Optimal Control (D2OC) provides an effective framework for steering multi-agent systems toward prescribed spatial distributions. However, existing D2OC formulations are primarily developed for Euclidean domains and do not directly account for intrinsic manifold geometry. This paper extends D2OC to second-order multi-agent systems evolving on Riemannian manifolds. The proposed Riemannian D2OC (R-D2OC) constructs a local distribution objective in the tangent space of each agent through logarithmic maps and uses its weighted center as the reference for a finite-horizon LQR. The resulting control is executed on the manifold through intrinsic second-order dynamics and parallel transport within a receding-horizon scheme. We establish local curvature-dependent bounds that quantify the approximation introduced by the tangent-space reduction and characterize the resulting target bias. Furthermore, we derive a conditional discrete-descent result showing that the closed-loop objective decreases when a local velocity-alignment condition is satisfied. Numerical simulations on a 3D ellipsoidal manifold demonstrate distribution-level control and empirically support the proposed approximation and descent results.

This letter develops closed-loop performance certificates for a transformer-based feedback policy. The policy is trained to imitate optimal Linear Quadratic Regulator (LQR) control across a family of heterogeneous Multiple-Input, Multiple-Output (MIMO) Linear Time-Invariant (LTI) systems. First, we establish a finite-sample excess-risk bound for the imitation loss minimized during training. Second, for each fixed problem instance, we derive regional closed-loop guarantees consisting of a forward-invariant operating region and a worst-case bound on deviation from the optimal rollout. Our main result is a probabilistic certificate for finite-horizon closed-loop near-optimality. Using an exact LQR cost identity, we express excess cost as a measurable per-rollout statistic and use independent calibration and validation rollouts to obtain a high-confidence bound on its violation probability. We evaluate the certificate on $28$ benchmark systems. This uses the base policy on seen systems and system-specific fine-tuned copies on unseen systems, with each rollout drawing the plant, cost, and initial condition from the corresponding certification distribution. All per-system certificates have violation probabilities below $3.1\%$, each at $95\%$ confidence; twenty systems certify suboptimality below $10\%$, with the tightest threshold equal to $4.8\times10^{-6}$.

Implanted neurostimulators that sense local field potentials now enable chronic electrophysiology based biomarker tracking in patients at home. The Medtronic Percept PC, the only commercially available sensing-enabled deep brain stimulation (DBS) device, stores spectral amplitudes as 16-bit integers at approximately 0.1 $\mu$V per bit (quantum $q \approx 0.11$ $\mu$Vp). At frequencies where the true amplitude spans only a few quantization levels, consecutive bins round to the same stored value. Standard spectral parameterization (FOOOF, fitting oscillations and one over f), which separates periodic peaks from the aperiodic 1/f activity, treats every value as exact and fits oscillatory peaks to these plateaus. Because these spectra feed clinical biomarker pipelines and spectral foundation models for symptom decoding, spurious peaks can corrupt downstream inference. Across 9,438 spectra from 14 hemispheres in 7 subcallosal cingulate DBS patients, 20.6% of peaks detected at [2, 45] Hz have no match in ground truth synthesized by quantizing clean in-clinic BrainSense recordings, while aggregate beta band power and the aperiodic exponent are preserved. We formalize dequantization as interval-censored subspace estimation and compare five classes of correction methods. Quantized probabilistic PCA is the only tested method that reduces the spurious rate (20.6% to 18.3%) while preserving true peak detection and keeping noise floor RMSE below $q/\sqrt{12}$.

Reference signal received power (RSRP) is commonly used to assess 5G cellular coverage, but it may substantially overestimate the connectivity available to cellular-connected unmanned aerial vehicles (UAVs) under strong inter-cell interference (ICI). As a UAV ascends, reduced blockage can strengthen the serving signal, while increased line-of-sight visibility to neighboring sectors can intensify ICI. This paper develops a trajectory-aware, 3GPP-based system-level framework for evaluating UAV radio serviceability during a three-dimensional flight in an urban 5G New Radio network. The framework jointly evaluates RSRP, reference signal received quality (RSRQ), and signal-to-interference-plus-noise ratio (SINR) in a 19-site, 57-sector deployment. We introduce the concept of coverage-serviceability gap to quantify the difference between RSRP availability and joint service availability. Under RSRP, RSRQ, and SINR thresholds of -100 dBm, -18 dB, and 0 dB, respectively, an inter-site distance (ISD) of 500 m provides 99.9% RSRP availability but only 13.6% joint service availability, yielding a coverage-serviceability gap of 86.3 percentage points. With RSRQ and SINR thresholds of -22 dB and -6 dB, respectively, joint availability increases to 55.0% and 63.1% for ISDs of 500 m and 1000 m, respectively. These results demonstrate that RSRP-based coverage substantially overestimates joint UAV serviceability under both evaluation configurations, with SINR remaining the limiting metric.

Loss of Load Expectation (LOLE), originally calculated as the expected number of days of load loss, has also been used as a frequency metric. This paper shows that LOLE can indeed be calculated as a frequency metric, but only with restricted conditions, and that it differs fundamentally from the standard frequency metric employed in the frequency and duration (F&D) approach. A lack of understanding of these conditions can lead to incorrect applications and interpretations.

Three-dimensional fetal brain ultrasound offers non-ionizing, cost-effective imaging with rich spatial information for comprehensive anatomical assessment, yet its development remains limited by scarce data and annotations. In contrast, fetal brain magnetic resonance imaging has advanced further, supported by larger datasets and mature analysis methods. To leverage these resources, anatomical label maps provide a promising modality-invariant bridge for transferring knowledge from fetal brain magnetic resonance imaging to ultrasound. However, generating ultrasound images from label maps remains challenging because anatomy is tightly entangled with ultrasound appearance. To address this challenge, we separate anatomical correspondence learning from ultrasound appearance adaptation at both the data and model levels. Specifically, we propose the anatomy wavelet residual network, a two-stage framework combining wavelet diffusion and residual refinement. The first stage learns to generate volumes from label maps using atlas pairs in the wavelet domain, while the second stage learns bounded residual corrections from real clinical ultrasound in the image domain. This separation enables realistic synthesis with consistent preservation of normal and abnormal anatomy. Experiments on real fetal brain ultrasound show that our method outperforms representative synthesis methods, with normalized cross correlation of 0.518 versus 0.482 and Fréchet Inception Distance of 8.905 versus 13.319 for the strongest baseline. Beyond synthesis quality, volumes generated from fetal brain magnetic resonance imaging label maps also improve downstream segmentation, particularly for severe abnormal cases. Overall, these results highlight the potential of the proposed framework to leverage rich fetal brain magnetic resonance imaging resources for advancing three-dimensional ultrasound analysis.

Electrodermal activity (EDA) is widely used for pervasive stress monitoring because of its sensitivity to sympathetic arousal and its computational efficiency. However, research remains fragmented: studies concentrate on a small subset of available datasets, preprocessing and evaluation protocols are inconsistent, and widely adopted methodological conventions remain unvalidated. Existing reviews summarize these practices without evaluating them under a common protocol. To bridge these gaps, this paper presents a comprehensive survey and benchmark for EDA-based stress detection. We review the technical pipeline from preprocessing to modeling and compile 26 public datasets and 22 representative unimodal studies to inform future dataset selection and methodological design. Under a subject-independent protocol spanning five diverse datasets, we benchmark decomposition, filtering, and channel-input choices alongside a broad range of machine learning (ML) and deep learning (DL) models in both in-domain and cross-domain transfer settings. Our results provide the first multi-dataset validation of cvxEDA, the default decomposition method, show that feature-based ML outperforms end-to-end (E2E) DL, and identify ecological validity as a key factor in cross-domain transfer. We conclude with directions toward robust, data-efficient, and trustworthy deployment.

The Chinese remainder theorem (CRT) is highly sensitive to remainder errors. Robust CRT addresses this problem by recovering the folding integers correctly from erroneous remainders, so that the final reconstruction error is bounded by the remainder error level. The existing dynamic range–robustness tradeoff results mainly assume a uniform remainder error bound, where all remainders share one scalar error bound. This paper studies the exact tradeoff when the remainder error bound is a vector in the sense that different remainders may have different error bounds. For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination. Based on this condition, we characterize the largest admissible range length, called the dynamic range, for a given remainder error bound vector. Conversely, for a given range length, we characterize all remainder error bound vectors under which remainder errors can be tolerated. We also give an exact folding integer vector decoding algorithm. We show that the proposed results reduce to the classical CRT in the error-free case and coincide with the known result when all remainder error bounds are equal. Numerical results show that the dynamic range depends on the full remainder error bound vector. They also show that the remainders are coupled in the robustness, which cannot be captured by a single uniform error bound.

Semidefinite programming (SDP) certificates for feedback systems containing deep neural networks (NNs) typically scale with the total number of neurons, whereas small-gain tests are scalable but can be highly conservative. This paper develops a unified and scalable framework for incremental robust stability and performance analysis of feedback interconnections involving high-dimensional NNs and unmodeled dynamics. By combining a structured decomposition of the full-order SDP condition with scalable Lipschitz constant estimation algorithms, we derive reduced verification conditions that certify incremental convergence and incremental $\ell_2$-gain bounds. The dimensions of the resulting control-analysis linear matrix inequalities (LMIs) depend only on the widths of the last two network layers and are independent of network depth. The framework preserves the coupling between the plant and the NN, with the incremental small-gain condition recovered as a special case. To further reduce conservatism, we develop a multi-round alternating update scheme that iteratively refines the coupling variables while preserving scalability. Numerical experiments show that the proposed framework achieves state-of-the-art incremental $\ell_2$-gain bounds for large-scale NN feedback systems.

We establish the positive semidefiniteness of a class of Hermitian Cauchy-like matrices associated with real Hurwitz polynomials having distinct zeros. Writing the zeros as $-\lambda_1,\ldots,-\lambda_n$, the matrix entries are defined through ratios of elementary symmetric polynomials in the variables $\lambda_i$. The result extends an earlier positivity theorem obtained under the assumption that all zeros are real. We first show that the coefficients appearing in the denominators are nonzero, so that the matrices are well defined. We then construct an explicit congruence between each matrix and the solution of a Lyapunov equation whose state matrix is in companion form. Positive semidefiniteness follows from a recent result on such equations with entrywise nonnegative right-hand-side data. This approach establishes the extension to complex zeros through the connection between structured matrices and Lyapunov equations.

This paper introduces Representation-to-Decision (R2D), an end-to-end imitation learning framework that maps heterogeneous multi-horizon time-series inputs directly to battery control decisions through modular Temporal Feature Extractors (TFEs) and a shared latent representation, without an explicit load and PV forecasting step. While accurate forecasting improves prediction quality, optimal control performance remains unguaranteed in prediction-then-optimization pipelines; standard Reinforcement Learning (RL) lacks the long-horizon temporal awareness due to short-window observations, even when forecast signals are available as additional inputs. R2D offers a different perspective: rather than forecasting first and deciding second, it learns to decide directly from raw temporal inputs, with control optimality anchored by an aging-aware Mixed-Integer Linear Programming (MILP) expert through Behavior Cloning (BC). Benchmarked against six controllers on a high-fidelity electro-thermal battery simulation across five industrial sites, R2D achieves 62–77% of the global clairvoyant optimum, outperforms the tested Model Predictive Control (MPC) and RL benchmarks, and yields battery degradation nearly identical to its MILP teacher across all five sites. Comprehensive ablation studies over temporal backbone, model size, expert formulation, aging-cost weighting, and horizon configuration confirm that an LSTM encoder with a 15-minute single-step control horizon provides the most robust and deployment-ready configuration, and cross-site and single-factor out-of-distribution tests show that generalization to unseen profiles is profile-dependent, with policies trained on high-activity sites transferring most reliably.

AI training loads can exhibit rapid power fluctuations because their power demand differs significantly between computational and communication phases, creating challenging ramp rates at the data center point of common coupling (PCC). Integrating battery energy storage systems (BESS) in data centers is a promising mitigation option. This paper proposes a hybrid BESS control strategy that combines droop-based grid-forming (GFM) control with instantaneous load current-based compensation to suppress high frequency load fluctuations. The GFM control loop regulates the long-term power exchange of the BESS, while the load-following control provides fast compensation for short-term AI workload fluctuations. Communication delay between the load current measurements and the BESS controller is explicitly modeled, and its impact on smoothing performance is analyzed. To mitigate delay-induced degradation, a predictor-based compensation method is incorporated into the BESS control structure. High-fidelity electromagnetic transient simulations are conducted to validate the proposed approach. Results demonstrate effective smoothing of AI training load fluctuations across different grid strength conditions and under time varying communication delays.

We present a candidate counterexample to a conjecture stating that the existence of a Lyapunov-Krasovskii functional with a pointwise dissipation rate is sufficient for the input-to-state stability of time-delay systems. The counterexample has been derived through interactions with large language models.

Robotic ultrasound (US) calibration is essential for accurately relating US images to the robot coordinate system, but accurate and automated calibration remains challenging because existing methods often require complex phantoms or external 3D trackers. In this work, we develop a tracker-free robotic US calibration framework using a spherical-marker phantom and a highly automated perception pipeline for sphere-center localization. The proposed threshold-free image-processing method localizes the spherical feature based on each US image's intensity distribution, eliminating hand-tuned intensity thresholds and improving robustness across imaging settings without per-system retuning. Multi-pose observations of the spherical fiducial are then used to estimate the US-to-EE transformation without external tracking or prior localization of the sphere center in the robot base frame. We validate the proposed framework on a robotic US platform through repeated sphere scans and further assess the calibrated system using geometrically distinct phantoms with known CAD models. Across 12 cross-validation folds, single-marker calibration achieved sphere-center accuracy and precision of $1.75\pm0.51$ mm and $0.85\pm0.11$ mm, respectively, compared with $1.72\pm0.51$ mm and $0.84\pm0.12$ mm for three-marker calibration. Across the three reconstruction sets, the single-marker calibration yielded pooled post-registration point-to-surface MAE$\pm$SD values of $0.41\pm0.35$ mm for the cone and $0.50\pm0.41$ mm for the triangular prism, closely matching the three-marker results of $0.40\pm0.35$ mm and $0.48\pm0.40$ mm, respectively.

Weighted Signal Temporal Logic (WSTL) is increasingly used as a scoring function in learning-to-rank problems of trajectories with safety guarantees, where its weighted quantitative semantics serve as a parametrized utility function. Despite the growing interest, prior work only assumes the expressiveness of WSTL formulas and empirically demonstrates its utility in capturing diverse preferences. This work focuses on the correctness of this assumption and asks whether using WSTL formulas as scoring functions is theoretically justified. We formalize two concepts: first, rank-realizability, which asks whether all rankings of a given signal set are achievable by varying weights, and, second, rank-capacity, the maximum signal set size for which the formula is rank-realizable. We propose a Mixed-Integer Linear Program to decide rank-realizability, and derive constructive lower bounds for rank-capacity. Experiments on a robotic navigation task show that while a practical WSTL specification may fail to be rank-realizable on a set with similar trajectories, its rank-capacity exceeds the size of the trajectory set. Analysis of Boolean-equivalent formulas reveals that formula structure affects expressivity and that rank-capacity can be increased without altering qualitative semantics.

Scanning Electron Microscopy (SEM) is a foundational technique for characterizing material microstructure, which dictates many fundamental physical and chemical properties. With the rise of Self-Driving Labs (SDLs), samples are now synthesized in large batches, demanding equally high-throughput, autonomous characterization. Existing automated electron microscopy pipelines are task-specific: they detect pre-defined features, optimize known properties, or require prior knowledge of the sample, restricting each pipeline to the material system it was built for. We introduce AutoRASOR, a task-agnostic autonomous SEM pipeline that captures the multi-scale morphology of an unknown sample without domain-specific pre-training, fine-tuning, or human prompting. AutoRASOR embeds micrographs in real time with a vision foundation model (VFM), DINOv3, and selects regions of interest (ROIs) through two complementary policies: Latent Farthest Point Sampling (LFPS) and active learning on morphological ambiguity, which is the conditional variance of unresolved fine-scale features given lower magnification appearance. Active learning on ambiguity consistently captures more diverse and rare morphologies than random ROI selection, while LFPS reliably recovers the specimen's morphological distribution within a limited capture budget, tested both on real SEM micrographs and synthetic phase-field images. By shifting autonomous characterization from pre-defined, task-specific targeting of features to morphological survey, AutoRASOR generates information-rich multi-scale datasets for diverse downstream tasks. Without the need for domain-specific pre-training or prior material assumptions, this framework can be deployed out-of-the-box to characterize novel materials produced by SDLs.

Accurate delineation of bi-atrial structures from late gadolinium enhancement MRI (LGE-MRI) is an important prerequisite for structural analysis and future fibrosis-quantification workflows in atrial fibrillation (AF). However, automated segmentation is challenging due to thin-walled anatomy, domain shifts across imaging centres, and limited benchmarking of existing methods. This study presents a two-stage segmentation framework and benchmarking platform for evaluating how ROI localisation, encoder design, 2D/3D dimensionality, and ensemble fusion affect bi-atrial wall and cavity segmentation across multicentre LGE-MRI datasets. The framework integrates 3D localisation and fine segmentation using 2D and 3D U-Net variants with ResNeXt encoders and compares them with convolutional, transformer-based, and state-space architectures. { Evaluation across three independent cohorts assessed accuracy and cross-domain transfer without target-domain fine-tuning. Cavity segmentation transferred more consistently across centres than atrial wall segmentation, while wall performance remained sensitive to domain shift, particularly in the Kobe cohort.} By quantifying how 2D, 3D, and ensemble architectures behave across centres and between walls and cavities, this work provides a reproducible benchmark for future methodological development and clinical validation.

Purpose: Contrast-enhanced breast MRI depends on intravenous gadolinium-based contrast agents, motivating methods that synthesise post-contrast appearance from pre-contrast images alone. The MAMA-SYNTH Challenge (MICCAI 2026 Deep-Breath Workshop) evaluates such synthesis across four metric groups: image fidelity, tumour region of interest, downstream classification, and downstream segmentation. The four group ranks are averaged, so optimising a single objective is insufficient. Materials and Methods: We developed a lesion-gated hybrid synthesis pipeline. A lesion probability map, estimated from the pre-contrast slice alone by an ensemble of pre-contrast-only segmentation networks, spatially coordinates a tumour-focused regression pathway and a background-focused Pix2PixHD synthesis pathway, followed by a region-dependent calibration of the predicted enhancement. Training used the public MAMA-MIA collection with a patient-level split. Inference consumes a single pre-contrast 2D slice, with no mask, no post-contrast image, and no auxiliary metadata beyond image geometry. Results: On internal validation (n = 120 patients) the method reached MSE 0.523, LPIPS 0.185, and tumour-region SSIM 0.495. It was submitted to the hidden external 300-case test cohort as a self-contained inference container. The method ranked sixth in the official MAMA-SYNTH Challenge leaderboard. Conclusion: A test-compatible lesion probability map derived from the pre-contrast image can coordinate complementary tumour-focused regression and background-focused perceptual synthesis, enabling balanced virtual contrast enhancement under a multi-metric challenge setting.

Background: Four-fold accelerated sensitivity encoding (SENSE4) can shorten brain MRI acquisition time but may amplify noise and result in residual aliasing artifacts after conventional reconstruction. Purpose: To evaluate whether an image-domain refinement framework can improve the quality of SENSE4 brain MRI while preserving anatomical information for quantitative measurements. Methods: In this prospective paired study, 80 participants underwent fully sampled and four-fold accelerated SENSE T1-weighted MRI. We developed an Anatomy-aware Residual Attention Network (ART-Net) to refine accelerated reconstructions through generalized self-attention and correlation-based residual artifact regularization. Participant-level splitting yielded training, validation, and independent test cohort (45/5/30 participants). The independent test cohort underwent quantitative, segmentation-based, and blinded radiologist assessments of image quality and anatomical preservation. Results: ART-Net demonstrated highly competitive reconstruction performance, achieving the highest peak signal-to-noise ratio (31.03 +/- 2.88 dB) and structural similarity index (0.963 +/- 0.022) among evaluated methods. It also demonstrated improved anatomical fidelity, with numerically highest Dice coefficients for medial temporal structures relevant to atrophy assessment (0.8824 +/- 0.0827) and whole-brain regions (0.8857 +/- 0.0885). Moreover, ART-Net improved gradient fidelity, regional contrast preservation, and radiologist-rated structural quality. Conclusion: ART-Net improved agreement between SENSE4 and fully sampled T1-weighted images in a single-center, held-out test cohort while maintaining segmentation-derived anatomical measurements. These findings suggest that ART-Net may support accelerated brain MRI by improving image fidelity and enabling reliable downstream anatomical analysis.

Two immiscible viscous fluids in pressure-driven channel flow can be unstable through their interface when their viscosities differ, at arbitrarily small Reynolds number — the instability Yih found in 1967. The unstable state is the interface itself: a curve inside the domain, separating the two fluids, whose displacement is governed by a partial differential equation of its own and which moves the fluid domain with it. Actuation is at one wall only, so the state to be controlled is reached across a fluid. We stabilize this interface at any rate below the limit set by the streamwise mean flow, by static feedback of the two velocity components of that wall, through a Fredholm backstepping transformation acting jointly on the two layers. The target is the two-fluid Stokes problem, shifted, with the transmission of stress between the fluids kept and the coupling of the interface into them removed. Two findings about the two-fluid spectrum carry the design: joined at the interface, the eigenvalue sequences of the two layers, which collide for a dense set of layer ratios when the layers are uncoupled, avoid each other uniformly, so no degeneracy has to be assigned; and the slowest mode left to viscosity is not a bulk mode but the capillary relaxation of the interface, whose rate is linear rather than quadratic in the wavenumber, which sets the band of actuated wavenumbers. The controller is tested on the nonlinear two-fluid channel, switched on against a saturated interfacial wave.

The large-scale integration of renewable energy into electrical power systems places a growing reliance on grid-forming converters (GFMs) to overcome critical stability and control hurdles. By emulating a slowly varying voltage source behind a tunable resistive?inductive impedance, GFMs enable precise setpoint tracking and vital grid support. In this regard, virtual admittance (VA)-based inner-loop control provides exceptional flexibility in shaping the converter's small-signal immittance at connection terminals, allowing for advanced GFM functionalities. This article addresses a novel internal-model-control-based VA approach, which inherently accounts for the effects of the inner current-control loop and the voltage feedforward. Unlike the state-of-the-art VA control, the proposed VA control ensures that, at frequencies outside the influence of outer loops, the converter's terminal admittance closely matches the target admittance, which is shown to be relevant for stability. It is revealed how, with the state-of-the art VA control, a small-signal instability in the harmonic range may arise if a low-pass filter with a high cut-off frequency is used for the voltage feedforward. However, the proposed VA control ensures stable operation regardless of this cut-off frequency. The methodology is experimentally validated using a laboratory prototype that features three-phase voltage-source converters.

Detector shifting is used in industrial cone-beam computed tomography to reduce ring artifacts, but the resulting detector motion can vary nonuniformly across projection views and produce detector positions that cannot be represented by fixed offsets. Although analytical reconstruction can accommodate this motion, approaches that use projection interpolation or rebinning may limit spatial resolution and introduce artifacts. MBIR provides an alternative by representing the acquisition geometry explicitly within the reconstruction model. Existing separable distance-driven MBIR formulations assume fixed detector geometry across projection views and therefore cannot directly represent nonuniform motion in both detector dimensions, as this motion changes the voxel-to-detector mapping. We extend the separable distance-driven MBIR model to incorporate recorded horizontal and vertical detector displacements into the distance-driven overlap computation while leaving measured projections unchanged. Forward-projection validation achieved an NRMSE of 0.0338 across 1080 views. The proposed model achieved a 3D SSIM of 0.9404 and NRMSE of 0.0406, compared with 0.5396 and 0.1740 for fixed-detector MBIR. A second industrial dataset showed reduced structured artifacts compared with FDK.

Accent conversion is the task of modifying a speech recording so that it sounds closer to a target accent while preserving linguistic content and other speaker-related characteristics. Most accent conversion systems use trained, generative models. Although they can induce target-accented speech, the strength of accent modification is not controllable at inference time, making it difficult to analyse how the strength of accent conversion affects source preservation. We propose Partial Accent-Control Editing (PACE), an accent conversion framework based upon the editing of frozen WavLM representations without the training of an accent-conditioned generator. A constrained edit is first applied to source WavLM features, which are then fused with target-accent reference features retrieved from non-parallel accent examples. Fusion weights are used to control the trade-off between accent conversion strength and the degradation of other source attributes. Using a suite of five metrics, and with the cost of accent-entangled speaker similarity, we show that PACE is substantially superior to a pair of competitive baselines in terms of both accent conversion and source preservation.

Spatial room impulse responses (SRIRs) capture directional distributions of acoustic sound-sources and their reflections. However, collecting SRIRs of moving sound-sources remains a challenge, requiring complex interpolations across measurements that account for multi-path spatial-temporal dynamics. This paper investigates the Wasserstein metric and displacement for evaluating interpolated SRIR echo densities in the spherical harmonic domain. We present novel sum-of-magnitude square expansions for efficiently fitting probability density functions, maximizing likelihood, inverse sampling, and computing spherical sliced Wasserstein interpolations. Experiments compare the Wasserstein displacements and metric to linear and geometric interpolations of SRIR image-source densities on a line-path, and demonstrate model-order reduction.

Modern power systems can encounter increased discrepancy between the operators' simulation model and the actual true dynamics of the grid, driven by uncertainties caused by integration of new inverter-based resources (IBRs), large loads, unmodeled dynamics, parameter drifts, etc., to name a few. All of these impact the control room operations, where some critical oscillations may not be captured during the transient studies. To circumvent these issues, we propose a learning-augmented hybrid approach where the operator simulation model is supplemented with artificial intelligence (AI)-learned residual models using the phasor measurement unit (PMU)/ point-on-wave (PoW) based sensed trajectory data. The physics-based operator model provides interpretability and structural consistency, while the learned residual captures discrepancies caused by non-idealities. The learned model employs advanced neural architectures and consists of a backbone encoder and multi-head decoder layers for heterogeneous grid channels. Subsequently, we formulated a continual learning-motivated adaptation framework such that the baseline residual AI model can also be updated when the underlying real grid model changes in future conditions. Extensive numerical simulations are performed on the IEEE 68-bus benchmark model with a diverse set of disturbances, and different state-of-the-art predictive architectures involving recurrent learners, latent neural ODEs, and transformers are explored to demonstrate both residual learning and adaptation capabilities.

This letter studies event-triggered linear-quadratic-Gaussian (LQG) control for multi-agent systems sharing a communication network with limited per-step capacity. Although the agent dynamics are decoupled, the communication decisions are coupled through the shared network constraint, leading to a constrained multi-agent scheduling problem. We show that the optimal control law remains certainty-equivalent and decouples across agents through independent finite-horizon Riccati recursions, whereas the transmission schedule remains globally coupled. Based on this structure, we develop a centralized receding-horizon scheduling framework and reformulate the resulting problem as a mixed-integer linear program (MILP) using a closed-form characterization of the estimation-error covariance. To improve scalability, we derive a window-based skip-pruning condition that safely fixes consecutive transmission decisions to zero before solving the MILP, and we propose an auction-inspired scheduler based on one-step transmission-benefit scores. Numerical results show that the proposed model predictive control (MPC) scheduler achieves the best trade-off between control performance and communication cost, while the auction-based scheduler attains performance close to MPC with substantially lower computational complexity.

Interval Markov decision processes (IMDPs) provide a natural framework for modeling stochastic systems with uncertain transition probabilities, represented by probability intervals and resolved adversarially. Such uncertainty arises naturally, for example, when the transition model is learned from finite data or obtained through model-based reinforcement learning. In this paper, we study the automata-theoretic verification of IMDPs against rich temporal specifications, including all LTL specifications, by considering the broader class of {\omega}-regular objectives. We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals. For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata). For unstable IMDPs, where intervals may include zero while the upper bound is strictly positive, verification becomes game-like and requires automata whose nondeterminism can be resolved on the fly (good-for-games automata). Building on these insights, we develop algorithms for verifying {\omega}-regular specifications over IMDPs and derive probabilistic guarantees when the interval model is learned from sampled data. The resulting framework enables principled verification of stochastic systems under probabilistic model uncertainty, connecting automata-based verification with data-driven stochastic modeling.