Papers

The relationship between subjective test vote variance and vote mean (or MOS) is well-studied, and the mathematically admissible vote variance region has been previously defined. We propose a reduced admissible variance region called the Unimodal Variance Region (UVR) that better describes real subjective rating behavior of multimedia. Further, subjective vote variance is often modeled as parabolic. We explain that, in practice, the parabolic model often violates the admissible region in the variance vs. MOS plane and we propose alternatives that respect the admissible region. We also present a parametrized random process to model votes that mixes voting processes and produces a realistic range of vote variances within the UVR at any desired MOS. This process was inspired by and comports with voting behavior that is observed in many subjective tests. By modeling vote variance from a subjective experiment, this vote model offers additional interpretable insights into voting behavior observed in a given experiment. We present example results from 16 datasets spanning speech, image, and video subjective quality experiments.

We study contraction properties of non-stationary continuous-time mean-field games (MFGs) under discounting and entropy regularization. The state of the representative agent evolves according to a controlled continuous-time Markov chain, and both the state and action spaces are finite. In contrast to the undiscounted case, we show that, under a sufficiently large discount rate, finite-horizon MFGs admit a horizon-independent contraction condition, which also coincides with the corresponding infinite-horizon non-stationary contraction condition. As a byproduct, we obtain an explicit convergence rate between finite- and infinite-horizon mean-field equilibria. For each finite horizon, we further derive a refined contraction criterion from the spectral radius of a positive operator that majorizes the propagation of policy errors, and show that its large-horizon limit agrees with the horizon-independent contraction factor. Finally, we provide an explicit error bound between discounted and undiscounted finite-horizon regularized equilibria.

Generalized disjunctive programming (GDP) expresses mixed discrete-continuous decisions through Boolean indicators and disjunctions, and can be systematically solved via a library of methods proposed in the literature. The recent InfiniteGDP abstraction lifts this modeling layer to continuous domains such as time, space, and uncertainty, but only the big-M and hull reformulations, the two endpoints of the relaxation spectrum, have been generalized to the infinite setting. This work closes this gap by generalizing four other GDP solution methods to infinite-dimensional optimization: the multiple big-M reformulation, P-split reformulation, cutting plane reformulation, and the logic-based outer approximation algorithm. It further proposes MBM-GP, a novel Gaussian-process variant of multiple big-M that learns the big-M function over the infinite domain from a small subset of the subproblem solves. Moreover, these approaches are implemented in the Julia package InfiniteDisjunctiveProgramming.jl. The methods are benchmarked on case studies arising in dynamic and stochastic optimization. The results demonstrate how the generalized solution methods can outperform big-M and hull, with MBM-GP retaining the tightness of multiple big-M at a fraction of its reformulation cost.

We present FDverb, a frequency-domain artificial reverberator, based on the idea of a vocoder with a noise carrier signal. Using a short-time Fourier transform (STFT) for analysis and synthesis, FDverb generates late reverberation by weighting spectral noise components with envelopes. We extend FDverb with early reflections, nonlinear decay, and pitch shifting. These extensions enable creative sound-design applications. We provide FDverb as an open-source DAW plug-in, using the JUCE framework.

Low-Earth-orbit (LEO) constellations offer dense signals of opportunity (SOP) for positioning, navigation, and timing (PNT) without dedicated navigation infrastructure. However, using these signals passively, by only listening to the downlink, is difficult when beacon/pilot components are weak, signals from multiple satellites overlap, or the receiver cannot reliably identify which satellite generated a given observable. This paper proposes a low-power direct-sequence spread-spectrum (DSSS) watermarking framework that embeds a recoverable pseudonymous satellite identifier and keyed authentication field into a LEO downlink signal. The watermark carries a public satellite pseudonym for identification and a keyed HMAC-SHA256-based authentication field for authorized verification, enabling passive detection and verification without full downlink demodulation. We evaluate the framework in a multi-satellite simulation using Starlink two-line-element (TLE)-derived geometry, Doppler, and link-budget scaling with Sionna RT-based local propagation. The results demonstrate candidate-satellite detection, public-ID recovery, and keyed verification under co-observed satellite interference, with limited perturbation to the simulated beacon/pilot and primary downlink components. The framework targets future transmitter-enabled LEO systems while remaining transparent to legacy receivers that do not process the low-power watermark.

