Papers

Underactuated systems pose a challenge for convex motion planning because their dynamically feasible motions lie on a manifold of trajectories in function space. Building on our earlier formulation of polytopic action sets (PAS), this paper presents a method for rapidly generating, online, trusted convex sets of short-horizon actions for underactuated and potentially nonlinear systems. Around a nominal trajectory, we construct local finite-dimensional action coordinates in which each parameter vector encodes a complete nearby motion through an affine trajectory map, rendering collision-avoidance and control bounds linear. To remain consistent with the nonlinear dynamics, we introduce a dynamics-violation metric and extract a trusted convex inner approximation using an IRIS-inspired inflation procedure directly in action space. The resulting PAS are reusable convex families of actions that can be queried and composed with linear programs, and a PAS-guided tree expansion treats nodes as composed reachable families rather than single trajectories, coupling local nonlinear fidelity with convex reuse for longer-horizon planning. The planner solves cluttered planar scenes in tens of milliseconds (14-78x faster than a kinodynamic RRT baseline) and reduces terminal error on a nonlinear underactuated benchmark by 26-86% over sampling and NLP baselines.

Device-free human pose estimation using commodity WiFi signals has emerged as a promising paradigm for pervasive sensing in mobile computing systems. However, existing approaches often suffer from severe performance degradation when deployed across heterogeneous environments due to complex multipath propagation and domain shifts in wireless signals. In this paper, we present a physics-informed WiFi sensing framework for robust 3D human pose estimation under mobile and cross-environment settings. Our approach explicitly models wireless signal propagation characteristics and incorporates multipath-aware attention to capture environment-dependent signal variations. To further improve generalization, we introduce a disentangled representation learning scheme that separates pose-related features from environment-specific factors, enabling effective cross-domain adaptation without requiring extensive retraining. We implement our system using commodity WiFi devices and evaluate it on multiple public benchmarks, including Person-in-WiFi-3D and MM-Fi, as well as real-world deployments across diverse indoor environments. Experimental results demonstrate that our framework significantly improves robustness and generalization performance compared to state-of-the-art methods, particularly under cross-environment scenarios. These results highlight the potential of physics-informed wireless sensing for enabling reliable, scalable, and infrastructure-free human-centric applications in mobile computing systems.

Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL). Our approach encodes discrete-time STL formulas into candidate time-varying control barrier functions (CBF), which are integrated into a model predictive path integral (MPPI) controller. Our method inherits the benefits of low computational cost from an efficiently parallelizable sampling based planner and utilizes CBF for constraints expressed in STL. We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency. We show a quadcopter planning experiment with NVIDIA Isaac Lab.

Differential binary noise (DBN) modulation encodes information in the polarity transition of a reused noise realization, dispensing channel state information and carrier-phase recovery. This letter proposes single-input multiple-output (SIMO) reception for DBN via post-correlation decision-statistic combining, followed by one zero-threshold decision. The combined statistic is a Hermitian quadratic form in complex Gaussian vectors, yielding an exact conditional bit error probability (BEP) with no Gaussian approximation. Averaging it over $\kappa$-$\mu$ fading and the reused energy gives the exact BEP for arbitrary weights. Because that energy is shared, its deep fades are common to every branch, and the observation length caps the diversity order at $\min(M\mu,N)$. The deflection-optimal weights follow in closed form and interpolate soft combining and power weighting. Measured 65 GHz indoor non-line-of-sight (NLoS) results quantify the trade-off between spatial resources and observation length.

Repetitive maritime operations can be effectively learned using the Imitation Learning (IL) paradigm, which transfers human expertise directly to Unmanned Surface Vehicle (USV) control systems. Dynamical Systems (DS) are widely used to model non-linear human demonstrations while offering inherent stability guarantees. However, real-world execution under persistent marine perturbations reveals a critical trade-off: standard DS-based IL approaches prioritize global target convergence at the expense of localized trajectory reproduction fidelity. To address this limitation, we present a hybrid learning-control architecture that integrates a DS-based IL reference generator with a neuroadaptive controller. Our approach introduces a control action that drives the USV back to the demonstrated path following exogenous disturbances, enabling dynamic human-like reactive alignment-termed behavioral tracking. The proposed methodology is validated using the Marine Systems Simulator (MSS) toolbox. Simulation results confirm that the framework generalizes complex maneuvering tasks while substantially improving trajectory tracking fidelity under disturbances compared to alternative control strategies.

