We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y. The unknown signal and observation are modeled as random vectors whose joint probability distribution is unknown, but assumed to belong to a given type-2 Wasserstein ball of distributions, termed the ambiguity set. The performance of an estimator is measured according to the conditional value-at-risk (CVaR) of the squared estimation error. Within this framework, we study the problem of computing affine estimators that minimize the worst-case CVaR over all distributions in the given ambiguity set. As our main result, we show that, when the nominal distribution at the center of the Wasserstein ball is finitely supported, such estimators can be exactly computed by solving a tractable semidefinite program. We evaluate the proposed estimators on a wholesale electricity price forecasting task using real market data and show that they deliver lower out-of-sample CVaR of squared error compared to existing methods.

The scarcity of labeled clinical data in oncology makes Few-Shot Learning (FSL) a critical framework for Computer Aided Diagnostics, but we observed that standard Prototypical Networks often struggle with the "prototype instability" caused by morphological noise and high intra-class variance in brain tumor scans. Our work attempts to minimize this by integrating a non-linear Logistic Chaos Module into a fine-tuned ResNet-18 backbone creating the Chaos-Enhanced ProtoNet(CE-ProtoNet). Using the deterministic ergodicity of the logistic chaos map we inject controlled perturbations into support features during episodic training-essentially for "stress testing" the embedding space. This process makes the model to converge on noise-invariant representations without increasing computational overhead. Testing this on a 4-way 5-shot brain tumor classification task, we found that a 15% chaotic injection level worked efficiently to stabilize high-dimensional clusters and reduce class dispersion. Our method achieved a peak test accuracy of 84.52%, outperforming standard ProtoNet. Our results suggest the idea of using chaotic perturbation as an efficient, low-overhead regularization tool, for the data-scarce regimes.

We examine market outcomes in energy transport networks with a focus on gas-fired generators, which are producers in a wholesale electricity market and consumers in the natural gas market. Market administrators monitor bids to determine whether a participant wields market power to manipulate the price of energy, reserves, or financial transmission rights. If economic or physical withholding of generation from the market is detected, mitigation is imposed by replacing excessive bids with reference level bids to prevent artificial supply shortages. We review market monitoring processes in the power grid, and present scenarios in small interpretable test networks to show how gas-fired generators can bid in the gas market to alter outcomes in a power market. We develop a framework based on DC optimal power flow (OPF) and steady-state optimal gas flow (OGF) formulations to represent two interacting markets with structured exchange of price and quantity bids. We formulate optimization-based methods to identify market power in a power grid, as well as to identify market conditions that indicate market power being exerted by a generator using gas market bids.

Model-based policy optimization often struggles with inaccurate system dynamics models, leading to suboptimal closed-loop performance. This challenge is especially evident in Model Predictive Control (MPC) policies, which rely on the model for real-time trajectory planning and optimization. We introduce a novel policy optimization framework for MPC-based policies combining differentiable optimization with zeroth-order optimization. Our method combines model-based and model-free gradient estimation approaches, achieving faster transient performance compared to fully data-driven approaches while maintaining convergence guarantees, even under model uncertainty. We demonstrate the effectiveness of the proposed approach on a nonlinear control task involving a 12-dimensional quadcopter model.

Nitrogen (N) is one of the most critical nutrients in winegrape production, influencing vine vigor, fruit composition, and wine quality. Because soil N availability varies spatially and temporally, accurate estimation of leaf N concentration is essential for optimizing fertilization at the individual plant level. In this study, in-field hyperspectral images (400-1000 nm) were collected from four grapevine cultivars (Chardonnay, Pinot Noir, Concord, and Syrah) across two growth stages (bloom and veraison) during the 2022 and 2023 growing seasons at both the leaf and canopy levels. An ensemble feature selection framework was developed to identify the most informative spectral bands for N estimation within individual cultivars, effectively reducing redundancy and selecting compact, physiologically meaningful band combinations spanning the visible, red-edge, and near-infrared regions. At the leaf level, models achieved the highest predictive accuracy for Chardonnay (R^2 = 0.82, RMSE = 0.19 %DW) and Pinot Noir (R^2 = 0.69, RMSE = 0.20 %DW). Canopy-level predictions also performed well, with R^2 values of 0.65, 0.72, and 0.70 for Chardonnay, Concord, and Syrah, respectively. White cultivars exhibited balanced spectral contributions across the visible, red-edge, and near-infrared regions, whereas red cultivars relied more heavily on visible bands due to anthocyanin-chlorophyll interactions. Leaf-level N-sensitive bands selected for Chardonnay and Pinot Noir were successfully transferred to the canopy level, improving or maintaining prediction accuracy across cultivars. These results confirm that ensemble feature selection captures spectrally robust, scale-consistent bands transferable across measurement levels and cultivars, demonstrating the potential of integrating in-field hyperspectral imaging with machine learning for vineyard N status monitoring.

