Papers

The incorporation of fairness into the distribution network (DN) planning and operation has become a key goal of recent studies. The cost of implementing fairness, denominated the price of fairness (PoF), covers the efficiency that is renounced for attaining social cohesion through fair outcomes. Locational disparity makes fairness schemes emerge to level the consumers playing field. However, fairness encompasses a range of notions. From egalitarian to merit-based criteria, various metrics are implemented as a tool for measuring equitable utility distribution. These have different mathematical complexities, from linear to non-linear programming cases, which affect their overall applicability. Hence, this study compiles the overarching fairness notions and metrics, reviewing how these affect stakeholders and the inherent mathematical optimisation in resource allocation problems. The aim is to support consistent and transparent planning and decision-making within DN operations.

Despite the rise of token communication (TokCom) as a new paradigm beyond traditional bit communication, existing approaches have primarily adopted artificial intelligence (AI)-centric designs that rely on semantic recovery via large models. Meanwhile, their physical-layer designs, such as token-bit mapping and power allocation, remain conventional and do not reflect token-level semantics. These semantics-agnostic designs can lead to significant semantic loss, particularly at low signal-to-noise ratio (SNR) levels. To address this issue, we propose hierarchical TokCom (H-TokCom), a framework that embeds semantic structure directly into physical-layer design. The key idea is to group semantically similar tokens into clusters and hierarchically assign their bit representations, where each token is represented by a cluster-level prefix and a token-specific suffix. As long as the cluster bits are correctly delivered, errors in the suffix bits typically map the received token to another within the same semantic cluster, resulting in only limited semantic distortion. This robustness is further strengthened by allocating more transmit power to the prefix bits than to the suffix bits. Simulation results show that H-TokCom achieves substantial semantic-similarity gains over conventional TokCom across the considered SNR range, increasing the semantic similarity from $0.206$ to $0.279$ at $\gamma=3$ dB on COCO, corresponding to a gain of $0.073$ $(35.4\%)$.

Future uncrewed aerial vehicle (UAV) systems increasingly combine heterogeneous communication technologies, such as low-latency aerial mesh, terrestrial cellular, and satellite links, to improve robustness and coverage. Multipath transport is a natural mechanism for aggregating these links, yet its ability to support real-time UAV services in highly heterogeneous environments remains insufficiently characterized. We present a measurement-driven study based on UAV flight experiments in an integrated network comprising UAV-to-UAV aerial mesh, private cellular, and low Earth orbit (LEO) satellite connectivity. Using Multipath TCP (MPTCP) as a representative lossless, in-order multipath transport framework, we find that aggregation can preserve end-to-end connectivity under severe link outages. However, large round-trip time (RTT) heterogeneity amplifies packet reordering, leading to substantial receiver-side buffering and bursty delivery. In addition, when the available links do not provide sufficient capacity for the offered load, pronounced sender-side buffering emerges. These effects cause real-time streaming to violate delay constraints, including cases where aggregate capacity is sufficient. To interpret these results, we formalize the distinction between connectivity continuity and service continuity and show empirically that maintaining connectivity is necessary but not sufficient for timely real-time delivery in multi-technology UAV networks. The findings motivate multipath designs that explicitly account for delay constraints, rather than optimizing for connectivity alone.

Flexible-antenna systems, which use a small number of radio frequency (RF) chains to dynamically access a large set of candidate antenna locations, have emerged as a hardware-efficient architecture for 6G networks. Acquiring accurate channel state information (CSI) is critical for these systems, but it typically incurs a prohibitive pilot overhead that scales with the massive number of candidate locations. To address this bottleneck, we propose a unified sensing-assisted channel estimation framework tailored for flexible-antenna systems. It reduces the full CSI reconstruction problem to a consistent two-stage process: it first resolves the dominant DOAs from the uplink data symbols by exploiting the spatial geometry, requiring no dedicated sensing pilot, and then calibrates the associated path gains using a minimal number of calibration pilots. Building on this pipeline, we develop two Newton-MUSIC algorithms tailored to different propagation environments. For line-of-sight (LOS)-dominant environments with uncorrelated sources, we propose SOC-Newton-MUSIC, which leverages second-order covariance (SOC) for low-complexity DOA sensing. For non-line-of-sight (NLOS) environments with coherent multipath, where the number of sources may exceed the number of activated RF chains, we propose FOC-Newton-MUSIC, which exploits fourth-order cumulants (FOC) to restore source identifiability and structurally expand the available spatial degrees of freedom (DOFs) through a continuous difference co-array. In both cases, by reformulating the spatial spectrum search as a continuous optimization problem, we replace exhaustive dense grid searches with parallelized Newton refinements.