Cardiovascular risk prediction remains limited by incomplete clinical data and imaging biomarkers that reduce computed tomography (CT) to a small number of handcrafted features. We developed CARDINAL (Cardiovascular Assessment via Representation learning from Deep Imaging with Nested Anatomical Latent embeddings), a clinically grounded framework that learns compact representations from routine non-contrast cardiac CT for major adverse cardiovascular event (MACE) prediction. In 17,659 patients, CARDINAL was evaluated for 1-, 3-, 5-, and 10-year MACE prediction against American Heart Association (AHA) pooled cohort equations (PCE), AHA predicting risk of cardiovascular disease events (PREVENT), coronary artery calcium (CAC), segmentation-derived CT biomarkers, and 70-feature structural radiomics. Gains were largest at longer horizons. At 10 years, CARDINAL (joint) achieved an area under the receiver operating characteristic curve (AUROC) of 0.866 $\pm$ 0.020 and an area under the precision-recall curve (AUPRC) of 0.890 $\pm$ 0.015, compared with an AUROC of 0.826 $\pm$ 0.023 and an AUPRC of 0.826 $\pm$ 0.022 for structural radiomics, the strongest baseline. CARDINAL also achieved the highest survival concordance index (C-index), 0.753 $\pm$ 0.015, and high-versus-low risk-tertile hazard ratio, 10.78 $\pm$ 3.16, with favorable reclassification and exploratory calibration. These findings suggest that non-contrast cardiac CT contains prognostic information beyond conventional risk equations, CAC scoring, and engineered imaging biomarkers.

Models mapping acoustic properties onto affective response underpin applications from music recommendation to sound design, yet are evaluated almost entirely within the corpus they were fitted on. When one fails outside it, the standard response – more data, or a larger model – assumes every failure is a shortage of resources. We show it is not, and that the alternative calls for the opposite remedy. Using four corpora of rated sound, four pretrained representations and three corpora of physiological recording, we pushed one mapping across four boundaries an application must cross: to new material, to edited audio, to a sensor in place of a self-report, and to an individual listener. At each we report the ceiling the target permits, the fraction surviving the crossing, and the price in target-side observations of closing the gap. Within a corpus, prediction reaches 84% of the ceiling set by inter-listener agreement. A same-domain corpus swap costs a fifth of that, and a hundred target labels return two-thirds of the loss. Crossing between music and environmental sound costs four-fifths to all of it, and four pretrained representations recover none of it. Against physiological response no information source we constructed exceeds a third of the attainable ceiling. "The model does not generalise" is therefore two diagnoses, not one, with mutually exclusive remedies; treating the second as the first is the more expensive mistake.

A spacecraft closing on a target from three hundred kilometres to contact flies one guidance law across five orders of magnitude of range, and a controller that is provably safe at close range can lose that guarantee completely at long range while continuing to fly as though nothing were wrong. This paper derives the range at which the guarantee lapses and uses it as a design rule. The bound compares the prediction model's own linearisation error against the disturbance set the controller was built to reject, and needs only the sampling period, the orbit and that disturbance bound, so it can be evaluated before any simulation. On a Mars Sample Return approach it disqualifies the homing phase, where most of the propellant is spent, and clears the other two. Re-posing the disqualified phase in relative orbital elements restores the guarantee; re-posing a phase the rule already clears, in a frame two orders of magnitude more accurate, changes propellant by under a tenth of one per cent, and it is that second prediction that makes the rule falsifiable rather than descriptive. The constraint tightening also ties the prediction horizon to feasibility, so the horizon search limit becomes a mission parameter rather than a solver setting. Against a reimplementation of a published benchmark that reproduces its propellant to within one per cent, over five hundred dispersed Monte Carlo transfers per case on matched seeds, the controller saves 29% of the propellant on a circular target orbit and 40% on an eccentric one, docking inside the 0.20 m capture requirement on essentially every draw at a median miss near 5 cm. Two results run the other way: the saving is bought with time of flight and computation, and it comes from what the guarantee demanded of the terminal condition rather than from better disturbance rejection. Recursive feasibility and asymptotic stability are not claimed.

