Papers

Reconfigurable antennas (RAs) have emerged as a promising technology for future wireless networks, offering additional flexibility for wireless communications. Among existing designs, rotatable antennas are particularly effective in improving directional gain via boresight alignment only. However, conventional rotatable RAs often overlook a critical physical coupling: the mechanical rotation inevitably alters the radiated polarization orientation, potentially leading to polarization mismatch. To address this challenge, we investigate a novel RA architecture that simultaneously supports 3D rotation and polarization state reconfiguration, ensuring alignment in both spatial and polarization domains. To quantify the performance gains, we analyze a simplified single-user LoS scenario to compare the optimized rotatable design against a fixed scheme. This analysis attributes the performance improvement to three aspects: directional and projection gain arising from boresight steering, polarization direction alignment gain enabled by roll adjustment, and polarization state matching gain provided by polarization reconfiguration. Furthermore, for general multipath multi-user systems, we formulate a joint power minimization problem by optimizing digital beamforming alongside rotation and polarization designs, subject to rate and hardware constraints. To solve the resulting non-convex problem efficiently, we develop an alternating optimization framework, where the digital beamforming is solved via semidefinite relaxation and difference-of-convex techniques, while the rotation and polarization designs are updated using Riemannian conjugate gradient on their respective manifolds. Simulation results demonstrate that the proposed RA outperforms both rotation-only and boresight-only benchmarks, achieving lower transmit power under the same rate constraints by joint spatial-polarization design.

We extend the unified kernel framework for transport equations and Koopman eigenfunctions, developed in previous work by the authors for deterministic systems, to stochastic differential equations (SDEs). In the deterministic setting, three analytically grounded constructions-Lions-type variational principles, Green's function convolution, and resolvent operators along characteristic flows–were shown to yield identical reproducing kernels. For stochastic systems, the Koopman generator includes a second-order diffusion term, transforming the first-order hyperbolic transport equation into a second-order elliptic-parabolic PDE. This fundamental change necessitates replacing the method of characteristics with probabilistic representations based on the Feynman–Kac formula. Our main contributions include: (i) extension of all three kernel constructions to stochastic systems via Feynman–Kac path-integral representations; (ii) proof of kernel equivalence under uniform ellipticity assumptions; (iii) a collocation-based computational framework incorporating second-order differential operators; (iv) error bounds separating RKHS approximation error from Monte Carlo sampling error; (v) analysis of how diffusion affects numerical conditioning; and (vi) connections to generator EDMD, diffusion maps, and kernel analog forecasting. Numerical experiments on Ornstein–Uhlenbeck processes, nonlinear SDEs with varying diffusion strength, and multi-dimensional systems validate the theoretical developments and demonstrate that moderate diffusion can improve numerical stability through elliptic regularization.

In this paper, we propose an artificial intelligence (AI)-enhanced hybrid simultaneous localization and mapping (SLAM) method that performs Bayesian inference directly on raw radio-frequency (RF) signals while learning an environment model in an unsupervised manner. The approach combines a physically interpretable signal model for line-of-sight (LOS) components with an AI model that captures multipath component statistics. Building on this formulation, we develop a particle-based sumproduct algorithm (SPA) on a factor graph that jointly estimates the mobile terminal (MT) state, visibility, multipath parameters, and noise variances, and integrate it into a variational framework that maximizes the evidence lower bound (ELBO) to learn the neural network (NN) parametrization directly from measurements. We further present a highly efficient GPU-based implementation that enables parallel likelihood evaluation across particles and base stations (BSs). Simulation results in multipath environments demonstrate that the proposed method learns the generative, environment-dependent signal model in an unsupervised manner while accurately localizing the MT and effectively exploiting the learned map in obstructed-line-of-sight (OLOS) scenarios.