This paper develops a sliding mode control based frame work for equality constrained optimization by reformulation the first order Karush Kuhn Tucker conditions as control affine dynamical system. The optimization variables are treated as states and the Lagrange multipliers as control input, with equality constraints defined as sliding manifold. The resulting design guarantees exact constraint enforcement with finite time convergence, independent of objective convexity, and exhibits robustness to matched disturbance, structural uncertainty and bounded measurement noise. To accelerate the convergence, a nonsingular terminal sliding mode based normed gradient flow is introduced, ensuring both finite time convergence to optimal solution and constraint satisfaction. Rigorous Lyapunov analysis establishes closed loop stability and convergence. Numerical studies across diverse benchmark problems demonstrate superior accuracy and robustness over classical continuous time optimization method, highlighting effectiveness under disturbance.

In this paper, we propose an enhanced physical layer security approach, named joint secrecy and covert communication (JSACC), which aims to improve the performance of physical layer security (PLS). The JSACC system can dynamically switch between secrecy mode and covert mode according to the channel difference between legitimate and illegitimate receivers. We further leverage reconfigurable intelligent surface (RIS) to extend the communication range. For each scenario, we derive the closed-form expressions for the outage probability (OP) and ergodic rate (ER). To further understand system performance, we derive asymptotic approximations in the high signal-to-noise ratio (SNR) regime to obtain the diversity order and high-SNR slope. We demonstrate that the diversity order of the JSACC depends on Nakagami fading parameters and the RIS reflecting element number. Simulation results are consistent with our theoretical analysis and reveal the superiority of the JSACC system over the conventional secrecy communication (SC) system.

Channel fingerprint (CF) is considered a key enabler for facilitating the acquisition of channel state information (CSI) in massive multiple-input multiple-output (MIMO) communication systems. In this work, we investigate a novel type of CF that stores statistical CSI (sCSI) at each potential location, referred to as statistical CF (sCF). Specifically, we reveal the relationship between sCSI, namely the channel spatial covariance matrix (CSCM), and the channel power angular spectrum (CPAS). Building on this foundation, we construct a unified tensor representation of the sCF and further reduce its dimension by exploiting the eigenvalue decomposition of the CSCM and its correlation with the PAS. Considering the practical constraints imposed by measurement cost, privacy, and security, we focus on three representative scenarios and uniformly formulate them as tensor restoration tasks. To this end, we propose a unified tensor-based learning architecture, termed LPWTNet. The architecture incorporates a closed-form Laplacian pyramid (LP) decomposition and reconstruction framework that replaces the traditional encoder-decoder structure, enabling efficient inference while capturing multi-scale frequency subband characteristics of the sCF. Additionally, a shared mask learning strategy is introduced to adaptively refine high-frequency sCF components through level-wise adjustments. To achieve a larger receptive field without over-parameterization, we further propose a small-kernel convolution mechanism based on the wavelet transform (WT), which decouples convolution across different frequency components of the sCF and enhances feature extraction efficiency. Extensive experiments show that the proposed approach delivers competitive reconstruction accuracy and computational efficiency across various sCF construction scenarios when compared with state-of-the-art baselines.

This paper studies flexible non-uniform array design for monostatic integrated sensing and communication (ISAC) systems. An antenna pool is considered at the base station, where each candidate antenna can be dynamically assigned to transmit, receive, or inactive modes, such that a non-uniform effective array is jointly constructed with the ISAC precoding design. We formulate a sum communication rate maximization problem by jointly optimizing the ISAC beamforming schemes and antenna-mode assignment under sensing, power, and antenna mode constraints. We develop an alternating-optimization-based solution framework mainly with the aid of weighted minimum mean square error, continuous relaxation-based penalty, and successive convex approximation. Numerical results show that the proposed non-uniform array achieves higher sum-rates than the uniform-array baselines, with particularly large gains when the number of activated antennas is small. Moreover, the proposed non-uniform array can achieve, and in some cases exceed, the performance of uniform array baselines with substantially fewer activated antennas, highlighting geometry-aware non-uniform array design as a compelling alternative to brute-force antenna scaling-based array design.

