Papers

While reconfigurable intelligent surfaces (RISs) are among the key enablers for next-generation (NextG) wireless networks, efficient feedback reporting for joint base station (BS) precoding and passive RIS configuration remains a major challenge due to the associated signaling overhead. By extending the standard-compliant channel state information reference signal framework, this paper introduces a novel channel information indicator (CII) that jointly represents the active BS precoding matrix and passive RIS configuration within a single feedback metric for multi-user multiple-input single-output systems. Simulation results demonstrate that the proposed unified feedback framework significantly reduces uplink signaling overhead compared with conventional disjoint reporting schemes. Furthermore, despite only a modest increase in the feedback payload, the proposed CII-based scheme outperforms conventional precoding matrix indicator approaches in terms of system performance, offering a practical and standards-compatible solution for RIS integration in NextG wireless networks.

Semantic communication (SemCom) has emerged as a new paradigm to facilitate the performance of integrated sensing and communication systems in 6G, due to its potential to enhance transmission efficiency by transmitting task-relevant semantic features rather than raw bits. However, most of the existing works mainly focus on sensing data compression to reduce the subsequent communication overheads, without considering the integrated transmission framework for both the SemCom and sensing tasks. This paper proposes a sensing-aware adaptive source-channel coding (SA-ASCC) and beamforming design framework for bi-static integrated sensing and SemCom (ISSC) systems by jointly optimizing the coding rate for SemCom task and the transmit beamforming for both the SemCom and sensing tasks. Specifically, an end-to-end semantic distortion function is approximated by deriving an upper bound composing of source and channel coding induced components, and then a hybrid Cramér-Rao bound (HCRB) is derived for target position under imperfect time synchronization due to the transceiver deployed at different places in our considered bi-static ISSC system. To characterize the achievable region between SemCom and sensing performance, a distortion minimization problem is formulated by considering the HCRB threshold, channel uses, and power budget, which is non-convex due to the coupled design variables and the mixed-integer program. Subsequently, an alternating optimization (AO) algorithm is proposed to decompose this problem into the model selection and joint rate and beamforming optimization subproblems, which are solved by the exhaustive search method and the combination of successive convex approximation and fractional programming, respectively. Finally, simulation results demonstrate that the proposed scheme outperforms the DJSCC-WF-ZF and BPG-WF-ZF benchmarks.

Neural tracking - the time-locking of neural responses to continuous stimuli such as speech, music, and video - is widely used to study how the brain processes natural input. Tracking strength is typically quantified as the correlation between the recorded neural response and the stimulus, decoded and/or encoded through data-driven models, and this correlation is routinely used to compare stimulus features, models, or settings. However, its magnitude depends not only on how strongly the brain tracks the stimulus, but also on the statistical properties of the signals being correlated. For example, a smallband speech envelope carrying almost no information about speech content yields among the highest correlations, simply because it is easier to reconstruct. Meaningful interpretation therefore requires comparing each correlation to its null distribution: the correlations expected without any stimulus-response relationship. We show that the randomization procedures commonly used to construct this null distribution are not interchangeable: each implicitly encodes a different null hypothesis, and we motivate stimulus-response misalignment as the most practical and appropriate choice. Because reliable null distributions require many permutations, we introduce a semi-parametric model using the normal distribution after the Fisher transform that yields accurate significance levels from only 3-5 min of data and predicts them across analysis window lengths. Building on this, we propose the null-normalized tracking score, an interpretable measure placing features and models on a common scale, which relates directly to the widely used match-mismatch accuracy. Applied to EEG from 121 participants listening to continuous speech, the framework reverses conclusions drawn from raw correlations, providing an efficient and principled methodology for interpreting neural tracking correlations.

Accurate and responsive turn-taking is essential for spoken dialogue systems, which must distinguish in real time between user interruptions, backchannels that should be ignored, and the completion of an utterance. Prior modular approaches typically optimize turn state prediction at the utterance or fixed-chunk level, creating a mismatch with the continuous turn state estimate, and often depend on an auxiliary ASR model, which limits responsiveness and increases overall system complexity. Therefore, we present X2-Turn, a frame-synchronous turn state prediction method via delayed-stream modeling. Specifically, building on the pretrained Voxtral Realtime model, we introduce a frame-synchronous turn state head that operates in parallel with the ASR head on shared streaming representations, jointly predicting ASR tokens and fine-grained turn states at the frame level. Experiments on bilingual EasyTurn and Full-Duplex-Bench demonstrate that the proposed method achieves an effective trade-off between turn state accuracy and decision latency.

