Papers

Weaving ramps are critical bottlenecks in highway networks due to conflicting traffic flows and complex interactions among heterogeneous vehicle types. In mixed-autonomy settings, the presence of controllable autonomous vehicles (AVs) introduces new opportunities to influence system-level outcomes, yet the structural impact of such control remains poorly understood. This paper develops a unified equilibrium framework to capture, predict, and optimize aggregate lane-choice behavior in weaving ramps with heterogeneous vehicle populations. We first formulate a Wardrop-based model capturing the selfish behavior of human-driven vehicles (HDVs) and establish existence, uniqueness, and validity of the resulting equilibrium. We then introduce a Stackelberg–Wardrop formulation in which AVs act as strategic leaders optimizing system performance, while HDVs respond through equilibrium adaptation. The framework is further generalized to incorporate heterogeneous behavioral preferences of HDVs and AVs via a Social Value Orientation (SVO) model. Our analysis reveals a fundamental structural property of mixed-autonomy traffic systems: under selfish HDV behavior, the impact of AV penetration is inherently non-increasing, exhibiting plateau regions where performance remains unchanged and improves only at critical thresholds. These results provide principled guidance for the design of AV control and incentive mechanisms in the presence of selfish human behavior, and demonstrate how strategically controlled autonomous agents can be deployed to induce system-level efficiency gains in mixed-autonomy transportation networks.

This study presents a controlled parametric framework for analyzing energy storage planning under uncertainty in a multi-stage model predictive control setting. The framework enables a broad and systematic exploration through parametrized generation of synthetic datasets in the context of energy price arbitrage. It facilitates the study of the joint effects of battery characteristics, signal structure, forecast uncertainty, and planning horizon on revenue performance in energy storage optimization, which are rarely considered together. The analysis is driven by two objectives. First, it characterizes how these interacting factors influence operational revenue and its sensitivity to planning horizon selection, including economic losses caused by deviations from optimal horizons. This provides guidance on expected horizon ranges and their impact on revenue and computational cost. Second, it enables a compact parametrization of the relationships between battery properties, data characteristics, forecast uncertainty, and horizon-dependent performance, providing a basis for future modelling of optimal planning horizon length. Results show that the framework captures consistent structural dependencies across configurations and provides meaningful guidance for horizon selection under uncertainty. In particular, increasing forecast uncertainty systematically reduces the optimal planning horizon across battery types, reflecting the diminishing value of long-term information under increasingly unreliable forecasts. Comparison with real market data shows that the parametrization reproduces the main qualitative trends of optimal horizon behavior, suggesting its potential as a lightweight surrogate for more complex simulation-based analysis.

The decoupling of multivariate functions is a powerful modeling paradigm for learning multivariate input-output relations from data. For the single-layer case, established CPD-based methods are available, but the multi-layer case remained largely unexplored. This work introduces a tensor-based framework for multi-layer decoupling, which is based on ParaTuck-type tensor decompositions and constrained optimization. We provide theoretical justification behind the considered tensor decompositions and parameterizations. Furthermore, we formulate a structured coupled matrix-tensor factorization that incorporates both Jacobian and function evaluations, together with a bilevel optimization approach for adaptively balancing first- and zeroth-order information. The feasibility of the proposed methodology is illustrated on synthetic systems, a nonlinear system identification benchmark and neural network compression.

Power system simulation workflows remain expert-intensive. Engineers must translate study intents into code or API calls, execute analyses, and interpret outputs. To automate this workflow, this paper presents PFAgent, a tractable and self-evolving power-flow agent for interactive grid analysis. PFAgent integrates four key capabilities: i) a tractable and interactive architecture for intent parsing, knowledge retrieval, tool execution, and structured reporting; ii) a self-evolution mechanism combining verification-driven refinement and human-in-the-loop feedback; iii) an AI-assisted evaluation and debugging loop that leverages conversational context, generated code, and execution errors for iterative fixing; and iv) an evaluation framework covering task success, convergence validity, numerical consistency, and explanation quality. Verification on IEEE benchmark systems shows that PFAgent can automate case change, analyze voltage violations, perform N-1 contingency analysis, generate plots and concise summaries, and return reproducible results with transparent execution logs. The proposed framework highlights a shift from conventional simulation tools to interactive, tractable, and self-evolving agents for power system analysis.

