Papers

The antenna-elements that make up a radio interferometer form a spatial filter that samples components of the Fourier transform of a target radio astronomical source brightness. Along the signal path, there are multiplicative and additive perturbation effects that alter the signal and that should be corrected. The process of mitigating these perturbation effects is called calibration. In this work, we develop a new and fast Maximum Likelihood based estimator of these perturbation effects using the Exponential Map and Lie groups. To evaluate its performance, we compare it to the Cramér-Rao Lower Bound and, to test the estimation time, we compare it with the Expectation Maximization algorithm, another fast Maximum Likelihood estimator. Finally, we apply our estimator to a real observation of the protoplanetary disk AS 209 made with the Submillimeter Array. We found that our proposed estimator meets the Cramér-Rao Lower Bound and it was approximately 40 times faster than the Expectation Maximization algorithm.

Machine learning (ML) has emerged as a promising approach for improving diffusion MRI (dMRI) tractography, a task that remains limited by the intrinsic tension between local diffusion information and global anatomical plausibility. In this work, we systematically evaluate recurrent neural networks (RNNs) and Transformer models for iterative tractography, with particular attention to training strategies, input representations (including convolutional neural network (CNN)-based embeddings and end-of-sequence (EOS) tokens), and hyperparameter selection. We introduce a generation-validation phase enabling supervision at the streamline level during training, allowing supervision despite the mismatch between local loss functions and global streamline quality. Using the ISMRM2015 tractography challenge dataset, our models achieve the highest reported performance to date. Through controlled experiments, we quantify the impact of missing bundles, noisy or imperfect training streamlines, and invalid fibers in the training set. Finally, we demonstrate the applicability of our best-performing models for in vivo data from the Tractoinferno database. Overall, our results highlight both the potential and the limits of sequence-based deep learning models such as Transformers and RNNs for tractography, and emphasize the need for improved phantoms and evaluation methods for in vivo validation. We provide takeaways and recommendations for future researchers training and validating sequence-based supervised methods for tractography.

The design of satellite constellations for Earth observation requires balancing spatial coverage, revisit time, cost, and operational complexity. This paper considers the problem of designing the orbits of a given number of Low Earth Orbit (LEO) or Very Low Earth Orbit (VLEO) satellites to maximize the spatial and temporal resolution achieved over a prescribed set of ground targets. This kind of problem is inherently nonconvex and possibly combinatorial, making its solution computationally demanding for large constellations and target sets. To address this challenge, we propose a two-stage optimization strategy that separates spatial-coverage design from temporal-resolution optimization, thereby reducing the complexity of the overall problem. Two variants of the method are developed. The first employs continuous decision variables during the spatial-optimization stage, whereas the second discretizes these variables and reformulates the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The latter formulation enables the use of efficient classical QUBO solvers and is directly compatible with quantum-annealing hardware. The proposed framework provides a scalable approach to the design of heterogeneous LEO and VLEO Earth-observation constellations and establishes a pathway for exploiting emerging quantum-optimization technologies in satellite mission design. Preliminary simulation results are presented to demonstrate the effectiveness of the strategy.

Natural language descriptions can provide rich semantic representations of audio-visual urban scenes, yet datasets that jointly describe both auditory and visual information remain limited. In this paper, we introduce AVSD-Scenes, a paired audio-visual scene description dataset for urban environments. The dataset contains 12,291 audio-visual scene descriptions generated from the TAU Urban Audio-Visual Scenes dataset. To construct the dataset, we first generate audio- and visual-based descriptions using Qwen2-Audio-7B and Qwen2.5-VL-7B, respectively. These modality-specific descriptions are then combined using large language models, namely Qwen3-14B, Mistral-Small-3.2-24B-Instruct-2506, and Gemma-3-27B-it, to produce multimodal descriptions that capture complementary information from both modalities. We benchmark AVSD-Scenes using semantic alignment, cross-modal retrieval, scene classification, LLM-as-a-judge evaluation, and human subjective assessment. Results show that multimodal descriptions improve semantic alignment and cross-modal retrieval performance compared with modality-specific descriptions while preserving strong scene-discriminative information. The generated descriptions achieve up to 94.5% accuracy in urban scene classification, while combining audio, visual, and description embeddings further improves accuracy to 95.4%. Furthermore, the descriptions remain highly scene-discriminative even when scene labels are removed from the prompting instructions, indicating that they capture semantic information derived from the audio-visual content rather than merely reflecting label information.