Real-time unmanned aerial vehicle (UAV) acoustic detection at the edge demands low-latency inference under strict power and hardware limits. This paper presents SHIELD8-UAV, a sequential 8-bit hardware implementation of a precision-aware 1D feature-driven CNN (1D-F-CNN) accelerator for continuous acoustic monitoring. The design performs layer-wise execution on a shared multi-precision datapath, eliminating the need for replicated processing elements. A layer-sensitivity quantisation framework supports FP32, BF16, INT8, and FXP8 modes, while structured channel pruning reduces the flattened feature dimension from 35,072 to 8,704 (75%), thereby lowering serialised dense-layer cycles. The model achieves 89.91% detection accuracy in FP32 with less than 2.5% degradation in 8-bit modes. The accelerator uses 2,268 LUTs and 0.94 W power with 116 ms end-to-end latency, achieving 37.8% and 49.6% latency reduction compared with QuantMAC and LPRE, respectively, on a Pynq-Z2 FPGA, and 5-9% lower logic usage than parallel designs. ASIC synthesis in UMC 40 nm technology shows a maximum operating frequency of 1.56 GHz, 3.29 mm2 core area, and 1.65 W total power. These results demonstrate that sequential execution combined with precision-aware quantisation and serialisation-aware pruning enables practical low-energy edge inference without relying on massive parallelism.

Car license plate recognition system is an image processing technology used to identify vehicles by capturing their Car License Plates. The car license plate recognition technology is also known as automatic number-plate recognition, automatic vehicle identification, car license plate recognition or optical character recognition for cars. In Malaysia, as the number of vehicle is increasing rapidly nowadays, a pretty great number of vehicle on the road has brought about the considerable demands of car license plate recognition system. Car license plate recognition system can be implemented in electronic parking payment system, highway toll-fee system, traffic surveillance system and as police enforcement tools. Additionally, car license plate recognition system technology also has potential to be combined with various techniques in other different fields like biology, aerospace and so on to achieve the goal of solving some specialized problems.

Accurate traffic prediction is a key task for intelligent transportation systems. The core difficulty lies in accurately modeling the complex spatial-temporal dependencies in traffic data. In recent years, improvements in network architecture have failed to bring significant performance enhancements, while embedding technology has shown great potential. However, existing embedding methods often ignore graph structure information or rely solely on static graph structures, making it difficult to effectively capture the dynamic associations between nodes that evolve over time. To address this issue, this letter proposes a novel dynamic weighted graph structure (DWGS) embedding method, which relies on a graph structure that can truly reflect the changes in the strength of dynamic associations between nodes over time. By first combining the DWGS embedding with the spatial-temporal adaptive embedding, as well as the temporal embedding and feature embedding, and then integrating attention and frequency-domain multi-layer perceptrons (MLPs), we design a novel traffic prediction model, termed the DWGS embedding integrated with attention and frequency-domain MLPs (DWAFM). Experiments on five real-world traffic datasets show that the DWAFM achieves better prediction performance than some state-of-the-arts.

The rapid progress in 6G communication and high-bandwidth radar has driven an unprecedented surge in the spatial density of signal sources, resulting in an increasingly congested electromagnetic (EM) environment. When resolving closely spaced signals and interference, existing architectures are strictly bounded by the inherent diffraction limits of two-dimensional (2D) physical apertures, hindering super-resolution sensing and multi-interference mitigation in complex scenarios. Here, we present a 3D aperture-engineered diffractive neural network (AE-DNN) that achieves super-resolution sensing and computing by extending the traditional 2D aperture into 3D. The 3D aperture engineering framework is realized by constructing deep cascaded metasurface layers so that the diffractive propagation from oblique incident fields can be layer-wise modulated and piecewise encoded for perceiving EM fields far exceeding physical aperture limits. The N-layer AE-DNN has the capability to achieve ~N times higher angular resolution than the 2D aperture diffraction limit. The multi-dimensional synthetic aperture (MSA) training is developed to achieve speed-of-light coherent synthesis of the 3D aperture and integrate neural network-based modeling of multi-dimensional metasurface modulation. By orthogonalizing array response vectors in the analog domain, AE-DNN performs parallel super-resolution angle estimation, source number estimation, and source separation for up to 10 independent coherent or incoherent sources. Experimental results across the 36-41 GHz band demonstrate that AE-DNN resolves and suppresses closely spaced multi-interference by ~20 dB, enhances communication capacity by 13.5X, and reduces latency by three orders of magnitude. AE-DNN heralds a paradigm shift in signal processing for advanced radar and 6G communications.

