Papers

This paper presents a novel structure-preserving, Kron-based reduction framework for unbalanced distribution feeders. The method aggregates electrically similar nodes within a mixed-integer optimization (MIP) problem to produce reduced networks that optimally reproduce the voltage profiles of the original full network. To overcome computational bottlenecks of MIP formulations, we propose an exhaustive-search formulation to identify optimal aggregation decisions while enforcing voltage margin limits. The proposed exhaustive network reduction algorithm is parallelizable on GPUs, which enables scalable network reduction. The resulting reduced networks approximate the full system's voltage profiles with low errors and are suitable for steady-state analysis and optimal power flow studies. The framework is validated on two real utility distribution feeders with 5,991 and 8,381 nodes. The reduced models achieve up to 90% and 80% network reduction, respectively, while the maximum voltage-magnitude error remains below 0.003 p.u. Furthermore, on a 1000-node version of the network, the GPU-accelerated reduction algorithm runs up to 15x faster than its CPU-based counterpart.

This paper introduces a new framework for synthesizing time-varying control barrier functions (TV-CBFs) for general Signal Temporal Logic (STL) specifications using spatiotemporal tubes (STT). We first formulate the STT synthesis as a robust optimization problem (ROP) and solve it through a scenario optimization problem (SOP), providing formal guarantees that the resulting tubes capture the given STL specifications. These STTs are then used to construct TV-CBFs, ensuring that under any control law rendering them invariant, the system satisfies the STL tasks. We demonstrate the framework through case studies on a differential-drive mobile robot and a quadrotor, and provide a comparative analysis showing improved efficiency over existing approaches.

We present improvements to speaker diarization in the two-stage end-to-end neural diarization with vector clustering (EEND-VC) framework. The first stage employs a Conformer-based EEND model with WavLM features to infer frame-level speaker activity within short windows. The identities and counts of global speakers are then derived in the second stage by clustering speaker embeddings across windows. The focus of this work is to improve the second stage; we filter unreliable embeddings from short segments and reassign them after clustering. We also integrate the VBx clustering to improve robustness when the number of speakers is large and individual speaking durations are limited. Evaluation on a compound benchmark spanning multiple domains is conducted without fine-tuning the EEND model or tuning clustering parameters per dataset. Despite this, the system generalizes well and matches or exceeds recent state-of-the-art performance.

This study presents a control strategy for coordinating multiple unmanned aerial vehicles (UAVs) to monitor unknown flood regions and estimate the extent of inundation. The proposed method adopts a density-driven coverage framework based on Centroidal Voronoi Tessellation (CVT), in which the density function is modeled using a Gaussian Mixture of Density Functions (GMDF). This formulation provides a more accurate characterization of inundated areas compared to conventional axis-aligned Gaussian models. The performance of the two density modeling approaches is systematically evaluated under different UAV fleet sizes (16, 20, and 24), with multiple simulation trials conducted in the ROS/Gazebo environment. The results show that the GMDF-based formulation consistently achieves higher coverage rates, demonstrating its effectiveness in enhancing flood monitoring and improving UAV spatial distribution.

We investigate the robustness of affine frequency division multiplexing (AFDM) and orthogonal time frequency space (OTFS) waveforms against passive eavesdroppers performing brute-force demodulation to intercepted signals, under the assumption that eavesdroppers have no knowledge of chirp parameters (in AFDM) or the delay-Doppler grid configuration (in OTFS), such that they must search exhaustively over possible demodulation matrices. Analytical results show that the brute-force complexity scales as $\mathcal{O}(\sqrt{N})$ for OTFS and $\mathcal{O}(N^2)$ for AFDM, where $N$ is the number of subcarriers, indicating that AFDM has superior resilience over OTFS. Bit error rate (BER) simulations confirm the analysis by showing that, with AFDM, the signal remains nearly undecodable at the eavesdropper, while OTFS allows partial signal recovery under equivalent conditions.