We develop a robust safety filter for input-constrained underactuated linear systems subject to unknown bounded-rate disturbances and structured model uncertainty entering through known distribution channels. A disturbance observer provides an online disturbance estimate and a dynamic estimation-error radius that define the certified uncertainty envelope used in the robust high-order control barrier function constraints. For general polytopic actuator sets, the resulting robust safety-admissible input set is polyhedral, while the shared scalar-input specialization yields an exact interval, a necessary-and-sufficient pointwise feasibility condition, a signed feasibility reserve, and a closed-form safety projection. A domain-wise certificate relates robust HOCBF control demand to available actuator authority, while a finite-horizon energy identity quantifies deviation from the unconstrained $H_\infty$ reference without claiming preservation of its original attenuation level. Across all $16$ structured-uncertainty corners in the linear-model actuator-stress test, the filter remains feasible and safe under $\tau_{\max}=1.18$ N$\cdot$m, with $\max\abs{p}=0.0740$ m, $\max\abs{\theta}=0.205$ rad, $\max\abs{\tau}=1.173$ N$\cdot$m, and $\min\mu_S=7.27\times10^{-3}$ N$\cdot$m.

An important question in pathology AI is how to allocate limited analytical resources between broad coverage of a whole slide image (WSI) and detailed analysis of selected regions. We compared a minimal WSI-AI model designed for broad search with Diagnostic Field Selection AI (DFS-AI), which uses a coarse overview to select diagnostically relevant fields for detailed analysis. Three minimal models introduced localization information, contextual discrimination, and spatial structure in sequence. In Model I, WSI-AI was favored when coarse localization was uninformative or costly. When coarse observation provided useful ranking information, DFS-AI was favored over an intermediate range of resources; WSI-AI again became preferable when resources allowed nearly complete fine observation. In Model II, background heterogeneity generated distractors. In a WSI control given the same local context as DFS-AI, most of the original DFS advantage was explained by local background correction, while coarse candidate selection provided a smaller additional benefit. In Model III, larger contiguous lesions were easier for WSI-AI to discover but more difficult to characterize completely with a finite budget for fine observation. The DFS advantage for complete characterization persisted when the comparator used the same field sized unit of fine analysis and when success was defined symmetrically as 100%, 90%, or 80% lesion unit coverage. Together, the models support a framework in which the preferred strategy changes with available resources and depends on the information available for selection, its acquisition cost, lesion structure, and the diagnostic endpoint. This framework clarifies when limited pathology AI resources should be devoted to broad WSI coverage and when they should be concentrated on selected Diagnostic Fields.

Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements. Existing methods struggle to resolve the signal ambiguity between overlapping fault modes without hardware upgrades. Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots. We introduce DeFault, a cross-modal diagnostic framework that mathematically unfolds one-dimensional voltage sequences into multi-dimensional phase-space topologies. DeFault employs a bidirectional cross-attention mechanism that acts as an autonomous, physics-aligned filter, explicitly decoding compounded fault modes that remain fundamentally invisible to sequence-based methods. Validated on a field dataset of 16.4 million data records from 99 in-service EVs, our method achieves an average accuracy of 0.96 and an F1 score of 0.84 for four fault types using only 500-second snapshots (spanning <100 mV). This work proves that high-fidelity, interpretable electrochemical diagnosis is achievable on legacy fleets without new sensors, providing a scalable solution for the battery safety crisis.

We evaluate multi-target detection, association and tracking end to end on an O-RAN simulation testbed built from OpenAirInterface, FlexRIC and Sionna RT that repurposes the 5G NR uplink sounding reference signal as a passive radar waveform, and against what a counter-UAS command-and- control (C2) consumer requires rather than by detection alone. Three UAVs differing in altitude, velocity and radar cross section (-8 to -20 dBsm) fly one bistatic pair with an 8-element planar receive array. Once every target is detected the binding limit is contention, not sensitivity - two targets share one nearest detection in about 74% of coherent processing intervals, and targets are detected far more often than they are tracked. Elevation from that array cannot separate targets sharing a range-Doppler cell, but it decides association in 58% of intervals. Concurrent tracks are exported from the RAN Intelligent Controller (RIC) xApp to a C2 fusion node over a SAPIENT interface carrying a calibrated detection confidence, validated at schema level against a mock fusion node. The evaluation is emulation-only on one geometry with 10 noise seeds, the mechanisms are characterized and analyzed to identify the key factors influencing multi-target tracking performance.