Open, cloud-native, and AI-enabled 6G architectures make network functions easier to deploy, observe, and replace, often implemented with separate software modules. However, each explicit interface can also create an entry point, trust transition, and lateral-movement route from a cybersecurity perspective. This paper formulates architectural disaggregation as a graph-based Stackelberg design game for 6G system security. A deployment graph specifies candidate 6G system seams, while an architecture-dependent directed attack graph specifies externally reachable functions and multistage paths. The defender commits to seams and allocates hardening and monitoring; an informed attacker then chooses a path and effort. Because edge traversal and evasion factors compose multiplicatively, the attacker's path response becomes a shortest-path problem after a logarithmic transformation. Convex effort costs admit a conjugate representation, and, for each fixed architecture, the defender's control problem is a convex exponential-epigraph program solvable by path generation. We derive an architecture-comparison criterion, a threshold for AI transducers within 6G systems that jointly add visibility and exposure, and comparative statics for attacker entry and bypass innovation. Experiments with stylized standards-anchored O-RAN/6G systems over RAN, RIC, core, cloud, and edge-AI functions show that neither full integration nor maximal disaggregation is generally best. Uncontrolled seams can increase risk, whereas selectively monitored and hardened seams can improve the Stackelberg objective. We find a boundary is worthwhile only when its detection and containment gains exceed its added attack opportunities and coordination cost.

Reconstructing the full-aperture channel of a fluid antenna system (FAS) from a few activated ports requires inferring unobserved responses from limited spatial samples. This paper proposes a covariance-domain FAS channel-reconstruction method based on nonnegative least squares (NNLS). A nonuniform port arrangement constructs a difference coarray with an enlarged aperture. Vectorizing the sample covariance maps the physical array to a virtual steering dictionary, and the resulting complex covariance-fitting model is recast as a strictly equivalent real-valued NNLS problem. A projected-gradient iteration initialized at zero estimates the nonnegative angular-occurrence coefficients, and the L_s strongest well-separated peaks yield the angles of arrival (AoAs). Simulations show that the proposed FAS-NNLS estimator exploits the enlarged virtual aperture and achieves lower AoA mean squared errors than uniform linear array (ULA) multiple signal classification (ULA-MUSIC) and ULA estimation of signal parameters via rotational invariance techniques (ULA-ESPRIT). Its non-line-of-sight (NLoS) path accuracy matches FAS covariance matching pursuit, while its line-of-sight (LoS) estimation is significantly improved.

Walsh-sequence-based receiver architectures offer an alternative approach for the reception and reconstruction of multiple simultaneous RF signals over wide bandwidths. While previous works have focused on the architecture and theoretical operation of Walsh-domain processing, limited experimental results have been reported so far on hardware operation under realistic conditions. This paper presents the experimental evaluation of a Walsh-sequence-based receiver prototype. A measurement campaign was conducted under various signal placement, interference, and receiver configuration scenarios. Reconstructed spectra, Walsh-lane power spectral densities (PSDs), and Error Vector Magnitude (EVM) measurements were used to investigate Walsh-domain signal representation, interference effects, and receiver performance. Finally, dense- spectrum experiments involving up to ten simultaneously active signals demonstrate the potential of the architecture for low power wideband spectrum sensing applications.

We consider a federated reinforcement learning setting involving $M$ agents, all of whom interact with a common Markov Decision Process (MDP). The agents exchange information via a central server to learn the optimal value function. Our goal is to understand to what extent one can hope for collaborative sample-complexity speedups in such a setting, when a small fraction of the agents are adversarial and can act arbitrarily. To that end, we propose Robust Fed-Q}, a federated Q-learning algorithm that blends ideas from both model-based and model-free RL, along with the median-of-means device from robust statistics. We prove that despite corruption, with high-probability, Robust Fed-Q (i) guarantees exact convergence to the optimal value function in the limit of infinite samples, and (ii) enjoys near-optimal finite-time rates that benefit from collaboration. In addition, our approach requires just $\tilde{O}(1)$ rounds of communication to achieve each of the above guarantees, a feature of independent interest in FL where communication is the major bottleneck.

