In this paper, we propose a tri-domain reconfigurable multiuser multiple-input multiple-output (MIMO) communication system that integrates the electromagnetic (EM) reconfigurable antenna (EMRA) with the spatially movable antenna (SMA), termed the spatial-EM reconfigurable antenna (SEMRA). The proposed system offers EM, spatial, and digital domain degrees of freedom (DoFs) for joint channel reconfiguration, yet introduces new challenges in channel estimation (CE) and precoding optimization. Specifically, for multiuser orthogonal frequency division multiplexing (OFDM) downlink, the precoding design is formulated as a tri-domain optimization problem over antenna positions, EM-domain radiation-pattern weights, and digital precoders. We first develop a zero-forcing (ZF)-based baseline algorithm to decouple the design of spatial reconfiguration, and then propose a weighted minimum mean square error (WMMSE)-based tri-domain joint optimization algorithm for further improving the spectral efficiency (SE). Furthermore, we propose a low-overhead movement-aided channel estimation scheme in which coordinated antenna repositioning across pilot slots synthesizes a denser virtual array, enabling more accurate angle-of-departure (AoD) estimation and EM-domain channel state information (eCSI) reconstruction under the same per-user pilot overhead as the EMRA baseline. The resulting parametric representation enables eCSI assembly at desired antenna positions without additional pilots. Simulation results show that the proposed CE scheme improves eCSI estimation accuracy and the proposed SEMRA achieves higher SE than the EMRA baseline under the same pilot overhead.

In industrial scenarios involving multi-agent collective decision-making, centralized decision-making may not be admissible due to restrictive access to individual local information, while the conflicts between participants' self-interest and global performance may also impede collaborative distributed decision-making. This paper proposes a mechanism-driven distributed decision-making method, wherein incentives are employed and designed to motivate participants to collaborate in a distributed fashion even though each participant's decision is driven primarily by self-interest. Focusing on optimization problems with coupled objective functions and coupled constraints, we design a distributed optimization algorithm tailored for this class of problems and provide guarantees for its convergence. Furthermore, we design two incentive mechanisms, the shadow pricing mechanism and the Vickrey-Clarke-Groves mechanism, and demonstrate that participants are willing to engage in distributed collaboration under these mechanisms. The mechanism drives the execution of the distributed algorithm, and the optimal result of distributed computation guides the determination of incentives in the mechanism, both of which are interrelated to form a closed loop. Finally, numerical experiments illustrate the effectiveness of the proposed algorithm and mechanisms.

In this technical report, we describe our submission for the WildSpoof Challenge TTS Track: Text-to-Speech with In-the-Wild Data. We introduce F5-TTS-DPS, a model built upon the F5-TTS architecture. Our approach integrates Exponential Moving Average (EMA) into supervised fine-tuning to stabilize training and improve generalization. To enhance synthesis fidelity, we leverage large language models (LLMs) and large audio language models (LALMs) for dual-scoring prompt selection, filtering reference audio and text prompts to ensure quality while addressing alignment issues in noisy datasets. Experimental evaluation demonstrates that F5-TTS-DPS achieves strong performance with UTMOS of 3.20 and speaker similarity of 0.51 on the development set. More importantly, our model achieves the best a-DCF scores of 0.1582, 0.5233, and 0.2562 across three advanced SASV systems among all submissions, indicating our synthesized speech is the most difficult to detect and exhibits the highest degree of naturalness and authenticity. Combined with competitive WER performance, these results validate the effectiveness of our approach in generating natural-sounding speech with strong spoofing capabilities.