This paper addresses proactive aperiodic spacecraft attitude control under model uncertainty, environmental disturbances, and actuator degradation. To this end, we develop Variable step Time Delay Control (VTDC), which jointly designs robust feedback control and control-update scheduling rather than treating them as separate components. Inspired by adaptive stepsize regulation in Runge Kutta integration, VTDC structures the local control error to scale with the realized timestep. Using sliding manifold based Time Delay Control, the resulting System Time Delay Error (TDE), which reflects local model and uncertainty variations, is shown to be quadratically bounded by the control interval. This relation yields a closed form feedback law that enlarges or reduces the subsequent interval to regulate the TDE magnitude. The next update time is therefore determined algebraically without continuous trigger monitoring, future state prediction, or iterative search. The resulting variable step closed loop admits bounded timesteps and step ratios, excludes Zeno behavior, and renders the sliding variable uniformly ultimately bounded. Nonlinear spacecraft attitude control simulations demonstrate accurate tracking with low scheduling cost under representative uncertainties and disturbances.

Integrating wave energy converters (WECs) with floating offshore wind turbines (FOWTs), to form hybrid wind-wave energy (HWWE) systems, is a promising approach to achieve further cost reduction for offshore renewable energy. In such systems, the control of the integrated WECs plays an important role, with the potential to generate additional wave energy while simultaneously suppressing floating platform motion. However, HWWE systems are characterized by complex dynamics, making accurate modelling only viable through numerical simulation, and posing significant challenges for control design. This paper proposes a reinforcement learning (RL) control framework for HWWE systems, in which the real-time control policy is learned directly through interactions with high-fidelity simulation. A numerical model is established for a HWWE system consisting of an IEA 15 MW wind turbine, a VolturnUS semi-submersible platform, and three torus-type WECs, which is then employed as the RL training environment. Control performance is evaluated in terms of both wave energy generation and platform motion reduction, two competing objectives, from a Pareto perspective. It is shown that the proposed RL controller achieves substantial Pareto improvements over conventional control strategies, e.g., over 75% higher wave energy capture at the same platform motion level, or nearly 50% lower motion at the same energy capture level, thereby significantly extending the attainable performance boundary of HWWE systems.

State estimation for nonlinear dynamical systems remains a fundamental challenge, particularly when measurements are sparse and internal states are inaccessible. This work presents a KOOPMAN-based Linear State Observer (KOOPMAN-LSO) design framework that enables linear observer synthesis for nonlinear systems through KOOPMAN operator theory. The nonlinear dynamics are lifted into a higher-dimensional observable space using physics-informed basis functions, where a linear predictor with control is identified via extended dynamic mode decomposition with control (eDMDc). A discrete-time Luenberger observer is then constructed in the lifted space, and the observer gain is obtained through a dual linear - quadratic regulator (LQR) formulation to ensure stable and tunable estimation error dynamics. The proposed framework combines the representational capability of KOOPMAN lifting with the simplicity and computational efficiency of linear observer design, providing a systematic approach for nonlinear state estimation under limited sensing. Its effectiveness is demonstrated on a latent thermal energy storage (LTES) system based on phase-change materials (PCM), where internal temperature states are not directly measurable. Experimental results under varying operating conditions show accurate reconstruction of unmeasured states from limited output measurements, illustrating the potential of KOOPMAN-LSO design for practical nonlinear systems. The proposed approach achieves high-fidelity reconstruction with an RMSE as low as 0.0819 {\deg}C for the LTES outlet temperature and generally below 1.0 {\deg}C for observable internal PCM temperatures.

Multipath transports place a client's WiFi, cellular, and satellite networks under one connection, yet real-time video gains little from them. The scheduler that assigns packets to paths sees only bytes, so it cannot tell a keyframe that anchors a second of video from an enhancement frame whose loss costs one image. We show that the limiting factor is not a shortage of path diversity but the absence of a channel through which the application can name what the transport cannot see. Media over QUIC Transport (MoQT), already deployed on production CDNs, carries media as named Objects, and relays forward each Object's metadata without interpreting it. The knowledge the scheduler lacks therefore already flows through the subscriber's relay. We present MoMQ, a MoQT extension that turns this metadata into path decisions. Applications and relay operators install declarative rules at the edge relay that match Object metadata and express delivery preferences against labeled paths. The relay evaluates the rules mechanically, so it acts on video semantics while containing no video logic. On a live testbed spanning Starlink and WiFi, four rules cut P99.9 frame completion time from 384.7 ms under the best transport-only scheduler to 114.1 ms and reduce the required playback buffer by 61.5%. MoMQ is the only configuration that meets the 150 ms interactive latency target. Across relays in two countries and subscribers on two continents, the same rules apply unchanged and retain their advantage wherever the paths remain disjoint.