Traffic sensor placement in large urban networks must balance traffic monitoring needs with limited installation, maintenance, and data-management budgets. This study develops a framework for preserving network-wide traffic information while reconstructing flow and density at unobserved links and the macroscopic fundamental diagram (MFD). The framework combines normalized mutual information (NMI) with Inductive Graph Neural Network Kriging (IGNNK). NMI quantifies lag-aware dependence between joint flow-density states, while a greedy algorithm selects sensors by balancing weighted information coverage against redundancy. An IGNNK-based bidirectional graph-diffusion model reconstructs unobserved link states and generates the MFD. The framework was evaluated against a principal component analysis (PCA) benchmark using seven hours of dynamic traffic assignment simulation data for the Chicago network, with 4,805 directed links and 420 one-minute intervals split into training, validation, and independent testing subsets. Reconstruction performance for both PCA and NMI-IGNNK varied substantially over the sensor ratios of 0.5% to 30%. PCA generally yielded lower root mean squared error (RMSE) over the 0.5%-3% range, but its errors were nonmonotonic and reached their minimum at 2%. At 3%, normalized joint RMSE was similar for PCA and NMI-IGNNK (0.100 and 0.105, respectively). NMI-IGNNK remained applicable up to 30% coverage and generally improved as coverage increased, reducing testing-subset normalized joint RMSE from 0.212 at 0.5% to 0.043 at 30%, with consistent trends over the complete analysis period. The framework integrates lag-aware, information-theoretic sensor placement based on joint flow-density states with directed graph-based reconstruction, enabling a broad range of sensor budgets in large-scale networks without strict limits on the number of sensors.

Real-time optimization (RTO) relies on process models to locate economically optimal operating conditions. Because developing first-principles models requires significant process knowledge, data-driven alternatives are increasingly attractive. Modern machine-learning models can fit historical plant data accurately and often pass standard validation tests. Whether such models can be trusted for economic optimization, however, remains unclear. We investigate this question using a vinyl acetate monomer benchmark process with a unique, well-conditioned economic optimum. We train a structured hybrid model that combines known mass balances and thermodynamics with a neural-network closure for unknown kinetics, and a fully data-driven neural ordinary differential equation (ODE) model. Both models reproduce plant measurements accurately and exhibit little variation in predictions across random initializations. Yet their economic optima differ substantially from that of the plant. Where the plant returns a single optimum on multistart search, the trained models return many phantom optima. We further show that the training optimizer alone can be yet another source of error. Even with noise-free data and initialization at weights that recover the plant optimum, stochastic gradient training can drift to weights that yield substantially worse RTO solutions. The identified model is thus an artifact of the training optimizer as well as the data. These results demonstrate that a good predictive fit of all available measurements does not guarantee reliable economic performance. A data-driven model for RTO should at least be required to recover the optimum on a decision-oriented benchmark like the one developed here before being considered for plant testing and application.

Segmenting ischemic stroke lesions on T1-weighted (T1w) MRI acquired across different scanners and protocols without intensity standardization is difficult because lesions are subtle and share intensity characteristics with cerebrospinal fluid. Standard deep learning architectures trained across multiple centers plateau around Dice 0.66, with acute lesions ($\le 7$ days post-stroke) performing substantially worse due to severe sample scarcity. We combine a MedNeXt-L ($k=5$) backbone with on-the-fly 3D CarveMix augmentation that pastes real lesion patches into healthy brain regions during training. By generating synthetic lesion placements dynamically within each fold with subject-level split isolation, the model sees more diverse lesion patterns without requiring pre-generated copies on disk. We evaluate on 1,453 native T1w scans from 55 clinical centers in the ISLES 2026 challenge. Our method achieves a mean 5-fold cross-validation Dice of 0.648 at 500 epochs, a +0.018 improvement over the MedNeXt-L backbone at a matched training budget (0.630)