Rain attenuates Ku-band satellite signals by up to 20~dB, encoding precipitation information along the Earth-space slant path. This paper derives the Bayesian Cramér-Rao bound (BCRB) for rain rate estimation from LEO broadband OFDM downlinks. Using corrected ITU-R P.838-3 coefficients, the standard CRB yields a minimum detectable rain rate $R_{\min} \approx 4.3\mmh$ for a single link at the $38^\circ$ reference elevation. We derive the prior Fisher information in closed form for log-normal rain ($c_v = 1.05$, from 186{,}292 samples) and show that a single-snapshot BCRB reduces $R_{\min}$ to $1.1\mmh$; exploiting temporal correlation ($\rho = 0.95$) over a 30-min window further tightens it to $0.95\mmh$, while multi-link fusion across $N = 215$ links lowers the operating-point RMSE lower bound at $R = 20\mmh$ to approximately $0.07\mmh$. Building on these bounds, we formulate a weather-adaptive pilot allocation that minimizes the BCRB subject to a hard spectral-efficiency constraint, characterize its three-regime structure (full-sensing, throughput-tracking, outage), and pair it with a CUSUM rain onset detector achieving sub-10-min delay for $R \geq 20\mmh$. A closed-form analysis of dynamic LEO slant geometry identifies a sensing-optimal elevation at the P.618-validity floor of $15^\circ$ that yields a $1.58\times$ geometric improvement over the $38^\circ$ baseline, exposing a structural anti-correlation between sensing- and communication-optimal elevations along an orbital pass. Validation against 9.4~million radar samples from 215 Ku-band GEO satellite links ($r = 0.72$, RMSE~$= 1.24\dB$) and 113 rain gauges confirms the underlying attenuation model; the bounds transfer to LEO constellations under matched OFDM signal parameters, with dedicated LEO validation left for future work.

System identification remains an intriguing challenge for lithium-ion batteries, as many models are nonlinear, exhibit multi-physics coupling, and involve a large number of parameters. In this paper, we address this challenge using the ensemble Kalman inversion (EnKI) method for battery system identification. EnKI performs maximum a posteriori parameter estimation through successive local Gaussian approximations, enabling an iterative and incremental search for unknown parameters. The search combines Monte Carlo sampling with Kalman-type updates to evolve an ensemble of samples, thereby offering empirical stability and the ability to handle strongly nonlinear models. We validate the proposed approach on two equivalent circuit models with coupled electro-thermal dynamics, through both simulation and experiments. The results demonstrate that the proposed approach achieves accurate parameter estimation with rapid iterative convergence, and it shows strong potential for application to other battery models.

We propose CisLunarSense, an opportunistic integrated sensing and communication (ISAC) framework that exploits the Lunar Gateway's Ka-band relay for monostatic debris detection, addressing the absence of cislunar space situational awareness infrastructure beyond the reach of ground-based radars. Using NASA/ESA-documented system parameters with author-selected sensing settings and a CR3BP-based 9:2 near-rectilinear halo orbit model, we derive the orbit-phase-dependent Cramér–Rao bound under OFDM inter-carrier interference, quantify a 36~dB cislunar sensing advantage over a ground-based Ka-band reference, and design a velocity-adaptive processor with mode switching at 337~m/s. Gateway operational debris ($v_\mathrm{rel} < 50$~m/s) is detectable within 700~km with over 30~minutes of warning; external threats ($v_\mathrm{rel}$ up to 500~m/s) remain detectable within 400–630~km. An orbit-phase-adaptive allocation reduces the sensing duty cycle from 60% to 19%, increasing relay throughput from 44 to 90~Mbps. A closed-form sensing outage probability for $K$-CPI non-coherent integration under Swerling~I fluctuation shows that the 10%-outage detection range reaches 91% of the deterministic maximum at the nominal operating point $K = 16$.