Foundation models can improve their outputs through a self-refinement process driven by external feedback. In this process, the model is embedded in an iterative loop where it generates outputs, receives feedback from verifiers, and refines its responses through in-context learning. Following a novel approach, we formalize this process as an optimal stopping problem where the number of refinement iterations is decided based on expected improvement relative to cost. We derive optimal stopping policies and show that they can be efficiently computed through stochastic approximation. To evaluate our approach experimentally, we apply it to a coding benchmark for foundation models. The empirical results show that our stopping policies are significantly more cost-efficient than stopping policies proposed in prior work.

This work presents the design of a Linear Quadratic Regulator for relative motion control near periodic orbits in the Circular Restricted Three-Body Problem (CR3BP), formulated in non-singular toroidal coordinates. The key result exploits the rotational quasi-periodicity of the toroidal coordinate transformation. A uniqueness argument on the stabilizing solution of the associated difference Riccati equation proves the optimal control gains need only be computed for a single orbital period. The controller is validated against the full non-linear CR3BP dynamics on an L1 Northern halo orbit in the Earth-Moon system, and further against a high-fidelity ephemeris model, demonstrating successful reconfiguration maneuvers on the invariant torus with low control effort. Compared with an impulsive targeting and station-keeping baseline, the proposed controller attains a comparable tracking accuracy while reducing the total control effort by approximately 40%.

Electromagnetic (EM) situational awareness is essential for the deployment and operation of local and temporary non-public networks (NPNs). Radio Environment Maps (REMs) provide an effective basis for network planning and operation by capturing the prevailing EM conditions. However, efficient measurement location selection for REM construction remains a key challenge, particularly under strict time and cost constraints. This paper presents a two-stage measurement selection framework that employs Optimal Experimental Design (OED)-based strategies to generate a reduced candidate set during a pre-selection phase. In a subsequent optimization stage, combinatorial optimization is applied to select an improved subset of measurement locations by minimizing the Mean Absolute Error (MAE) of the resulting REM, using a scenario-specific propagation simulation model. The results demonstrate that the proposed framework reduces the number of required measurement locations while consistently improving REM construction accuracy across all evaluated strategies. Validation using real-world measurement data confirms the practical applicability of the approach, with the optimization stage achieving MAE reductions from about 4% to around 50%, independent of the chosen pre-selection strategy.

Leukemia cell image classification is challenged by real-world domain shifts from acquisition, staining, illumination, and site protocols, causing single-dataset models to generalize poorly in real clinical scenarios. This work presents a robust framework for leukemia classification across multiple heterogeneous datasets using a two-stage pipeline with a pretrained vision foundation model. Stage 1 performs binary classification (leukemia vs. non-leukemia) and is trained using 122,167 single-cell images. Stage 2 is conditionally applied to Stage 1 positives to perform subtype classification into Acute Lymphoblastic Leukemia (ALL) and Acute Myeloid Leukemia (AML), trained using 69,400 single-cell images. Labels are harmonized across five heterogeneous datasets to enable cross-dataset training, and performance is evaluated on a held-out dataset protocol to assess domain-shift generalization. Within this pipeline, three encoders are benchmarked (DinoBloom, pretrained on single-cell images; BiomedCLIP, pretrained on biomedical data; and CLIP as a general-purpose model) under linear probing, Low-Rank Adaptation (LoRA), and a Retrieval-Augmented Classification (RAC) module that retrieves the top-k most similar cell images to provide cytomorphological grounding. The objective is to quantify how much domain-specific pretraining contributes to performance under domain shift, and whether cost-effective adaptation and retrieval can be a viable alternative to expensive domain-specialized pretraining. The held-out protocol additionally serves as a diagnostic tool, revealing when classification performance is attributable to dataset-specific artifacts rather than to cytomorphological features.