This paper proposes a local recursive least squares (RLS) estimation strategy for discrete-time adaptive fuzzy control of nonlinear systems represented in quasi-Linear Parameter Varying (qLPV)/Takagi–Sugeno (TS) form. Unknown nonlinear terms are approximated by a constant-consequent TS fuzzy model, and the consequent parameters are updated by a membership-function-weighted RLS law with a forgetting factor. The proposed estimator keeps a different covariance for each rule, considerably reducing the memory footprint of the least-squares updates. The adaptation is also simplified since each rule is only adapted when it is active. From these properties, we are capable of showing that the adaptation law ensures bounded local adaptation errors. Building upon this adaptation law, Linear Matrix Inequality (LMI) synthesis conditions are presented for matched, sector-bounded and norm-bounded unknown nonlinearities, guaranteeing ultimate uniform boundedness of the adaptive control system in closed loop. Three numerical examples are presented to illustrate the adaptive control conditions in the three cases: a planar manipulator with unknown gravity direction, a two-tank system with unknown coupling, and a Brushless DC (BLDC) motor acting as thrust for an efficiency vehicle.

Speech-based Alzheimer's disease (AD) assessments increasingly rely on pretrained self-supervised learning (SSL) models that learn acoustic representations directly from raw audio, exposing the model to recording factors. We ask whether such factors are merely encoded in SSL representations or can systematically alter predictions. Using ADReSSo and three large SSL backbones, we apply controlled noise and reverberation interventions to participant-speech-only, non-speech, and full-recording audio. We combine layer-wise linear decoding, input- and representation-space interventions, and geometric alignment analysis to distinguish acoustic decodability from influence on AD prediction. Our results show that controlled acoustic interventions alter AD predictions across all three SSL backbones. Noise, despite showing no significant diagnostic-group difference in the original data, produces the strongest intervention effects. Importantly, these effects are systematically structured relative to the classifier's decision direction, replicate on the held-out test set and reverse when the representation-space intervention direction is reversed. Together, these findings show that high predictive performance and the absence of a significant diagnostic-group difference in a measured acoustic factor are not sufficient for robustness. We argue that intervention-based robustness tests should become standard for trustworthy clinical speech models.

Collaborative embodied artificial intelligence (CEAI) enables multiple physical agents to perceive, reason, and act cooperatively in dynamic environments. Effective communication is essential for CEAI, yet CEAI agents must exchange not only large multimodal observations but also task-relevant insights, intents, and interactive information over long horizons. This article investigates token communication (TokCom) as a native intelligence interface for CEAI, in which tokens serve jointly as compact semantic carriers for communication and fundamental inference units for generative foundation models (GFMs). We first discuss how TokCom supports insight sharing, intent alignment, and interactive control among embodied agents. We then propose a TokCom-assisted CEAI framework driven by a task-adaptive communication protocol. Comprising a compact codebook, syntax rules, and contextual examples, this protocol guides GFM-based transceivers to distill messages into compact tokens and reconstruct them after wireless transmission. A case study on collaborative object transport demonstrates that the proposed TokCom framework substantially reduces the source payload bit consumption while preserving task efficiency and showing robustness under noisy channels. Finally, we outline future research directions.

Many cyber-physical systems require control policies that combine continuous setpoints with discrete operational de- cisions, such as equipment switching, mode selection, or resource scheduling. Discrete actions are not differentiable, which ob- structs gradient-based policy training, while conventional mixed- integer formulations remain costly to solve online. This paper proposes a hybrid-action neural controller (HANC) in which a continuous branch, a categorical branch and a differentiable assembly layer jointly generate commands that satisfy complex actuator constraints by construction. Categorical decisions are handled using a straight-through Gumbel estimator, enabling the policy to be trained by backpropagation through time over full closed-loop rollouts. The proposed framework is deployed on a district heating network (DHN) featuring multiple heat generation units and stratified thermal energy storage. Its performance is evaluated on a simulation of a real DHN located at RSE SpA in Italy. The resulting policy jointly learns switching decisions and continu- ous operating setpoints. Under dynamic electricity pricing, the learned controller reduces operating cost by 30% compared to a rule-based industrial baseline. We also show that, compared with a deterministic straight-through relaxation, injecting noise during training achieves similar cost while reducing hard switching by an order of magnitude, and attribute this difference to the wider decision margins of the resulting policy.

