arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 73 records · Page 4Linked to original sources

arXiv2026

Automated Shape-Model-Based Astrometry of Phobos from Mars Express SRC Images

High-resolution spacecraft images provide important astrometric constraints for orbit refinement, but measurements of resolved bodies are often limited by labor-intensive control-point selection and the difficulty of achieving consistent reductions over large image archives. We present an automated shape-model-based astrometric pipeline for Phobos and apply it to Mars Express Super Resolution Channel (SRC) images. For each exposure, a synthetic image is rendered from a high-resolution 3D shape model under the nominal spacecraft-target-Sun geometry. Feature correspondences between the observed and synthetic images are established using SuperPoint and SuperGlue, followed by RANSAC filtering. The matched synthetic-image keypoints are then associated with surface points through ray-shape intersection. The geometric adjustment fixes the adopted body orientation, spacecraft state, and corrected camera pointing and estimates only two effective plane-of-sky position offsets using the exact perspective-projection model. These offsets are used to derive the center-of-figure position of Phobos. We first test the method on an image set previously analysed with a control-point approach and obtain comparable astrometric performance. We then extend the analysis to a larger SRC dataset spanning 2007-2025 and obtain 1113 successful measurements. Relative to the JPL MAR099 ephemeris, the resulting observed-minus-computed residuals have mean values of 0.186 km in $α\times cos(δ)$ and 0.053 km in $δ$, with corresponding standard deviations of 0.609 km and 0.583 km. These results demonstrate that the proposed pipeline provides a practical approach to large-scale, homogeneous astrometric reduction of archival spacecraft images of Phobos, with potential application to other resolved bodies.

astro-ph.IM↗

arXiv2026

Efficient, Adaptive Near-Field Beam Training based on Linear Bandit

This paper proposes a posterior sampling-based beam training framework for near-field communication under multi-path channels. By leveraging Thompson Sampling (TS), the framework adaptively balances exploration and exploitation to maximize the final beamforming gain under a finite pilot overhead. To ensure data-efficient learning, we incorporate a structured Gaussian prior in the DFT domain and use an RBF covariance as a tractable local-correlation prior, motivated by near-field energy leakage, to promote information sharing among neighboring DFT components. We develop three TS strategies: codebook-constrained search for rapid stabilization via structural regularization, continuous-space search for high accuracy refinement, and a two-stage hybrid refinement scheme that balances training efficiency and estimation accuracy. Simulation results show that the proposed framework reduces pilot overhead by over 90\% while achieving more than a 2 dB SNR gain over baselines in multipath environments. Furthermore, simulations show that the continuous-space search approaches the full-CSI benchmark as the available pilot numbers become sufficiently large.

eess.SP↗

arXiv2026

Adaptive Payload-Aided Near-Field Beam Tracking via Thompson Sampling

Extremely large antenna arrays at high frequencies substantially extend the radiative near-field region in 6G networks, making mobile beam alignment depend jointly on user angle and range. The added range dimension enlarges the beam-search space, making repeated pilot-based sweeping costly under mobility, while sensing-assisted tracking depends on propagation conditions, echo quality, and target reflectivity. We propose an adaptive payload-aided near-field beam-tracking framework based on maximum likelihood estimation (MLE) and Thompson sampling (TS). Selected received payload samples are fed back and reused as tracking observations, avoiding dedicated beam-sweeping symbols during tracking. Within each sliding window, local angle and range trajectories are modeled by low-order polynomials to capture velocity, acceleration, and higher-order motion variations, and are estimated by MLE using the spherical-wave channel model. A local Gaussian approximation centered at the MLE, with covariance from the inverse observed Fisher information, represents trajectory uncertainty. For payload transmissions selected for feedback, TS samples a trajectory hypothesis and maps it to a payload beam toward the sampled state, while the remaining transmissions use the MLE-predicted beam. To handle nonstationary mobility, an asymptotic chi-square characterization of in-window estimation risk motivates joint adaptation of observation-window length and polynomial degree, while online residual statistics adjust the update interval and feedback ratio. The framework is also extended to uniform planar arrays with elevation tracking. Simulations under smooth and sharp-turn trajectories show high payload-accounted mean normalized beamforming gain, low normalized-gain variance, and high effective-symbol reliability, while the adaptive mechanism provides substantial robustness under nonstationary sharp-turn mobility.

eess.SP↗

arXiv2026

The number of limit cycles of piecewise linear Liénard systems