A surrogate-based synthesis framework for antenna arrays is presented that incorporates mutual coupling while keeping optimization computationally efficient. The method combines a common characteristic-mode basis, a global modal coupling model, and element-wise generalized scattering matrices (GSMs). Array design variables are formulated and optimized on physically meaningful manifolds, in particular the manifold of unitary symmetric matrices for reciprocal and lossless element GSMs. A staged penalty strategy is used to progressively enforce sidelobe and cross-polarization constraints during multi-beam optimization. The framework is demonstrated for an 8x8 left-handed circularly polarized patch phased array with scan behavior in one principal plane. Different degree-of-freedom assignment strategies are compared, showing that constrained non-identical element classes can satisfy stringent pattern requirements where equal-element designs fail. For the demonstrated case, the optimization converges within seconds on a single CPU core, and full-wave verification of the realized arrays confirms the predicted trends, with good agreement for the SLL and useful accuracy for the XPR. The results indicate that the proposed formulation is a practical and scalable route for coupling-aware array synthesis and realization.

3rd Generation Partnership Project (3GPP) Technical Report (TR) 38.901 channel models (Releases 15-19) are widely used for physical-layer design and system-level evaluation in dense urban outdoor-to-indoor (O2I) and indoor environments. These models capture ensemble-averaged channel statistics but do not account for site-specific geometry. In this paper, we compare Power Delay Profiles (PDPs) derived from a deterministic ray-tracing model (Remcom Wireless InSite software) with those from the 3GPP TR 38.901 Tapped Delay Line (TDL) channel models. This comparative analysis is performed using a dense urban O2I scenario and a representative single-story indoor layout modeled in Washington, D.C., under matched link-distance and Non-Line-of-Sight (NLOS) conditions. All Wireless InSite PDPs are power-normalized to enable comparison of relative multipath delay structure. We evaluate root-mean-square (RMS) delay spread, mean excess delay, effective maximum delay, and Kullback-Leibler (KL) distribution divergence. Results indicate that 3GPP TDL models generally exhibit longer delay spreads and often fail to capture deterministic, site-specific features such as late-arriving energy and irregular spikes. While TDL models can approximate primary channel features in some cases, their reliance on ensemble-averaged statistics rather than geometry limits their representation of fine multipath structures. We conclude that while 3GPP TDL models are suitable for large-scale system evaluation, deterministic or hybrid approaches are more appropriate for site-specific physical-layer design.

Modern optimal control theory involves adjoining the already known equations of motion of a dynamic system to the objective function using dynamic costates; this is done in order to constrain the optimal control solutions to satisfy the equations of motion. The use of costates increases the number of variables and hence increases the complexity of the problem. On the other hand, variational methods of analytical mechanics finds the equations of motion by minimizing an action functional of the dynamic system, realizing control forces as external input to the system. In this paper a new disruptive approach for computing the optimal control is presented. This approach adopts the variational methods of analytical mechanics to derive equations for the control, in addition to the equations of motion. This is achieved by recognizing the control actuator as part of the dynamic system. In addition to the kinetic energy and potential energy, the action functional in this new approach includes additional energy terms that represent the control energy of the system. Two different methods are presented to write the modified action functional. The proposed approach is a significant departure from the modern optimal control theory, and it eliminates the need for costates when solving for the control. In this paper, a case study is presented to demonstrate the new approach.

This paper presents a system design methodology for a large-scale static wireless mesh network for 155 commercial off-the-shelf (COTS) radio nodes at fixed infrastructure sites in a challenging island environment. The architecture consists of approximately ten 15-node clusters, each with designated primary and secondary gateway nodes to support inter-cluster communication. A structured, multi-stage planning methodology was developed to guide network design. Site-specific radio frequency (RF) path loss predictions were generated using Remcom's Wireless InSite ray-tracing platform, incorporating terrain, buildings, and dense foliage effects. To optimize connectivity under physical-layer and operational constraints, spectral embedding combined with balanced k-means clustering was applied to partition the nodes into clusters of comparable size. A link budget analysis determined the maximum tolerable path loss under waveform and hardware constraints, defining the connectivity threshold used in the clustering framework. This work integrates deterministic RF propagation modeling with constrained clustering optimization to provide a scalable framework for planning static wireless mesh networks in complex geographic environments. Node mobility and higher-layer networking protocols were outside the scope of this study.