Brain organoid interfaces that seek neuromodulator readout benefit from chemical receivers with molecular specificity and tolerance to drift. This paper presents a receiver-centric theoretical study of a control-referenced tri-channel organic electrochemical transistor (OECT) receiver with dopamine- and serotonin-selective pixels alongside a hydrogel-matched control pixel. The Ag/AgCl electrode provides the electrochemical gate reference, whereas the control pixel is used only as a matched reference for common-mode drift and other low-frequency baseline fluctuations during amplitude decisions. We couple finite-duration release, restricted diffusion with clearance, aptamer binding, OECT transduction, and correlated thermal, flicker, and drift noise, and we evaluate MoSK, CSK-4, and a 2-bit Hybrid detector on the same front-end by Monte Carlo simulation. At $r=45$ micrometers, control referencing mainly benefits the Hybrid amplitude branch, reducing Hybrid SER from $3.71\times 10^{-2}$ to $1.09\times 10^{-2}$ at $N_m=1.40\times 10^4$ molecules/symbol while barely changing the MoSK component. In calibrated no-ISI front-end benchmarks, Hybrid+CTRL reaches an LoD of 11866 molecules/symbol at 45 micrometers and remains below CSK-4+CTRL over much of the medium-to-long-distance range studied. The reported SER and LoD values are scenario-based receiver forecasts, whereas the more transferable result is the regime-dependent rule for when matched control referencing benefits Hybrid amplitude decoding.

Energy infrastructure planning under uncertainty has become increasingly complex as electrification, interdependence between energy carriers, decarbonization, and extreme weather events reshape long-term investment decisions. This paper surveys recent advances at the intersection of generation and transmission expansion, and optimization under uncertainty, with a focus on stochastic programming, robust optimization, and distributionally robust optimization. We then categorize modeling needs along the axes of modeling fidelity, uncertainty characterization, and solution methods to identify dominant modeling features and trace research gaps. We further examine emerging directions at the interface of optimization and machine learning, including surrogate modeling, learning uncertainty sets, probabilistic forecasting, and synthetic scenarios, and discuss how these tools can be embedded within infrastructure planning models.

Artificial intelligence (AI) is driving rapid growth in electricity demand, yet the grid-facing power dynamics of AI data centers remain poorly understood. Here we show that, in shared-GPU systems, the composition of batch and inference workloads decouples aggregate power variability from short-horizon ramping. As the inference share rises, variability becomes U-shaped, whereas ramping becomes hump-shaped, particularly under higher loading. The magnitude and turning points of these patterns also depend on system loading. Using a trace-calibrated framework linking workload arrivals, queueing, scheduling, and GPU power, we show that the underlying mechanism is asymmetric. At intermediate workload mixes, queued batch jobs fill capacity left idle by fluctuating inference demand, reducing aggregate power variability. However, short-horizon ramping remains elevated because inference-side fluctuations propagate more directly into realized power. AI data centers should therefore be understood as dynamic systems whose workload composition shapes their grid impact.

We study whether second-order systems can be made to behave like prescribed first-order dynamical systems through feedback control. More precisely, we study whether prescribed vector fields on compact smooth manifolds, viewed geometrically as sections of the tangent bundle, can be asymptotically stabilized in a strong sense by second-order control systems on the base manifold. Our class of second-order systems includes most Lagrangian systems, and we obtain both positive and negative results. The positive result asserts that, for fully actuated systems, the section corresponding to any smooth vector field can be made globally exponentially stable, normally hyperbolic, and more. In particular, not only does each closed-loop solution asymptotically have the prescribed velocities, but it also converges to a trajectory of the first-order dynamics generated by the prescribed vector field at an exponential rate. Thus, the closed-loop second-order system asymptotically reproduces the prescribed first-order dynamics. In contrast, the negative result asserts that, for underactuated systems on manifolds with nonzero Euler characteristic, sections corresponding to "almost all" smooth vector fields cannot even be locally asymptotically stabilized. This includes, in particular, all vector fields with only isolated zeros. An example shows that the Euler characteristic assumption is necessary for the negative result.