When the system model is not fully known, measurement error and limited excitation can leave several models consistent with the same finite data. A command judged safe for one model may fail for another, while limited control authority can prevent the corrective action needed to preserve safety. To ensure safety under model uncertainty and asymmetric input limits, we develop a finite-data certificate that determines whether a command can enforce a prescribed safety inequality. For a linearly parameterized safety channel with exactly known regressors and bounded aggregate residual error, we derive a support formula for the worst-case safety contribution of all data-consistent models. The formula identifies the regressor directions that admit a finite bound, allowing rank-deficient records to contribute to safety certification. Using certified componentwise bounds on actuator tracking error yields an affine inequality with a necessary and sufficient test for pointwise command feasibility. The affine inequality reduces computation of the closest certified command to a scalar root-finding problem. It also yields a closed-form gate that selects the largest certified fraction of a prescribed command segment. The proposed certificate guarantees output safety within its operating domain, provided the feedback is locally Lipschitz and the uncertainty bounds remain valid. Domain retention and full-state continuation extend this guarantee to all time. A vehicle study demonstrates that output safety can be certified from finite measurements in a safety-critical setting with model and actuator uncertainty.

Sensors deployed in real-world conditions often produce measurements corrupted by outliers due to model uncertainties, changes in the surrounding environment, and/or data loss. As a result, managing these outliers becomes crucial for state estimation to avoid inaccurate estimations and a reduction in the reliability of results. To address this issue, we introduce a novel form of extended Kalman filter (EKF) based on the maximum a posteriori (MAP) principle for scenarios where outliers simultaneously occur in multiple dimensions. For detecting outliers during the filtering process, we introduce a novel variant of the normalized innovation ratio (NIR) test and embed it within the EKF framework. Our approach enhances the estimation accuracy and computational efficiency of state estimation process even when data from several sensors simultaneously contain outliers.

Neural activity often exhibits multiple timescales that can vary with behavioral states and task conditions. Identifying these timescales from neural recordings is important for better understanding neural computation and function. However, traditional approaches based on autocorrelation fitting are difficult to scale to high-dimensional population recordings and can become unreliable when neural dynamics change with behavior. State-space models have been a powerful framework for modeling high-dimensional neural population activity through latent dynamical systems, but standard formulations and inference methods do not explicitly account for multiple timescales and therefore do not guarantee accurate recovery of the underlying temporal structure. Motivated by these questions, we introduce the Multi-Timescale Switching Linear Dynamical System (MTS-SLDS), a framework for identifying regime-specific latent timescales from continuous or spiking neural observations. MTS-SLDS combines a multi-lag moment initialization, which captures temporal structure across multiple observation lags, with regime-conditioned Laplace-EM inference, which reduces mixing of dynamical statistics across uncertain regimes. Characteristic timescales can then be extracted directly from the eigenvalues of the learned latent transition matrices. In synthetic and neural experiments with Gaussian and Poisson spike observations, MTS-SLDS accurately recovers timescales and switching structure over multiple datasets.