Cardiac cine-MRI serves as a direct visual indicator of cardiovascular hemodynamics by capturing the continuous wall motion of the aorta. Quantifying these dynamic structural changes across the cardiac cycle is essential for measuring aortic distensibility, a primary marker of arterial stiffness. However, standard 2D segmentation networks focus on each frame independently. Consequently, when rapid systolic flow temporarily obscures the aorta's boundaries, this lack of continuous context results in frame-to-frame tracking dropouts and boundary inconsistencies. Spatiotemporal ($2\text{D}+t$) networks can enforce temporal consistency across the sequence but suffer from a scarcity of expert annotations. To address this, we present a semi-supervised spatiotemporal ($2\text{D}$ to $2\text{D}+t$) knowledge distillation framework exploiting the cardiac cycle. The framework distills a spatial teacher's expertise into a spatiotemporal student network by executing a dynamic latent interception, pairing a recurrent spatiotemporal bottleneck with a residual spatial bypass. Our model selection strategy applies a baseline validation threshold ($\text{DSC} \ge 0.50$) prior to selecting the epoch that maximizes anatomical consistency. This strategy enables the spatiotemporal student model to achieve superior surface tracking accuracy ($\text{NSD@1mm} = 92.3\% \pm 0.2\%$) and high structural reliability ($\text{Frac}_{2\text{CC}} = 99.2\% \pm 0.6\%$), reducing population-wide structural anomalies by over 56% compared to a 2D nnU-Net baseline.

This paper proposes a critical weather scenario screening framework for identifying weather conditions that can trigger high-voltage (HV) events in the power grid. Unlike conventional weather-aware contingency analysis limited to component-level outage risk, our framework screens weather scenarios as potential drivers of grid-level voltage violations. Given a non-critical weather scenario, we seek the perturbation over the high-dimensional weather space to maximize a pre-defined voltage criticality score, by using a differentiable weather-to-voltage (W2V) predictive model to facilitate the gradient update over a compact latent space. Specifically, a non-negativity constraint is used for achieving physically-consistent perturbations, with another L1-norm based constraint for bounded perturbation. The latter could promote sparse and interpretable perturbations, and this uniform budget also yields a sensitivity-aware vulnerability ranking across different weather scenarios. Numerical experiments on a 6717-bus synthetic Texas system have effectively demonstrated the potential of weather uncertainty in triggering HV events, and this potential cannot be represented by the voltage analysis of individual weather scenarios. Interestingly, the most vulnerable scenarios are characterized by wind-dominated perturbation patterns concentrated in high wind-capacity regions, coinciding with observations from actual power flow data and experiences in real system operations.

Psychological research on emotion dynamics has established that human affect is a continuous, evolving process: emotions rise, decay, and transition within seconds. Current emotional text-to-speech (TTS) systems, however, condition on a single discrete label or static embedding per utterance, fundamentally misaligning with the temporal nature of affect. While recent LLM-based TTS systems may implicitly vary prosody through text understanding, such variation is neither explicitly controllable nor precise enough for targeted intra-utterance transitions. We address three challenges: (1) a multi-pass flow blending pipeline synthesizes frame-aligned transition audio, circumventing the scarcity of natural intra-utterance transitions; (2) dual-stage Valence-Arousal-Dominance (VAD) conditioning guides prosodic planning in the LLM and acoustic realization in the flow decoder via frame-level VAD embeddings; (3) direction-magnitude decoupled injection structurally separates emotion direction from injection magnitude, preventing content degradation. EmoTra-TTS adds only +0.43% parameters with no latency overhead, achieves 30%-87% relative improvement on emotion transition quality, corroborated by 64.4%-79.5% overall win rates in pairwise preference tests against four SOTA baselines and two commercial systems.

Audio-visual speech enhancement (AVSE) uses a target speaker's visible articulation to recover that speaker's voice from overlapped speech. Yet most evaluation protocols rely on synthetic mixtures and reliable video. The ISCSLP 2026 Real-World AVSE Challenge addresses both gaps. Track~1 combines naturally recorded two-talker mixtures, which lack a clean reference, with reference-available remixes of the same speakers; Track~2 additionally degrades the target video in five ways and adds 3-m far-field recordings. Sixteen and twelve teams were ranked on speaker-disjoint test data by rank averaging over waveform fidelity, predicted quality, transcription accuracy, and speaker similarity. On Track~1 remixes, the best system reaches 12.7~dB SI-SDR and 0.85 STOI, but natural recordings remain harder: even the lowest CER rises from 9.0% to 14.7%. The leading systems use video mainly for speaker attribution rather than signal reconstruction, and the top two lose under 0.5~dB SI-SDR on Track~2. UTMOS and DNSMOS rank systems differently from the other metrics, so no single metric captures target-speech recovery. We release the baselines, evaluator, and official results.