This paper is concerned with fault/disturbance compensation control for fully actuated systems. In particular, we explore observer-based control, incorporating an active compensation mechanism. First, we propose a novel observer with enhanced design flexibility for the fully actuated system model, enabling simultaneous estimation of system states and exogenous unknown signals, such as faults or disturbances. Then, a nonlinear controller is developed with an active fault or disturbance compensation term, leveraging the fully actuated system approach. The asymptotic stability of both the state estimation error and the closed-loop control system is systematically established. Finally, the feasibility and merits of the proposed method are validated through comparative simulations and experiments.

Autonomous UAV infiltration in dynamic contested environments remains a significant challenge due to the partially observable nature of threats and the conflicting objectives of mission efficiency versus survivability. Traditional Reinforcement Learning (RL) approaches often suffer from myopic decision-making and struggle to balance these trade-offs in real-time. To address these limitations, this paper proposes an Intent-Context Synergy Reinforcement Learning (ICS-RL) framework. The framework introduces two core innovations: (1) An LSTM-based Intent Prediction Module that forecasts the future trajectories of hostile units, transforming the decision paradigm from reactive avoidance to proactive planning via state augmentation; (2) A Context-Analysis Synergy Mechanism that decomposes the mission into hierarchical sub-tasks (safe cruise, stealth planning, and hostile breakthrough). We design a heterogeneous ensemble of Dueling DQN agents, each specialized in a specific tactical context. A dynamic switching controller based on Max-Advantage values seamlessly integrates these agents, allowing the UAV to adaptively select the optimal policy without hard-coded rules. Extensive simulations demonstrate that ICS-RL significantly outperforms baselines (Standard DDQN) and traditional methods (PSO, Game Theory). The proposed method achieves a mission success rate of 88% and reduces the average exposure frequency to 0.24 per episode, validating its superiority in ensuring robust and stealthy penetration in high-dynamic scenarios.

Developing automatic speech recognition (ASR) systems for low-resource languages is hindered by the scarcity of transcribed corpora. This proof-of-concept study explores songs as an unconventional yet promising data source for Kazakh ASR. We curate a dataset of 3,013 audio-text pairs (about 4.5 hours) from 195 songs by 36 artists, segmented at the lyric-line level. Using Whisper as the base recogniser, we fine-tune models under seven training scenarios involving Songs, Common Voice Corpus (CVC), and FLEURS, and evaluate them on three benchmarks: CVC, FLEURS, and Kazakh Speech Corpus 2 (KSC2). Results show that song-based fine-tuning improves performance over zero-shot baselines. For instance, Whisper Large-V3 Turbo trained on a mixture of Songs, CVC, and FLEURS achieves 27.6% normalised WER on CVC and 11.8% on FLEURS, while halving the error on KSC2 (39.3% vs. 81.2%) relative to the zero-shot model. Although these gains remain below those of models trained on the 1,100-hour KSC2 corpus, they demonstrate that even modest song-speech mixtures can yield meaningful adaptation improvements in low-resource ASR. The dataset is released on Hugging Face for research purposes under a gated, non-commercial licence.