Encoder-based speech large language models (Speech-LLMs) commonly employ pretrained speech encoders that prioritize linguistic content but may discard fine-grained acoustic cues essential for speaker discrimination and paralinguistic understanding. Encoder-free Speech-LLMs instead map Mel-spectrogram features directly into the LLM input space through lightweight embedding layers, enabling the LLM to learn from low-level acoustic features. However, systematic pretraining strategies for encoder-free Speech-LLMs remain underexplored, limiting their ability to compensate for the absence of large-scale pretrained speech encoders. We propose metadata-supervised pretraining (MSP), which leverages speech attributes such as speaker identity and emotion to develop speaker-discriminative and paralinguistic capabilities. We further introduce speaker-aware utterance composition (SAUC) to strengthen speaker discrimination and apply random span masking to regularize pretraining. We primarily evaluate our approach on joint ASR and speaker diarization in multi-speaker conversations, complemented by experiments on paralinguistic speech-understanding tasks. Under matched training-data conditions, our encoder-free model outperforms its randomly initialized encoder-based counterpart. With limited metadata-annotated data, it is competitive with models using speech encoders pretrained on substantially larger corpora, outperforming them in several settings. These results demonstrate the potential of encoder-free architectures for building native multimodal LLMs that acquire diverse speech capabilities.

Wrist electrodermal activity (EDA) differs in amplitude from one person to the next, so affect-recognition models normalize their input before classification. Studies that test such models on held-out subjects seldom report where the normalization statistics come from, yet statistics computed from the held-out subject's own recording give the model information that a device does not have when it is first worn. We asked how this choice alters the measured benefit of pretraining. A compact convolutional network, SAFE-EDA, was pretrained on expert artifact annotations from 43 subjects and compared with the same network trained from scratch on the Wearable Stress and Affect Detection (WESAD) dataset (15 subjects, leave-one-subject-out), with two normalization sources crossed with four window hops. When the statistics came only from training subjects, pretraining raised macro-F1 by 0.078 to 0.227; when they came from the held-out user's full recording, the gain fell to between 0.020 and 0.050 and was no longer significant. Artifact supervision was far more useful than self-supervised pretraining on the same recordings (0.078 versus 0.008). Across 13 configurations in two datasets, the pretrained network was better in 12, but on the second dataset (26 subjects) per-user normalization increased the gain instead of reducing it, so the interaction depends on the data. Only five of 50 published WESAD studies state which data were used for normalization. Reporting this choice is necessary to separate first-use performance from performance after calibration.

We study the design of a token economy for highway lane allocation that aims to improve fairness without sacrificing traffic efficiency. Motivated by the San Mateo 101 Express Lanes Project, we consider a setting in which high-occupancy vehicles have unrestricted access to an express lane, while the remaining users can alternate between regular and express lanes by earning and spending nonmonetary tokens. We model the resulting interaction as a finite-population dynamic congestion game with heterogeneous time preferences and limited-information evolutionary policy revisions. Building on a mean-field approximation, we derive token prices that enforce the system-optimal lane split while inducing fairness over time through turn-taking. The scheme is evaluated in a microscopic traffic simulation with real-world demand data. The results show that the proposed prices yield nearly the same average travel time as a baseline scenario in which no lane is reserved as an express lane, while substantially reducing urgency-weighted perceived travel time. These findings highlight token economies as a promising alternative to monetary congestion pricing for fairer management of scarce road capacity.

Real images often exhibit unknown and mixed degradations, making restoration substantially more challenging than single-task image restoration because multiple distortion types interact within the same observation. Consequently, existing methods often rely on prior knowledge of the degradation type or separate task-specific models, which may oversmooth fine structures or leave residual artifacts, motivating a compact model-driven alternative. We propose the Multi-Degradation Image Restoration Network (MDIRNET), a unified framework that combines a model-driven low-rank prior with end-to-end learning. Here, unified refers to joint training on three degradation types: noise, rain, and blur. A single MDIRNET model restores all three without requiring task-specific models, modules, or branches at inference. The low-rank prior exploits the redundancy and compact structure of natural image patches. To identify this underlying low-dimensional representation, we formalize restoration via Orthogonal Variational PCA (OVPCA) and translate its iterative inference into a deep unfolding network. To handle spatially non-uniform corruption and local content variability, we further introduce a learnable patch-partitioning strategy and a lightweight dynamic rank-allocation module that predicts the appropriate subspace dimension for each region. Spatially adaptive reconstruction refinement is performed using a supervised attention module. Extensive experiments on standard denoising, deblurring, and deraining benchmarks show that MDIRNET achieves competitive or superior performance over strong baselines across most metrics, while controlled mixed-degradation experiments demonstrate consistent performance across the evaluated synthetic degradation combinations. The code is available at https://github.com/ScholarForge/mdirnet.git.