Accurate brain tumor segmentation from magnetic resonance imaging (MRI) is essential for diagnosis, treatment planning, surgical guidance, and disease monitoring. However, developing automated segmentation models that generalize across diverse tumor characteristics, imaging protocols, acquisition sites, and patient populations remains challenging. Variations in tumor morphology and imaging distributions can substantially degrade performance outside the training domain. Consequently, improving the robustness and generalization of deep learning-based segmentation models has become a key objective in medical image analysis. To improve segmentation robustness, we propose Multi-Stage Dynamic Prompt nnU-Net, a prompt-conditioned extension of nnU-Net. Three independent dynamic prompt modules are inserted into the deepest encoder stages. Each module contains a learnable bank of ten 256-dimensional prompt vectors and uses globally pooled encoder features to generate image-specific prompt representations. These representations are projected into feature-wise scaling $(\gamma)$ and shifting $(\beta)$ parameters that modulate encoder feature maps through Feature-wise Linear Modulation (FiLM), enabling adaptive feature conditioning at multiple semantic levels. Evaluation on the BraTS GOAT validation dataset demonstrated that the proposed Multi-Stage Dynamic Prompt nnU-Net outperformed the baseline nnU Net across the majority of evaluated metrics and tumor subregions. The proposed model achieved average lesion-wise Dice scores of 76.16% (ET), 80.04% (TC), and 86.42% (WT), compared with 74.38%, 78.14% and 84.01% for the baseline model. The results demonstrate that multi-stage dynamic prompt conditioning improves segmentation accuracy and boundary delineation for brain tumor segmentation.

Rapid and accurate fault detection in high-voltage transmission networks is essential for grid reliability and equipment protection. Transmission fault datasets are frequently imbalanced, and certain fault types produce electrical signatures that fall within the normal operating envelope, causing single-model classifiers to fail on safety-critical cases. This paper proposes a hybrid two-stage machine learning pipeline that decouples detection from classification. Stage 1 combines an Isolation Forest anomaly detector with an optional supervised binary detector through an OR-fusion rule; the supervised branch is allocated automatically during training for any fault class the anomaly detector cannot resolve, and is omitted when no such class exists. Stage 2 applies a Random Forest multiclass classifier only to samples flagged by Stage 1. Feature engineering is expressed as a per-measurement-point operator mapping six raw channels to eighteen features, including zero-sequence symmetrical components derived from Fortescue's theorem, yielding 18L features for L measurement points. On the TLFaultDataset, the pipeline raises Line-fault end-to-end accuracy from 31.3% to 95.8%. On an independent single-point dataset, the same framework attains 97.25% end-to-end accuracy across all classes including normal operation, exceeding the TLFed federated benchmark of 94.84% without GPU or federated infrastructure, at 0.05 ms per sample on CPU. Ablation on both datasets shows zero-sequence features resolving the three-phase versus three-phase-to-ground ambiguity, raising the F1-score of that class pair from 0.39 to 0.997. The direction of the zero-sequence signature is found to be system-dependent, motivating a learned decision boundary in place of a fixed relay threshold.

Ballistocardiography (BCG) is promising for unobtrusive long-term blood pressure (BP) monitoring in laboratory settings, but traditional BCG signals are vulnerable to the variations in body-bed interaction with shifted fiducial points in temporal or amplitude axis, and BP varies with personal hemodynamic changes, causing misaligned representations that affect model generalizability and robustness. In this work, we propose Phy-BP, a physics-constrained BP estimation framework based on triaxial bodyseismography (BSG) acquired using bed-mounted sensors as an extension of single-axis BCG. Firstly, we design an adaptive quality-control algorithm combining neighboring beat patterns and universal cardiogenic templates to retain reliable cardiac components. Secondly, we propose a physical model of wave propagation through the body-bed system to constrain latent feature evolution, aligning triaxial representations generated by a shared cardiogenic excitation. These mechanical constraints connect multi-axis feature learning to body-bed dynamics and complement data-driven regression from vibration signals. Evaluation on a 162-hour hospital dataset from 21 subjects against invasive arterial BP yields a mean absolute error of 5.07 mmHg, a prediction-error standard deviation of 7.24 mmHg, and a Pearson correlation coefficient of 0.86 for mean arterial pressure. This framework is intended for unobtrusive monitoring during rest and sleep, with potential applications in overnight hospital and home monitoring.