This paper addresses the stability analysis and state estimation of generalized Persidskii systems subject to time-varying delays and external disturbances. The generalized Persidskii class, which couples linear dynamics with sector-bounded nonlinear feedback loops, offers a tractable yet expressive framework for modeling electromechanical and neural network systems. We develop delay-dependent conditions for input-to-state stability (ISS) via Lyapunov–Krasovskii functionals incorporating Persidskii-type integral terms, and cast these conditions as linear matrix inequalities (LMIs). A structured robust observer is proposed for systems with partial state measurement, and its convergence is guaranteed through an $H_\infty$ synchronization criterion. To handle plant uncertainty, the system matrices are identified from trajectory data using a stability-preserving Koopman lifting procedure, in which the ISS-LMI constraint is embedded as a convex side condition during parameter regression. The identified model populates the prediction horizon of an ICODE-MPPI (Input-dependent Control-oriented Dynamical Estimation – Model Predictive Path Integral) controller. The complete framework is validated on a 1.5 kW Permanent Magnet Synchronous Motor (PMSM) drive equipped with a programmable load brake. Experimental results confirm a 35% reduction in velocity estimation RMSE relative to an Extended Kalman Filter and a 67% improvement in speed-tracking accuracy relative to standard Field-Oriented Control, corroborating the theoretical ISS bounds established herein.

Cuffless blood pressure (BP) estimation based on Pulse Transit Time (PTT) has emerged as a promising solution for continuous health monitoring. However, conventional models relying on the Moens-Korteweg equation often fail during rapid hemodynamic fluctuations, as they assume arterial walls are purely elastic and neglect inherent viscoelasticity. To address this limitation, we propose a physics-informed framework introducing a viscoelastic compensation mechanism. First, raw photoplethysmogram (PPG) signals undergo high-fidelity reconstruction using Modified Akima (Makima) interpolation. Second, a robust Intersecting Tangent Method is applied for precise pulse foot localization. Crucially, we utilize Ensemble Empirical Mode Decomposition (EEMD) to isolate high-frequency Intrinsic Mode Functions (IMFs), defining a “Viscoelastic Velocity Metric” to quantify the vascular damping effect ($\eta \cdot \dot{\epsilon}$) typically ignored by elastic models. The framework was rigorously validated on a challenging subset of the MIMIC-II database (364 subjects, 28,525 cardiac cycles) characterized by a high prevalence of hypertension (23.4%). Experimental results demonstrate medical-grade accuracy, yielding a Root Mean Square Error (RMSE) of 5.22 mmHg for Systolic and 3.65 mmHg for Diastolic BP, with Pearson correlation coefficients ($R > 0.97$). These findings confirm that incorporating viscoelastic features significantly enhances robustness against vascular hysteresis.

Terrestrial network limitations drive the integration of non-terrestrial networks (NTNs), notably mega-constellations comprising thousands of low Earth orbit (LEO) satellites. While these satellites act as interconnected network switches via inter-satellite links (ISLs), their massive scale creates severe bottlenecks for network management. To address this, we propose a scalable, hierarchical software-defined networking (SDN) framework. Our architecture leverages graph neural networks (GNNs) to compactly represent the constellation topology, and Koopman theory to linearize nonlinear dynamics. Specifically, a Graph Koopman Autoencoder (GKAE) forecasts spatio-temporal behavior within a linear subspace for each orbital shell. A central SDN controller then aggregates these shell-level predictions for globally coordinated control. Simulations on the Starlink constellation demonstrate that our approach achieves at least a 42.8% improvement in spatial compression and a 10.81% improvement in temporal forecasting compared to established baselines, all while utilizing a significantly smaller model footprint.

In this letter, we study a model-based inverse problem for infinite-horizon linear-quadratic differential games with descriptor dynamics. Given an observed feedback strategy profile, we seek to identify all cost functions that rationalize it as a feedback Nash equilibrium; this collection is referred to as the solution set. We characterize the solution set, show that it is rectangular and convex, and provide an algorithm for computing an admissible realization whenever it is nonempty. We also show that, compared with the corresponding inverse problem for standard state-space dynamics, descriptor dynamics modify the geometry of the solution set and may reduce identifiability. Finally, we illustrate the results with numerical examples.