This paper investigates security vulnerabilities and countermeasures for the 3rd Generation Partnership Project (3GPP) Fifth Generation New Radio (5G-NR) Time Difference of Arrival (TDoA)-based unmanned aerial vehicle (UAV) localization in low-altitude urban environments. We first optimize node selection strategies under Air to Ground (A2G) channel conditions, proving that optimal selection depends on UAV altitude and deployment density, and propose lightweight User Equipment (UE)-assisted approaches that reduce overhead while enhancing accuracy. Next, we then expose critical security vulnerabilities by introducing merged-peak spoofing attacks where rogue UAVs transmit multiple 5G-NR Positioning Reference Signalss (PRSs) that merge with legitimate signals, bypassing existing detection methods. Through theoretical modeling and sensitivity analysis, we quantify how synchronization quality and geometric factors determine spoofing success probability, thereby revealing fundamental weaknesses in current 3GPP positioning frameworks. To address these vulnerabilities, we design a network-centric anomaly detection framework at the Localization Management Function (LMF) using 3GPP-specified parameters, coupled with recursive gradient descent-based robust localization that filters anomalous data while estimating UAV position. Our unified framework simultaneously provides robust victim localization and spoofer localization, enabling active attacker attribution beyond passive defense. Extensive simulations validate the effectiveness of our optimization and security mechanisms for 3GPP-compliant UAV positioning.

Speech foundation models have recently achieved remarkable capabilities across a wide range of tasks. However, their evaluation remains disjointed across tasks and model types. Different models excel at distinct aspects of speech processing and thus require different evaluation protocols. This paper proposes a unified taxonomy that addresses the question: Which evaluation is appropriate for which model? The taxonomy defines three orthogonal axes: the evaluation aspect being measured, the model capabilities required to attempt the task, and the task or protocol requirements needed to perform it. We classify a broad set of existing evaluations and benchmarks along these axes, spanning areas such as representation learning, speech generation, and interactive dialogue. By mapping each evaluation to the capabilities a model exposes (e.g., speech generation, real-time processing) and to its methodological demands (e.g., fine-tuning data, human judgment), the taxonomy provides a principled framework for aligning models with suitable evaluation methods. It also reveals systematic gaps, such as limited coverage of prosody, interaction, or reasoning, that highlight priorities for future benchmark design. Overall, this work offers a conceptual foundation and practical guide for selecting, interpreting, and extending evaluations of speech models.

Recent work has shown that sample-based Minimum Bayes Risk (MBR) decoding outperforms beam search in text-to-text generation tasks, such as machine translation, text summarization, and image captioning. On the other hand, beam search is the current practice for speech-to-text tasks such as automatic speech recognition (ASR) and Speech Translation (ST). Given that MBR decoding is effective in text-to-text generation tasks, it is reasonable to expect it to also be effective for speech-to-text tasks. In this paper, we evaluate MBR decoding for ASR and ST tasks on English and Japanese using Whisper and its derivative models. We observe that the accuracy of MBR decoding outperforms that of beam search in most of the experimental settings we have evaluated. The results show that MBR decoding is a promising method for offline ASR and ST tasks that require high accuracy. The code is available at https://github.com/CyberAgentAILab/mbr-for-asr

Accurate segmentation and precise morphological analysis of neuronal cells in fluorescence microscopy images are crucial steps in neuroscience and biomedical imaging applications. However, this process is labor-intensive and time-consuming, requiring significant manual effort and expertise to ensure reliable outcomes. This work presents a pipeline for neuron instance segmentation and measurement based on a high-resolution dataset of stem-cell-derived neurons. The proposed method uses YOLOv8, trained on manually annotated microscopy images. The model achieved high segmentation accuracy, exceeding 97%. In addition, the pipeline utilized both ground truth and predicted masks to extract biologically significant features, including cell length, width, area, and grayscale intensity values. The overall accuracy of the extracted morphological measurements reached 75.32%, further supporting the effectiveness of the proposed approach. This integrated framework offers a valuable tool for automated analysis in cell imaging and neuroscience research, reducing the need for manual annotation and enabling scalable, precise quantification of neuron morphology.

The Relative Transfer Matrix (ReTM), recently introduced as a generalization of the relative transfer function for multiple receivers and sources, shows promising performance when applied to speech enhancement and speaker separation in noisy environments. Blindly estimating the ReTM of sound sources by exploiting the covariance matrices of multichannel recordings is highly beneficial for practical applications. In this paper, we use covariance subtraction to present a flexible and practically viable method for estimating the ReTM for a select set of independent sound sources. To show the versatility of the method, we validated it through a speaker separation application under reverberant conditions. Separation performance is evaluated at low signal-to-noise ratio levels in comparison with existing ReTM-based and relative transfer function-based estimators, in both simulated and real-life environments.