In the field of medical image segmentation, the scarcity of labeled data poses a major challenge for existing models to accurately perceive target regions. Compared with manual annotation, gaze data is easier and cheaper to obtain. As a classical semi-supervised learning framework, mean-teacher can effectively use a large number of unlabeled medical images for stable training through self-teaching and collaborative optimization. Our study is based on the mean-teacher framework. By combining gaze data, it aims to address two crucial issues in semi-supervised medical image segmentation: 1) expand the scale and diversity of the dataset with limited labeled data; 2) enhance the network's perception ability. We propose the Human Gaze-based Dual Teacher Guidance Learning model (HG-DTGL). In this model, human gaze serves as an additional hidden `teacher' in the mean-teacher architecture. We introduce the GazeMix to generate reliable mixed data to expand the diversity and scale of the dataset, and the Multi-scale Gaze Perception (MGP) module is used to extract the multi-scale perception of the network. A Gaze Loss is designed to align the model's perception with human gaze. We have verified HG-DTGL on multiple datasets of different modalities and achieved superior performance on a total of ten different organs/tissues, with extensive experiments. This demonstrates that our method has strong generalization ability for medical images of different modalities, and shows the great application potential of gaze data in semi-supervised medical image segmentation.

Consider a non-uniform Euler-Bernoulli beam with a tip-mass at one end and a cantilever joint at the other end. The cantilever joint is not fixed and can itself be moved along an axis perpendicular to the beam. The position of the cantilever joint is the control input to the beam. The dynamics of the beam is governed by a coupled PDE-ODE model with boundary input. On a natural state-space, there exists a unique state trajectory for this beam model for every initial state and each twice continuously differentiable control input which is compatible with the initial state. In this paper, we study the motion planning problem of transferring the beam model from an initial state to a final state over a prescribed time-interval and then employ the results obtained to establish the approximate controllability of this model. We address these problems by extending and applying the generating functions approach to flatness-based control to the beam model. We prove that the transfer described above is feasible if the initial and final states belong to a certain set, which also contains the steady-states of the beam model. We then establish that this set contains all the eigenfunctions of the beam model, which form a Riesz basis for the state-space, and thereby conclude the approximate controllability of the beam model over all time intervals. We illustrate our theoretical results on motion planning using simulations and experiments.

The segmentation of 2D vascular structures via deep learning holds significant clinical value but is hindered by the scarcity of annotated data, severely limiting its widespread application. Developing a universal few-shot vascular segmentation model is highly desirable, yet remains challenging due to the need for extensive training and the inherent complexities of vascular imaging. In this work, we propose UniVG (Generative Data-engine Foundation Model for Universal Few-shot 2D Vascular Image Segmentation), a novel approach that learns the compositionality of vascular images and constructing a generative foundation model for robust vascular segmentation. UniVG enables the synthesis and learning of diverse and realistic vascular images through two key innovations: 1) Compositional learning for flexible and diverse vascular synthesis: It decomposes and recombines vascular structures with varying morphological features and diverse foreground-background configurations to generate richly diverse synthetic image-label pairs. 2) Few-shot generative adaptation for transferable segmentation: It fine-tunes pre-trained models with minimal annotated data to bridge the gap between synthetic and real vascular domains, synthesizing authentic and diverse vessel images for downstream few-shot vascular segmentation learning. To support our approach, we develop UniVG-58K, a large dataset comprising 58,689 vascular images across five imaging modalities, facilitating robust large-scale generative pre-training. Extensive experiments on 11 vessel segmentation tasks cross 5 modalties (only with 5 labeled images on each task) demonstrate that UniVG achieves performance comparable to fully supervised models, significantly reducing data collection and annotation costs. All code and datasets will be made publicly available at https://github.com/XinAloha/UniVG.

Digital Subtraction Angiography (DSA) is a clinically significant imaging technique for diagnosing cerebrovascular disease, as gold-standard. However, the artifacts caused by motion of high-attenuation tissues such as bones, teeth, and catheters, seriously reduce the visibility of blood vessels. This paper presents a novel Vascular Consistency Constrained DSA Imaging Model (VCC-DSA) for robust motion suppression and precise vascular imaging with the following designs: 1) We specially design a Learning-based Subtraction Mapping Paradigm, so that the ill-posed problem of existing learning-based methods can be solved to enhance the stability of the algorithm. 2) Our model effectively develops Residual Dense Blocks and details-shortcut to improve the performance under complex structures, such as moving bones overlapping with blood vessels, and small features, like peripheral vessels. 3) An innovative Vascular Consistency Strategy is proposed to extract intrinsically consistency from the various relative motions in mask-live images, so that spontaneously distils the vascular structure with contrast-agent development and robustly suppress motion artifacts, and also naturally alleviates the high matching requirements of data. 4) We creatively design a Mixup-based Data Self-evolution Strategy for data-intra self-enhancement in training loop, so that the training data gains dynamically optimized to promote model better learning the vascular features, and excluding the irrelevant structures in live/mask image and even the inevitable-artifacts/fake-structure in label. Prospectively, to further evaluate practical value, an actual general anesthesia animal experiment is specially conducted, besides the assessment on human clinical data. Compared with other method, our model improves the PSNR and SSIM by 73.4% and 8.56%, respectively.