Hamilton-Jacobi reachability (HJR) is an important framework in safe control theory. HJR provides theoretical tools and numerical methods to obtain value-functions for tasks involving target-reaching and obstacle-avoidance. A recent work proposed an algebraic framework to scale to complex, composite tasks via decomposing the value functions of the composite tasks into value functions for the fundamental tasks traditionally studied in HJR, all in the one-player setting. Many of these decomposition results, however, do not directly translate to the two-player setting. In this technical note, we nevertheless show that one of the previous work's key results for analyzing various tasks involving reaching multiple targets while obeying constraints still holds in the two-player setting, so long as a critical monotonicity assumption is satisfied. In particular, we detail the analogous result and its proof (which structurally differs from the one-player case), we show via a counter-example what can go wrong if this monotonicity assumption is not satisfied, and we show how the analysis of a variety of tasks can be performed using this result. Such tasks include sequential and any-order multi-target-reaching tasks under constraints. We note that, whereas the prior work considered discrete-time, infinite-horizon tasks, which are more standard in reinforcement learning, we here consider continuous-time, finite-horizon tasks, which are more standard in HJR.

Generation and discovery are different problems. A generative model trained on valid artifacts reproduces a distribution, whereas discovery must produce artifacts that lie outside the observed corpus, satisfy hard structural constraints, and improve on established designs under evaluation that the model cannot influence. We introduce a diffusion-based discovery framework. Unlike conventional generative models that sample from learned distributions, it learns transition operators that transform existing artifacts into new candidates. Controlled partial re-noising followed by denoising defines a diffusion mutation kernel, a learned transition distribution that preserves the structural regularities of feasible designs while moving between regions of the design space. The learned model supplies feasibility structure only, and all correctness and performance judgments remain with external engineering tools. Intermediate diffusion trajectories are additionally monitored under a conformal risk budget so that unpromising candidates are discarded before expensive evaluation. We evaluate the framework on three electronic design spaces, an environment that supplies rigorous non-differentiable evaluators in the form of simulation, formal equivalence checking, and industrial physical implementation. The framework discovers 32-bit prefix adders that are formally verified equivalent to addition over all 2^64 input pairs and reduce delay by 17% and area by 18% relative to Kogge-Stone under a placed-and-timed flow; seven independently re-simulated amplifier topologies absent from the training corpus, spanning gains of 21.9-66.1 dB and bandwidths of 72.9 kHz-207 MHz; and macro placements on held-out netlists reaching 0.68x wirelength of an industrial placer.

Oscillator synchronization is a widely used sound-synthesis technique, but straightforward digital implementations suffer from aliasing artifacts. This paper presents an alias-free method for digital emulation of oscillator synchronization of arbitrary periodic waveforms based on additive synthesis. Starting from a finite set of Fourier-series coefficients representing a bandlimited free-running waveform, we derive linear spectral-resampling transforms that map these coefficients to those of the bandlimited synchronized waveform. Beyond conventional hard synchronization, the proposed approach also supports two additional soft-synchronization modes. To address the high computational complexity of the proposed method, we introduce HASY, a 6 mm^2 application-specific integrated circuit (ASIC) fabricated in 65 nm CMOS technology. HASY generates one 96 kHz, 24 bit alias-free synchronized waveform with up to 512 harmonics and computes the spectral-resampling transform within only five audio-sample periods.

This paper studies competitive one-step-ahead control of Friedkin-Johnsen networks with overlapping player influence. The one-step interaction is an exact potential game with a unique Nash equilibrium obtained from a symmetric positive-definite system. Sequential best-response sweeps converge for every frozen network state, parallel sweeps obey an exact Jacobi condition (and always converge with two players), and one-sweep implementations require an augmented state-action stability test. For marginal networks, a signed left-right damping condition is sufficient for exact-equilibrium stability and becomes a sharp first-order instability test when its sign is reversed. A resolvent identity clarifies the feedback geometry, while a control-aware centrality identifies the goal conflicts that matter most. We characterize attainable equilibria under unconstrained, convex, and sparse goal restrictions and give a closed form for the same-state welfare loss caused by competition. Numerical examples verify the stability thresholds, geometry, and welfare predictions.