Heterogeneous unmanned aerial vehicle (UAV) networks embedded with reconfigurable intelligent surfaces (RISs) present a promising paradigm for emergency wireless communications (EWC), offering enhanced coverage and resilience in harsh environments. However, extreme conditions in disaster areas necessitate robust performance evaluation under practical impairments, including outdated/imperfect channel state information (CSI) and discrete RIS phase shifts. Existing works lack a unified analytical framework for modeling CSI errors, employing inconsistent approaches that treat errors either as channel gain or as equivalent interference, leading to ambiguous benchmarks. To address this, we propose the $\zeta$-Model, a unified receiver-equivalent signal-to-noise (SNR) framework that continuously parameterizes residual-error exploitability via $\zeta$. This framework unifies the information-theoretic model (ITM) and the engineering baseline model (EBM) as the optimistic and pessimistic benchmark receiver treatments, while incorporating the simplified engineering model (SEM) as a tractable approximation. By employing the Fisher-Snedecor $\mathcal{F}$ distribution to capture severe fading and shadowing, we derive moment-matching-based closed-form or finite-sum approximate expressions and asymptotic expressions for average capacity (AC), effective capacity (EC), and outage probability (OP) under the proposed unified framework and its boundary cases. Validated by Monte Carlo simulations, our framework quantifies performance limits and provides crucial insights for designing robust and efficient EWC systems under various channel conditions and system impairments.

The rapid growth of large language model (LLM) services is expanding AI data centers (AIDCs), increasing electricity demand and associated carbon emissions. Renewable energy integration can mitigate these impacts but also strengthens the coupling between AIDC loads and inverter-interfaced generation, creating cross-domain cyber-physical vulnerabilities. Specifically, adversarial AI requests alter AIDC power demand, whereas inverter control tampering modifies source-side dynamics, and their combined impact on system stability varies with generation forecast and demand response uncertainties. To this end, we propose an uncertainty-aware AIDC microgrid vulnerability assessment framework under computing-power coordinated attacks. First, the framework maps adversarial AI requests to AIDC power variations and represents uncertainties in attack-induced demand responses and photovoltaic (PV) forecasts through confidence-weighted realizations. Then, impedance based stability analysis combines these realizations with bounded inverter parameter tampering to construct attack reachable domains and identify critical attack time windows. Furthermore, a separate criterion identifies fixed coordinated attack vectors that retain destabilizing capability throughout each selected window. Case studies demonstrate that, unlike either attack component applied alone, coordinated attacks within identified critical windows induce sustained inverter frequency oscillations with peak absolute deviations exceeding 20% of nominal frequency, whereas the evaluated out-of-window response remains bounded. The proposed method further identifies critical attack windows and the associated coordinated attack vectors.

A subcritical age-structured branching population dies out almost surely. Conditioned on survival, it converges to its Yaglom limit, a quasi-stationary equilibrium that we take as the operating point for control. We model preventive removal (culling) as an age-dependent actuator that raises the mortality rate and leaves the offspring law untouched, and we show that its authority over this equilibrium is bounded for structural reasons. Two facts drive the result. First, the input is matched to the killing rate but unmatched with respect to the Foster–Lyapunov drift, so the transmission barrier $\Lbar$ set by reproduction alone is invariant under such actuation. Second, and this does not follow from invariance alone,} the supremum of the reachable decay rates is $\Lbar+\nu^\star$, where $\nu^\star\le0$ is the Malthusian parameter of the lineage conditioned never to die childless; the gap $|\nu^\star|$ is given in closed form and vanishes exactly when no individual has two or more offspring. Consequently no removal law of this class reaches the barrier, and along the admissibility boundary the achievable decay rate is governed by the shape of the actuator rather than by its size. We illustrate these results on a model calibrated to the 2001 Cumbrian foot-and-mouth outbreak.