Multi-talker automatic speech recognition (ASR) in conversational recordings remains an open problem, particularly in scenarios with large portion of overlapping speech where identifying and transcribing a target speaker is difficult from audio alone. Visual cues can help resolve speaker ambiguity, yet their integration into long-context audio-visual (AV) ASR systems has been limited. The CHiME-9 MCoRec task addresses this challenge by requiring transcription of audio-visual recordings of heavily-overlapped parallel conversations, followed by clustering the participants into conversational groups. In this work, we present the BUT system based on a long-context target-speaker AV-ASR model capable of processing long-form recordings in a single decoding pass. Our architecture conditions a pre-trained NVIDIA Parakeet-v2 ASR model on visual representations from a pre-trained AV-HuBERT model. To cluster participants into conversation groups, we employ Qwen3.5-122B LLM to estimate transcript topic similarity followed by hierarchical agglomerative clustering. On the MCoRec development set, the proposed system achieves 33.7% WER and a clustering F1 score of 0.97, improving over the official baseline by 16.2% WER and 0.15 F1 absolute. On the eval set, our team ranked second, being 0.16% WER and 0.5% F1 worse than the best system.

We propose a knowledge-driven approach to speech target extraction in the presence of background sound effects already recorded in cinematic audio. The specific knowledge sources studied are manners of articulation that are detected in speech frames and adopted to form a knowledge vector as a part of features to enhance speech separation and target speech extraction because some short speech segments are often difficult to separate from mixed background sounds. Testing on the recent Sound Demixing Challenge data for cinematic audio source separation (CASS) shows that utilizing articulator-aware knowledge sources produces better separation results than those obtained without using any knowledge, especially for speech segments buried in unspecified background sound events.

Alberto Isidori's framework of geometric nonlinear control, and particularly of feedback linearization, is the inspiration behind PDE backstepping: apply a transfromation of the state to cast the plant into a canonical form, bring all the non-canonical effects within the "span" of (boundary) control, and close the design with a feedback that makes the closed loop evolve in accordance with well-studied stable dynamics. The specificity of this approach is that, for PDEs, there is not one canonical form (like Brunovsky for ODEs) but the canonical forms are PDE-class-specific. When conducting this process for nonlinear PDEs, where the "transformation of the state" is performed using a nonlinear Volterra series indexed by the spatial variable, enormous technical challenges arise. One has to deal with kernels governed by PDEs on simplex domains growing in dimension to infinity, capture the growth rates of these kernels of the "direct transformation," and conduct the same for the "inverse transformation" without directly studying its Volterra kernels. So far, this agenda has been executed only once, two decades ago: for parabolic PDEs by Vazquez and Krstic [Automatica, 2008]. Generalization attempts have not followed because of the immense complexity involved in feedback-linearizing nonlinear PDEs. In this paper, dedicated to Professor Isidori, we convert the PDE feedback-linearizing methodology of 2008 from the parabolic to a hyperbolic class and, for a transport-adapted subclass of Chen-Fliess series, construct controllers without kernel PDEs.

Robotic-assisted surgery offers significant clinical advantages but largely eliminates direct haptic feedback, increasing the risk of excessive tool-tissue interaction forces. Although recent commercial systems have begun to introduce force feedback, their high cost limits accessibility, particularly for surgical training. This paper presents a modular experimental robotic laparoscopic instrument integrated with a real-time haptic feedback framework. The proposed instrument employs a wrist-mounted force/torque (F/T) sensor to estimate tool-tissue interaction forces while avoiding the durability and integration challenges of tip-mounted sensors. A haptic feedback framework is developed to extract the external contact forces, render them to the haptic device, and generate stable and perceptually meaningful feedback. The instrument is integrated into the robotic surgery training system (RoboScope) and evaluated through a controlled user study involving a force regulation task. Experimental results demonstrate that haptic feedback significantly improves task success rate, force regulation accuracy, and task efficiency compared to visual-only feedback. The proposed instrument enables stable, high-fidelity haptic interaction, supporting effective robotic surgery training.