Unified decoder-only transformers have shown promise for multimodal generation, yet the mechanisms by which they synchronize modalities with heterogeneous sampling rates remain underexplored. We investigate these mechanisms through video-text-to-speech (VTTS) synthesis-a controlled task requiring fine-grained temporal alignment between sparse text, video, and continuous speech. Using a unified decoder-only transformer, dubbed Visatronic, trained on VoxCeleb2, we study: (i) how modalities contribute complementary information, (ii) how positional encoding strategies enable synchronization across heterogeneous rates, (iii) how modality ordering shapes the trade-off between in-domain performance and cross-domain transfer, (iv) how phoneme-level synchronization metrics provide diagnostic insight into per-phoneme timing errors. Our findings reveal that both "global sequential indexing'' (unique position IDs across modalities) and "co-temporal ordered indexing'' (identical IDs for temporally corresponding tokens) achieve strong synchronization performance, with co-temporal ordered indexing providing a simple mechanism without explicit timestamp metadata. Both text and video contribute complementary signals: text ensures intelligibility while video provides temporal cues and emotional expressiveness. Modality ordering reveals a consistent trade-off: video-first ordering achieves stronger in-domain performance while text-first ordering generalizes more robustly to unseen domains. Our findings also reveal, that diverse large-scale training enables transferable synchronization strategies. To enable fine-grained analysis, we also introduce TimeSync, a phoneme-level metric that reveals temporal misalignments overlooked by frame-level metrics. These insights establish VTTS as a valuable testbed for understanding temporal synchronization in unified multimodal decoders.

This paper studies end-to-end latency minimization for a multi-band radar sensing and deep neural network (DNN) inference pipeline. Unlike conventional stage-wise designs that treat radar sensing and DNN inference as two sequential stages, the proposed framework exploits cross-stage parallelism by allowing the inference branch associated with a sensed band to start as soon as that band completes sensing, without waiting for all bands to finish. To characterize this interaction, we formulate a joint scheduling problem that couples sensing-time allocation, branch release timing, and non-preemptive multi-core execution of a directed acyclic graph (DAG) under sensing-feasibility, precedence, and core-capacity constraints. Since the resulting problem is combinatorial and strongly time-coupled, we further develop a release-aware heuristic that evaluates each sensing decision according to its downstream impact on the DAG makespan, together with a greedy list scheduler for multi-core DAG execution under release times. Simulation results show that the proposed design can effectively exploit cross-stage parallelism and reduce end-to-end latency relative to a decoupled baseline in many heterogeneous sensing scenarios, while also clarifying the operating regimes in which the latency gain becomes limited.

This paper proposes a multi-step probabilistic forecasting framework using a single neural-network based model to generate simultaneous point and interval forecasts. Our approach ensures non-crossing prediction intervals (PIs) through a model structure design that strictly satisfy a target coverage probability (PICP) while maximizing sharpness. Unlike existing methods that rely on manual weight tuning for scalarized loss functions, we treat point and PI forecasting as a multi-objective optimization problem, utilizing multi-gradient descent to adaptively select optimal weights. Key innovations include a new PI loss function based on an extended log-barrier with an adaptive hyperparameter to guarantee the coverage, a hybrid architecture featuring a shared temporal model with horizon-specific submodels, and a training strategy. The proposed loss is scale-independent and universally applicable; combined with our training algorithm, the framework eliminates trial-and-error hyperparameter tuning for balancing multiple objectives. Validated by an intra-day solar irradiance forecasting application, results demonstrate that our proposed loss consistently outperforms those in current literature by achieving target coverage with the narrowest PI widths. Furthermore, when compared against LSTM encoder-decoder and Transformer architectures--including those augmented with Chronos foundation models--our method remains highly competitive and can be seamlessly adapted to any deep learning structure.