Direct to device D2D connectivity from low Earth orbit LEO satellites is moving to Ku band, where a handheld terminal must obtain directional gain from several small phased array panels distributed around the chassis. Beam management then becomes a joint satellite panel beam selection problem with hundreds of candidates, and ordinary hand motion can change the best candidate within one decision interval. This paper proposes a low overhead predictive beam management scheme for a multiband LEO D2D downlink in which a low frequency anchor link carries control signalling and fallback traffic, and a Ku band link carries broadband data. The handset inertial measurement unit IMU reports attitude and angular rate with a known delay; the scheme extrapolates the delayed attitude to the current orientation, scores all satellite panel beam candidates analytically from the satellite ephemeris and panel geometry, and trains only a small candidate set built with a satellite panel diversity rule under a fixed pilot budget. The Ku band link is activated only when its predicted post training rate exceeds the anchor rate by a margin. Trace driven Monte Carlo simulations with a four panel handset and two visible satellites show that, with six pilots 0.3 percent training overhead, the proposed scheme improves mean goodput by 21.2 percent and reduces broadband outage by 57.6 percent at 90 degrees per second relative to an equal budget delayed attitude baseline, and operates within 3.8 percent of a zero overhead oracle.

Optical inter satellite links ISLs are becoming the backbone of modern LEO constellations offering high capacity and low latency but introducing stringent geometric and physical layer constraints Routing in such networks must therefore account for time varying topology jitter induced outage and the heterogeneous reliability of intra and inter plane optical links aspects that classical shortest path or existing learning based schemes do not fully capture This paper develops a joint geometric and QoS aware routing framework for optical LEO networks We derive a closed form outage expression under Gaussian beam propagation with pointing errors and obtain analytical maximum feasible link ranges for different ISL classes These relations remove beam divergence from the optimization variables and embed optical feasibility directly into the routing layer leading to a latency reliability capacity constrained routing formulation that is proved to be NP hard To enable scalable decision making we cast snapshot routing as a Markov decision process and introduce an angle constrained masked deep Q network AC MDQN that integrates optical feasibility masks potential based latency shaping and a geometry aware corridor filter around the source destination great circle path This design significantly reduces the effective action space complexity while preserving near optimal routing choices Simulations on a Starlink like constellation demonstrate that AC MDQN achieves end to end latency within 1 to 2 percent of constrained shortest path solutions remains robust under varying pointing jitter and supports controllable hop latency trade offs through reward design The results confirm that the proposed framework provides an efficient and physically consistent routing solution for large scale optical LEO networks

Wearable ultrasound probes must transfer increasingly large acquisition payloads while maintaining compact, low-power electronics. In TinyProbe, the current bottleneck in data transfer occurs between the acquisition FPGA and the wireless system controller. This work presents an open-source, multi-wire SPI readout interface that uses serial command and address phases followed by a build-time-selectable dual- or quad-lane payload phase that is intended to address this bottleneck by increasing the potential bandwidth over the wifi limit while retaining compatibility with the Microcontroller-centric wearable US architecture. The interface emulates a serial flash memory, enabling compatibility with a broad range of microcontroller families and their existing peripheral interfaces. On the FPGA, the data path connects the existing acquisition FIFOs to the SPI interface through clock-domain crossing, sample reshaping, and packing into 32-bit words. Dual-SPI readout is integrated into the existing IGLOO2/SiWG917 TinyProbe architecture and verified at an SCLK frequency of 5 MHz. A separate Kria K26 testbed is used to characterize the FPGA SPI interface independently of the acquisition and wireless subsystems, demonstrating error-free transfers at SCLK frequencies up to 66 MHz. These measurements identify the SiWG917 multi-lane SPI implementation as the next bandwidth-limiting component and motivate a future upgrade of the system controller. The HDL and MCU implementations are released under a permissive open-source license.