Nasotracheal intubation (NTI) is a critical clinical procedure for establishing and maintaining patient airway patency. Machine-assisted NTI has emerged as a pivotal approach for optimizing procedural efficiency and minimizing manual intervention. However, visual detection algorithms employed for NTI navigation encounter significant challenges, including complex anatomical environments and suboptimal illumination conditions surrounding the glottis. Additionally, the glottis presents considerable scale variability throughout the procedure, initially appearing as a small, difficult-to-capture structure before expanding to occupy nearly the entire field of view. Moreover, traditional visual detection methods often have high computational costs, making real-time, high-precision detection on portable devices challenging. To enhance NTI efficacy and address these challenges, this paper proposes a novel glottis segmentation framework optimized for vision-assisted NTI applications. First, we designed a lightweight, multi-receptive field feature extraction module to reduce intra-class differences, achieving robustness to scale variations of the glottis. This module was then stacked to form the backbone and neck of our network. Subsequently, we developed an advanced label assignment method and redefined the number of samples to further reduce intra-class differences and enhance accuracy in the complex NTI environment. Experiments on three distinct datasets demonstrate that our network surpasses state-of-the-art algorithms, achieving a segmentation mDice of 92.9% with a compact model size of 19 MB and an inference speed exceeding 170 frames per second. % Our code and datasets will be open-sourced on GitHub after the manuscript is accepted. Our code and datasets are available at https://github.com/HBUT-CV/GlottisNet.

We study the set of solutions to a parameterized, strongly convex optimization problem whose cost depends on uncertain, bounded parameters. We compute a certified outer approximation of the corresponding set of optimizers, using convergence properties of the projected gradient descent (PGD) algorithm for convex programs. Concretely, by treating the cost parameter as constant but unknown, we interpret the PGD iterates as an uncertain dynamical system and analyze its forward reachable sets. Since PGD converges exponentially to the unique optimizer for each fixed parameter, these reachable sets provide outer approximations of the optimizer set, with an explicit error bound that decays exponentially with the iteration count. We apply system-level synthesis (SLS) on the PGD dynamics to optimize the step-size sequence and obtain reachable-set over-approximations. Our method outperforms existing baselines in over-approximating, with low conservativeness, the minimizer sets of convex programs with uncertain costs and high-dimensional decision variables.

The emergence of movable antenna (MA) technology provides a promising way to enhance wireless sensing and communication by introducing spatial degrees of freedom through dynamic array reconfiguration. In near-field localization, achieving high resolution at low cost necessitates the adoption of sparse arrays. However, such sparsity tends to introduce spatial ambiguity due to aliasing effects. To resolve this resolution-ambiguity dilemma, this paper proposes an MA-enabled array zooming (AZ) system. First, we design a multi-measurement array zooming system that dynamically adjusts antenna spacings. By fusing the observational information from different measurements, the proposed AZ system effectively mitigates spatial aliasing while maintaining spatial resolution. Second, to quantify the performance limits under the severe multi-modal distributions inherent in sparse near-field sensing, we theoretically analyze the false peak distribution and derive a tighter performance lower bound, which incorporates the false detection probability. Third, considering that multiple false peaks may exist in practical multi-modal distributions, we propose an optimization algorithm for the AZ system to suppress false peaks and minimize the localization error. Extensive numerical results demonstrate that the proposed AZ strategy adaptively optimizes array configurations under varying signal-to-noise ratios (SNRs), substantially outperforming both conventional fixed-spacing arrays and Cramer-Rao bound (CRB)-based AZ benchmarks in localization accuracy.

Hyperspectral image super-resolution is essential for enhancing the spatial fidelity of HSI data, yet existing deep learning methods often struggle with substantial spectral redundancy and the limited non-linear modeling capacity of standard feed-forward networks (FFNs). To address these challenges, we propose Spectral Dynamic Attention Network (SDANet), a framework designed to adaptively suppress redundant spectral interactions. SDANet integrates two key components: 1) Dynamic Channel Sparse Attention (DCSA) module that computes channel-wise correlations and selectively preserves the most informative attention responses through dynamic and data-dependent sparsification. 2) Frequency-Enhanced Feed-Forward Network (FE-FFN) that jointly models spatial and frequency-domain representations to enhance non-linear expressiveness. Extensive experiments on two benchmark datasets demonstrate that SDANet achieves state-of-the-art HISR performance while maintaining competitive efficiency. The code will be made publicly available at https://github.com/oucailab/SDANet.