For the planar Liénard differential system $\dot{x}=F(x)-y$, $\dot{y}=x$, where $F(x)$ is a piecewise linear function, Tonnelier (SIAM J. Appl. Math., 2002) conjectured that the maximum number of limit cycles of the system is $n$ when $F(x)$ has $n$ fold points and no jump points, and $2n$ when $F(x)$ has $n$ jump points and no fold points. This conjecture was confirmed by Llibre et al. (J. Nonlinear Sci., 2015) (resp. Chen et al. (J. London Math. Soc., 2026a)) when $F(x)$ has one fold point and no jump points (resp. two fold points). More recently, Chen et al. (J. London Math. Soc., 2026b) proved that the conjecture is correct when $F(x)$ has no fold points and one jump point. All other cases remain open. Here we verify that the lower bound for the maximum number of limit cycles of the system can be $n$ when $F(x)$ has only $n$ fold points, and $2n$ when $F(x)$ has only $n$ jump points, thereby confirming the lower bound part of Tonnelier's conjecture. Moreover, when $F(x)$ has $m$ jump points and $n-m$ fold points, $0\le m\le n$, we also show that the system can have $n+m=(n-m)+2m$ limit cycles. In addition, a complete classification of the {dynamics} near infinity for this class of systems is provided.

math.DS↗

arXiv2026

Reduced-Order Physics-Informed Neural Network with Adaptive Basis Refinement for Structural Identification

Physics-informed neural networks (PINNs) provide a flexible framework for solving forward and inverse problems. However, their direct application to structural dynamics remains limited by high system dimensionality and model-form errors arising from incomplete physics. Reduced-order models (ROMs) can alleviate the dimensionality bottleneck, yet existing PINN-ROM couplings typically rely on fixed reduced subspaces, target forward simulations, or assume complete physics, restricting their use for inverse identification under parametric variability or incomplete system knowledge. To address these limitations, this work proposes a Reduced-Order Physics-Informed Neural Network (RO-PINN) framework with adaptive basis refinement for structural identification under known and incomplete physics. Via projection, reduced governing equations are embedded directly into the PINN loss, facilitating learning in a low-dimensional latent space. An adaptive scheme updates the projection basis during training so that the latent space is progressively realigned with evolving structural parameters or learned residual restoring forces. This realignment reduces basis-mismatch errors and limits their influence on the inferred residual force. The method is validated on a four-story steel frame with nonlinear hysteretic braces under sparse and noisy measurements. Results show parameter identification comparable to or more accurate than Bayesian model updating with lower computational cost in the considered cases, recovery of unmodeled nonlinear restoring forces under incomplete physics, and joint identification of residual restoring forces and structural parameters within the same framework. Overall, RO-PINN provides a unified framework for structural identification by integrating reduced-order modeling, adaptive basis refinement, and physics-informed learning within a single formulation.

cs.CE↗

arXiv2026

Hybrid Topological Defects in Ferroelectric Nematic Fluids

We investigate the evolution of topological defects in polar fluids driven by discrete inversion symmetry-breaking acrossthe nematic-to-ferroelectric nematic phase transition. Using photopatterned surface alignment to prescribe well-defined initial defect configurations in the nematic phase, we track their metamorphosis upon entering the ferroelectric phase. Through systematic comparisons between experiments and numerical simulations, we demonstrate that the resulting polar structures are generically hybrid, intertwining topological configurations of different dimensionalities. Specifically, we identify three basic hybrid defects evolving from precursor disclinations of net charge 0 and +1 (via pairs), and +1 (via single defects): domain walls terminated by surface disclinations, monopole-decorated domain walls, and meron-mediated boojum and monopole complexes. We further demonstrate that these stable hybrid polar defects are ubiquitous in the ferroelectric nematic phase, providing the basic motifs needed to understand, predict, and engineer complex topological textures in polar fluids.

cond-mat.soft↗

arXiv2026

Tensor Decomposition-Based Wireless Sensing for MIMO-OFDM ISAC via Flexible Spatial-Temporal-Spectral Optimization

Integrated sensing and communication (ISAC) is regarded as a key enabling technique in future 6th-generation (6G) mobile communication systems. However, existing multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) ISAC designs generally rely on the fixed-position antennas and fixed allocation of time-frequency resources, thereby limiting the degrees of freedom of wireless sensing along the spatial-temporal-spectral dimensions. In this paper, we propose a novel wireless sensing framework for MIMO-OFDM ISAC systems with flexible spatial-temporal-spectral optimization and propose a tensor decomposition-based approach to estimate target parameters, including azimuth/elevation angles, ranges, and velocities. Specifically, we first establish a monostatic wireless sensing model for MIMO-OFDM ISAC systems, where the positions of antenna elements, the allocation of OFDM symbols and subcarriers can be flexibly configured. Then, we formulate the problem of estimating target parameters as a tensor decomposition problem admitting to the canonical polyadic format, which enables the parallel target parameters estimation process from corresponding factor matrices along the spatial, temporal, and spectral dimensions, respectively. Based on the decomposed factor matrices, we derive the Cramer-Rao Bound (CRB) for the unknown target parameters and reveal that the estimation accuracy of azimuth/elevation angles, velocities and ranges is fundamentally determined by the array geometry, the distribution of OFDM symbols and subcarriers. Building on this insight, we obtain an optimized solution for the positions of antenna elements, and optimal solutions for the subcarrier allocation and OFDM symbol allocation to minimize the CRB, as well as the mean square error of target parameters estimation.