Elastomers are central to vision-based tactile sensors (VBTSs), where they transduce external contact into observable deformation. Different VBTS architectures, however, require distinct optical and mechanical properties, particularly transparency and hardness. Conventional elastomer design relies on a forward, trial-and-error optimisation process from material preparation to property evaluation, which is inefficient and offers limited property scalability and target tunability. In this work, we present i-Tac, an inverse design pipeline for tailoring 3D-printed tactile elastomers with target optical and mechanical properties. Inspired by the composite structure of the human dermis, i-Tac exploits multi-material PolyJet additive manufacturing with three complementary resins. A mixture design methodology is employed to characterise the printed elastomers and establish response surface models (ReSMs) that map material compositions to functional properties, thereby defining a scalable property space. Based on user-defined targets, a desirability-function-based multi-objective optimisation is then performed to identify feasible composition regions and derive an optimal operating window for fabrication. This enables elastomers with desired properties to be manufactured in a single iteration, thereby achieving efficient target tunability. Experimental results validate the proposed i-Tac framework in terms of both property scalability and inverse design performance, showing that i-Tac can effectively tailor elastomer transparency and hardness while reducing the iterative burden of conventional forward design. By fabricating physical sensor samples from both commercial and custom designs, the proposed framework further demonstrates the potential of inverse-designed, monolithically manufactured elastomers for customisable VBTS fabrication.

In this paper, we consider the notions of effort and resilience of a dynamical control system defined by the maximum disturbance the system can withstand while satisfying given finite temporal logic specifications. Given a dynamical system and a specification, the objective is to synthesize the controller such that the system satisfies the specification while maximizing its resilience, taking into account input constraints. In addition, we introduce a new metric, called the effort metric, which characterizes the minimal input bound necessary to satisfy a given specification for a perturbed system. The problem for both metrics is formulated as a robust optimization program where the objective is to compute the maximum resilience for the system with input constraints or the minimal effort while simultaneously synthesizing the corresponding controller parameters. Moreover, we study the trade-off between resilience and effort, where we seek to maximize resilience and minimize the control effort. For linear systems and linear controllers, exact solutions are provided for the class of time-varying polytopic specifications for the closed-loop and open-loop systems. For the case of nonlinear systems, nonlinear controllers, and more general specifications, we leverage tools from the scenario optimization approach, offering a probabilistic guarantee of the solution as well as computational feasibility. Different case studies are presented to illustrate the theoretical results.

This paper investigates a fluid reconfigurable intelligent surface (FRIS)-assisted Rydberg Atomic REceiver (RARE) architecture under magnitude-only heterodyne readout. We show that, unlike conventional coherent systems, the optimal propagation environment is fundamentally governed by the receiver's nonlinear measurement structure. In particular, under the strong-reference regime, symbol detection is limited by residual quadrature leakage after reference alignment, motivating a receiver-induced channel shaping approach rather than conventional channel-centric optimization. Based on this insight, we formulate a signal-independent leakage minimization problem that jointly optimizes the FRIS port set, finite-resolution phase shifts, and the transmit beamformer, resulting in a nonconvex mixed discrete-continuous design. To address this, we develop an alternating-optimization (AO) framework comprising: (i) a closed-form eigenvector solution for widely-linear beamforming, (ii) cross-entropy method (CEM)-based combinatorial port selection, and (iii) coordinate-descent (CD) phase refinement with guaranteed monotonic descent. Simulation results demonstrate fast convergence and consistent bit-error-rate (BER) gains across various modulation orders and receiver dimensions. Moreover, the proposed FRIS-enabled design achieves near-exhaustive performance with significantly reduced complexity and consistently outperforms conventional RIS schemes with fixed elements, highlighting the effectiveness of spatial reconfiguration in suppressing quadrature leakage and the additional spatial degree-of-freedom (DoF) enabled by FRIS for reliable atomic-MIMO detection.