The growing interest in ocean discovery imposes a need for inspection and intervention in confined and demanding environments. Eely's slender shape, in addition to its ability to change its body configurations, makes articulated underwater robots an adequate option for such environments. However, operation of Eely in such environments imposes demanding requirements on the system, as it must deal with uncertain and unstructured environments, extreme environmental conditions, and reduced navigational capabilities. This paper proposes a Bayesian approach to assess the risks of losing Eely during two mission scenarios. The goal of this work is to improve Eely's performance and the likelihood of mission success. Sensitivity analysis results are presented in order to demonstrate the causes having the highest impact on losing Eely.

The growing prevalence of speech deepfakes has raised serious concerns, particularly in real-world scenarios such as telephone fraud and identity theft. While many anti-spoofing systems have demonstrated promising performance on lab-generated synthetic speech, they often fail when confronted with physical replay attacks-a common and low-cost form of attack used in practical settings. Our experiments show that models trained on existing datasets exhibit severe performance degradation, with average accuracy dropping to 59.6% when evaluated on replayed audio. To bridge this gap, we present EchoFake, a comprehensive dataset comprising more than 120 hours of audio from over 13,000 speakers, featuring both cutting-edge zero-shot text-to-speech (TTS) speech and physical replay recordings collected under varied devices and real-world environmental settings. Additionally, we evaluate three baseline detection models and show that models trained on EchoFake achieve lower average EERs across datasets, indicating better generalization. By introducing more practical challenges relevant to real-world deployment, EchoFake offers a more realistic foundation for advancing spoofing detection methods.

Channel measurements are the prerequisite for applying emerging transmission technologies and designing communication systems. Conventional time or frequency domain channel measurement methods cannot directly obtain Doppler information induced by high-mobility scenarios. The channel spreading function (CSF) simultaneously captures delay and Doppler information while naturally characterizing the propagation environment in the delay-Doppler (DD) domain. However, DD domain channel measurement methods remain underexplored. This paper presents an orthogonal time frequency space (OTFS) waveform-based DD domain channel measurement method for high-mobility scenarios. A native OTFS waveform, employed as the sounding signal, is designed for the first time, and its sounding capability is comprehensively analyzed. Next, we detail the methodology of DD domain channel measurement, including synchronization and CSF estimation. To enhance measurement precision, a joint fractional delay and Doppler shift estimation algorithm is proposed, and the overall performance of the proposed method is evaluated. Subsequently, a practical DD domain channel measurement system is established, followed by system calibration and verification. Finally, DD domain channel measurements are conducted in vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) scenarios. Measurement results, including the CSF and other small-scale fading characteristics, confirm the effectiveness of the proposed method and offer valuable insights for advancing research on high-mobility communications.

This paper investigates narrow-beam channel characterization and performance evaluation for 5G for railway (5G-R) systems based on ray-tracing (RT) simulation. Three representative high-speed railway (HSR) scenarios including viaduct, cutting, and station are established, and RT-based dynamic narrow-beam channel simulations are conducted using a designed beam tracking scheme that ensures continuous alignment with the moving train. The channel characteristics are analyzed in terms of both large-scale and small-scale fading, as well as non-stationarity, providing statistical insights into path loss, shadow fading, fading severity, time-frequency-space dispersion, and stationarity interval. The influence of beamwidth on these channel properties is also examined. Furthermore, the performance of 5G-R systems operating in such narrow-beam channels is evaluated using the Vienna 5G simulator, with a focus on block error rate, throughput, and spectral efficiency. A hardware-in-the-loop simulation platform is developed to further assess synchronization signal reference signal received power, signal-to-interference-plus-noise ratio, and reference signal received quality. The results provide valuable guidance for the design and optimization of 5G-R systems in HSR environments.

The integration of artificial intelligence (AI) with the Internet of Things (IoT) enables task-oriented communication for multi-edge cooperative inference system, where edge devices transmit extracted features of local sensory data to an edge server to perform AI-driven tasks. However, the privacy concerns and limited communication bandwidth pose fundamental challenges, since simultaneous transmission of extracted features with a single fixed compression ratio from all devices leads to severe inefficiency in communication resource utilization. To address this challenge, we propose a framework that dynamically adjusts the code rate in feature extraction based on its importance to the downstream inference task by adopting a rate-adaptive quantization (RAQ) scheme. Furthermore, to select the code rate for each edge device under limited bandwidth constraint, a dynamic programming (DP) approach is leveraged to allocate the code rate across discrete code rate options. Experiments on multi-view datasets demonstrate that the proposed frameworks significantly outperform the frameworks using fixed-rate quantization, achieving a favorable balance between communication efficiency and inference performance under limited bandwidth conditions.