The capacity of Low Earth Orbit (LEO) to sustain space operations is under mounting pressure from megaconstellations, legacy fragmentation debris, and new payload classes. Existing assessments of orbital capacity and debris evolution are largely deterministic, tracking mean populations of intact satellites and fragments with ordinary differential equations; they cannot capture the inherent randomness of collisions, breakup sizes, and launch schedules. We develop a stochastic extension of the two-species Lotka–Volterra model of Bradley and Wein, formulated as a density-dependent Markov chain, and study its deterministic and stochastic scaling limits. Because intacts and fragments differ by many orders of magnitude, these limits emerge on distinct time-scales, and different pathways to a collisional Kessler cascade become visible only on the appropriate time horizon. On a fast intact time-scale we obtain an ODE approximation and a Gaussian SDE approximation; on an intermediate fragment time-scale we obtain an ODE approximation, a Gaussian SDE approximation, and the critical Kessler threshold, above which the ODE approximation runs away in Kessler syndrome. Crucially, on a third, slow time-scale at the critical threshold, the fragment count converges to a Feller diffusion, in which runaway is triggered purely by fluctuations rather than by the drift—an effect the ODE approximations and their Gaussian SDE approximations cannot see. Debris runaway may occur sooner, and with higher probability, than deterministic models predict: the intact population can appear well-behaved while fragments quietly accumulate risk. Constellation deployment, debris-removal investment, and slot allocation should account for these stochastic effects, and planning for runaway must depend on the variance of the collision dynamics, not on the mean alone.

A machine learning-assisted framework for the inverse design of pixelated millimetre-wave patch antennas targeting the 22–30 GHz band is presented. The antenna surface is represented as a 19x23 binary pixel grid on a Rogers RT/duroid 5880 substrate, where each pixel is either metal or empty, with a continuous electrical path from the feed enforced by design. An initial dataset of approximately 6,000 full-wave CST simulations was collected from structured random pixel patterns, of which only around 40% achieved a resonance with |S11| <= -10 dB anywhere in the band, resulting in an imbalanced dataset. To improve simulation efficiency, an XGBoost binary classifier was trained on this data to distinguish resonant from non-resonant patterns before simulation. Using the classifier as a pre-simulation filter, an additional 4,000 patterns were selected and simulated, raising the overall proportion of resonant designs in the combined 10,000-sample dataset from approximately 40% to 52%. A hybrid CNN-BiLSTM forward surrogate was then trained on this augmented dataset to predict the full complex S11 response across 801 frequency points, using a physics-guided composite loss that explicitly emphasises resonance dip accuracy. Finally, an inverse design model was developed that optimises in a compact 64-dimensional latent space using gradient descent to generate pixel patterns matching a desired S11 specification. The results show good agreement between the surrogate-predicted and CST-simulated |S11| responses for the generated designs and demonstrate the feasibility of automatically designing and reconfiguring antenna structures.

Dynamic operating envelopes (DOEs) are increasingly used to publish time-varying export limits that keep distribution networks within operational limits. Purely technical DOE allocation, however, can systematically privilege electrically favorable prosumers, while embedding fairness directly into a single-period optimal power flow (OPF) objective mixes network feasibility, equity and efficiency in a way that obscures the cost of fairness. This paper proposes a two-stage, multi-period framework that addresses both of these. Initially, a technical distributed OPF computes network-feasible export envelopes. The subsequent stage then applies a dynamic aggregate export budget and redistributes capacity through cumulative proportional fairness, limiting the additional curtailment by an admissible efficiency budget. The resulting fair DOEs are treated as first-stage decisions, while battery storage provides scenario-dependent recourse under demand and renewable uncertainty. The operational problem is solved by a calibrated regional alternating direction method of multipliers (ADMM) on a lossless LinDistFlow model and independently validated using AC power flow. On the IEEE 33-bus feeder over a 24-hour horizon, the technical benchmark yields 2.1097 MWh of renewable curtailment, whereas the fairness-constrained allocation increases curtailment to 5.7216 MWh but caps the maximum cumulative curtailment ratio at 11.20% and raises Jain fairness indices close to unity, with AC voltage deviations below 0.01 p.u. and no voltage or thermal violations under the adopted 0.90-1.05 p.u. limits. Results show that considering both storage (which alleviates curtailment impact) and multi-period fairness (which increases curtailment) is an interesting approach for modern DOE design, which in turn requires a multi-period, co-designed approach.