Hyperspectral image (HSI) and SAR/LiDAR data offer complementary spectral and structural information for land-cover classification. However, their effective fusion remains challenging due to two major limitations: The spectral redundancy in high-dimensional HSI and the heterogeneous characteristics between multi-source data. To this end, we propose Representative Spectral Correlation Network (RSCNet), a novel multi-source image classification framework specifically designed to address the above challenges through spectral selection and adaptive interaction. The network incorporates two key components: (1) Key Band Selection Module (KBSM) that adaptively selects task-relevant spectral bands from the original HSI under cross-source guidance, thereby alleviating redundancy and mitigating information loss from conventional PCA-based spectral reduction. Moreover, the learned band subset exhibits highly discriminative spectral structures that align with discriminative semantic cues, promoting compact yet expressive representations. (2) Cross-source Adaptive Fusion Module (CAFM) that performs cross-source attention weighting and local-global contextual refinement to enhance cross-source feature interaction. Experiments on three public benchmark datasets demonstrate that our RSCNet achieves superior performance compared with state-of-the-art methods, while maintaining substantially lower computational complexity. Our codes are publicly available at https://github.com/oucailab/RSCNet.

Antithetic feedback controllers have become a key experimental and theoretical tool in synthetic biology. Introduced by Khammash and collaborators about 10 years ago, they are employed in order to achieve the practical regulation of protein expression, including tracking and robust disturbance rejection. In closed-loop, there are unique equilibria which, depending on parameter values, can be unstable. It had been shown, however, that this instability is not arbitrary: any bounded trajectory that stays away from the equilibrium must converge to a periodic orbit. This motivated a long-standing open question: is every trajectory bounded? In other words, even if the equilibrium is unstable, can nonlinear effects prevent unbounded excursions in the state space? This paper provides an affirmative answer, establishing the boundedness of all solutions. Previous attempts to prove this fact using Lyapunov functions had no success. Instead, this paper takes a completely different approach, specific to antithetic configurations, in which the key idea is to think of the controller as providing a “persistently negative feedback” which acts far away from the equilibrium in such a way so as to keep trajectories from diverging. This new approach, although tailored to the antithetic controller, might be useful in other applications as well.

Audio-based stuttering systems to date have been trained for detection – what disfluency is present now – leaving prediction, the capability needed for closed-loop intervention, unstudied at deployable scale. We train a 616K-parameter CNN on SEP-28k (Apple, 20,131 three-second clips) to predict whether the next contiguous clip contains any disfluency. (1) Severity-selective precursor signal: on the episode-grouped test set, aggregate preblock AUC is modest (0.581 [0.542, 0.619]), but stratifying by upcoming event type reveals concentration on clinically severe events – blocks 0.601 [0.554, 0.651] and sound repetitions 0.617 [0.567, 0.667] both exclude chance, while fillers (0.45) and word repetitions (0.49) are at chance. The aggregate objective converges to a severity-selective predictor because severe events carry prosodic precursors; fillers do not. (2) Cross-population transfer: without fine-tuning, the same checkpoint applied to 1,024 pediatric Children-Who-Stutter utterances (FluencyBank Teaching) attains AUC 0.674 detection and 0.655 prediction; DisfluencySpeech and LibriStutter reach 0.58-0.60 AUC. (3) Deployable on-device: lossless export to CoreML (1.19 MB), ONNX (40 KB), TFLite. Neural-Engine latency per 3 s window: 0.25 ms (iPhone 17 Pro Max, A19 Pro) to 0.55 ms (iPhone SE 3rd-gen and M1 Max). A 4 Hz streaming simulation uses 0.54% of the real-time budget. Platt-calibrated outputs (test ECE 0.010, from 0.177 raw). Five negative ablations – output-level Future-Guided Learning, multi-clip GRU, time-axis concatenation, asymmetric focal loss, direct block-targeted training – none improved over the vanilla baseline.