Miniaturized ultrasound (US) probes require programmable and synchronized transmit (TX) excitation across multiple elements, while existing compact platforms often rely on limited microcontroller (MCU) pulse generators or closed-source fixed-function pulser devices. We present U-Sonic, an open-source digital US TX peripheral integrated into a 32-bit RISC-V system-on-chip (SoC). The implemented SoC integrates 8 pulser cores, while the parameterized architecture supports up to 16 channels. Each core generates single- or dual-tone bursts with programmable period, duty cycle, pulse count, polarity, and idle level, together with optional inverted stop pulses for active damping. A shared memory-mapped Open Bus Interface (OBI) enables synchronous start and stop of arbitrary channel subsets and supports composite bipolar, gated, and three-level excitation schemes. Functional correctness was verified in Verilator against a Python golden model over 4379 checked cycles across directed and randomized configurations, and confirmed on a Terasic DE10-Lite field-programmable gate array (FPGA). The design was synthesized and placed-and-routed in IHP 130 nm. The post-layout area in kilo gate equivalents (kGE), scales as 1.65 kGE plus 1.66 kGE per channel. The 8-channel instance occupies 14.9 kGE, corresponding to approximately 14.3% of the 104 kGE SoC. The register-transfer level (RTL), register descriptions, verification collateral, and software support are released as open source.

Wearable ultrasound enables continuous deep-tissue monitoring, and a single programmable probe can operate in multiple complementary modes, such as structural A-mode and Doppler flow measurement. However, each operating mode requires dedicated measurement parameters and peripheral states, with no single configuration serving all modes on resource-constrained devices. Time multiplexing of operating modes introduces reconfiguration latency that lowers the effective mode repetition rate. To address this limitation, we present an open-source, transition-aware control stack for low-latency, in-session reconfiguration of the 32-channel TinyProbe wearable platform. Operating modes are described as hardware configurations, and host-side shadow registers track the peripheral states, enabling transition-specific register updates. Transition sequences are executed either by the host (over Wi-Fi 6) or by a firmware loop on the probe MCU. We validate the stack on a pulsatile-flow phantom by interleaving blocks of 25 to 100 pulsed-wave Doppler shots at 1.43 kHz PRF with single 16-channel A-mode acquisitions, changing channel configurations at every transition. Compared to full reconfiguration, the overhead per transition decreases from 30.2 ms to 11.6 ms (host-scheduled) and 3.1 ms (MCU-scheduled). For 75-shot Doppler blocks, the multi-mode repetition rate reaches 16.0 Hz (MCU-scheduled), 90.1% of the theoretical maximum of 17.7 Hz. Concurrent reconstruction of a Doppler spectrogram and a lumen-diameter trace demonstrates the functionality of time-multiplexed flow and structural monitoring.

This paper introduces the integration of dual-band reconfigurable intelligent surfaces (DBRIS) in wireless system design, and investigates the ensuing performance gains in different application scenarios. This type of metasurfaces offers a compelling technology due to their reduced material usage, compact design, and multi-functional operation across multiple frequency bands compared to single-band RISs. Two representative use cases are considered to assess the achievable performance gains with the said integration, namely, DBRIS-assisted wireless communication, and DBRIS-assisted simultaneous wireless information and power transfer (SWIPT). For the first design, where the DBRIS is deployed as a relay, we focus on the energy efficiency (EE) maximization of the communication system. An alternating manifold method is proposed for the joint optimization of the source transmit power and the DBRIS phase shifting. For the second design, we investigate a DBRIS-assisted SWIPT system using a novel power splitting approach. An EE metric is defined, and an alternating optimization algorithm is developed to maximize it. Numerical results validate the advantages of the proposed design architectures as well as the proposed optimization framework. In particular, we highlight the energy efficiency gains enabled by the DBRIS as compared to operations with conventional single-frequency surfaces, in both application scenarios.

Neural speech codecs increasingly serve as tokenizers for speech language models (SLMs). Lowering the frame rate reduces the computational and memory costs of SLMs, but makes it difficult to preserve both linguistic information and acoustic detail. Existing approaches rely on rule-based compression: average pooling can discard linguistic information, whereas similarity-based merging uses a fixed threshold on adjacent-frame similarity and applies the resulting boundaries to the acoustic stream. We propose Q-SPT, a low-frame-rate dual-stream speech tokenizer with separate, context-aware, learnable query-based compressors specialized for semantic and acoustic representations. In particular, queries at a fixed rate independently attend to the semantic and acoustic streams as separate key-value sources, enabling stream-specific, context-aware aggregation through two separately learned compressors. In addition, an autoregressive text loss explicitly supervises the semantic compressor to preserve linguistic information. Experimental results show that Q-SPT achieves the best reconstruction among the evaluated codecs at the same frame rate. In downstream SLMs, it yields the best speech recognition accuracy and text-to-speech perceptual quality with competitive intelligibility.