Classical auditory-periphery models, exemplified by Bruce et al., 2018, provide high-fidelity simulations but are stochastic and computationally demanding, limiting large-scale experimentation and low-latency use. Prior neural encoders approximate aspects of the periphery; however, few are explicitly trained to reproduce the deterministic, rate-domain neurogram , hindering like-for-like evaluation. We present a compact convolutional encoder that approximates the Bruce mean-rate pathway and maps audio to a multi-frequency neurogram. We deliberately omit stochastic spiking effects and focus on a deterministic mapping (identical outputs for identical inputs). Using a computationally efficient design, the encoder achieves close correspondence to the reference while significantly reducing computation, enabling efficient modeling and front-end processing for auditory neuroscience and audio signal processing applications.

This study is the first application of spiking neural networks (SNNs) for anomaly detection in the Laser Powder Bed Fusion (LPBF) additive manufacturing process. The neural networks were used to identify print processing anomalies generated by dropping of laser energy during the printing of individual layers in a Ti-6Al-4V alloy lattice structures. Associated changes in the laser generated melt pool were observed using an in-process photodiode monitoring technique. photodiode sensors capturing plasma and infrared radiations reflected from the print bed of the metal 3D printer were utilized to detect sudden changes caused by anomalies during the printing process. The algorithm is first implemented on non-neuromorphic hardware including a central processing unit (CPU), on Field Programmable Gate Arrays (FPGA) and then on neuromorphic Intel's Loihi chip. Improved detection of anomalies is achieved by adjusting the spike latency of the neural network, which reduces masking of information by noise within the monitored temporal signal. The work demonstrates the possibility of using low-power neuromorphic chips within an edge framework for anomaly detection in additive manufacturing and creates a framework for the process.

Operating fleets of electric vehicles (EVs) introduces several challenges, some of which are borne by the fleet operator, and some of which are borne by the power grid. To maximize short-term profit a fleet operator could always charge EVs at the maximum rate to ensure vehicles are ready to service ride demand. However, due to the stochastic nature of electricity demand, charging EVs at their maximum rate may potentially increase the grid stress and lead to overall instability. Furthermore, high-rate charging of EVs can accelerate battery degradation, thereby reducing the service lifespan of the fleet. This study aims to reconcile the conflicting incentives of fleet longevity, short-term profitability, and grid stability by simulating a taxi fleet throughout its lifespan in relation to its charging policies and service conditions. We develop an EV fleet simulator to evaluate the battery degradation due to unpredictable charging and ride demand. Consequently, the impact on the power grid through the charging infrastructure is assessed due to these activities. This simulation utilizes publicly accessible real-world travel data from the NYC taxi dataset. We compare a baseline 80-20 fleet charging policy with a reinforcement learning-based policy designed to prolong the fleet's service life and alleviate grid stress. We monitor grid stress, battery degradation, and profitability over five years and find that our learned policy outperforms the baseline. This simulator enables fleet operators to assess the impact of different charging policies on these indicators to make informed decisions in the future.

Wireless power transfer (WPT) with coupled resonators offers a promising solution for the seamless powering of electronic devices. Interactive design approaches that visualize the magnetic field and power transfer efficiency based on system geometry adjustments can facilitate the understanding and exploration of the behavior of these systems for dynamic applications. However, typical electromagnetic field simulation methods, such as the Method of Moments (MoM), require significant computational resources, limiting the rate at which computation can be performed for acceptable interactivity. Furthermore, the system's sensitivity to positional and geometrical changes necessitates a large number of simulations, and structures such as ferromagnetic shields further complicate these simulations. Here, we introduce a machine learning approach using Gaussian Process Regression (GPR), demonstrating for the first time the rapid estimation of the entire magnetic field and power transfer efficiency for near-field coupled systems. To achieve quick and accurate estimation, we develop 3D adaptive grid systems and an active learning strategy to effectively capture the nonlinear interactions between complex system geometries and magnetic fields. By training a regression model, our approach achieves magnetic field computation with sub-second latency and with an average error of less than 6% when validated against independent electromagnetic simulation results.