The European Space Agency's Sentinel-2 satellite provides global multispectral coverage for remote sensing (RS) applications. However, limited spectral resolution (12 bands) and non-unified spatial resolution (60/20/10 m) restrict their practicality. In contrast, the high spectral-spatial resolution sensor (e.g., NASA's AVIRIS-NG) covers only the American region due to practical considerations. This raises a fundamental question: “Can a global hyperspectral coverage be achieved by reconstructing Sentinel-2 data to NASA hyperspectral images?” This study aims to achieve spectral super-resolution from 12-to-186 and unify the spatial resolution of Sentinel-2 data to 5 m. To enable a reliable and efficient reconstruction, we formulate a novel deep unfolding framework regularized by a data-driven spectrum prior from PriorNet, instead of relying on implicit deep priors as conventional deep unfolding does. Moreover, an adversarial term is integrated into the unfolded architecture, enabling the discriminator to guide the reconstruction in both the training and testing phases; we term this novel concept unfolding adversarial learning (UAL). Experiments show that our UALNet outperforms the next-best Transformer in PSNR, SSIM, and SAM, while requiring only 15% MACs and 20 times fewer parameters. The associated code will be publicly available at https://sites.google.com/view/chiahsianglin/software.

Tagged MRI enables tracking internal tissue motion non-invasively. It encodes motion by modulating anatomy with periodic tags, which deform along with tissue. However, the entanglement between anatomy, tags and motion poses significant challenges for post-processing. The existence of tags and imaging blur hinders downstream tasks such as segmenting anatomy. Tag fading, due to T1-relaxation, disrupts the brightness constancy assumption for motion tracking. For decades, these challenges have been handled in isolation and sub-optimally. In contrast, we introduce a blind and nonlinear inverse framework for tagged MRI that, for the first time, unifies these tasks: anatomical image recovery, high-resolution cine image synthesis, and motion estimation. At its core, the synergy of MR physics and generative priors enables us to blindly estimate the unknown forward imaging models and high-resolution underlying anatomy, while simultaneously tracking 3D diffeomorphic Lagrangian motion over time. Experiments on tagged brain MRI demonstrate that our approach yields high-resolution anatomy images, cine images, and more accurate motion than specialized methods.

Batteries are ubiquitous today, with applications ranging from smartphones, watches, and laptops to electric cars, drones, and electric aircraft. Lithium-ion batteries are widely used in these applications due to their high energy density, rechargeability, and low lifecycle cost. Understanding the lifetime of lithium-ion batteries is essential for their effective utilization across many domains. In this study, data-driven modeling approaches are explored to predict the lifetime of lithium-ion batteries using various measurable battery parameters. A battery dataset from NASA's electric aircraft experiments was used, which included 17 predictor variables and remaining flight time as the response variable representing battery lifetime. The dataset contained more than 4,000,000 rows. However, the original dataset provided limited directly useful information about battery utilization over time; therefore, feature engineering was performed to generate more informative variables. Additionally, dimensionality reduction using principal component analysis (PCA) was applied to reduce computational cost and model complexity by selecting a smaller number of principal components as predictors for model development. Random forest and neural network models were explored for battery lifetime prediction using the engineered features. Multiple neural network configurations were evaluated, including single- and double-hidden-layer architectures with varying numbers of nodes. Mean squared error (MSE) on the test dataset was used as the performance metric for model comparison. The results indicate that data-driven modeling approaches are effective for battery lifetime prediction, with neural network models outperforming other models based on the MSE metric. Furthermore, neural networks demonstrate robustness in handling high-dimensional battery data.

With recent development of artificial intelligence, it is more common to adopt AI agents in economic activities. This paper explores the economic actions of agents, including human agents and AI agents, in an economic game of trading products/services, and the equilibria in this economy involving multiple agents. We derive a range of equilibrium results and their corresponding conditions using a Markov chain stationary distribution based model. One distinct feature of our model is that we consider the long-term utility generated by economic activities instead of their short-term benefits. For the model consisting of two agents, we fully characterize all the possible economic equilibria and conditions. Interestingly, we show that unless each agent can at least double (not merely increase) its marginal utility by purchasing the other agent's products/services, purchasing the other agent's products/services will not happen in any economic equilibrium. We further extend our results to three and more agents, where we characterize more economic equilibria. We find that in some equilibria, the “more powerful” AI agents contribute zero utility to “less capable” agents.