Large Language Models (LLMs) show promise in lyric-to-melody generation, but models trained with Supervised Fine-Tuning (SFT) often produce musically implausible melodies with issues like poor rhythm and unsuitable vocal ranges, a phenomenon we term "constraint violation". To address this, we propose a novel alignment framework that instills musical knowledge without human annotation. We define rule-based musical constraints to automatically generate a preference dataset from an SFT model's outputs. The model is then aligned through a sequential process, first using Direct Preference Optimization (DPO) on paired preference data, followed by Kahneman-Tversky Optimization (KTO) on unpaired negative samples. Experimental results demonstrate that our aligned model substantially reduces rule violations and outperforms strong baselines in both objective and subjective evaluations, generating melodies with substantially improved musicality and coherence. An interactive demo with audio comparisons is available at https://arain233.github.io/AligningMelody-demo.

Safety filters have been shown to be effective tools to ensure the safety of control systems with unsafe nominal policies. To address scalability challenges in traditional synthesis methods, learning-based approaches have been proposed for designing safety filters for systems with high-dimensional state and control spaces. However, the inevitable errors in the decisions of these models raise concerns about their reliability and the safety guarantees they offer. This paper presents Adaptive Conformal Filtering (ACoFi), a method that combines learned Hamilton-Jacobi reachability-based safety filters with adaptive conformal inference. Under ACoFi, the filter dynamically adjusts its switching criteria based on the observed errors in its predictions of the safety of actions. The range of possible safety values of the nominal policy's output is used to quantify uncertainty in safety assessment. The filter switches from the nominal policy to the learned safe one when that range suggests it might be unsafe. We show that ACoFi guarantees that the rate of incorrectly quantifying uncertainty in the predicted safety of the nominal policy is asymptotically upper bounded by a user-defined parameter. This gives a soft safety guarantee rather than a hard safety guarantee. We evaluate ACoFi in a Dubins car simulation and a Safety Gymnasium environment, empirically demonstrating that it significantly outperforms the baseline method that uses a fixed switching threshold by achieving higher learned safety values and fewer safety violations, especially in out-of-distribution scenarios.

Data detection in large-scale multiple-input multiple-output (MIMO) systems with higher-order quadrature amplitude modulation (QAM) remains a challenging problem due to the exponential complexity of the classical maximum likelihood (ML) detector. This challenge is further amplified by Gray-coded modulation, which introduces nonlinear symbol-to-bit mappings and transforms the problem into a higher-order unconstrained binary optimization (HUBO) formulation. To address this problem, this paper presents a hybrid quantum-classical detection framework that leverages a warm-start linear-ramp Quantum Approximate Optimization Algorithm (WSLR-QAOA) for solving the resulting HUBO problem. A structured warm-start based on a low-rank semidefinite relaxation, solved via a block coordinate descent (BCD) method, provides an efficient and high-quality initialization, while a linear ramp parameterization guides the QAOA optimization. Simulation results show that the proposed framework outperforms classical methods in terms of symbol error rate (SER) and converges faster than standard QAOA, while achieving performance close to the optimal ML detector. Furthermore, the WSLR-QAOA algorithm is validated on actual IBM quantum hardware, where it achieves near-ML performance at low SNR and maintains competitive accuracy at higher SNR despite moderate degradation due to hardware noise. This demonstrates the practical potential of the HUBO-based WSLR-QAOA algorithm for large-scale MIMO data detection.

This paper proposes an explainability concept for direct data-driven linear quadratic regulation (LQR) with quadratic regularization. Our perspective follows the parametric effect of regularization, an analysis approach that translates regularization costs from auxiliary variables to system quantities, enabling intuitive interpretations. The framework further enables the elimination of auxiliary variables, thereby reducing computational complexity. We demonstrate the effectiveness of our approach and the identified effect of regularization via simulations.