Understanding the optimization landscape of linear quadratic regulation (LQR) problems is fundamental to the design of efficient reinforcement learning solutions. Recent work has made significant progress in characterizing the landscape of static output-feedback control and linear quadratic Gaussian (LQG) control. For LQG, much of the analysis leverages the separation principle, which allows the controller and estimator to be designed independently. However, this simplification breaks down when the gradients with respect to the estimator and controller parameters are inherently coupled, leading to a more intricate analysis. This paper investigates the optimization landscape of observer-based dynamic output-feedback control of LQR problems. We derive the optimal observer-controller pair in settings where transient quadratic performance cannot be neglected. Our analysis reveals that, in general, the combination of the standard LQR controller and the observer that minimizes the trace of the accumulated estimation error covariance does not correspond to a stationary point of the overall closed-loop performance objective. Moreover, we derive a pair of discrete-time Sylvester equations with symmetric structure, both involving the same set of matrix elements, that characterize the stationary point of the observer-based dynamic LQR problem. These equations offer analytical insight into the structure of the optimality conditions and provide a foundation for developing numerical policy gradient methods aimed at learning complex controllers that rely on reconstructed state information.

Music and food traditions are both intangible cultural heritage, and the links between them, how a sound can make a taste seem sweeter or more bitter, are increasingly used in museum, exhibition and gastronomic-tourism settings. Modelling those links computationally runs into a data bottleneck familiar across cultural heritage computing: expert annotation is slow and costly, so the annotated collections that result are small. The usual remedy is to enlarge a collection automatically, labelling it with a model trained on the small annotated one. Such synthetic labels are rarely checked, either against the original annotations or against people. We provide both checks. Experiment 1 asks whether the audio-flavour patterns found in an experimental soundtrack collection (257 tracks annotated by listeners) survive when the collection is scaled to 49,300 30-second segments from the Free Music Archive (FMA) labelled by a fine-tuned Audio Spectrogram Transformer. Experiment 2 asks whether flavour profiles computed from food chemistry, for 20 dishes drawn largely from Italian culinary tradition, match what listeners actually hear (49 participants, online). Feature-flavour patterns carry over for every taste dimension (rho=0.38-0.72, all p<0.001), and sweetness still carries over when every spectral feature is removed, so the agreement is not an artefact of how the labelling model represents audio. Listener ratings match the computed profiles far beyond chance (permutation p<0.001; Mantel r=0.45; Procrustes m^2=0.49), and the result holds when participants reporting hearing or taste impairments are excluded. We release the harmonized datasets and all code.

Recent progress in brain-guided image generation has improved the quality of fMRI-based reconstructions; however, fundamental challenges remain in preserving object-level structure and semantic fidelity. Many existing approaches overlook the spatial arrangement of salient objects, leading to conceptually inconsistent outputs. We propose a saliency-driven decoding framework that employs graph-informed saliency priors to translate structural cues from brain signals into spatial masks. These masks, together with semantic information extracted from embeddings, condition a diffusion model to guide image regeneration, helping preserve object conformity while maintaining natural scene composition. In contrast to pipelines that invoke multiple diffusion stages, our approach relies on a single frozen model, offering a more lightweight yet effective design. Experiments show that this strategy improves both conceptual alignment and structural similarity to the original stimuli, while also introducing a new direction for efficient, interpretable, and structurally grounded brain decoding.

This paper studies the problem of distributed state estimation of linear time-invariant (LTI) systems under event-triggered communication. For event-triggering mechanisms, the existence of positive minimum inter-event times (MIETs) is an essential property for ensuring practicality. It is widely recognized that dynamic event-triggering mechanisms can effectively reduce redundant communication. However, for distributed observers, it remains unclear whether dynamic event-triggering mechanisms can ensure positive MIETs. This paper proposes a dynamic event-triggered distributed observer. By introducing new comparison functions, it is proven that the dynamic event-triggered distributed observer can guarantee strictly positive MIETs and ensure the exponential convergence of the estimation error. Moreover, most existing works on event-triggered distributed observers only consider node-based event-triggering mechanisms, while both node-based and edge-based dynamic event-triggering mechanisms are constructed in this paper. Numerical examples are provided to illustrate the effectiveness of the proposed results.