This study presents AI-HEART, a cloud-based information system for managing and analysing long-duration ambulatory electrocardiogram (ECG) recordings and supporting clinician decision-making. The platform operationalises an end-to-end pipeline that ingests multi-day three-lead ECGs, normalises inputs, performs signal preprocessing, and applies dedicated deep neural networks for wave delineation, noise/quality detection, and beat- and rhythm-level multi-class arrhythmia classification. To address class imbalance and real-world signal variability, model development combines large clinically annotated datasets with expert-in-the-loop curation and generative augmentation for under-represented rhythms. Empirical evaluation on three-lead ambulatory ECG data shows that delineation accuracy is sufficient for automated interval measurement, noise detection reliably flags poor-quality segments, and arrhythmia classification achieves high specificity with clinically useful macro-averaged performance across common and rarer rhythms. Beyond predictive accuracy, AI-HEART provides a scalable deployment approach for integrating AI into routine ECG services, enabling traceable outputs, audit-friendly storage of recordings and derived annotations, and clinician review/editing that captures feedback for controlled model improvement. The findings demonstrate the technical feasibility and operational value of a noise-aware AI-ECG platform as a digital health information system.

A player piano can strike more keys, across more of the register, and faster than any pianist can reach. Three traditions dominate composition in that region, namely Nancarrow's tempo canons, Xenakis' stochastic distributions, and L-system grammars. They have developed in isolation, and none of them accounts for the instrument itself. A Disklavier does not answer instantly, because a loud note reaches the string sooner than a soft one, so music written as if the mechanism were transparent arrives distorted. We present Amanous, a hardware-aware composition system for the Yamaha Disklavier that unifies the three traditions through distribution-switching, in which each grammar symbol selects an entire distributional regime rather than adjusting parameters within a fixed one. A four-layer pipeline carries a symbol from grammar to actuation-ready MIDI. An L-system fixes the macro-form, each symbol is mapped to distributions and a tempo-canon ratio, events are sampled and time-scaled, and a hardware layer pre-compensates velocity-dependent latency and enforces the key-reset time. Convergence points close a feedback loop, letting the music's own temporal structure trigger the next switch. Sections from different symbols remain statistically separable at the output, and ablating the L-system, the tempo canon, or the hardware compensation each degrades a distinct property. Under the modelled latency curve, pre-compensation takes the mean onset error from roughly 18 ms to below the instrument's 1 ms scanning resolution. Structured and random textures are most separable near 25 notes/s, and melodic metrics lose their discriminative power over the 40-100 notes/s band, above which the difference is consistent with distributional content rather than melodic order. All results are computational, nothing was played or measured on an instrument, and a psychoacoustic protocol is proposed for future work.

Reliable and interpretable automated assessment of second-language (L2) speech remains a central challenge, as large speech-language models (SpeechLLMs) often struggle to align with the nuanced variability of human raters. To address this, we introduce a rubric-guided reasoning framework that explicitly encodes multi-aspect human assessment criteria: accuracy, fluency, and prosody, while calibrating model uncertainty to capture natural rating variability. We fine-tune the Qwen2-Audio-7B-Instruct model using multi-rater human judgments and develop an uncertainty-calibrated regression approach supported by conformal calibration for interpretable confidence intervals. Our Gaussian uncertainty modeling and conformal calibration approach achieves the strongest alignment with human ratings, outperforming regression and classification baselines. The model reliably assesses fluency and prosody while highlighting the inherent difficulty of assessing accuracy. Together, these results demonstrate that rubric-guided, uncertainty-calibrated reasoning offers a principled path toward trustworthy and explainable SpeechLLM-based speech assessment.