In this paper, the quasi-constant modulus (QCM) property is analyzed and leveraged in the design of nonlinearity-tolerant four-dimensional (4D) modulation formats. Accordingly, we propose a family of QCM-based quadrature amplitude modulation (QCM-QAM) constellations with high spectral efficiencies (SEs) of 9, 11, and 13 bit/4D-sym, respectively. The quasi-constant modulus design theoretically enhances tolerance to fiber nonlinearities. Meanwhile, QCM-QAM is evaluated in an unrepeatered wavelength-division multiplexing (WDM) system over both standard single-mode fiber (SSMF) and non-zero dispersion-shifted fiber (NZDSF). Across all SEs, QCM-QAM demonstrates robust nonlinear tolerance in both SSMF and NZDSF. This is evidenced by a consistent shift of the optimal launch power toward higher values and a significant improvement in effective signal-to-noise ratio (SNR). QCM-QAM also delivers generalized mutual information (GMI) gains of 0.22, 0.09, and 0.21 bit/4D-sym in SSMF, and 0.24, 0.10, and 0.22 bit/4D-sym, in NZDSF at the optimal transmission power, corresponding to the SEs of 9, 11, and 13 bit/4D-sym. Furthermore, QCM-QAM achieves transmission reach extensions of 1.6%, 0.9%, and 1.7% in SSMF, and 1.7%, 1.5%, and 1.8% in NZDSF, respectively, for the three SE levels.

Power system expansion depends on the equipment required to connect, convert, regulate, and condition electricity, yet grid-supporting equipment (GSE) is rarely modeled as an explicit constraint. We develop a framework integrating dynamic stock-flow modeling, bill-of-materials accounting, multi-regional supply-use analysis, and expansion optimization to quantify GSE deployment requirements and upstream material dependence. Because manufacturing data are often fragmented or proprietary, we use critical material requirements as a physically grounded proxy for GSE supply constraints. In a U.S. case study, GSE shortages reach 269.6--274.1 GVA (28.5%--28.6%) by 2030 under high-growth conditions. Copper becomes fully binding, with steel and nickel forming additional constraints. Trade disruption intensifies shortages, while grid-enhancing technologies provide limited relief. These results show that grid expansion depends on the timely manufacturability, replacement, and material support of GSE, motivating planning frameworks that explicitly incorporate deliverability, supply chain exposure, and resilience strategies.

The evolution of large aperture antennas and arrays at the sub-THz band (100-300 GHz) results in traditional far-field (FF) gain measurements to require large distances due to the high frequency nature making them impractical in many laboratory environments. In the presented work, absolute antenna gain measurements are performed in localized distance clusters for commercial horn antennas in the sub-THz range of 145-170 GHz using the three-antenna method, leveraging a theoretically derived modified FF equation along with the Friis transmission equation to enable a compact measurement setup. By applying the proposed modified FF formulation, the approach aims to redefine the FF distance by considering the combined effects of both the transmitting and receiving antennas, accounting for their aperture sizes and radiation characteristics. This allows precise gain characterization within a compact measurement footprint. The proposed theoretical model was validated through radiated measurements and simulations, demonstrating its effectiveness in this case study. Also, measurements were performed using dissimilar antenna pair combinations due to inventory constraints, a common challenge both in research and in industry. Despite the mismatches, the presented work demonstrates that reliable and sufficiently accurate measurement results can still be achieved. This highlights the practical feasibility of the compact cluster measurement technique without compromising measurement integrity. The compact setup ensures efficiency in the measurement time and cost, making it a robust solution for both research and industrial needs in sub-THz antenna characterization for applications including 6G, high frequency sensing, and imaging systems.

AI data center loads create query-driven power transients on millisecond timescales. Such loads can violate the timescale separation assumptions underlying internal inverter control of grid-following resources collocated with data centers as supplementary generation. This paper develops a singular perturbation-based modeling and control for stabilizing fast power imbalances. We show that physically-implementable droop control is derived and valid by requiring reduced-system stability rather than being imposed a priori, and that AI workloads satisfy a bounded-rate disturbance class due to physical filtering in power delivery hardware. The analysis yields explicit gain bounds linking inverter parameters to disturbance rejection performance, a modulation admissibility condition ensuring physical realizability of the feedback linearizing control, and a feasibility condition identifying the maximum tolerable load ramp rate. Numerical simulations validate the theoretical predictions under stochastic AI transients.

A non-iterative phase noise compensation method based on the sum-product algorithm (SPA) is applied to the outputs of intersymbol interference (ISI) channels. The outputs are modeled as independent Gaussian random variables, and the receiver applies mismatched processing with von Mises statistics. The performance is compared with that of linear minimum-mean-square-error filtering. The SPA achieves higher information rates at similar complexity for three channel types: ISI-free, standard single-mode fiber, and multipath channels with orthogonal frequency-division multiplexing.