The operation of residential energy hubs with multiple energy carriers (electricity, heat, mobility) poses a significant challenge due to the energy storage differences in time-constants, round-trip efficiencies and self-discharge rates. Usually, thermal storage exhibits flexibility in yearly planning optimizations or long-term scenarios. However, as optimization horizons shrink (1-48hs) so does their supplied value due to the lower round-trip efficiencies. To avoid this early depletion during operation this paper proposes a data-driven highway to steer the short-term daily control towards long-term optimality. The proposed methodology also presents how to optimally size the thermal storage and avoid yearly simulations and how all of this is related to nonlinearities in the daily operation. The presented framework links seasonal and daily optimizations through dynamic terminal sets and value functions. The seasonally-aware nonlinear economic model predictive controller achieves the most balanced performance, with the second best mean grid cost of all MPCs at -\texteuro 209. It also achieves better battery degradation control than its linear counterparts (between 26-34%) and the best thermal comfort of the nonlinear benchmarks. Nevertheless, the data-driven seasonal highway restrains the ability to control battery degradation and slightly increases computational time.

Large language models (LLMs) are increasingly deployed as computational engines in autonomous decision-making and planning loops, yet their systems and control treatment remains hindered by architectural simplifications, index conflations, and informal descriptions of tool interactions. This paper presents a control-theoretic formulation of decoder-only language models as multi-index, multi-rate systems, and sets the stage for a stochastic hybrid systems framework to govern the multi-phase dynamics of agentic tool interaction. We formalize the architecture across three hierarchically coupled evolution indices: (i) an ultrafast feedforward cascade of transformer blocks across layer depth, where layer normalization is cast as a spherical projection and key–value caching is proven to be an exact internal state realization via causal prefix invariance; (ii) an uncontrolled stochastic difference recursion over token generation steps, where finite context truncation induces a time-homogeneous Markov chain; and (iii) an autonomous mode-switching mechanism governing transitions between token generation and tool execution regimes, where tool invocations are triggered upon trajectory arrival at switching manifolds, followed by exogenous state jump maps that augment the context string with external observations. By defining a prompt-dependent evaluator over successive evaluable claims, we obtain a task-level error process whose fault-free histories and expected error growth admit bounds under conditional fault-hazard and error-drift assumptions.

Integrated Sensing and Communication (ISAC) is a foundation of 6G networks, demanding architectures that simultaneously enhance sensing accuracy and communication reliability. This paper presents a Reconfigurable Distributed Antenna and Reflecting Surface (RDARS) aided ISAC framework, where an RDARS overcomes the limitations of conventional passive Reconfigurable Intelligent Surfaces (RIS) and Distributed Antenna Systems (DAS). By enabling each element to dynamically operate in either reflection or connection mode, RDARS synergistically harnesses reflection gain, distribution gain, and an additional mode-selection gain. We investigate the joint optimization of transmit beamforming at the base station and dynamic mode selection at the RDARS to minimize the sensing performance metric, namely the Cramér-Rao Bound (CRB) for target localization, while guaranteeing a minimum required Signal-to-Interference-plus-Noise Ratio (SINR) for multiple communication users. To solve the resulting non-convex and mixed-integer problem, we develop an efficient iterative algorithm based on the Alternating Optimization (AO) framework, effectively leveraging Majorization-Minimization (MM) and Penalty methods. Comprehensive simulations validate the proposed design, demonstrating that the dynamic RDARS configuration achieves a superior trade-off between the Position Error Bound (PEB) and communication SINR, significantly outperforming benchmark passive RIS and DAS systems.