Cell-free massive multiple-input multiple-output (CF-mMIMO) promises uniform service across the coverage area, and this service relies on accurate channel estimation for every user equipment (UE). These estimates are obtained from orthogonal pilot sequences, whose number is bounded by the channel coherence block. As a result, the sequences are reused as the UE density increases and the resulting pilot contamination limits the scalability. This paper proposes a joint user association (UA) and pilot assignment (PA) framework built on the adaptive phase-shifted (APS) pilot design, in which all UEs share a single full-band pilot and a per-UE phase shift applied in the frequency domain places their channel impulse responses (CIRs) in contiguous, non-overlapping intervals of the time domain at the access point (AP). The number of UEs that an AP can separate is thus set by the number of subcarriers rather than by the number of orthogonal sequences, and the UA is formulated as a $\mathbf{0/1}$ knapsack problem whose item weights are the numbers of taps and whose capacity is the number of subcarriers. Analysis and simulations show that the proposed design more than doubles the number of UEs scheduled by the conventional interleaved (CI) benchmark. It attains the same mean-squared error (MSE) as the CI benchmark under an equal total pilot power, and a lower MSE under an equal per-subcarrier power. It further improves the 5th-percentile connectivity and Jain's fairness index by penalizing the number of existing connections of a UE in the value assigned to each candidate link.

This study evaluates the effectiveness of remote human-robot interaction using virtual reality for leaf inspection and soil moisture assessment in a greenhouse environment. The robotic system comprised an unmanned ground vehicle and a robotic manipulator equipped with cameras, governed by kinematic models for navigation and manipulator control. Fourteen distinct plants were inspected across two experiments utilizing VR teleoperation, guided by a set of pre-specified research questions and hypotheses. In the leaf inspection experiments, cycle completion times varied from 3.3 to 8.0 s, and plant-based disease detection was achieved up to 88% accuracy; diseased-spot detection improved numerically in the second experiment, though this change was not statistically significant (p=0.378). For soil moisture assessment, the experiments achieved successful determination of watering needs in up to 64.3% of plants (9 of 14), with consistent success observed for plants 1, 2, 3, 8, 9, 10, and 13; however, this improvement was likewise not statistically significant (p=0.50). A post hoc analysis instead revealed that soil moisture assessment reliability was strongly and significantly predicted by plant canopy morphology (p<0.01): plants with broad, single-leaf canopies reached 100% success by the second experiment, versus only 16.7% for dense, compound canopies. A secondary analysis showed operators became measurably faster at attempting dense-canopy plants without a corresponding gain in success, indicating that camera occlusion, not operator skill or effort, is the dominant limiting factor. These findings show occlusion imposes a sensing limitation rather than a control or training deficiency, and that adapting camera viewpoint and sensing strategy to canopy density is needed to improve the system's accuracy and robustness.

In electric guitars, the vibrations of the strings are typically sensed by coils of wire combined with a magnet, called pickups. The pickups and their position along the strings contribute strongly to the instrument's sound. Most guitars feature one to three pickups, each spanning across all strings with fixed positions and generating a single mono output. The work of this Master's Thesis at ETH Zürich introduces a new pickup system called PolyMap, which senses each string individually and at multiple locations. The system is demonstrated with a custom-made eight-string guitar that contains eight pickups per string for a total of 64 pickups. The signals from these 64 pickups are individually digitized inside the guitar and transmitted over a multichannel audio digital interface (MADI), a low-latency digital audio interface, to a computer for further processing. PolyMap enables high-resolution sensing of an electric guitar's strings and enables extensive post-processing capabilities for musicians, audio engineers, and researchers. To the best of our knowledge, this is the first polyphonic guitar pickup system with such a complete feature set.

Deep learning's diagnostic utility in pathology is constrained by model vulnerability to real-world data imperfections. While current strategies favor "perfect data" by filtering low-quality regions, which can lead to the loss of valuable diagnostic context, we propose a paradigm shift: engineering models to thrive in imperfect environments using "Destroy Me", a hybrid framework for realistic artifact synthesis and robust data augmentation. Our approach combines Stable Diffusion, fine-tuned to preserve morphological continuity by realistically integrating artifacts with the underlying tissue architecture, with physics-based procedural modeling to synthesize six common artifact types: tissue folds, precipitates, blur, stitching errors, dust, and pen markers. Artifact fidelity is assessed using Kernel Inception Distance (KID) and color Wasserstein distance metrics. Validating this strategy on lung adenocarcinoma pattern classification with an nnU-Net, we confirm that models trained on "destroyed" patches consistently outperform baselines on independent real-world datasets. Specifically, we observed a 10.5% relative improvement in macro F1-score and a 15% relative increase in the Cohen's Kappa ($\kappa$) coefficient. Crucially, our results demonstrate that selective, impact-weighted augmentation is vital for balancing practical robustness with the preservation of subtle diagnostic features.