This paper investigates robust downlink transmission to tolerate calibration aging in time-division duplex cell-free massive multiple-input multiple-output (CF-mMIMO) systems with residual calibration errors (RCEs). Unlike existing studies that typically treat RCEs as static impairments, we develop a time-evolving RCE model that characterizes the joint effects of residual phase mismatches, residual carrier frequency offsets, and oscillator phase noise. Based on this model, two practical processing architectures are considered: instantaneous calibrated-channel-based robust beamforming (BF) and statistical beamformed-channel-based robust power allocation (PA). For both architectures, tractable achievable rate lower bounds are derived, which explicitly reveal the impact of calibration aging on coherent combining, BF-gain uncertainty, and inter-user interference. Using these lower bounds as design metrics, we formulate an effective weighted sum-rate (EWSR) maximization problem over the data transmission interval, so that the resulting BF and PA designs can account for the temporal evolution of RCEs rather than a single calibrated instant. To efficiently solve the resulting problems, a Gauss–Legendre quadrature-based weighted minimum mean square error (WMMSE) optimization framework is developed, where both robust BF and PA are updated in an access point (AP)-block manner with closed-form solutions under per-AP power constraints. Simulation results demonstrate that: i) the proposed algorithms exhibit stable convergence; ii) the proposed robust BF and PA schemes achieve higher EWSR by explicitly accounting for calibration aging than their non-robust counterparts; and iii) robust BF achieves higher spectral efficiency (SE), whereas robust PA provides a more favorable tradeoff between SE and implementation cost in terms of computational complexity and fronthaul overhead.

Integrating optical intelligent reflecting surfaces (IRSs) into aerial platforms, such as unmanned aerial vehicles (UAVs), has been proposed to relax the line-of-sight (LoS) constraint, extend coverage, and enhance deployment flexibility of free space optical (FSO) systems. However, misalignment errors induced by the UAV hovering, in both position and orientation, may degrade connectivity and impair the end-to-end channel quality. In this paper, we develop novel expressions for the electric fields incident on and reflected by an optical IRS, based on the Huygens-Fresnel principle. The resulting expressions are applicable for any combination of incident and reflected propagation directions. Building on this framework, we derive a closed-form statistical channel model that captures the geometric and misalignment losses of an FSO link assisted by a UAV-mounted IRS in the presence of random UAV fluctuations. In particular, we develop a statistical model for the beam misalignment at the receiver lens, assuming Gaussian fluctuations in both the UAV position and orientation. The proposed analytical model is validated through Monte Carlo (MC) simulations and is further used to provide practical design guidelines regarding the optimal placement of the UAV-mounted IRS for the minimization of the outage probability.

Integrated sensing and communication (ISAC) can enable sixth-generation (6G) unmanned aerial vehicle-assisted Internet of Things (UAV-IoT) networks to provide reliable Localization-as-a-Service (LaaS), but activating all aerial/terrestrial anchors and beams increases pilot overhead, energy use, and beam-training delay. This article proposes artificial intelligence (AI)-assisted ISAC resource selection for LaaS (AIRS-LaaS), an edge-intelligent framework that ranks candidate anchor–beam pairs using line-of-sight (LoS) likelihood, signal-to-interference-plus-noise ratio (SINR), sensing confidence, geometry, mobility risk, and resource cost. A lightweight selector then activates only a compact subset before localization. Simulations compare AIRS-LaaS with all-anchor, Fisher information matrix/Cramér–Rao lower bound (FIM/CRLB)-greedy, strongest-SINR, nearest-anchor, and random schemes under LoS/non-line-of-sight (NLoS) conditions and UAV mobility. Results show a balanced localization–communication–overhead tradeoff, while the discussion highlights standard-driven key performance indicators (KPIs), ISAC reporting, localization confidence, fallback operation, AI model management, and privacy-aware data exchange.

This perspective examines whether nuclear fusion can provide a scalable, low-carbon power source for rapidly growing AI-driven data center demand. As large language models, cloud computing, and cryptocurrency mining accelerate electricity consumption growth, data centers are projected to account for a substantially larger share of U.S. and global electricity use in the coming decades, creating significant pressure on grid reliability and decarbonization goals. We evaluate the technical and economic alignment between data center load profiles and nuclear power, particularly fusion, through a comparative analysis of capacity factors, levelized cost of electricity, grid interconnection constraints, and deployment pathways. Unlike intermittent renewables, nuclear fission and fusion offer high-capacity-factor, firm baseload generation suited to AI training and inference workloads that require continuous, reliable power. Preliminary techno-economic analysis suggests that several Nth-of-a-kind fusion concepts, particularly magnetic confinement systems, may become cost-competitive with firmed renewable systems and advanced fission for hyperscale data center applications. Co-location of fusion plants with data centers further reduces transmission bottlenecks, improves resilience, and aligns with emerging hyperscaler procurement strategies. We also assess recent regulatory developments and argue that fusion's favorable safety profile and reduced waste burden improve its long-term social and political viability relative to fission. We conclude that fusion represents a strategically important pathway for sustainably powering next-generation computing infrastructure and should be prioritized in both policy and industrial deployment planning.