Modern audio-visual media rely on compact representations for efficient storage and transmission, whereas realistic digital touch still depends on high-resolution tactile recordings. Existing approaches for representing tactile signals constrain manipulation and limit the generation of new content. Here, we introduce two compact representations, spectral beta and spectral slope, that capture the temporal spectral structure of finger-surface friction signals while preserving perceptually relevant information. Spectral beta models spectral skewness using a two-parameter beta distribution, whereas spectral slope approximates the spectrum with an asymmetric bandpass filter defined by low- and high-pass orders. We evaluated these representations in a perceptual study with 14 participants using five virtual textures rendered on a friction-modulation display and compared them with physical textures and high-fidelity reproductions of recorded signals. Spectral beta achieved perceptual similarity ratings comparable to those of the original high-fidelity reproductions. Regression analysis further showed that matching spectral energy across nine critical frequency bands was the strongest predictor of perceived realism. Together, these findings suggest that tactile texture perception depends primarily on fundamental temporal spectral patterns and that modeling these patterns is sufficient for perceptually realistic rendering. These results establish an efficient and scalable framework for haptic compression, communication, and synthetic texture generation.

The accurate modeling of reflection coefficients is pivotal for developing reliable channel models in emerging terahertz (THz) communications. This study establishes a 300$\sim$400 GHz channel measurement platform to measure the reflection coefficients of various materials. Based on the analysis of measured data, we propose the single-layer interference with an extended-parameterized Lorentz/Drude (SLI-EPLD) reflection coefficient model. In this model, a sub-band modeling strategy is adopted to characterize the variation of reflection coefficients with frequency, while a parameterized mapping approach is employed to ensure the stability of model parameters. Furthermore, the weighted sub-band fitting for trend regression (WF-TREND) algorithm is introduced to achieve precise sub-band parameter fitting. Validation results demonstrate superior performance to existing models across multiple materials. The reflection coefficient model established in this work serves as a critical foundation for channel modeling in 300$\sim$400 GHz for high-THz communication.

Recent advancements in vehicle autonomy have drawn interest in understanding the impact of autonomous vehicles on traffic systems. In this paper, we study a traffic assignment problem in a mixed-autonomy setting where both human-driven and autonomous vehicles coexist. We model the interaction as a simultaneous routing game where human drivers are self-interested and aim to minimize their own travel times, while autonomous agents are altruistic and aim to minimize the total social cost. The standard nonatomic congestion game analysis establishes the existence of equilibrium to this game under convex cost functions, and does not have any implication of its uniqueness. In this work, we formulate the equilibrium as a variational inequality (VI), which enables us to establish the equilibrium existence without convexity assumption, and guarantees the uniqueness of the aggregated link flow and social cost at equilibrium under a specific class of cost functions. Leveraging this VI framework, we provide sufficient conditions under which including autonomous agents improves, deteriorates, or has no effect on social cost. While the possibility of deterioration has been established in prior work, our results complement existing worst-case bounds by explicitly characterizing sufficient conditions under which each outcome occurs, thereby providing a deeper understanding of mixed-autonomy traffic systems. Furthermore, we consider a centralized scenario where a social planner optimizes the routing of autonomous agents, and show that the same equilibrium is achieved as in the decentralized scenario when assuming convex costs.Finally, we conduct numerical experiments that illustrate how social cost changes with the amount of autonomous vehicles under different system parameters.

The deployment of Extremely Large-Scale Antenna Arrays for 6G enables radiative near-field sensing but poses significant challenges in terms of hardware complexity and interference. Stacked Intelligent Metasurfaces (SIMs) address these limitations by enabling wave-domain dimensionality reduction. This paper proposes a rigorous SIM-aided framework for near-field channel and localization estimation based on Multiport Network Theory, which provides an electromagnetically consistent characterization accounting for mutual coupling and non-unilateral inter-layer propagation effects. An indirect estimation approach is adopted, where the SIM is optimized to perform analog spatial filtering by projecting the received signal onto a relevant subspace identified through coarse prior location information. Within this realistic setting, we analytically characterize the impact of SIM approximation errors on channel estimation and quantify the resulting effects on localization performance. The results show that the proposed architecture preserves the essential wavefront curvature information required for accurate near-field localization, achieving performance comparable to fully digital solutions while drastically reducing the number of radio-frequency chains.