Power grid state estimation relies on sensor measurements that are increasingly vulnerable to adversarial corruption in cyberphysical environments, potentially leading to significant deviations in system observations. This motivates the need to identify critical measurement nodes whose compromise results in the most severe system-level impact. However, existing node criticality methods primarily rely on structural or steady-state analyses and do not explicitly account for adversarial effects on system behavior. To address this gap, this paper proposes an adversarially informed framework for identifying critical measurement nodes in linearized power systems. Within this framework, a structured attack generation mechanism is developed to construct stealthy and effective false data injection attacks (FDIAs) against an H-infinity resilient state estimator. Node criticality is then evaluated using coalition-based marginal contributions of compromised sensor subsets, estimated via permutation sampling over a prescribed set of admissible nodes, with the resulting importance scores mapped to the corresponding physical buses. Simulation results on the IEEE 14-bus system show that adversarially identified nodes induce larger deviations in frequency, voltage angle, and net power compared to randomly selected nodes, demonstrating the effectiveness of the proposed framework.

Camera-derived remote photoplethysmography (rPPG) is commonly validated through endpoint accuracy, but endpoint performance does not establish whether other physiological properties of source contact photoplethysmography (PPG) remain preserved recording by recording. We evaluated property-specific PPG-to-rPPG recoverability on 655 recordings from the Multi-Domain Mobile Video Physiology Dataset using CHROM as a fixed camera-rPPG observation pathway. The pathway reproduced the published CHROM correlation regime, with heart-rate MAE of 15.26 bpm and Pearson correlation of 0.0801. Matched-versus-shuffled validation revealed modest recording-specific autocorrelation correspondence, while spectral and recurrence-rate measures showed little matched discrimination. Maximal Lyapunov exponents showed essentially no recording-specific PPG-to-rPPG correspondence, with correlation of 0.0231 and permutation p-value of 0.5584, despite population-level overlap. Endpoint discrepancy exhibited Fitzpatrick-associated heterogeneity after adjustment for lighting and motion, including a Fitzpatrick VI versus III contrast of 9.32 bpm, while dynamical discrepancy showed no corresponding gradient. Aggregate RGB signal-to-noise ratio did not materially account for the endpoint contrast. In subject-held-out analysis, adding motion and lighting consistently reduced MAE across linear, ridge, and random-forest learners relative to rPPG-HR-only calibration, with reductions up to 13.32 percent. These findings show that recoverability is property-specific: physiological properties differ in recording-specific preservation and dependence on observation conditions, and population-level plausibility does not establish preservation of individual recordings.

Range-Doppler (rD) maps produced by chirp- sequence (CS) radar systems are fundamentally limited in reso- lution by bandwidth, carrier frequency, and coherent processing interval constraints. Improving resolution through hardware is often impractical due to regulatory, cost, and real-time operation requirements. In this work, we investigate deep learning-based super- resolution of rD maps in both range and Doppler using a real- world dataset collected with an Infineon millimeter-wave CS radar. We propose a memory-efficient transformer architecture based on dual-path shifted window (DPSWIN) attention, which combines axial/dual-path attention with 1D shifted window (SWIN) attention for scalable processing of high-dimensional radar data. Our model is benchmarked against existing 2D SWIN attention-based super-resolution models, which we adapt to the rD-map super-resolution task. We prioritize reconstruction fidelity over perceptual quality and employ root mean squared error (RMSE)-based training objectives. We avoid adversarial or perceptual losses that may introduce visually plausible but physically incorrect structures. In addition, we incorporate CFAR-based target-detection losses to optimize downstream target detectability in the super-resolved rD maps. We further study the impact of signal processing and training design choices on the super-resolution, including magnitude compression, spatial upsampling strategies, and loss formulations. Experimental results demonstrate that the proposed framework achieves computationally efficient rD map super-resolution on previously unseen real-world environments.