Simultaneous input-gain variation and large additive disturbance create a control problem in which a fixed observer or nominal controller may be unable to reproduce the performance of a regime-aware design. We study a training–deployment asymmetry: during simulation or commissioning, an expert controller is allowed to use the known gain and disturbance, whereas the deployed controller can use only the reference and measured states. Directly imitating expert actions is generally unsafe because the same instantaneous student observation may correspond to different privileged regimes and hence different expert actions. We propose a mechanism-guided transfer route rather than a new neural architecture. An exact sampled-data identity removes the additive disturbance from the expert law and reduces learning to a task-relevant inverse input gain inferred from causal state history. The latent target is reconstructed from expert actions and deployment-visible trajectories, so the true plant parameter is not required as a student label. A common-quadratic certificate is derived for the actual augmented sampled recursion, followed by explicit residual, coverage, switching, noise, and saturation qualifications. A parameter-regime scan shows that the nominal observer's error grows sharply as $a$ decreases and that the next gain above the best non-failing tuning diverges for every tested $a<1$. Direct action networks also fail in closed loop despite moderate offline error, whereas the structured student remains close to the privileged expert and reduces tracking RMSE by about 69% relative to the tuned observer in unseen 60-s trials. The contribution is an interpretable design perspective for turning privileged multi-regime control knowledge into a deployable adaptive controller, together with conditions under which the transfer is meaningful.

This paper investigates covert communication in which a single covert user is assisted by multiple spatially distributed non-covert users against a geometry-aware warden. Unlike prior works based on receiver-centric activation, homogeneous channels, or averaged geometry, the proposed framework retains the individual user-to-warden large-scale fading coefficients in both cooperative user activation and the warden's detection analysis. Under the adopted analytical formulation for large-scale user deployments, we establish an on–off activation structure that balances the interference caused at Bob and the interference effectiveness at warden. Based on the resulting aggregate-interference statistics, we derive a closed-form approximation of the detection error probability, the detection threshold that minimizes it, and the minimum number of cooperative users required to satisfy the covert constraint. Then, we reduce the original high-dimensional power-control problem to a one-dimensional piecewise search and develop a low-complexity algorithm that avoids resolution-dependent grid search. The analysis shows that greater warden-side spatial dispersion can reduce the required cooperative users, whereas a larger average user-to-warden distance increases it. Numerical results validate the analysis and show that finite-sample detection approaches the large-sample benchmark, while imperfect user-to-Bob channel estimation mainly reduces the achievable rate through activation errors.

Intracytoplasmic sperm injection (ICSI) operators frequently adjust the field-of-view (FOV) during procedures, which interrupts workflow and increases procedure time. Conventional microscopes require manual objective lens switching and illumination adjustments to achieve different FOV sizes. We propose an AI-based automatic FOV adjustment method integrated with a view-expansive microscope. This microscope enables the simultaneous acquisition of a large FOV and high-resolution images using a single objective lens through multiview imaging with galvanometer mirrors and high-speed vision, thereby eliminating the need for physical lens exchanges. Our method utilizes a long short-term memory (LSTM) model to predict the appropriate FOV size based on real-time analysis of the pipette's position and velocity, combined with the operator's gaze position. The AI model is trained using ICSI procedure data from an expert with over five years of micromanipulation experience. Experimental evaluation with novice operators reveals that the proposed automatic FOV adjustment system significantly improves the ICSI procedure speed, reducing the average task completion time from 60.5 to 48.0 s (p < 0.001). The experiments also demonstrate that this improvement enables novice operators to achieve ICSI working speeds equivalent to those of expert operators.

In dense deployments, massive multi-user multiple-input multiple-output (MU-MIMO) base stations can acquire instantaneous channel state information (CSI) for only a limited subset of users per scheduling interval, restricting multiuser diversity. We therefore propose Digital Twin User pre-Screening (DiTUS), a digital-twin (DT)-aided framework that identifies promising users before instantaneous CSI acquisition. DiTUS forms spatial covariances from DT-inferred departure angles and path powers. Optional Gaussian-process (GP) calibration mitigates path-power bias, while the dominant rank-r eigenspace of the aggregate covariance yields common reference beams. It prescreens the pool using DiTUS-P, a low-complexity projection-energy rule, or DiTUS-L, a greedy log-determinant rule that promotes spatial compatibility. A two-level protocol collects scalar beam reports from shortlisted users and requests r-dimensional effective-channel vectors only from the scheduled set. The framework also supports proportional-fair scheduling. At 15 dB under DT imperfections, simulations with 128 candidates, a 64-user effective-CSI acquisition budget, and a 64-user shortlist show that DiTUS-L achieves 35.06 +/- 0.49 bps/Hz versus 30.28 +/- 0.60 bps/Hz for semi-orthogonal user selection (SUS) with full-dimensional CSI from 64 users, demonstrating that DT-based prescreening preserves substantial multiuser-diversity gains by identifying strong, spatially compatible users before acquiring effective-channel vectors.