ASR systems exhibit persistent performance disparities across accents, but whether these gaps reflect superficial biases or deep structural vulnerabilities remains unclear. We introduce ACES, a three-stage audit that extracts accent-discriminative subspaces from ASR representations, constrains adversarial attacks to them, and tests whether removing them improves fairness. On Wav2Vec2-base with seven accents, imperceptible perturbations (~60 dB SNR) along the accent subspace amplify the WER disparity gap by nearly 50% (21.3->31.8 pp), exceeding random-subspace controls; a permuted-label test confirms specificity to genuine accent structure. Partially removing the subspace worsens both WER and disparity, revealing that accent-discriminative and recognition-critical features are deeply entangled. ACES thus positions accent subspaces as powerful fairness-auditing tools, not simple erasure levers.

Test-Time Scaling has shown notable efficacy in addressing complex problems through scaling inference compute. However, within Large Audio-Language Models (LALMs), an unintuitive phenomenon exists: post-training models for structured reasoning trajectories results in marginal or even negative gains compared to post-training for direct answering. To investigate it, we introduce CAFE, an evaluation framework designed to precisely quantify audio reasoning errors. Evaluation results reveal LALMs struggle with perception during reasoning and encounter a critical bottleneck: reasoning performance suffers from audio perception decay as reasoning length extends. To address it, we propose MPAR$^2$, a paradigm that encourages dynamic perceptual reasoning and decomposes complex questions into perception-rich sub-problems. Leveraging reinforcement learning, MPAR$^2$ improves perception performance on CAFE from 31.74% to 63.51% and effectively mitigates perception decay, concurrently enhancing reasoning capabilities to achieve a significant 74.59% accuracy on the MMAU benchmark. Further analysis demonstrates that MPAR$^2$ reinforces LALMs to attend to audio input and dynamically adapts reasoning budget to match task complexity.

Template-based segmentation, a widely used paradigm in medical imaging, propagates anatomical labels via deformable registration from a labeled atlas to a target image, and is often used to compute volumetric biomarkers for downstream decision-making. While conformal prediction (CP) provides finite-sample valid intervals for scalar metrics, existing segmentation-based uncertainty quantification (UQ) approaches either rely on learned model features, often unavailable in classic template-based pipelines, or treat the registration process as a black box, resulting in overly conservative intervals when applied directly in output space. We introduce ConVOLT, a CP framework that achieves efficient volumetric UQ by conditioning calibration on properties of the estimated deformation field from template-based segmentation. ConVOLT calibrates a learned volumetric scaling factor from deformation space features. We evaluate ConVOLT on template-based segmentation tasks involving global, regional, and label volumetry across multiple datasets and registration methods. ConVOLT achieves target coverage while producing substantially tighter intervals than output-space conformal baselines. Our work paves way to exploit the registration process for efficient UQ in medical imaging pipelines.

We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a quantum Fourier transform–based adder. This avoids the explicit convolution required in classical implementations and the repeated coin-flip operations used in quantum random walk approaches. Numerical simulations using a gate-based quantum computing simulator confirm that the proposed approach reproduces the desired probability densities while requiring significantly fewer quantum gates and much shallower circuit depth.