Data-driven signal decomposition methods decompose a signal into its underlying components in a flexible and adaptive way, taking into account the signal characteristics. Here we focus on univariate signals, whose decomposition is ill-posed. Classical univariate approaches – like variational mode decomposition – constrain the solution space (e.g. through narrowband priors), and often require the number of components to be known in advance. These assumption, however, limit the algorithm's usage in certain real-life applications. Instead, we exploit the flexibility of neural networks to replace fixed (narrowband) priors with data-driven priors. Our model, called Iterative Deep-Learning-Based Signal Decomposition (IDSD), iteratively extracts an adaptive number of various types of components from a signal, with no restrictions on the bandwidth of a component. We show superior performance of IDSD both in a controlled setup with synthetic data, and on two real datasets concerning tidal waves and physiological measurements.

Three-phase alternating current is so deeply embedded in modern electric-power infrastructure that its phase order is often treated as self-evident. Historically, however, 1-phase and true 2-phase systems were commercially important, while commercial 6-phase transmission was later demonstrated. This paper reassesses why 3 phases became the dominant architecture for bulk AC transmission. A general balanced \(m\)-phase formulation is used to show that constant aggregate instantaneous power is not unique to 3 phases: an ideal balanced 2-phase system also cancels the double-frequency power term and can generate a constant-magnitude rotating field. Consequently, the historical displacement of 2 phases cannot be explained by power smoothness alone. The comparison is instead organized around conductor architecture, insulation stress, machine and transformer utilization, conversion requirements, right-of-way utilization, and technological path dependence. A historical, commercial 6-phase demonstration showed that high-phase-order transmission was technically feasible and could improve corridor utilization. The paper then asks: if PE conversion and protection make phase count less costly, could \(m>3\) offer intrinsic advantages? Six such advantages are identified: modular decomposition into interleaved 3-phase groups, redundant control degrees of freedom, structured modal/fault analysis, increased corridor power density under field constraints, potentially higher natural loading and loadability, and enhanced harmonic/field cancellation. A companion derivation shows that phase count alone does not intrinsically reduce \(I^2R\) loss at fixed total conductor material and phase voltage. As a conditional conclusion, 3 phases are an unusually favorable historical optimum for electromechanical grids, but not a mathematically universal optimum for a future converter-dominated grid.

Most single-stage 3D object detectors complete different tasks with the same extracted features. Nevertheless, it is impossible to project features into a common space that is adaptive for all the tasks. We present a novel task-aware deformable prediction (TADP) method for single-stage 3D object detection to solve this problem. Firstly, a triple feature refinement aggregation module is designed to extract three-level features adaptively. Additionally, we design the multi-scale feature aggregation block to fuse multi-scale features in a scale-aware manner. Finally, the prediction of each task is deformed with the designed plug-and-play task-aware deformation head. It can percept the emphasis and interaction of each task. We also designed three different deformation modules. The experimental results demonstrate that the proposed deformation head shows good results on other detection methods. The experimental results on the KITTI dataset demonstrate that the car mAP is 80.91%, surpassing many state-of-the-art methods on the KITTI benchmark.

World Action Models (WAMs) augment robot policies by predicting how task-relevant scene states may evolve under interaction. Recent WAMs increasingly perform such prediction in latent representation spaces, avoiding full appearance-level generation while preserving control-relevant information. Yet latent transitions are commonly realized with Transformer-based predictors whose inductive structure is centered on token interaction rather than temporal evolution. We study transition realization as an architectural choice distinct from predictive representation and prediction-policy coupling. We introduce the Latent Evolution Operator Network (LEON), which models latent evolution in a learned observable space through context-modulated operator-based propagation and additive forcing. Grounded in the controlled Koopman generator view of evolution, LEON organizes context-dependent transition variation around a shared evolution-operator structure while retaining a complementary path for additive change. Controlled dynamical systems verify the resulting evolution-specific inductive bias and the complementary roles of operator propagation and forcing. Across two WAM formulations that integrate latent prediction into the policy differently, LEON improves closed-loop performance and robustness while remaining effective under full transition replacement. These results establish transition realization as a consequential architectural choice in latent WAMs.