DC-coupled analogue front ends (AFEs) for neural implants provide a low-area solution. However, removing the coupling capacitor eliminates the intrinsic barrier that protects cortical tissue: a single-fault event, such as gate-oxide breakdown of a low-noise amplifier (LNA) input transistor, can open a direct DC path from the supply rail into the brain. On the stimulation side this hazard is well understood, and single-fault tolerance is enforced by a series DC-blocking capacitor; on the recording side, DC-coupled front ends discard the equivalent safeguard, yet their protection has gone almost unexamined. This paper presents a single-fault detection mechanism that monitors the LNA for the DC imbalance produced by such a failure and disables the amplifier before the resulting fault current can irreversibly damage tissue. The imbalance is encoded in the duty cycle of a current-starved relaxation oscillator and read out as a time-to-digital measurement. Designed in 65 nm, the mechanism resolves a worst-case fault of 6.4 nA across all corners within 0.81 ms - compliant with the ISO~14708-3 limit for an 8533 um2 electrode - opening a broader discussion of safety in DC-coupled recording.

Arabic maqam music microtonal, modal, and built on ornamented call and response is among the traditions most underserved by generative music models, whose training frameworks remain predominantly Western and equaltempered. Real time accompaniment sharpens this gap: an AI partner must listen, adapt dynamically, and respect idiomatic microtonal structures. Streaming text to music models provide strong generative capabilities but lack precise control interfaces. We present MazzikaAI, a knowledge based system that uses natural language as the actuator of a realtime control loop. By compiling live MIDI, gesture, and inferred harmony into continuously updated text prompts, MazzikaAI steers an unmodified streaming generator, Google Lyria RealTime, without requiring model finetuning. The system embeds expert knowledge of six core maqamat, characteristic ornaments, and ensemble dynamics, maintaining realtime responsiveness with subsecond keytoaudibleupdate latency. Empirical evaluations demonstrate that dynamic prompt compilation reliably grounds generation in microtonal scales, significantly increasing offgrid quartertone content over baseline generation. Beyond its core implementation, MazzikaAI illustrates how deterministic knowledgebased rules can effectively bridge expert, nonWestern musical traditions and unfinetuned foundation models. This architecture establishes a scalable paradigm for realtime humanAI cocreation, offering a generalizable blueprint for interactive accompaniment, adaptive music education, and culturally inclusive generative audio across diverse global idioms.

Differentiable predictive control (DPC), a self-supervised learning approach for approximating explicit model predictive control (MPC) policies, offers significant computational advantages over online optimization-based MPC. However, feasibility guarantees, a core requirement for safe control, are currently provided either probabilistically or via online safety filters. The lack of rigorous feasibility guarantees for offline policy optimization remains an open problem. This paper establishes deterministic feasibility guarantees for DPC using a novel topological analysis of the induced reachable safe set, without requiring online safety filters. By exploiting the inherent model-based nature of DPC, in which differentiable system dynamics are embedded directly into the computational graph, we analyze the properties of the learned control policies and the corresponding system states from topological and geometric perspectives. Inspired by our theoretical analysis, we propose a novel self-supervised offline policy learning strategy that utilizes a proxy loss with Control Barrier Functions (CBFs). Crucially, these properties not only significantly improve policy training but also enable the derivation of strict, deterministic feasibility guarantees from a finite number of training samples. Extensive closed-loop simulations validate our theoretical findings, demonstrating that the empirical constraint violations monotonically decrease to zero as the training sample size increases. Ultimately, this work illustrates that DPC policy optimization yields formal safety certificates that are structurally unattainable with conventional black-box methods, e.g., reinforcement learning (RL) or supervised learning-based approximate MPC, thereby providing a new perspective on feasibility guarantees in learning-based control.