Design-space exploration of configurable Cyber-Physical Systems (CPS) requires executable evaluation when design choices affect timing, fault propagation, recovery behavior, and temporal-property satisfaction. Repeated stochastic executions make exhaustive exploration impractical for large design spaces. This paper presents a temporal-property-driven CPS design workflow using Reinforcement Learning (RL). At design time, the RL agent selects subsystem alternatives to assemble a candidate system model. The model is then evaluated through simulation, during which online temporal-property monitors observe runtime traces and produce functional-property violation indicators. These indicators are combined with evaluated non-functional terms for budget, recoverability, sustained compliance, and operational use to calculate the reward used for subsequent candidate selection. The workflow is evaluated on a methane-sensitive mine-pump CPS. The corresponding executable case-study model is provided as additional contribution. RL-guided search identifies the highest-reward design observed in the experiments after 26 episodes (corresponds to 130 executable simulations). These designs were reached with fewer simulations than surrogate-guided Bayesian Optimization and population-based Genetic Algorithm baselines under the same executable model and reward formulation. Ablation study results indicate that value-based feedback and reuse of previous simulation traces contribute to this reduction.

Reconfigurable intelligent surfaces (RISs) have emerged as a promising technology for improving communication reliability in radar-communication coexistence (RCC) scenarios, particularly for communication users (CUs) located inside radar exclusion zones, where only the radar is permitted to operate and the two systems remain uncoordinated. In such settings, CUs may suffer from strong radar interference whose phase is random and difficult to track while also facing difficulty in obtaining accurate CSI from the base station. These challenges become even more critical in the presence of RIS phase errors, which limit the applicability of conventional coherent detection methods. Motivated by these practical limitations, this paper develops an RIS-assisted RCC framework for a CU operating in an uncoordinated RCC setting. Within this framework, we derive two practical maximum-likelihood (ML)-based detectors, both of which avoid tracking the radar interference phase: 1) a non-coherent detector that does not require instantaneous CSI and incorporates RIS phase uncertainty, and 2) a mismatched coherent detector that relies on imperfect CSI. For the non-coherent case, we derive an exact likelihood expression and a closed-form detector in the low to moderate SINR regime. For the imperfect CSI case, we derive the corresponding closed-form detector in the low-to-moderate SINR regime, and analyze performance through pairwise error probability (PEP), yielding a tractable approximation based on Gauss-Chebyshev quadrature. Numerical and analytical results show that the proposed non-coherent detector closely matches the optimal ML detector, validating its practical usefulness.

Cyber-physical systems (CPSs) consist of sensors, controllers, and actuators through communication and physical interactions, making them vulnerable to attacks on measurements, control logic, and equipment operation. Graph-based attack detectors, especially graph attention models, can localize such attacks by learning edge-adaptive interactions over communication and physical interaction graphs. However, their computational cost grows rapidly with neighborhood size, and their inference latency can reach tens to hundreds of milliseconds in large-scale or densely connected graphs, delaying time-critical alarm generation. To enable real-time deployment of graph attention mechanisms for attack detection, we propose GraphGHHA, a graph-native attention acceleration layer designed as a replacement for graph attention layers in attack detection units. GraphGHHA combines (i) a graph-local sparse attention branch that is constrained by the adjacency matrix of the CPS, and (ii) a global linear mixing branch to retain system-wide information. A learnable gate combines the two branches node-wise, preserving detection accuracy under strict latency constraints. We evaluate GraphGHHA on a networked heating, ventilation, and air conditioning (HVAC) cyber-physical system under representative attack scenarios and demonstrate up to an eight-fold reduction in detection latency while maintaining high detection accuracy. These results indicate that GraphGHHA enables practical, real-time alarm generation for large-scale CPS monitoring.