Speech recruits the same executive, attentional, and working memory processes underlying instrumental activities of daily living, or IADLs, providing a non-invasive proxy for cognitive assessment. Yet most speech-based dementia detection systems depend on transcription, discard within-recording temporal structure, and are validated on a single English corpus with known recording artifacts. We propose an ASR-agnostic framework operating directly on Mel spectrograms. Our key contribution is extracting spectrotemporal displacement fields from consecutive spectrogram frames, capturing shifting spectral energy patterns as digital biomarkers of cognitive decline. These features are fused with CNN-ConvGRU acoustic embeddings via a learned cross-attention mechanism and aggregated using a Transformer encoder with learnable query pooling. A composite temporal loss enforces smoothness and contrastive coherence across segments. We train independent models on English DementiaBank, Slovak EWA-DB, and Spanish Ivanova corpora, using clinical elicitation protocols taxing IADL-relevant cognitive domains. The Slovak model achieves 83.9% accuracy, and Spanish achieves, while the English baseline yields 53.2%, confirming known artifacts. Cross-lingual ablation studies reveal distinct fusion regimes: removing cross-attention collapses Spanish performance to 53.7%, below unimodal models, while the Slovak audio encoder alone outperforms the full model, 93.7% vs. 83.9%, and all English configurations remain near chance. Thus, multimodal fusion's value is corpus-dependent: essential when signal is distributed across modalities, counterproductive when one dominates, and irrelevant when no signal exists. Auxiliary temporal losses converge to language-invariant values, indicating cross-lingual architectural stability.

Accurate estimation of the human circadian phase plays an important role in personalized health monitoring, but most existing wearable-based approaches operate retrospectively and require full circadian cycle recordings, leading to high estimation latency and substantial data and computational burden for real-time deployment on edge devices. In this study, we investigated whether circadian phase can be estimated in real time using only short historical windows of wearable data. We propose a low latency framework that estimates instantaneous circadian phase from past observations, with a cosinor-fitted core body temperature rhythm serving as the reference. Data from a free-living field study involving 14 participants were used to systematically evaluate the effects of sensor modality selection, historical window length, and model class under participant-based cross-validation. The results showed that estimation accuracy improves with increasing window length but saturates at approximately 8 hours of history. Tree-based models reached a performance plateau beyond 480 minutes, whereas sequence-based models continued to benefit from longer temporal contexts. When relying solely on light exposure and physical activity, the proposed approach achieved a mean circular mean absolute error (CMAE) of 1.19 h. These findings provide practical guidance for efficient and deployable real-time circadian phase monitoring using wearables.

Multi-band sensing has emerged as a key enabler of integrated sensing and communication (ISAC), one of the six primary usage scenarios defined for IMT-2030 (6G). The introduction of frequency range 3 (FR3, 7-24 GHz), comprising non-contiguous sub-bands across a wide frequency span, further reinforces the importance of multi-band operation. In such scenarios, frequency-dependent clutter, collectively referred to as dense multipath components (DMC), must be carefully considered. Building on prior literature and our experimental observations, this paper analyzes the impact of DMC on multi-band fusion ISAC systems by investigating Cramér-Rao bound (CRB)-based fundamental limits and the performance of our proposed multi-band estimator. Numerical results show that multi-band processing, especially in DMC-dominated scenarios, can substantially reduce estimation error and boost system resilience when channel statistics vary.

Short-term load forecasting for AI data centers presents new challenges because it is computing-driven, with heterogeneous job arrivals, sizes, and durations exhibiting bursty, non-stationary dynamics. Compared with traditional load types, data center loads are less researched and can pose greater threats to the efficiency and stability of power grids. To close the gap, this paper proposes a regime-adaptive ensemble learning forecasting algorithm to predict computing-driven dynamic workloads in AI data centers. A weight-learned neural network within an ensemble learning framework is developed to exploit the complementary strengths of two machine learning (ML) submodels across varying operating regimes. Furthermore, a novel feature engineering strategy is developed to incrementally learn from a non-stationary data stream. Thus, the ensemble weights are dynamically optimized to facilitate adaptive calibration of inter-submodel contributions. Comparative case studies on the MIT Supercloud dataset demonstrate that the proposed method significantly enhances load forecasting accuracy and adaptivity across various regimes, and the selected combination of ML models for ensemble learning outperforms other possible combinations. To the best of our knowledge, our method is the first to reduce minute-class forecasting errors for AI data center loads to below 1%, highlighting its potential for grid-interactive coordination and demand response.