eess.SP↗

arXiv2026

GigaBrain-0.7: Scaling Embodied Foundation Models to Emergent Capabilities with a Three-System Architecture

Vision-language-action (VLA) models have become a dominant paradigm for generalist embodied agents, demonstrating strong complex and long-horizon task completion in structured settings. Yet it remains an open question whether current VLA systems can benefit from more effective architectural design, scale to substantially larger and more heterogeneous data regimes, and achieve broader generalization across tasks and embodiments. To this end, we present GigaBrain-0.7, an embodied foundation model with substantially improved generalization across diverse robot embodiments. Specifically, GigaBrain-0.7 unifies understanding, prediction, and action through a three-system architecture, scales pretraining to over 37,000 hours of heterogeneous embodied data, and introduces one-stage alignment training that jointly optimizes vision-language understanding and multi-embodiment action generation. Compared with the preceding GigaBrain-0 series and prior state-of-the-art models including $π_{0.5}$, GigaBrain-0.7 achieves substantial improvements in foundation zero-shot capabilities, language-conditioned instruction following, and post-training task success rates. In particular, on our in-house Maker H01 platform and mainstream robot embodiments, GigaBrain-0.7 demonstrates strong task adaptability and completion ability across both home and industrial scenarios. All training code and pretrained model weights will be released.

cs.RO↗

arXiv2026

LAPF: LLM-Agent-Based Path Finder Using the UAVScenes Dataset

Uncrewed aerial vehicles (UAVs) are increasingly deployed for autonomous navigation in complex outdoor environments, where dynamic conditions and mission requirements require intelligent adaptive decision-making. Existing optimization-based, Machine Learning (ML), and Reinforcement Learning (RL) approaches often rely on predefined models or task-specific training, limiting their generalization and adaptability in uncertain scenarios. Recent Large Language Model (LLM)-assisted approaches offer promising reasoning capabilities but remain constrained by limited agentic functionality, including insufficient memory, planning, and tool interaction mechanisms.This paper proposes an LLM-Agent-Based Path Finder (LAPF) framework for autonomous UAV navigation in town-scale outdoor environments. LAPF extends LLM-assisted navigation by integrating perception, memory, planning, and action modules into a closed-loop cognitive architecture. The proposed agent leverages prior navigation experiences, performs Chain-of-Thought (CoT) reasoning, couples each detected hazard to a bounded corrective action, and dynamically refines waypoint decisions based on environmental feedback.The three independent trials per method demonstrate that LAPF achieves mean path lengths of 512.83 m and 506.37 m, compared to the straight-line optimum of 497.33 m, corresponding to path length reductions of 17.2% and 15.6% relative to CoT prompting and absolute path efficiencies of 97.1% and 98.1% in open-field and obstacle-injected scenarios, respectively. Furthermore, LAPF is the only evaluated approach that couples every detected hazard to a bounded, metric-neutral corrective action while maintaining near-goal stability, with zero clamp events in both scenarios, whereas CoT prompting increases from 9.7 to 14.0 events.

cs.RO↗

arXiv2026

Tri-Domain Multiuser MIMO Precoding Optimization and Channel Estimation with Spatial-EM Reconfigurable Antenna

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.

eess.SP↗

arXiv2026

Trigger the Straggler: Load Hijack on Mixture-of-Experts LLMs