Code-switched (CS) speech leaks through the monolingual language identification (LID) filters used to curate massive speech corpora, calling for CS-aware LID (CS-LID). We formulate utterance-level CS-LID as multi-label language-set prediction and propose a set generator that directly outputs the languages in an utterance, comparing it against atomic-pair and score-based classification baselines. Oracle Top-k is the strongest baseline, but thresholding fails because no single threshold separates CS from monolingual speech. Our set generator predicts the correct language count on unseen pairs without assuming the number of languages, but underperforms oracle Top-k in exact set accuracy. Our analysis identifies the key obstacles to robust CS-LID: oracle cardinality, threshold instability, language bias in CS training data, and the synthetic-to-real gap.

This letter introduces an optimization-based fixed time control algorithm for solving the voltage regulation problem of a radial and balanced power distribution network. The proposed algorithm requires no prior knowledge of the exact network impedance (resistance and reactance), yet guarantees voltage convergence to the predefined safe limit within a fixed time-window. We embrace results from Fixed-time stability (FxTs) and Control Lyapunov function (CLF) to analyze the stability and robustness of the underlying algorithm and then synthesize it leveraging the Quadratic Programming (QP) approach. We first analytically provide sufficient conditions on the control gains and the design parameters, that can ensure voltage regulation in fixed-time. Thereafter we transform the existing voltage regulation problem into an equivalent QP-based optimization framework and translate the aforesaid conditions to find feasible solutions for voltage stability. We empirically verify the efficacy of our proposed algorithm on the IEEE-33 bus distribution network and compare its performance against other existing robust control methods.

This paper presents a collection of audio transforms that introduce perceptually irrelevant distortions and demonstrates their use as perceptual stress tests for audio quality models. We refer to these methods as Perceptual Audio Data Perturbation (PADP). PADP exploits the insensitivity of the human auditory system to certain fine-grained signal variations to substantially alter the waveform while preserving perceived audio quality and content. The audibility of PADP and the selection of its parameters are evaluated through controlled listening tests, ensuring that the transformations achieve transparent or near-transparent quality for both non-critical and critical items. We further probe the robustness of state-of-the-art (SOTA) perception-motivated objective audio quality models and foundation models. The results reveal a misalignment between model responses and human auditory perception, highlighting the limited perceptual awareness of these models for certain proposed transforms.

Factories are shifting toward smaller lot sizes with high product customization, requiring frequent re-programming of flexible and reconfigurable automation systems. LLM-based agents can be deployed in two complementary roles: Offline, they generate deterministic production sequences, reducing programming effort; online, they operate live machines and handle unforeseen runtime faults that static programs cannot anticipate. We propose a solution in which each factory module is paired with a dedicated LLM-based agent and an MCP tool server that exposes the module's skills via OPC UA method calls, with agents coordinating over MQTT and grounded by real-time updates of the factory state. We compare three agent architectures (orchestrator, peer-to-peer, and monolithic) across nine production challenges of increasing complexity in a simulation of a physical six-module hexagonal factory, including silent hardware fault detection. The monolithic and peer-to-peer architectures both achieve the highest mean solve rate (93%), while the orchestrator uniquely resolves a silent conveyor-belt fault in all ten runs by autonomously rerouting plates around the blocked segment. All architectures exhibit emergent fault-diagnosis behavior without any explicit failure-handling logic, establishing standardized MCP tooling, MQTT-based inter-agent communication, and real-time state injection as a viable and reproducible foundation for LLM-programmed smart manufacturing.

Stable port-Hamiltonian neural networks certify asymptotic stability by construction. Yet, their Hamiltonian is a global Lyapunov function with a single global minimum, so they can represent only dynamic systems with one attractor. We demonstrate that this excludes even simple systems with energy landscapes forming a double well, and we overcome the restriction by parametrising the Hamiltonian as a product of Bregman divergences generated by one input-convex network. We prove that the resulting model is locally Lyapunov stable, that the coexistence of stable equilibria forces additional non-asymptotically-stable equilibria to exist, that all equilibria lie in a bounded region, and under a hyperbolicity assumption that almost-everywhere stability holds. On three systems our approach is able to recover the energy surface characteristics and improve the convergence speed by 1.8$\times$-8.5$\times$.