Most data-driven ionospheric forecasting models operate on gridded products, which do not preserve the time-varying sampling structure of satellite-based sensing. We instead model the ionosphere as a dynamic graph over ionospheric pierce points (IPPs), with connectivity that evolves as satellite positions change. Because satellite trajectories are predictable, the graph topology over the forecast horizon can be constructed in advance. We exploit this property to condition forecasts on the future graph structure, which we term ephemeris conditioning. This enables prediction on lines of sight that appear only in the forecast horizon. We evaluate our framework on multi-GNSS (Global Navigation Satellite System) data from a co-located receiver pair in Singapore spanning January 2023 through April 2025. The task is to forecast Rate of TEC Index (ROTI)-defined irregularities at 5-minute cadence up to 2 hours ahead as binary probabilistic classification per node. The resulting model, IonoDGNN, achieves a Brier Skill Score (BSS) of 0.49 and a precision-recall area under the curve (PR-AUC) of 0.75, improving over persistence by 35\% in BSS and 52\% in PR-AUC, with larger gains at longer lead times. Ablations confirm that graph structure and ephemeris conditioning each contribute meaningfully, with conditioning proving essential for satellites that rise during the forecast horizon (receiver operating characteristic AUC: 0.95 vs.\ 0.52 without). Under simulated coverage dropout, the model retains predictive skill on affected nodes through spatial message passing from observed neighbors. These results suggest that dynamic graph forecasting on evolving lines of sight is a viable alternative to grid-based representations for ionospheric irregularity forecasting. The model and evaluation code will be released upon publication.

Signal Temporal Logic (STL) is a powerful language for specifying temporally structured robotic tasks. Planning executable trajectories under STL constraints remains difficult when system dynamics and environment structure are not analytically available. Existing methods typically either assume explicit models or learn task-specific behaviors, limiting zero-shot generalization to unseen STL tasks. In this work, we study offline STL planning under unknown dynamics using only task-agnostic trajectory data. Our central design philosophy is to separate logical reasoning from trajectory realization. We instantiate this idea in DAG-STL, a hierarchical framework that converts long-horizon STL planning into three stages. It first decomposes an STL formula into reachability and invariance progress conditions linked by shared timing constraints. It then allocates timed waypoints using learned reachability-time estimates. Finally, it synthesizes trajectories between these waypoints with a diffusion-based generator. This decomposition--allocation--generation pipeline reduces global planning to shorter, better-supported subproblems. To bridge the gap between planning-level correctness and execution-level feasibility, we further introduce a rollout-free dynamic consistency metric, an anytime refinement search procedure for improving multiple allocation hypotheses under finite budgets, and a hierarchical online replanning mechanism for execution-time recovery. Experiments in Maze2D, OGBench AntMaze, and the Cube domain show that DAG-STL substantially outperforms direct robustness-guided diffusion on complex long-horizon STL tasks and generalizes across navigation and manipulation settings. In a custom environment with an optimization-based reference, DAG-STL recovers most model-solvable tasks while retaining a clear computational advantage over direct optimization based on the explicit system model.

Autonomous swarms of multi-Unmanned Aerial Vehicle (UAV) system requires an accurate and fast relative state estimation. Although monocular frame-based camera methods perform well in ideal conditions, they are slow, suffer scale ambiguity, and often struggle in visually challenging conditions. The advent of event cameras addresses these challenging tasks by providing low latency, high dynamic range, and microsecond-level temporal resolution. This paper proposes a framework for relative state estimation for quadrotors using event-based propeller sensing. The propellers in the event stream are tracked by detection to extract the region-of-interests. The event streams in these regions are processed in temporal chunks to estimate per-propeller frequencies. These frequency measurements drive a kinematic state estimation module as a thrust input, while camera-derived position measurements provide the update step. Additionally, we use geometric primitives derived from event streams to estimate the orientation of the quadrotor by fitting an ellipse over a propeller and backprojecting it to recover body-frame tilt-axis. The existing event-based approaches for quadrotor state estimation use the propeller frequency in simulated flight sequences. Our approach estimates the propeller frequency under 3% error on a test dataset of five real-world outdoor flight sequences, providing a method for decentralized relative localization for multi-robot systems using event camera.