Expert parallelism (EP) is a common strategy for serving large Mixture-of-Experts (MoE) models across multiple GPUs by distributing experts among devices. Router decisions then determine both which experts process each token and which GPUs execute the resulting work. This procedure exposes a supply-chain attack surface in the serving schedule. We introduce Load Hijack, in which a malicious model provider modifies only a checkpoint's router weights, distributes the poisoned checkpoint, and retains a private trigger. When the trigger appears, the poisoned router concentrates token-to-expert assignments on experts co-located on one GPU. The resulting load makes that GPU a straggler and forces peer devices to wait, while routing on ordinary inputs remains near the clean reference. We find this conditional behavior difficult to achieve because an objective that rewards target-expert use on triggered inputs can also bias ordinary-input routing toward the same experts. To resolve this conflict, Load Hijack employs a three-stage optimization procedure that produces strong trigger-dependent concentration while keeping ordinary-input routing close to the clean reference. Across three MoE families and four corpora, Load Hijack directs 92.3% to 95.6% of triggered token assignments to the target experts. In live EP serving, triggered traffic produces 1.43x the time-to-first-token and 0.86x the throughput measured under ordinary traffic. These results show that poisoned routers can act as trigger-controlled device schedulers and motivate checkpoint audits of routing and runtime load.

cs.CR↗

arXiv2026

Rotatable Antenna-Enhanced Wireless Sensing with Uniform Sparse Array via Tensor Decomposition

In this letter, we propose a new wireless sensing system equipped with a rotatable antenna (RA) array to enhance the sensing performance of a uniform sparse array (USA). To tackle the severe spatial undersampling issues, we propose a novel tensor decomposition-based direction-of-arrival (DOA) estimation algorithm. Specifically, we introduce a synchronous multiple rotation pattern for active target probing such that the received signals across multiple rotations to capture the diverse spatial degree of freedoms. Subsequently, we mathematically formulate the received signals across successive rotations as a third-order tensor, and leverage the canonical polyadic decomposition to obtain the factor matrices incorporating the DOA of targets. By analyzing the extrema distribution laws of array steering vector correlation (SVC) and gain SVC of RAs, we propose to combine the array and gain factor matrices via the Kronecker product, which theoretically guarantees the unambiguous DOA estimation. Simulation results demonstrate that the proposed RA-enhanced tensor decomposition-based algorithm achieves high-precision and unambiguous sensing performance compared to conventional uniform dense arrays and omnidirectional antenna systems.

eess.SP↗

arXiv2026

SIMMER: Benchmarking Latent Failures in LLM Executable Planning with a World Model

Large language models (LLMs) are increasingly deployed as planners for autonomous agents in household environments. While existing benchmarks evaluate whether LLM-generated plans execute successfully, they overlook a critical type of failure: latent failures. Unlike immediate failures that trigger instant feedback at execution time and enable timely correction, latent failures do not immediately halt plan execution but silently compromise goal achievement. In severe cases, they cause irreversible harm. To address this gap, we introduce SIMMER, a benchmark for evaluating latent failures in LLM planning through a human-curated symbolic world model grounded in the kitchen domain. SIMMER defines a world model comprising 77 actions, 262 unique objects, and approximately 46,800 possible interactions that are semantically realistic, derived from real-world cooking scripts. It then leverages a state machine executor that validates plans against the world model and detects immediate precondition violations, latent hazards, and irreversible failures. Experiments across six LLMs show that even frontier models achieve at most 17% error-free plans. Moreover, up to 56% of plans contain latent failures, the majority of which lead to irreversible consequences. We further demonstrate that explicit state reasoning via counterfactual foresight simulation can reduce latent failures by up to 72% and irreversible cases by up to 75%, suggesting a promising direction for more robust LLM planners.

cs.CL↗

arXiv2026

ZoomV: Temporal Zoom-in for Efficient Long Video Understanding

Long video understanding poses a fundamental challenge for large video-language models (LVLMs) due to the overwhelming number of frames and the risk of losing essential context through naive downsampling. Inspired by the way humans watch videos on mobile phones, constantly zooming in on frames of interest, we propose ZoomV, a query-aware temporal zoom-in framework designed for efficient and accurate long video understanding. Specifically, ZoomV operates in three stages: (1) Temporal interests grounding: guided by the query, ZoomV retrieves relevant events and their associated temporal windows as candidates. (2) Event interests spotlighting: within pools of candidate windows, each window is scored through the model itself reflection and filtered accordingly, where higher-confidence windows are more representative. (3) Compact representation: the selected events are encoded and temporally downsampled to preserve critical semantics while significantly reducing redundancy. Extensive experiments demonstrate that ZoomV substantially outperforms prior video agent approaches. On temporal grounding, ZoomV unlocks the latent capability of LVLMs, achieving an 11.8% mIoU gain on Charades-STA. Remarkably, ZoomV further boosts accuracy on LVBench by 9.7%, underscoring its effectiveness on long-video benchmarks.

cs.CV↗

arXiv2026

Double Parton Scattering Effects on the Measurement of the W-Boson Mass