Expansion planning models usually fix storage duration before optimization, setting how much storage power to build but not for how long it can discharge. We present a generation-transmission-storage expansion framework in which candidates of many durations compete on annualized cost, making the duration mix an optimization outcome. It is a rolling-horizon, two-stage stochastic linear program, each five-year stage is a full year at hourly resolution under ten coherent inflow, wind, and solar scenarios. We apply it to the Brazilian Interconnected System over 2030-2050, where demand roughly doubles to 1,716 TWh/year and variable renewable energy (VRE) supplies most new capacity. Two cases are compared: 36 pumped-storage hydropower (PSH) candidates over four subsystems and nine durations (4-144 h) alongside 4-h battery energy storage systems (BESS), and BESS alone. With PSH available, the model builds 31.2 GW / 755 GWh of PSH and no BESS, dominated by 12-h capacity with 4.9 GW of 72-h units. Without PSH it builds 38 GW / 152 GWh of BESS and 7.8 GW more gas-fired capacity, mostly open-cycle peakers. PSH lowers 2050 annualized system cost by US$ 5.0 billion/year (6.8%), operating cost by 23.5%, thermal generation by 34 TWh/year, and long-run marginal cost by 20%; 2035 VRE curtailment falls from 8.4% to 3.2%. The magnitudes are specific to Brazil, but the underlying mechanism is general: limiting storage candidates to a single duration understates the system's optimal energy-storage requirement and overstates its residual need for thermal capacity.

To achieve sustainable intelligent mobility, 6G-empowered robotic vehicles (RVs) require high-fidelity visual perception under stringent bandwidth and energy constraints. Semantic communication offers a spectral-efficient solution but suffers from severe interference in uplink non-orthogonal multiple access (NOMA) RV networks. To address this, we propose a knowledge distillation-driven and generative models-enhanced NOMA framework for robust and green RV communications, named KDG-SemNOMA. First, we develop a ConvNeXt-based deep joint source-channel coding (DeepJSCC) architecture with an enhanced attention feature (AF) module for dynamic channel adaptation. Second, to mitigate interference without inference overhead, an orthogonal transmission teacher model guides the NOMA student model via a two-stage knowledge distillation strategy. Finally, to address the over-smoothing artifacts of pixel-wise optimization, we introduce a channel-conditional GAN (cGAN). By explicitly taking the Stage-I initial reconstruction and channel states as conditional inputs, this module refines coarse outputs into high-fidelity images with realistic textures. Experiments on FFHQ-256 demonstrate that KDG-SemNOMA significantly outperforms state-of-the-art methods in both pixel-level accuracy and perceptual fidelity.

Understanding spoken dialogue requires joint reasoning over lexical content and paralinguistic acoustic signals such as emotion and conversational intent. However, existing evaluations often allow shortcuts based on transcripts or single-modality solutions, obscuring whether models genuinely ground predictions in speech. We formalize this failure mode as cross-modal disagreement, where transcripts suggest plausible but incorrect surface interpretations while acoustic cues such as prosody or speaking style support different answers. We develop a scalable framework that identifies text-biased surface interpretations and converts disagreement regions into conflict QA examples. We also include consistent cases where transcript-based and speech-grounded interpretations agree, enabling evaluation beyond adversarial audio dependence. This results in ContraTalk, a controlled benchmark containing 501 questions across five discourse dimensions: interaction behavior, emotion state, dialogue act, social stance, and conversational intent. We further develop an agentic-style reasoning framework that converts speech into an Audio Twin, a text-readable representation of localized acoustic cues that exposes acoustic evidence to the reasoning model. Experiments show that strong text-only LLMs exceed 90% accuracy in consistent cases but drop to 33-48% in conflict cases. Direct AudioLLMs provide only partial grounding, still selecting the transcript-biased trap in roughly 30-40% of conflict cases. Our Audio Twin framework improves conflict-case accuracy while reducing trap selection, but its consistent-case behavior remains backbone-dependent. These results identify transcript-based shortcuts as an important failure mode in spoken dialogue understanding and show that explicit acoustic evidence aggregation provides a more controllable interface for diagnosing and improving speech-grounded reasoning.

This paper develops a price-based distributed scheduling in an energy community whose members own behind-the-meter renewable generation with deferrable EV charging and price-elastic thermostatic loads. A coordinator transacts with the distribution utility under a Net Energy Metering tariff and broadcasts a community price to which each household responds in its own interest, giving a bilevel stochastic dynamic program that is intractable in general. Our main result characterizes that the joint optimal centralized policy is a two-threshold policy on the community's aggregate renewable generation. Building on this structure, we adopt the Threshold Pricing Rule, which is uniform, individually rational, revenue adequate, and asymptotically optimal in terms of community welfare under a light-traffic condition. Simulations using synthetic and real world data confirm asymptotic optimality and individual surplus gains.