Sleep quality is an important indicator of the efficient cognitive function for high school teachers. Due to the high work stress and multi-tasking expectations, the teachers often face issues with their sleep quality and cognitive function, which has a clearly negative influence on their teaching abilities. In this work, we propose a unique but simple method of deploying Internet of Things (IoT) technology to monitor the sleep quality of high school teachers at Pakistan. Smart watches embedded with pulse rate and SpO2 sensors were used to collect data and categorize the sleep quality as "poor", "fair" or "good". Moreover, we used a psychological tool, Cognitive Assessment Questionnaire (CAQ) for the self-assessment of teachers' cognitive function. The study was conducted over 208 high school teachers from across Pakistan. It has been found that most of the teachers had a poor sleep quality and cognitive function; The link between these two variables indicate that the workload and other factors must be improved for the teachers to ensure their well-being, which will in turn have a positive impact on their teaching quality.

Vehicular Ad hoc Networks (VANETs) comprise of multi-priority hetero-genous nodes, both stationary and/or mobile. The data generated by these nodes may include messages relating to information, safety, entertainment, traffic management and emergency alerts. The data in the network needs dif-ferentiated service based on the priority/urgency. Media Access Control (MAC) protocols hold a significant value for managing the data priority. This paper studies a comparison of 802.11p which is a standard PHY and MAC protocol for VANET with a fragmentation-based protocol, FROG-MAC. The major design principle of 802.11-p is to allow direct Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication without associa-tion, using Enhanced Distributed Channel Access (EDCA) to prioritize safety-critical messages. However, if non-critical messages already start to transmit, the nodes with critical data have to wait. FROG-MAC reduces this delay by transmitting normal packets in fragments with short pauses between them, al-lowing urgent packets to access the channel during these intervals. Simula-tions have been performed to assess the delay and throughput for high and low priority data. We report that FROG-MAC improves both the performance parameters due to offering an early channel access to the emergency traffic.

Processing-in-memory (PIM) has emerged as the go to solution for addressing the von Neumann bottleneck in edge AI accelerators. However, state-of-the-art (SoTA) digital PIM approaches suffer from low compute density, primarily due to the use of bulky bit cells and transistor-heavy adder trees, which impose limitations on macro scalability and energy efficiency. This work introduces Res-DPU, a resource-shared digital PIM unit, with a dual-port 5T SRAM latch and shared 2T AND compute logic. This reflects the per-bit multiplication cost to just 5.25T and reduced the transistor count of the PIM array by up to 56% over the SoTA works. Furthermore, a Transistor-Reduced 2D Interspersed Adder Tree (TRAIT) with FA-7T and PG-FA-26T helps reduce the power consumption of the adder tree by up to 21.35% and leads to improved energy efficiency by 59% compared to conventional 28T RCA designs. We propose a Cycle-controlled Iterative Approximate-Accurate Multiplication (CIA2M) approach, enabling run-time accuracy-latency trade-offs without requiring error-correction circuitry. The 16 KB REP-DPIM macro achieves 0.43 TOPS throughput and 87.22 TOPS/W energy efficiency in TSMC 65nm CMOS, with 96.85% QoR for ResNet-18 or VGG-16 on CIFAR-10, including 30% pruning. The proposed results establish a Res-DPU module for highly scalable and energy-efficient real-time edge AI accelerators.

The spline adaptive filtering (SAF) algorithm-based information-theoretic learning has exhibited strong convergence performance in nonlinear system identification (NSI), establishing SAF as a promising framework for adaptive filtering. However, existing SAF-based methods suffer from performance degradation under generalized Gaussian noise (GGN) environment and exhibit significant steady-state misalignment under impulse noise. Moreover, prior research on SAF algorithms has not effectively addressed the adverse effects caused by outliers. To overcome these challenges, the generalized modified Blake-Zisserman robust spline adaptive filtering (SAF-GMBZ) algorithm is proposed. Compared to conventional SAF algorithms, SAF-GMBZ exhibits superior learning performance in GGN. Furthermore, the mean convergence ranges of the step-sizes and the steady-state mean-square error (MSE) are calculated by introducing the commonly utilized assumptions. To arrive at good convergence accuracy and noise cancellation capability in active noise control (ANC) application, the filter-c GMBZ (FcGMBZ) algorithm is further developed based on SAF-GMBZ. Simulation results confirm the accuracy of the theoretical steady-state MSE, and the superiority of the SAF-GMBZ algorithm under GGN environment in NSI, along with the effectiveness of the FcGMBZ algorithm in ANC application under impulsive noise environment.