This work investigates a full-duplex (FD)-enhanced Rate-Splitting Multiple Access (RSMA) system under practical constraints, including imperfect channel state information (CSI) and successive interference cancellation (SIC). We derive closed-form expressions for key performance metrics, such as outage probability and throughput, for both uplink and downlink users. The analysis considers co-channel interference (CCI) from uplink to downlink users and models the self-interference (SI) channel as a random variable. Monte Carlo simulations validate the analytical results and highlight the impact of system imperfections on RSMA-FD performance. At low transmit power, imperfect CSI significantly affects the system, though this effect weakens as power increases. In contrast, imperfect SIC becomes more detrimental at high transmit power, causing severe degradation. Additionally, neglecting CCI and assuming perfect SI cancellation leads to substantial overestimation of performance. Lastly, we demonstrate that the SI cancellation factor must be carefully selected to suppress interference effectively. Otherwise, a poor choice limits the full potential of FD technology.

The ability of humans for lifelong learning is an inspiration for deep learning methods and in particular for continual learning. In this work, we apply Hebbian learning, a biologically inspired learning process, to sound classification. We propose a kernel plasticity approach that selectively modulates network kernels during incremental learning, acting on selected kernels to learn new information and on others to retain previous knowledge. Using the ESC-50 dataset, the proposed method achieves 76.3% overall accuracy over five incremental steps, outperforming a baseline without kernel plasticity (68.7%) and demonstrating significantly greater stability across tasks.

This work investigates the ergodic rate performance analysis of rate-splitting multiple access (RSMA) in a downlink communication system under practical impairments. Closed-form expressions are derived for key performance metrics such as ergodic rate, energy efficiency, sum-rate, and Jains fairness index, capturing the joint effects of imperfect channel state information at the receiver (CSIR), imperfect successive interference cancellation (SIC), and hardware impairments. Numerical simulations validate the accuracy of the analytical expressions and reveal several insightful trends. At low transmit powers, imperfect CSIR is the dominant performance-limiting factor, followed by hardware impairments and imperfect SIC. However, as the transmit power increases, hardware impairments become the primary bottleneck, with the impact of imperfect CSIR gradually diminishing, and imperfect SIC becoming a more prominent bottleneck. Moreover, RSMA consistently outperforms non-orthogonal multiple access (NOMA) in terms of ergodic rate, fairness, and sum-rate, even under severe non-idealities. These findings underscore the importance of incorporating fairness as a core design objective alongside rate and energy efficiency, positioning RSMA as a robust and strong multiple access candidate for next-generation wireless networks.

Emissions reduction and resilience to outages motivate the adoption of renewable microgrids. Surprisingly, research integrating both probabilistic grid outages and electric vehicle (EV) charging requirements remains limited. This paper addresses this gap by developing a scenario-based stochastic model predictive controller (SMPC) for a microgrid energy hub comprising solar generation, battery storage, diesel backup, and an EV fleet connected to a weak grid. Grid outage and campus load scenarios are generated from a continuous-time Markov chain and a Gaussian Process, respectively. Using 2023 operational data from the Ashesi University Energy Hub in Ghana, we demonstrate that the SMPC achieves performance within 1\% of a perfect-forecast benchmark. In contrast, a naive MPC that assumes continuous grid availability offers no economic or sustainability advantage over rule-based control, with both incurring significantly higher costs and emissions than the SMPC. These results highlight that outage anticipation is essential for economic viability. Finally, we show that incorporating a deterministic buffer against EV consumption uncertainty eliminates over 90\% of state-of-charge violations with negligible impact on total operating costs

Current learning-based wireless methods struggle with generalization due to the fragmented processing of communication and sensing data. WiFo-MiSAC addresses this as a task-agnostic foundation model that tokenizes heterogeneous signals into a unified space for self-supervised pre-training. A shared-specific disentangled mixture-of-experts (SS-DMoE) architecture is employed to decouple modality-shared and modality-specific representations, facilitating interaction without cross-modal interference. By combining masked reconstruction with contrastive alignment, the model achieves state-of-the-art performance across downstream tasks, including beam prediction and channel estimation. Experimental results demonstrate robust few-shot adaptation and seamless integration of new modalities, positioning WiFo-MiSAC as a scalable backbone for future integrated sensing and communication systems.