Low-altitude network is a key enabler for extending coverage and recovering connectivity in 6G systems, especially when terrestrial infrastructure is unavailable. This paper studies a uncrewed aerial vehicle (UAV)-mounted rotatable intelligent reflecting surface (IRS) as a low-altitude reflector between a blocked base station (BS) and a ground terminal (GT). Unlike the conventional isotropic-element assumption, each IRS element is modeled with a hemispherical directive radiation pattern, whose boresight can be adjusted via element rotations. We formulate a new optimization problem that jointly designs IRS phase shifts, per-element rotation vectors, and UAV placement to maximize the received signal-to-noise ratio (SNR). Leveraging the problem structure, we derive closed-form solutions for phase alignment and element rotations, showing that the optimal boresight points are along the internal angular bisector between the BS-IRS and GT-IRS directions. With these closed forms, the design reduces to a placement optimization problem over a box-constrained airspace; we solve it using an efficient projected gradient algorithm with majorization-minimization update and a global Lipschitz constant. Numerical results demonstrate substantial SNR gains from directive elements and reveal a fundamental trade-off between directional gain and path loss, yielding useful insights into low-altitude deployment of UAV-mounted IRSs.

Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support. We provide the first robustness-based quantitative semantics for SFO, enabling the expression and evaluation of rich real-time properties beyond the scope of existing formalisms such as Signal Temporal Logic. To enable online monitoring, we identify a past-time fragment of SFO and give a pastification procedure that transforms bounded-response SFO formulas into equisatisfiable formulas in this fragment. We then develop an efficient runtime monitoring algorithm for this past-time fragment and evaluate its performance on a set of benchmarks, demonstrating the practicality and effectiveness of our approach. To the best of our knowledge, this is the first publicly available prototype for online quantitative monitoring of full SFO.

Machine learning (ML)-assisted outage-based resource allocation has recently emerged as an effective alternative to conventional scheduling methods in reliability-critical wireless systems. However, existing approaches are fundamentally limited to single-resource allocation, whereas modern and emerging systems increasingly require the simultaneous allocation of multiple resources to meet aggregate rate and reliability constraints. In this paper, we extend outage-based learning to the bulk resource allocation regime, where a user requires at least $D$ reliable resources from a pool of $R$ candidates. We first introduce a practical allocation policy, termed gate + top-$D$ allocation (GTBA), which combines threshold-based admission control with ranking-based selection. We then propose a novel ranking-aware bulk outage loss (RBOL) that provides a differentiable surrogate for the bulk outage event induced by GTBA, explicitly accounting for both gate failures and ranking errors near the selection boundary. An exact reliability analysis is developed, establishing a decomposition of bulk outage probability (BOP), identifying dominant failure mechanisms and deriving an oracle lower bound that characterizes the fundamental performance limit. Extensive simulations under balanced, light and heavy stress regimes demonstrate that RBOL consistently outperforms conventional pointwise losses and baselines, achieving substantial reductions in BOP and remaining significantly closer to the oracle bound across a wide range of operating conditions. These results confirm that set-level ranking-aware training objectives are essential for reliable ML-assisted bulk resource allocation.

Predicting the response of an observed system to a known input is a fruitful first step to accurately control the system's dynamics. Despite the recent advances in fully data-driven algorithms, the most interpretable way to reach this goal is through mechanistic mathematical modeling. Here, we leverage optimal control and propose a closed-loop iterative method to choose among a set of candidate models the one that most accurately predicts an observed system. We assume that one has control over an input of the observed system and access to measurements of its response. Our approach is to identify the input control that maximally discriminates the response of the candidate models, allowing us to determine which model is best by comparing such responses with the observed data. We demonstrate our proposed framework in numerical simulations before applying it during an electrophysiology experiment, successfully discriminating between different models for photocurrents produced via opsin dynamics.

False discovery rate (FDR) control is a popular approach for maintaining the integrity of statistical analyses, especially in high-dimensional data settings, where multiple comparisons increase the risk of false positives. FDR control has been extensively researched for real-valued data. However, the complex data case, which is relevant for many signal processing applications, remains widely unexplored. We therefore present a fast and FDR-controlling variable selector for complex-valued high-dimensional data. The proposed Complex-Valued Terminating-Random Experiments (CT-Rex) selector controls a user-defined target FDR while maximizing the number of selected variables. This is achieved by optimally fusing the solutions of multiple early terminated complex-valued random experiments. We benchmark the performance in sparse complex regression simulation studies and showcase an example of FDR-controlled compressed-sensing-based single snapshot multi-source detection and direction of arrival (DOA) estimation. The proposed work applies to a wide range of research areas, such as DOA estimation, communications, mechanical engineering, and magnetic resonance imaging, bridging a critical gap in signal processing for complex-valued data.