Foundation models for medical imaging demonstrate superior generalization capabilities across diverse anatomical structures and clinical applications. Their outstanding performance relies on substantial computational resources, limiting deployment in resource-constrained clinical environments. This paper presents TinyUSFM, the first lightweight ultrasound foundation model that maintains superior organ versatility and task adaptability of our large-scale Ultrasound Foundation Model (USFM) through knowledge distillation with strategically curated small datasets, delivering significant computational efficiency without sacrificing performance. Considering the limited capacity and representation ability of lightweight models, we propose a feature-gradient driven coreset selection strategy to curate high-quality compact training data, avoiding training degradation from low-quality redundant images. To preserve the essential spatial and frequency domain characteristics during knowledge transfer, we develop domain-separated masked image modeling assisted consistency-driven dynamic distillation. This novel framework adaptively transfers knowledge from large foundation models by leveraging teacher model consistency across different domain masks, specifically tailored for ultrasound interpretation. For evaluation, we establish the UniUS-Bench, the largest publicly available ultrasound benchmark comprising 8 classification and 10 segmentation datasets across 15 organs. Using only 200K images in distillation, TinyUSFM matches USFM's performance with just 6.36% of parameters and 6.40% of GFLOPs. TinyUSFM significantly outperforms the vanilla model by 9.45% in classification and 7.72% in segmentation, surpassing all state-of-the-art lightweight models, and achieving 84.91% average classification accuracy and 85.78% average segmentation Dice score across diverse medical devices and centers.

The paper focuses on designing a controller for unknown dynamical multi-agent systems to achieve temporal reach-avoid-stay tasks for each agent while preventing inter-agent collisions. The main objective is to generate a spatiotemporal tube (STT) for each agent and thereby devise a closed-form, approximation-free, and decentralized control strategy that ensures the system trajectory reaches the target within a specific time while avoiding time-varying unsafe sets and collisions with other agents. In order to achieve this, the requirements of STTs are formulated as a robust optimization problem (ROP) and solved using a sampling-based scenario optimization problem (SOP) to address the issue of infeasibility caused by the infinite number of constraints in ROP. The STTs are generated by solving the SOP, and the corresponding closed-form control is designed to fulfill the specified task. Finally, the effectiveness of our approach is demonstrated through two case studies, one involving omnidirectional robots and the other involving multiple drones modelled as Euler-Lagrange systems.

As 6G wireless communication systems evolve toward intelligence, high reconfigurability, and space-air-ground integration \cite{liu2025toward, liu2024near}, the limitations of traditional fixed antenna (TFA) have become increasingly prominent. As a remedy, spatially movable antenna (SMA) and electromagnetically reconfigurable antenna (ERA) have respectively emerged as key technologies to break through this bottleneck. SMA activates spatial degree of freedom (DoF) by dynamically adjusting antenna positions, ERA regulates radiation characteristics using tunable metamaterials, thereby introducing DoF in the electromagnetic domain. However, the “spatial-electromagnetic dual reconfiguration" paradigm formed by their integration poses severe challenges of high-dimensional hybrid optimization to signal processing. To address this issue, we integrate the spatial optimization of SMA and the electromagnetic reconfiguration of ERA, propose a unified modeling framework termed movable and reconfigurable antenna (MARA) and investigate the channel modeling and spectral efficiency (SE) optimization for MARA. Besides, we systematically review artificial intelligence (AI)-based solutions, focusing on analyzing the advantages of AI over traditional algorithms in solving high-dimensional non-convex optimization problems. This paper fills the gap in existing literature regarding the lack of a comprehensive review on the AI-driven signal processing paradigm under spatial-electromagnetic dual reconfiguration and provides theoretical guidance for the design and optimization of 6G wireless systems with advanced MARA.