Free-space optical (FSO) communication is emerging as a key backhaul technology for next-generation vertical heterogeneous networks (VHetNets), whose architecture spans satellites, high-altitude platform stations (HAPS), unmanned aerial vehicles (UAVs), and terrestrial nodes. Along these vertical and slant paths, optical beams traverse successive atmospheric layers that may contain clouds, fog, rain, and aerosols, conditions that conventional single-coefficient Beer-Lambert models typically handle only in isolation. Instead of such simplified formulas, we present a unified attenuation model that incorporates aerosols, fog, rain, cloud layers, and drizzle, accounts for the zenith angle, and provides a holistic estimate of the cumulative power loss across atmospheric layers. Numerical results show several-decibel attenuation variations across representative weather scenarios, while the difference between the proposed model predictions and the layer-resolved MODTRAN simulations remains within 1 dB, thereby validating the accuracy of the proposed model and its practical relevance for VHetNet link-budget studies.

Near-field integrated sensing and communication (ISAC) requires target models beyond the point-target abstraction when the target has a non-negligible spatial extent. In this letter, a geometry-aware transmit design is developed for a parametric extended target (ET) described by its center, orientation, and size under spherical-wave propagation. The CRB for the geometric parameters is formulated around a nominal ET state, an exact ET-aware reduced subspace is identified for the lifted covariance formulation, and a reduced-dimensional semidefinite relaxation (SDR) is developed under signal-to-interference-plus-noise ratio (SINR) and power constraints. Simulation results show lower CRB values than point-target and geometry-agnostic baselines together with substantially reduced runtime for large arrays.

Space--air--ground integrated networks (SAGINs) are emerging as a key foundation for future non-terrestrial networks (NTNs) and low-altitude economy services. However, their performance is increasingly limited not only by communication resources, but by the inability to adapt to rapidly changing spatial geometry. Here, spatial geometry refers to the relative configuration among network nodes, obstacles, and targets, which directly determines propagation conditions, blockage states, interference patterns, and sensing observability.This trend becomes more pronounced as low-altitude operations grow in density and complexity, causing the dominant bottleneck to shift from static resource allocation toward real-time maintenance of favorable spatial geometry across layers.In this article, we argue that movable antenna (MA) technology provides a fundamentally new perspective for SAGIN design. By enabling controlled antenna displacement, MA introduces a spatial degree of freedom that allows the network to directly adapt local spatial geometry at fine granularity, rather than passively reacting to it through beamforming or platform mobility.We present a geometry-aware, layered SAGIN architecture, where Low-Earth-Orbit (LEO) provides macro-scale coverage and coordination, High-Altitude Platform Stations (HAPS) enables regional continuity and backhaul support, and MA is incorporated into the layered design to enable fine-grained geometry adaptation, particularly at unmanned aerial vehicles (UAVs) and terrestrial layers where local channel dynamics are most pronounced. We further discuss how such geometry control enhances robustness, supports multi-functional operation spanning communication, sensing, control, and navigation, and enables more flexible spatial cooperation across layers.

In the past few years, data informativity with prior knowledge has attracted increasing attention. This line of research aims to characterize a dataset on a dynamical system that enables system analysis or design only by the dataset and given prior knowledge on the system. In this paper, we investigate such a characterization for the data-driven problem of computing a unique solution to Lyapunov equations. First, we introduce a notion of joint informativity for data-knowledge pairs as an extension of the standard informativity concept. Second, we derive an algebraic equivalent condition for the joint informativity. Finally, we provide further insights into the joint informativity by considering a special case of prior knowledge. The characterization presented in this paper is developed for a wide class of prior knowledge, enabling the incorporation of various forms of system information.

Timely and accurate monitoring in geofencing scenarios is challenging when relying on ultra-low power Internet of Things devices (IoTDs) powered by energy harvesting (EH). This is mainly because frequent wake-ups for data acquisition and data uploading may quickly deplete their limited energy buffer. Conventional grid-like IoT deployments overlook these limitations and merely rely on continuously powered sensing. Herein, we propose an energy-aware geofencing framework for camera-equipped EH IoTDs deployed around a protected area and its surrounding perimeter zone. The framework integrates a directional sensing power model with an operational representation of EH, sensing, sleeping, and reporting, accounting for the limited field-of-view (FoV) and distance-dependent detection confidence of the IoTDs. Device activity is controlled by the coverage-providing access point, which hosts a mobile edge host and a facility geocencing system to ensure timely and reliable detection under tight energy constraints. Reinforcement learning is used to determine IoTD placement, enabling earlier intruder detection than uniform grid-based deployments. Numerical results show that the proposed coordinated sensing and reporting configuration achieves frugal geofencing with fewer devices, while concurrently improving detection timeliness and dependability.