Double parton scattering (DPS) corresponds to events where two parton-parton scatterings occur in a single hadron-hadron collision. The DPS effects may arise from the spectator scatterings that are somewhat related to semi-hard QCD activities. In this work, we investigate the DPS effects on the W-boson mass measurements. Especially, our analysis reveals that the DPS effects contribute additional missing transverse momenta from spectator scatterings as well as relevant inclusive cross sections, potentially altering the distribution of total missing transverse momenta. Consequently, the DPS effects have the potential to cause an increase in the measured W-boson mass by the CDF detector, which helps to understand the deviation of the CDF-II measurements from other measurements and the predicted value in the Standard Model. This could be further validated in upcoming studies, such as the W-like analyses of the Z boson production, which will potentially open new avenues for probing QCD dynamics in the semi-hard regime.

hep-ph↗

arXiv2026

When Memory Becomes Authority: Benchmarking Authority Collapse at the Memory Consolidation Boundary

Persistent memory allows (self-evolving) LLM agents to adapt across tasks by consolidating heterogeneous interaction histories into reusable facts, preferences, observations, and rules. Yet consolidation also imposes an implicit authorization boundary: it determines whether stored information may later be consumed as a user fact, an attested observation, or a standing instruction. We identify authority collapse, in which consolidation preserves a claim while erasing the source constraints governing its authorized use, causing the stored memory to imply greater authority than its source permits. We introduce AuthMem-Bench, a controlled paired benchmark that holds the focal claim and downstream task fixed while varying only source authority. It evaluates write-time collapse, downstream authorization errors, and automatic authority preservation. Across seven consolidators based on widely used agent-memory systems and seven LLM backbones, we observe authority collapse in 48 of 49 evaluated configurations. In a controlled action-grounded evaluation, collapsed memories without authority metadata yield a mean unauthorized-action rate of 50.3%. In an end-to-end evaluation, automatically predicted and persisted authority labels reduce the observed unauthorized-action rate from 16.9% to 0.0%, while benign task success remains essentially unchanged. These findings show that memory-driven adaptation must preserve not only what was learned, but also the authority under which it may be reused.

cs.AI↗

arXiv2026

Breaking optoelectronic SNR limitations via physics-consistent computational diffractive imaging

Ptychography is a powerful lensless imaging technique capable of approaching the diffraction limit, yet its performance is increasingly constrained by non-ideal detection hardware. In photon-limited measurements, weak high-frequency diffraction signals often overlap with spatially heterogeneous detector noise, whereas most reconstruction algorithms still treat the detector as an ideal measurement plane. Here, we introduce detector-informed measurement consistency into ptychographic reconstruction. By calibrating the pixelwise sensor response, the method construct a spatially resolved confidence map and embed it into the iterative amplitude constraint, allowing unreliable detector residuals to be down-weighted while preserving physically meaningful diffraction information. Experiments across transmission, reflection, and weak biological phase imaging show improved diffraction-data quality, an approximately twofold signal-to-noise ratio (SNR) enhancement, and reconstruction approaching the Rayleigh limit with a measured (k)-factor of about 0.65. Compared with previous advanced denoising methods, the proposed framework achieves a better balance between suppressing detector-induced background and preserving structural diffraction information. These results show that detector reliability can be used as an in-loop physical constraint to extend the performance of ptychographic imaging with imperfect sensors.

cs.GR↗

arXiv2026

InkShield: Writing Style Protection Against Unauthorized Handwriting Mimicry

Recent handwritten text generators can reproduce a writer's style from publicly available references, posing risks of document forgery and identity misuse. An attacker may use a publicly available handwritten note or signature sample to generate forged recommendation letters or authorization forms, leading to document fraud, identity misuse, and misleading decisions. However, existing protections against unauthorized image editing or synthesis transfer poorly to handwriting style mimicry. Designed for natural images with complex backgrounds, they often optimize perturbations over the whole image. For sparse handwriting images, such global perturbations become conspicuous in blank background regions and largely degrade the visual quality. In this work, we propose InkShield, a proactive writing-style defense that protects reference images before release. InkShield selects a decoy writer to define a style-displacement direction, optimizes perturbations with a frozen handwriting-generation surrogate, and confines them to ink-stroke edges to avoid conspicuous background artifacts. On IAM, the average Top-1/Top-5 rates at which generated samples are retrieved as the target writer by two independent writer evaluators decrease from 11.94%/36.52% to 2.03%/8.79%. Meanwhile, the protected references remain visually close to the originals (LPIPS 0.0078), and the generated text remains readable. InkShield also exhibits transferability to other handwriting generators. Overall, InkShield provides practical protection against unauthorized handwriting style mimicry.

cs.CR↗