We present a physically consistent multiport framework for stacked intelligent metasurfaces (SIMs) with linear and explicit nonlinear terminations. The model provides closed-form input--output relations in the linear case and fixed-point forward evaluation in the nonlinear case, with adjoint-based gradients for optimization in both settings. Under stage-isolated SIM structure, complexity remains $\mathcal{O}(QK^3)$. In a 28 GHz near-field localization case study, nonlinear terminations improve transfer-function matching and reduce mean localization error, close to the ideal benchmark.

The robustness of synchronization is typically characterized by scalar, per-node stability indices whose dependence on topology is studied via network science or graph neural networks (GNNs). We propose a novel upstream task, learning stability landscapes, which provide deeper insights into synchronization behavior and from which many such scalar indices can be derived. Crucially, we pioneer a graph-to-image prediction paradigm: learning image-like landscapes as per-node targets directly from graph topology, a formulation we are not aware of having been established elsewhere in the literature. To support this task, we release two datasets of 10,000 graphs each at 20 and 100 nodes with per-node landscape labels, based on a conceptual oscillator model, capturing power grid synchronization behavior. A GNN encodes topology and a CNN decoder renders per-node images, learned end-to-end with good in-distribution accuracy, generalizing across graph sizes and to realistic power grid topologies. This demonstrates that stability landscapes, while beyond the reach of conventional network science, are learnable from topology and open new avenues for moving beyond scalar stability indices in biology, neuroscience, and power grids.

Models of opinion dynamics aim to capture how individuals' opinions change when they interact with each other. One well-known model of opinion dynamics is the Deffuant--Weisbuch (DW) model, which is a type of bounded-confidence model (BCM). In the DW model, agents have pairwise interactions, and they are receptive to other agents' opinions when their opinions are sufficiently close to each other. In this paper, we extend the DW model by studying it on networks with heterogeneous and adaptive edge weights between pairs of agents. These edge weights govern the interaction probabilities between the agents and thereby encode the idea that people are more likely to communicate with individuals with whom they have previously compromised or had other positive interactions. We prove theoretical guarantees of our adaptive edge-weighted DW model's convergence properties, the long-time dynamics of its edge weights, and the model's associated ``effective graph", which is a time-dependent subgraph that includes edges only between agents that are receptive to each other's opinions. We support our theoretical results with numerical simulations of our adaptive edge-weighted DW model on a variety of networks and find that including adaptive edge weights yields different qualitative dynamics for different types of networks. In particular, for small confidence bounds, we observe that incorporating adaptive edge weights decreases the convergence time for dense networks but increases the convergence time for sparse networks.

Model Predictive Path Integral (MPPI) control is a widely used sampling-based method for trajectory optimization, yet its convergence properties remain only partially understood. This paper provides a direct convergence analysis using variational optimization. By lifting constrained trajectory optimization to a Kullback-Leibler (KL) regularized problem over decision distributions, we derive a reduced free-energy objective defined over a parametric sampling family. For general parametric families, we derive gradient and Hessian representations of this reduced objective and analyze preconditioned gradient descent on the sampling-distribution parameters. In the fixed-covariance Gaussian case, the classical MPPI update is recovered exactly as a unit-step preconditioned gradient update. We prove descent and stationarity guarantees for the exact expectation-based iteration when the Hessian of the reduced objective is bounded in the metric induced by the preconditioner. For the Gaussian family, we further show that the preconditioned Hessian is governed by the covariance of the Gibbs-tilted distribution relative to the covariance of the sampling distribution, yielding a covariance-dependent sufficient condition for the descent of exact unit-step MPPI. Numerical experiments illustrate the theory and the effect of key hyperparameters.