The pinching-antenna system (PASS) has been proposed as a promising solution for mitigating line-of-sight (LoS) blockages by dynamically repositioning pinching antennas (PAs) along a dielectric waveguide. This paper develops a fairness-oriented downlink design for a non-orthogonal multiple access (NOMA)-enabled PASS, where the longitudinal placement of PAs and the NOMA power allocation coefficients are jointly optimized to maximize the minimum user signal-to-interference-plus-noise ratio (SINR) across all users under transmit power and waveguide constraints. A soft-blockage channel model incorporating waveguide attenuation and imperfect channel state information (CSI) is developed. To ensure the feasibility of successive interference cancellation under CSI uncertainty, a conservative SINR evaluation framework is proposed. The resulting non-convex max-min SINR optimization problem is efficiently solved using a tailored particle swarm optimization (PSO) algorithm. Numerical results demonstrate that the proposed design improves the minimum user SINR by approximately 7-10 dB compared with fixed-antenna systems and non-robust optimization baselines under moderate blockage and imperfect CSI.

This paper presents joint sampling frequency offset (SFO) estimation and compensation algorithms based on the Farrow structure. Unlike conventional approaches that treat estimation and compensation separately, the proposed framework exploits the interpolator structure to enable a low-complexity, fully time-domain solution applicable to arbitrary bandlimited signals, without imposing constraints on the waveform or requiring Fourier transform based processing. The estimation stage can operate on a real-valued component of a complex signal and supports the simultaneous estimation of SFO and sampling time offset, while being inherently robust to other synchronization impairments such as carrier frequency offset. The proposed estimation algorithms rely on two complementary methods, specifically, Newton's method and iterative least-squares formulation. The implementations of the estimators are presented and the overall computational complexity is analyzed, showing that the complexity scales only linearly with the number of samples employed. Numerical results for real and complex multisine and bandpass-filtered white noise signals demonstrate accurate estimation and effective compensation over a wide range of operating conditions, confirming the flexibility and efficiency of the proposed approach. Moreover, the influence of the Farrow structure approximation error on the SFO estimation accuracy is investigated.

The pinching-antenna systems (PASS) enable blockage mitigation in urban micro (UMi) networks through flexible antenna placement. However, the joint optimization of antenna positions and beamforming precoding is inherently nonconvex and becomes significantly more challenging under user mobility. To address this issue, we propose a bilevel optimization framework for dynamic antenna positioning and beamforming precoding design. In the outer level, a soft actor-critic (SAC) agent learns a continuous control policy for real-time antenna positioning, while in the inner level, zero-forcing (ZF) precoding is applied based on the instantaneous effective channel. Numerical results demonstrate that the proposed framework significantly improves spectral efficiency (SE) and enhances robustness against user mobility and random blockages.

Modern cyber-physical systems, such as automotive control, rely on feedback controllers that regulate the system towards desired a setpoint. In practice, however, the controller must also be scheduled efficiently on resource-constrained processors, where the choice of numerical precision for controller implementation directly affects both control quality and computational cost. This trade-off is critical: higher precision improves control performance but increases runtime, while lower precision executes faster in the processor but may degrade overall system performance. In this work, we propose the first approach for a precision switching schedule, where the controller switches between different floating-point precisions to balance control performance and enhance computational efficiency. We formulate this problem as a multi-objective optimization, expressed as a Mixed-Integer Quadratic Program (MIQP) with sound linearizations and error bounds that capture roundoff effects from different precision implementations. Our method efficiently computes a switching schedule that ensures the system output remains within a specified reference band. Through experimental evaluation on standard benchmark control systems, we demonstrate that switching between 32-bit and 16-bit floating-point implementations offers an average runtime reduction of 26.5% compared to 32-bit execution and a 27.6% improvement in control performance over 16-bit execution, while maintaining near-optimal overall performance.