We present a distributionally robust PAC-Bayesian framework for certifying the performance of learning-based finite-horizon controllers. While existing PAC-Bayes control literature typically assumes bounded losses and matching training and deployment distributions, we explicitly address unbounded losses and environmental distribution shifts (the sim-to-real gap). We achieve this by drawing on two modern lines of research, namely the PAC-Bayes generalization theory and distributionally robust optimization via the type-1 Wasserstein distance. By leveraging the System Level Synthesis (SLS) reparametrization, we derive a sub-Gaussian loss proxy and a bound on the performance loss due to distribution shift. Both are tied directly to the operator norm of the closed-loop map. For linear time-invariant systems, this yields a computationally tractable optimization-based framework together with high-probability safety certificates for deployment in real-world environments that differ from those used in training.

Coordinated operation of alkaline water electrolysis (AWE) systems with multiple electrolyzers under fluctuating renewable power input is challenging due to varying power availability and dynamic safety constraints. Moreover, the conventional separation between optimization and control may result in inconsistent decisions across timescales. To address these issues, this paper proposes a two-layer coordinated operation method integrating feedback optimization (FO) with a projection-based safety layer. The FO layer generates real-time reference inputs to improve renewable energy utilization, while the safety layer corrects these inputs to ensure compliance with operational and safety constraints. To explicitly address the safety constraints arising from the inertial dynamics of AWE systems, discrete-time control barrier function theory is incorporated into the safety layer, thereby enhancing safety assurance and online computational tractability. Theoretical analysis establishes the feasibility and effectiveness of the proposed method. Case studies based on annual wind generation data show that the proposed method achieves high energy utilization, maintains safe operation, and demonstrates online applicability, scalability, and robustness.

With the rapid growth of Multi-access Edge Computing (MEC), secure and efficient computation offloading from user equipment (UEs) to edge access points (APs) is critical. However, DISCO intelligent reflective surface-based fully-passive jammers (DIRS-based FPJs) use random time-varying phase shifts to launch DISCO jamming attacks, disrupting offloading performance. This paper leverages an aerial intelligent reflective surface (AIRS) to enable secure computation offloading against DISCO jamming by jointly optimizing offloading ratios, AIRS phase shifts, and deployment. A two-timescale (2Ts) framework is proposed to address the optimization challenge caused by the distinct update frequencies of different strategies. Specifically, AIRS deployment is adjusted on a long timescale to boost antijamming capability due to the impracticality of frequent physical adjustment, while offloading ratios and phase shifts are optimized on a short timescale to adapt to DIRS-jammed dynamic channel conditions. We propose a dual-agent deep reinforcement learning (DRL)-based AIRS deployment-aided secure computation offloading (DDADSO) scheme to maximize the secure offloading utility under DISCO jamming. Simulation results verify that the proposed DDADSO scheme outperforms benchmark schemes, demonstrating the effectiveness of AIRS deployment in improving offloading performance against DISCO jamming attacks.

As a key enabler for sixth-generation (6G) wireless communications, reconfigurable intelligent surfaces (RISs) provide the flexibility to control signal strength. Nevertheless, optimizing hundreds of elements is computationally expensive. To overcome this challenge, we present a quantum framework (QGCN) to jointly optimize the physical and electromagnetic response of a double-sided RIS design that incorporates discrete phase shifts and inter-element coupling. The core contribution is the adaptive activation or deactivation of elements, allowing a virtual spacing mechanism using PIN diode switches. We then solve a multi-objective problem that maximizes the minimum user data rate subject to constraints on aperture length and mutual coupling between active elements. Experimental results on IBM Quantum's 127-qubit ibm_kyiv superconducting processor demonstrate that the proposed QGCN algorithm reduces both per-iteration computational complexity and memory requirements compared to existing approaches. Also, the QGCN outperforms classical graph neural networks (GNN) on an equivalent graph topology by an additional $+$0.38 bps/Hz. This advantage is increasing with increasing array sizes.