Orbital data centers are being evaluated as solar-powered compute constellations and relay-integrated processing platforms. Their feasibility is not set by orbital solar flux alone, but by simultaneous closure of photovoltaic generation, eclipse recharge, radiative heat rejection, sustained space-to-ground communications, utilization, replacement cadence, and delivered compute-years over finite mission life. This paper derives necessary cluster-level competitiveness conditions using delivered information-technology (IT) electrical power $P_{\rm IT}$, deployed mass per delivered IT power $m_{\rm kW}$ in kg/kW, communication intensity $\Gamma=D_{\rm sg}/E_{\rm IT}$, sustained communication ceiling $\Gamma_{\max}$, effective utilization $U_{\rm eff}$, and lifetime penalty $\Pi_{\rm life}$. For a representative $P_{\rm IT}$=1 MW high-sunlight anchor, the base case gives beginning-of-life photovoltaic area $A^{\rm BOL}_{\rm PV}=5.64 \times 10^3 {\rm m}^2$, radiator area $A_{\rm rad}=2.50 \times 10^3 {\rm m^2}$, and 29.4 kg/kW for photovoltaic, storage, and radiator mass; fixed spacecraft mass raises the total to 34-59 kg/kW. At m_kW ~ 40 kg/kW, a terrestrial infrastructure benchmark of 10-40 k\$/kW allows only 250-1000 \$/kg for the combined launch and spacecraft-build cost before space-to-ground communications, operations, utilization, and lifetime terms are included. That allowance is 3.4-13.5 times below the current public Falcon 9 dedicated low-Earth-orbit launch-price benchmark alone, before spacecraft build is included. Space-native preprocessing and communications-integrated edge compute are credible early regimes; terrestrial-user general compute closes only for low Earth-coupled communication intensity, high effective utilization, long delivered lifetime, and very low combined launch-plus-build cost.

Automatic Emergency Braking (AEB) systems represent a safety-critical national interest, with the National Highway Traffic Safety Administration (NHTSA) Federal Motor Vehicle Safety Standard (FMVSS No. 127) requiring AEB in all new light vehicles sold in the United States by September 2029. However, production implementations frequently rely on deterministic stopping-distance or Time-to-Collision (TTC) thresholds that fail to capture uncertainty in sensing, road conditions, and vehicle dynamics. This paper presents a GPU-accelerated Monte Carlo framework for stochastic evaluation of emergency braking performance using a longitudinal vehicle model incorporating aerodynamic drag, road grade, brake actuator dynamics, and weight transfer effects. A one-thread-per-sample execution strategy exploits the independence of Monte Carlo rollouts, while deterministic CPU-generated sampling ensures bit-exact numerical consistency between CPU and GPU implementations. The framework is evaluated across four hardware platforms: two laptop GPUs (GTX 1650, RTX 5070) and two automotive-grade embedded platforms (Jetson Orin Nano, Jetson AGX Orin). Peak speedups of 54.57x are achieved. Real-time feasibility analysis with a complete AEB timing budget demonstrates that the Jetson AGX Orin can execute approximately 25,000 Monte Carlo samples within a 530 ms budget, enabling real-time probabilistic AEB evaluation as part of a complete embedded pipeline. Collision probability analysis demonstrates that a threshold set at the mean stopping distance of 79.2 m leaves a collision probability of approximately 47%, while the conservative 1% risk threshold requires a minimum safe headway of 111.1 m, an additional 31.9 m (40%). These results provide quantitative guidance for risk-aware AEB threshold selection under the NHTSA final rule.

We study finite-horizon budget allocation as a closed-loop economic control problem and evaluate receding-horizon Model Predictive Control (MPC) relative to reactive budgeting policies. Budgets are allocated periodically under execution noise and operational constraints, while return efficiency may evolve over time. Using a controlled simulation framework motivated by digital marketing, we compare reactive pacing to MPC across environments with increasing degrees of non-stationarity. Our results show that non-stationarity alone does not justify predictive control. When return dynamics are stationary or evolve through unpredictable stochastic drift, MPC offers no systematic advantage over reactive baselines. By contrast, when return efficiency exhibits predictable structure over the planning horizon, that is captured through an underlying model, MPC consistently outperforms reactive budgeting by exploiting intertemporal trade-offs.