The performance of state-of-the-art speech enhancement (SE) models considerably degrades for pathological speech due to atypical acoustic characteristics and limited data availability. This paper systematically investigates data augmentation (DA) strategies to improve SE performance for pathological speakers affected by Parkinson`s disease, evaluating both predictive and generative SE models. We examine three DA categories, i.e., transformative, generative, and noise augmentation, assessing their impact with objective SE metrics. Experimental results show that noise augmentation consistently delivers the largest and most robust gains, transformative augmentations provide moderate improvements, while generative augmentation yields limited benefits and can harm performance as the amount of synthetic data increases. Furthermore, we show that the effectiveness of DA varies depending on the SE model, with DA being more beneficial for predictive SE models. While our results demonstrate that DA improves SE performance for pathological speakers, a performance gap between neurotypical and pathological speech persists, highlighting the need for future research on targeted DA strategies for pathological speech.

Accurate fault location is essential for operational reliability and fast restoration in wind farm collector networks. However, the growing integration of inverter-based resources changes the current and voltage behavior during faults, challenging the effectiveness of traditional phasor-based diagnostic methods. In this context, the present paper introduces an advanced machine-learning solution that enhances a deterministic fault distance estimator by incorporating a correction model driven by a Gated Residual Network, specifically designed to minimize residual fault location errors. Through comprehensive feature engineering and selection processes, an improved predictor was developed and trained on a diverse set of fault scenarios simulated in a PSCAD-based real-world wind farm model, including variations in fault type, resistance, location, inception angle, and generation penetration. Hyperparameter optimization was performed using the Optuna framework, and the robustness of the method was statistically validated. Results show a significant improvement in accuracy, with a 76% overall decrease in fault location error compared to state-of-the-art approaches. The proposed method demonstrates strong scalability and adaptability to topological and operational changes. This approach advances the deployment of data-driven fault location frameworks for modern power systems.

Real-time hierarchical energy-sharing markets are promising to coordinate large numbers of prosumers. Still, most existing clearing methods rely on linearized or DC power-flow models and do not explicitly handle reactive power or voltage-security constraints. With AC network constraints, the problem becomes a large-scale bilevel Mathematical Program with Equilibrium Constraints (MPEC) that is difficult to solve in real time. This paper develops a non-iterative clearing algorithm for two-layer energy-sharing markets with voltage constraints. We first derive an efficient best-response function for each lower-layer energy-sharing market and reduce the equilibrium search to one dimension by exploiting the pricing-coupling structure. We then embed this function into the upper-layer network-constrained problem and reformulate the bilevel MPEC as a single-level mixed-integer second-order cone program (MISOCP), which is computationally tractable. Case studies on the IEEE 123-bus system with 12,300 prosumers show that the proposed method preserves nodal voltages within prescribed limits and delivers solutions with maximum errors below 0.01\% in 0.829 s.

An output feedback model predictive control (MPC) framework with adaptive tubes is proposed for linear time-invariant systems subject to parametric and additive uncertainties. An adaptive observer provides point estimates of the system state, model parameters, and initial condition, while jointly updating the corresponding sets containing the true parameters and initial state. These estimates parameterize the constrained optimal control problem, enabling constraint tightening, terminal ingredients, and tube geometry to be updated as the estimates evolve. In contrast to standard robust tube-based MPC formulations, the proposed approach does not require a common quadratically stabilizing linear feedback gain across the parametric uncertainty set. As the available uncertainty information improves, the tube geometry evolves accordingly, resulting in an adaptive tube MPC framework with improved performance over time. Recursive feasibility and robust exponential stability are established, and a numerical example is presented.

Most existing integrated sensing and communication (ISAC) studies focus on enabling a base station (BS) to support sensing and communication over shared resources through advanced waveform design and power allocation. In contrast, the object-side perspective remains underexplored. For example, an object may wish to remain difficult to detect for security reasons, while another object in close proximity may generate dominant reflections that confuse the BS and impair sensing reliability for the intended target. These challenges motivate the fluid antenna system (FAS) paradigm which introduces a reconfigurable spatial degree of freedom (DoF) that can reshape sensing signatures via port selection, beyond what waveform and power control alone can provide. In this paper, we devise diffusion FAS, a generative artificial intelligence (AI)-driven framework that exploits spatial agility to steer ISAC performance over the electromagnetic fading manifold. Instead of optimizing ISAC solely in the power domain, diffusion FAS casts ISAC as a \emph{dynamic spatial selection} problem in which antenna states (i.e., ports) are chosen to shape sensing signatures while maintaining communication objectives. To work under sparse measurements, we employ a conditional denoising diffusion probabilistic model (DDPM) to reconstruct the latent spatial correlation structure from a small set of observed ports, enabling efficient exploration of the reconfigurable aperture. We demonstrate two FAS-enabled ISAC modes: (1) \emph{generative spatial stealth}, which identifies localized deep fades to suppress a target's sensing visibility by up to two orders of magnitude, and (2) \emph{target isolation}, which synthesizes spatial nulls that reject interference from adjacent objects.

Fast fluid antenna multiple access (FAMA) is an idea that promises to overcome severe interference in massive access scenarios by reconfiguring the antenna's position at the receiver side on a symbol-by-symbol basis, without the need of precoding nor any other interference mitigation techniques. However, this idea is commonly studied under a \emph{genie-aided} premise: each user terminal (UT) can probe \emph{all} fluid-antenna ports in every symbol instance and ideally knows the instantaneous signal-interference split for the received signals at all the ports. Such assumption is unrealistic since it implies impractical hardware and switching limits, pilot overhead, as well as an unknown ability to determine the signal-interference split. This paper revisits the fast FAMA communication problem and asks a key question: can a UT act \emph{as if} it had full per-port interference knowledge while observing only a small fraction of ports? To this end, we propose a \emph{copula-aided FAMA} framework that learns the joint dependence structure of the complex triplets $(r_k,h_k,I_k)$ across ports, where $r_k$, $h_k$ and $I_k$ denote, respectively, the received signal, the channel coefficient and the aggregate interference signal at the $k$-th port, and uses this learned model to infer unobserved channels and interference. Concretely, we devise an attention-copula time-series model that is trained under random partial-observation masks and evaluated under both rich and finite-scattering channel models. Simulation results indicate that the reconstruction normalized mean-square-error (NMSE) for $h$, $r$, and $I$ drops to the order of $10^{-4}$ once the number of observed ports, $M$, exceeds the spatial degrees of freedom (DoF).

Modern radio-frequency (RF) instruments, such as vector network analyzers (VNAs), already provide mature remote-control interfaces. However, practical RF measurement workflows still rely on manual operation or custom scripting, which is time-consuming and expertise-intensive. This paper presents RF Instrument Agent (RFIA), a natural-language agent framework for reliable task-driven RF instrument control. RFIA adopts a decoupled intent--planning--execution architecture, where the LLM is used only for task understanding and high-level planning, while instrument-facing operations are handled by a deterministic runtime. Verified skills, workflow templates, RF analysis tools, instrument-specific rules, and retrieval-assisted SCPI knowledge are organized in a structured knowledge base, and hybrid execution graphs are used for closed-loop measurement tasks. A hardware-in-the-loop prototype is implemented on a commercial VNA and evaluated using a 16-task benchmark covering configuration, query, acquisition, rule-aware operation, RF-data analysis, and closed-loop measurement. RFIA handles all benchmark tasks under predefined execution and safety policies, including one expected safety rejection. Hardware-in-the-loop results with both a 230B-scale MiniMax-M2.7 model and a smaller 27B-scale Qwen3.6-27B model confirm that the decoupled architecture supports reliable natural-language RF measurement automation across different LLM backends.

Non-intrusive intelligibility prediction estimates how well hearing-impaired listeners understand hearing-aid-processed speech without a clean reference. We study this task in the 3rd Clarity Prediction Challenge using two frozen speech encoders, Canary and WavLM. The central question is not only whether complementary pretrained representations should be combined, but where their interaction should occur. We compare single-backbone baselines, uniform score averaging, pool-late fusion, cross-attention, frame-aligned fusion, and reverse alignment under a shared left/right-preserving binaural framework. Among the compared systems, the best model temporally prepares WavLM with a learnable strided convolution and fuses it with Canary on the coarser Canary timeline before pooling, reaching Eval RMSE 24.96$\pm$0.06 and Eval Corr 0.796$\pm$0.001. Severity, enhancement-system, layer-window, and temporal-shift analyses indicate that coarse local temporal correspondence before pooling is a useful inductive bias for this task.

We address text-assisted speech intelligibility prediction for hearing-impaired listeners in CPC3. Although the target is a sentence-level percentage, it is determined by reference-word recognition outcomes. We formulate prediction as reference-conditioned word-level correctness modeling: a frozen Whisper encoder analyzes degraded speech, a teacher-forced decoder conditions on the canonical transcript, and sentence intelligibility is obtained by averaging predicted correctness probabilities over valid reference words. To complement transcript-conditioned decoder states, we add a word-aligned local acoustic branch based on character-level cross-attention alignment and an utterance-level global acoustic branch for calibration. On the official evaluation set, the decoder baseline obtains RMSE 24.92 and correlation 0.795, while joint fusion improves to incorrect-word F1 0.778, MCC 0.626, correlation 0.806, and RMSE 24.39. A similar trend with Whisper medium suggests that the gain comes from prediction granularity and alignment-aware fusion.

Phoneme-level computer-assisted pronunciation training systems typically rely on phoneme-level annotations, which are costly and scarce. In this work, we investigate whether phoneme-level mispronunciation information can be learned without phoneme-level supervision by exploiting higher-level pronunciation labels. Specifically, we study a weakly supervised setting in which models are trained using only utterance- or word-level pronunciation labels and analyze whether this supervision induces useful phoneme-level score predictions. We further consider a two-stage training scenario in which a model trained only with utterance-level labels is finetuned using a limited number of carefully-selected phoneme-level labeled utterances. We find that, using our proposed architecture and selection process, the two-stage process leads to comparable results to those obtained with full phoneme-level supervision, requiring only a small fraction of phoneme-level labels.

LoRaWAN is a compelling low-cost solution for large-scale indoor Internet of Things (IoT) data backhaul, owing to its strong penetration capability and low power consumption. However, its default pure ALOHA access mechanism leads to severe channel contention, substantial packet loss, and reduced throughput under dense, concurrent transmissions. To overcome this, we propose a lightweight out-of-band (OOB) synchronization scheme that integrates a time division multiple access (TDMA) mechanism into commercial LoRaWAN Class~A networks. Unlike approaches requiring gateway scheduling, frequent downlink signaling, or custom hardware, our method introduces a single low-cost node providing millisecond-level alignment via a dedicated OOB synchronization channel. End devices seamlessly access this channel by briefly retuning their existing LoRa transceivers. Consequently, the scheme imposes zero downlink overhead during the steady-state reporting phase, requires no hardware modifications to gateways or end devices, and remains fully backward-compatible. This design enables collision-free scheduled channel access within the configured nominal resource capacity, thereby improving throughput and reducing contention. Real-world experiments using an indoor positioning prototype demonstrate that the proposed TDMA-LoRaWAN architecture improves system throughput by over 30\% and reduces the packet loss rate from 25.8\% to 5.02\% in a 20-node indoor deployment. Furthermore, large-scale simulations corroborate these empirical findings, support the scalability analysis under larger network sizes, and indicate improved energy efficiency per successful packet in dense network settings. These combined results demonstrate the effectiveness of the proposed approach for dense indoor IoT data collection and indicate its practical potential under high uplink reporting demands.

Manipulating fragile deformable containers, such as disposable plastic cups filled with liquid, demands real-time grip-force adaptation within an extremely narrow force margin: insufficient force causes slip, while excessive force irreversibly deforms the thin wall. Existing approaches struggle to achieve such force-sensitive manipulation tasks. We propose a noise-statistics-based calibration-driven reflex control paradigm with vision-based tactile sensing: by analyzing the sensor's intrinsic noise characteristics (via a brief static-hold-and-unload protocol), we directly derive all controller thresholds, eliminating external force calibration, trial-and-error manual tuning, or material-specific physical models. Instantiating this paradigm, we present TactileReflex, a three-channel closed-loop controller that extracts three image-level proxies, shear intensity ($S_y$), contact intensity ($F_n$), and center of pressure ($C$), from dual visuo-tactile sensors and drives prioritized reflex channels at ~12 Hz for slip suppression, weight-adaptive release, and force protection. Each channel closes the loop directly on its proxy via noise-derived thresholds. Ablation demonstrates that only the full three-channel system is able to prevent irreversible container deformation (5/5 success vs. at most 1/5 for partial configurations). In a dynamic pouring task, fixed-effort baselines fail in all 10 attempts due to pose drift, while TactileReflex achieves 9/10 success across two water volumes. As a self-contained and interpretable controller, TactileReflex can serve as a plug-and-play safety layer beneath high-level manipulation pipelines, including haptic-free VR teleoperation and vision-language-action (VLA) policies.

Unmanned Aerial Vehicle (UAV) detection is one prominent use case of Integrated Sensing and Communication (ISAC) systems in 5G-Advanced and future 6G networks. In this paper, we present experimental results for the detection of a small UAV using unmodified commercial 5G hardware for mono-static Orthogonal Frequency-Division Multiplexing (OFDM) radar and compare them with the expected performance based on models for link budget and hardware impairments. We show that reliable detection with sub-meter accuracy is still possible in over 500 meters distance in a challenging radio environment rich of strong clutter.

Directed acyclic graphs (DAGs) constitute a central modeling tool to enable principled reasoning about cause-effect interactions in complex systems. However, since the causal structure underlying a group of variables is often unknown and interventions may be infeasible or ethically challenging to implement, there is a need to address the task of inferring DAGs from observational data. However, most classical structure identification approaches face two key obstacles: the combinatorial challenge of enforcing acyclicity, which severely limits scalability, and identifiability challenges arising from latent confounding or heterogeneous noise. This tutorial offers an overview of recent signal processing and optimization advances that address these issues by recasting DAG structure learning as a continuous, score-based estimation problem over adjacency matrices. We begin with a didactic introduction to structural equation models and the formulation of causal graph recovery, followed by a historical survey of score-based methods ranging from early combinatorial search schemes and greedy heuristics to modern continuous frameworks that leverage smooth characterizations of acyclicity. Building on this foundation, we describe concomitant DAG estimation methods that jointly infer sparse causal structure and exogenous noise levels, improving robustness under heteroscedasticity and distribution shifts by rendering the estimator noise adaptive. All in all, the tutorial introduces readers to challenges and opportunities for signal processing research at the crossroads of causal inference, high-dimensional statistics, and scalable graph learning, while outlining emerging directions including online, nonlinear, and neural causal discovery.

This paper introduces a signal strength-based direction of arrival (DOA) estimation approach for directional sensors that explicitly accounts for missed detections. In traditional phase-based DOA estimation frameworks, negative information from expected emitters that fall below the detection threshold fall outside the scope of standard measurement models. Unlike phase-based DOA estimation methods, the proposed approach relies only on received signal strength measurements. As a result, missed detections arise naturally from the sensing and detection process and convey valuable information via the known detection thresholds. By incorporating both detected signals and missed detections into the likelihood function, we develop a probabilistic estimation method that fully leverages the underlying measurement and detection models. Simulation results show that the proposed method significantly improves DOA estimation accuracy compared to baseline techniques, particularly in challenging scenarios with high missed-detection rates. Real-world experiments using Bluetooth Low Energy (BLE) signals and directional antennas further validate the effectiveness of the approach, demonstrating substantial performance gains. These findings highlight the value of modeling missed detections in sensor array processing and open new avenues for enhancing localization performance in wireless communication systems.