Recent promising results in auditory attention decoding (AAD) using scalp electroencephalography (EEG) have motivated the exploration of cEEGrid, a flexible and portable ear-EEG system. While prior cEEGrid-based studies have confirmed the feasibility of AAD, they often neglect the dynamic nature of attentional states in real-world contexts. To address this gap, a novel cEEGrid dataset featuring three concurrent speakers distributed across three of five distinct spatial locations is introduced. The novel dataset is designed to probe attentional tracking and switching in realistic scenarios. Nested leave-one-out validation-an approach more rigorous than conventional single-loop leave-one-out validation-is employed to reduce biases stemming from EEG's intricate temporal dynamics. Four rule-based models are evaluated: Wiener filter (WF), canonical component analysis (CCA), common spatial pattern (CSP) and Riemannian Geometry-based classifier (RGC). With a 30-second decision window, WF and CCA models achieve decoding accuracies of 41.5% and 41.4%, respectively, while CSP and RGC models yield 37.8% and 37.6% accuracies using a 10-second window. Notably, both WF and CCA successfully track attentional state switches across all experimental tasks. Additionally, higher decoding accuracies are observed for electrodes positioned at the upper cEEGrid layout and near the listener's right ear. These findings underscore the utility of dynamic, ecologically valid paradigms and rigorous validation in advancing AAD research with cEEGrid.

Zeroth-order optimization (ZO) has been a powerful framework for solving black-box problems, which estimates gradients using zeroth-order data to update variables iteratively. The practical applicability of ZO critically depends on the efficiency of single-step gradient estimation and the overall query complexities. However, existing constrained ZO algorithms cannot achieve efficiency on both simultaneously. In this work, we consider a general constrained optimization model with black-box objective and constraint functions. To solve it, we propose novel algorithms that can achieve the best-known overall query complexity bound of $\mathcal{O}(d/\epsilon^4)$ to find an $\epsilon$-stationary solution ($d$ is the dimension of variables), while reducing the queries for estimating a single-step gradient from $\mathcal{O}(d)$ to $\mathcal{O}(1)$. Specifically, we integrate block gradient estimators with gradient descent ascent, which leads to two algorithms, ZOB-GDA and ZOB-SGDA, respectively. Instead of constructing full gradients, they estimate only partial gradients along random blocks of dimensions, where the adjustable block sizes enable high single-step efficiency without sacrificing convergence guarantees. Our theoretical results establish the finite-sample convergence of the proposed algorithms for nonconvex optimization. Finally, numerical experiments demonstrate the superior performance of our algorithms compared to existing methods.

We study the policy gradient method (PGM) for the linear quadratic Gaussian (LQG) dynamic output-feedback control problem using an input-output-history (IOH) representation of the closed-loop system. First, we show that any dynamic output-feedback controller is equivalent to a static partial-state feedback gain for a new system representation characterized by a finite-length IOH. Leveraging this equivalence, we reformulate the search for an optimal dynamic output feedback controller as an optimization problem over the corresponding partial-state feedback gain. Next, we introduce a relaxed version of the IOH-based LQG problem by incorporating a small process noise with covariance $\epsilon I$ into the new system to ensure coerciveness, a key condition for establishing gradient-based convergence guarantees. Consequently, we show that a vanilla PGM for the relaxed problem converges to an $\mathcal{O}(\epsilon)$-stationary point, i.e., $\overline{K}$ satisfying $\|\nabla J(\overline{K})\|_F \leq \mathcal{O}(\epsilon)$, where $J$ denotes the original LQG cost. Numerical experiments empirically indicate convergence to the vicinity of the globally optimal LQG controller.

The advancement of next-generation Wi-Fi technology heavily relies on sensing capabilities, which play a pivotal role in enabling sophisticated applications. In response to the growing demand for large-scale deployments, contemporary Wi-Fi sensing systems strive to achieve high-precision perception while maintaining minimal bandwidth consumption and antenna count requirements. Remarkably, various deep learning-driven perception technologies have demonstrated the ability to surpass conventional resolution limits. However, the theoretical underpinnings of this phenomenon have not been thoroughly investigated in existing research. We find that under hardware-constrained conditions, the performance gains of deep learning in Wi-Fi sensing primarily originate from two aspects: prior information and temporal correlation, which act as specific forms of side information that reduce the estimation error bound. We construct a deep learning-based Wi-Fi sensing system using only a single transceiver pair and design experiments to validate these gains. The system achieves an average human pose estimation error of 0.2189 m and an average localization error of 0.6124 m, while operating in real time at 42 fps on commodity hardware.