This paper develops a direct data-driven framework for robust positively invariant (RPI) set synthesis for unknown linear time-invariant systems under state-feedback and observer-based output-feedback scenarios. The feedback and observer gains, along with the RPI sets, are directly synthesized from noisy offline data by solving semidefinite programs (SDPs), avoiding intermediate model identification or explicit model-uncertainty set construction. In the state-feedback case, a linear-quadratic (LQ)-type feedback gain is first computed, and an ellipsoidal RPI set is then synthesized for the resulting closed-loop dynamics. In the observer-based output-feedback case, offline data are used to compute the observer gain and the corresponding RPI set for the system state through an augmented-state formulation. This design provides a unified method for invariant-set computation in both scenarios, and the direct data-driven formulation avoids the explicit construction and propagation of an intermediate model-uncertainty set. Numerical examples illustrate the effectiveness of the proposed method.

This paper presents a fully reconfigurable RF vector modulator (RFVM)-based phase shifter for wideband beamforming phased array of 6G/NextG satellite communication (SATCOM). It covers the frequency range from S-band up to Ku-band. Specifically, the proposed RFVM features a novel vector modulation approach that relaxes the frequency constraint in conventional scenario while avoiding applying a quarter all-pass filtering (QAF) network. It achieves a topology that RF input signal is divided into multi-branch transversal sections where each branch enables individual gain weightings and phase delays. By resumming the signals from all branches, the output signal of proposed RFVM can realize a full 360 degree phase shifting while it preserves magnitude response in wideband scenario.

This paper describes a fuel blending algorithm based on artificial intelligence and model predictive control. A gas-fired power plant was modeled using physical laws and on-site measurements. A neural network is used to calculate the methane number of the fuel and determine the fuel blending ratio limits so that the methane number is within the limits specified by the engine manufacturer. A model predictive controller adjusts the final blending ratio to meet safety requirements and minimize operating costs. The algorithm was tested in simulations with different scenarios and a reduction in both the operating costs and amount of flaring was observed.

This paper addresses the fundamental design problem of plug-and-play distributed energy resource (DER) systems, which are emerging as a scalable solution for integrating distributed generation through user-driven connection of modular units. In such systems, the number of connected units is not fixed but dynamically varies due to user operation and system conditions, requiring stability and operational constraints to be guaranteed over a range of system sizes rather than for a single configuration. To address this challenge, we propose the Plug-in DER Orchestrated Grid (PDOG) and develop a normalized analytical framework in terms of normalized delay and aggregate loop gain. This formulation enables explicit characterization of the stability boundary together with a lower bound derived from the no-reverse-power constraint, defining a feasible region for system operation. By mapping this feasibility condition into the number of DER units, the admissible range of connectable units is obtained as a function of delay. The analysis reveals a fundamental trade-off: while the theoretical stability limit increases with normalized delay, implementation-induced gain amplification reduces the practical hosting capacity. As a result, the admissible system size exhibits a non-monotonic dependence on delay, and a feasibility boundary may emerge beyond which no admissible system size exists. These results provide explicit design guidelines for determining the number of DER units under delay and implementation constraints, establishing a new paradigm in which system scalability is explicitly constrained and engineered.

Dual-Orthogonality waveforms are multi-antenna signaling schemes that enforce mutual orthogonality across transmit channels and over a prescribed set of delay shifts. By relaxing strict time orthogonality to the physically admissible propagation region, they preserve full-band operation per transmit antenna while embedding communication data and maintaining stream separability. This makes them attractive for Integrated Sensing and Communications (ISAC), where reliable data transmission, high-resolution sensing, and imaging must coexist under time-varying propagation. In dynamic multipath environments, delay-Doppler dispersion across multiple paths perturbs the transmit subspaces and partially breaks the relaxed orthogonality conditions. This paper analyzes this effect and develops a multipath-aware decoding framework based on structured parameter estimation, effective-subspace reconstruction, and low-complexity linear equalization. Numerical results show communication performance comparable to OFDM-based ISAC and MIMO-OTFS baselines while improving sensing and imaging through full-band per-transmit operation. The proposed approach achieves approximately 30 cm range resolution, more than 15 dB suppression of multipath imaging artifacts with coherent SAR processing, and a favorable sensing-communication trade-off. Over-the-air experiments at 60 GHz validate multi-stream communication, the designed zero-correlation region, and accurate radar ranging. A second campaign in a highly reflective indoor environment further demonstrates multipath-aware stream equalization under strong unsuppressed reflections.