Industrial Internet of Things (IIoT) networks widely adopt Ethernet technologies, such as 100BASE-TX, for industrial communications. As industrial networks continue to scale, reliable device authentication becomes increasingly important for preventing device impersonation and unauthorized access. Physical-layer fingerprinting (PLF) exploits device-dependent fingerprint features in transmitted signals and provides a hardware-based approach for terminal authentication. However, the distinguishable space supported by 100BASE-TX physical-layer fingerprints and its capacity boundary remain largely unexplored. To analyze the capacity of physical-layer fingerprints, this paper proposes a nonlinear and impulse-response model (NAIM) that characterizes device-dependent waveform differences in 100BASE-TX transmitted waveforms. The nonlinear component captures steady-state level deviations, while the impulse-response component describes the transition response during level transitions. The 100BASE-TX transmitter waveform requirements, the observation resolution determined by noise and analog-to-digital conversion (ADC) quantization, and the target bit-error ratio (BER) constrain the admissible fingerprint space. Under the NAIM model, the fingerprint-space capacity of 100BASE-TX terminals is derived as approximately $2.96\times10^{10}$ distinguishable states. Experiments on signals collected from 48 NICs under two cable conditions estimate a Gaussian-equivalent empirical capacity from the measured inter-device and within-device variations. Under the 5-m cable condition, empirical capacity and closed-set identification consistently rank the three NIC models, and a larger empirical capacity yields higher identification accuracy. These results demonstrate that the proposed capacity analysis provides a pre-deployment assessment for physical-layer fingerprinting in IIoT.

The recently envisioned goal-oriented communications paradigm requires machine learning inference to be performed directly on wirelessly transferred data. This paper presents an eXtremely Large (XL) Multiple-Input Multiple-Output (MIMO) system that operates as an Extreme Learning Machine (ELM) to execute Over-The-Air (OTA) binary classification. To reduce hardware complexity, the receiver is equipped with cascaded metasurfaces terminating in a single radio-frequency chain. A front metasurface layer applies a fixed nonlinear response to the incoming signal, acting as the ELM's activation function. Subsequent tunable linear metasurface layers physically approximate the trained network weights directly in the wave domain. Numerical evaluations across diverse datasets showcase that our XL MIMO architecture achieves classification accuracy comparable to idealized digital models, thereby proving the viability of low-complexity, wave-domain OTA learning.

Detecting the fetal abdominal circumference standard plane in low-cost obstetric blind sweeps is a highly imbalanced frame-classification problem: positive frames account for under 3% of a sequence, form short contiguous segments, and are poorly handled by off-the-shelf ultrasound and vision foundation models. We propose AnatoProto, a lightweight sequence-level framework that adapts a frozen BiomedCLIP encoder to fetal blind sweeps through four components: (i) anatomy-weighted spatial pooling that uses nnU-Net abdominal-region probabilities as a spatial prior to reweight BiomedCLIP patch tokens, so frozen semantic features are aggregated onto anatomically meaningful regions; (ii) a within-case prototype loss that pulls each frame embedding toward the mean of positive frames of the same sweep, exploiting case-level structure unavailable at the frame level; (iii) a three-stage cascade refinement (frame->segment->case-level rejecter) that lifts the prediction unit from noisy frames to structurally-constrained segments; and (iv) a hybrid prediction head that jointly models per-frame stability and inter-frame boundary transitions to suppress boundary false positives. On the ACOUSLIC-AI benchmark, AnatoProto reaches a test F1 of 67.72, outperforming the strongest foundation-model baseline (FetalCLIP + PRS, F1 = 54.52) by +13.20 F1 and the strongest video temporal-action-detection baseline (TriDet + PRS) by +15.76 F1. A synergy study, backed by embedding geometry and paired-bootstrap confidence intervals, shows that the prototype loss and anatomy-weighted pooling are not additive: applied alone the prototype loss reduces recall by 12 points, but combined with anatomy-weighted pooling it increases recall by 6.5 points – a sign-flip we trace to the accuracy of the within-case prototype.