We develop a queueing-theoretic framework to model the temporal evolution of cyber-attack surfaces, where the number of active vulnerabilities is represented as the backlog of a queue. Vulnerabilities arrive as they are discovered or created, and leave the system when they are patched or successfully exploited. Building on this model, we study how automation affects attack and defense dynamics by introducing an AI amplification factor that scales arrival, exploit, and patching rates. Our analysis shows that even symmetric automation can increase the rate of successful exploits. We validate the model using vulnerability data collected from an open source software supply chain and show that it closely matches real-world attack surface dynamics. Empirical results reveal heavy-tailed patching times, which we prove induce long-range dependence in vulnerability backlog and help explain persistent cyber risk. Utilizing our queueing abstraction for the attack surface, we develop a systematic approach for cyber risk mitigation. We formulate the dynamic defense problem as a constrained Markov decision process with resource-budget and switching-cost constraints, and develop a reinforcement learning (RL) algorithm that achieves provably near-optimal regret. Numerical experiments validate the approach and demonstrate that our adaptive RL-based defense policies significantly reduce successful exploits and mitigate heavy-tail queue events. Using trace-driven experiments on the ARVO dataset, we show that the proposed RL-based defense policy reduces the average number of active vulnerabilities in a software supply chain by over 90% compared to existing defense practices, without increasing the overall maintenance budget. Our results allow defenders to quantify cumulative exposure risk under long-range dependent attack dynamics and to design adaptive defense strategies with provable efficiency.

In this paper, we develop a distributed algorithm for solving a class of distributed convex optimization problems where the local objective functions can be a general nonsmooth function, and all equalities and inequalities are network-wide coupled. This type of problem arises from many areas, such as economic dispatch, network utility maximization, and demand response. Integrating the decomposition by right hand side allocation and primal-dual methods, the proposed algorithm is able to handle the distributed optimization over networks with time-varying directed graph in fully distributed fashion. This algorithm does not require the communication of sensitive information, such as primal variables, for privacy issues. Further, we show that the proposed algorithm is guaranteed to achieve an $O(1/k)$ rate of convergence in terms of optimality based on duality analysis under the condition that local objective functions are strongly convex but not necessarily differentiable, and the subdifferential of local inequalities is bounded. We simulate the proposed algorithm to demonstrate its remarkable performance.

The Intelligent Driver Model (IDM) is a cornerstone of Adaptive Cruise Control (ACC), valued for its interpretable parameters and effectiveness in car-following behavior modeling. However, its inherent conservatism leads to prolonged stabilization and reduced traffic efficiency, which have received limited attention. In this paper, we propose SEIDM (Safe and Efficient Intelligent Driver Model), an enhanced IDM extension designed to improve traffic flow efficiency without sacrificing safety. SEIDM introduces an adaptive safety factor to dynamically modulate the impact of the safe deceleration term in acceleration decisions. This allows vehicles to follow more assertively under safe conditions while behaving more cautiously in potential hazards. Extensive urban traffic simulations show that SEIDM achieves significantly shorter stabilization spacing and faster convergence to traffic flow equilibrium, outperforming the original IDM and its variants in traffic stability and efficiency.

Deep Riemannian networks provide a powerful framework for Electroencephalography (EEG) decoding, but their practical applications are severely constrained. Accurately decoding EEG signals requires modeling complex temporal dynamics across multiple rhythms, which results in high-dimensional Riemannian inputs and significant computational costs. To address this, we propose the Manifold Pooling Network (MPNet). MPNet uses a rhythm-adaptive convolutional frontend to extract comprehensive time-frequency representations and generate multi-view Riemannian nodes. A novel manifold node pooling layer is then proposed to aggregate these nodes into a single fusion node with a fixed size, enabling the following deep Riemannian network to process it with greatly reduced costs. Experiments on two public EEG datasets show that MPNet achieves state-of-the-art accuracy, runs up to 10 times faster than the comparable Riemannian model, and maintains robust performance under limited-data conditions. These findings highlight MPNet's practicality and efficiency for real-world EEG applications.