SearcharxivSearch

arXiv subjects

Jianhui Zhang

Publications and source records attributed to Jianhui Zhang.

15 recordsLinked to original sources

Towards Dual-Brain Minimal Sufficient Representation for Vision-Language Navigation

Vision-and-Language Navigation in continuous environments (VLN-CE) requires an agent to ground language in egocentric observations and plan in unseen scenes. Although recent multimodal large models and world-model-based methods have improved navigation, they often preserve excessive task-irrelevant detail, weakening generalization and increasing computational burden. We propose BrainNav, a navigation framework grounded in the Principle of Minimal Sufficiency. BrainNav consists of three components: a Logical Anchor Model that implements instruction-aware selective perception to suppress environmental noise, a Minimalist Constraint Alignment module that serves as a compact cross-modal bottleneck, efficiently synchronizing discrete linguistic intent with continuous latent dynamics while filtering out redundant information, and a Compression World Model that predicts action-conditioned states within a condensed, low-rank latent space. These modules align semantic intent with spatial perception, enhancing the agent's robustness and efficiency in complex tasks. Experiments show that BrainNav improves over prior SOTA by 2.0 % / 1.0 in SR/SPL on R2R-CE val-unseen and 0.94 % / 0.78 on RxR-CE val-unseen. These results indicate that minimally sufficient world representations provide an effective foundation for robust VLN.

cs.CV

World-Ego Modeling for Long-Horizon Evolution in Hybrid Embodied Tasks

World models are widely explored in embodied intelligence, yet they typically predict distinct evolutions of the world and the ego within a single stream, where the world captures persistent instruction-agnostic scene regularities and the ego captures robot-centric instruction-conditioned dynamics. This world-ego entanglement leads to a degradation in long-horizon embodied scenarios, particularly in hybrid tasks with interleaved navigation and manipulation behaviors. In this paper, we introduce \emph{World-Ego Modeling}, a new conceptual paradigm that decomposes future evolution into world and ego components. We define the world-ego boundary from three perspectives, i.e., motion-, semantic-, and intention-based views, and analyze three disentanglement strategies with post-, pre-, and full disentanglement. Further, we instantiate this paradigm as the World-Ego Model (WEM), a unified embodied world model that couples an implicit separate world-ego planner with a cascade-parallel mixture-of-experts (CP-MoE) diffusion generator. To enable rigorous evaluation, we further construct HTEWorld, the first benchmark for long-horizon world modeling with hybrid navigation-manipulation tasks, providing 125K video clips (over 4.5M frames) with fine-grained action annotations and 300 multi-turn evaluation trajectories (over 2K instructions). Extensive experiments show that WEM achieves state-of-the-art performance on HTEWorld while remaining competitive on existing manipulation-only benchmarks.

cs.CV

LongDPM: Overlap-Aware 4D Reconstruction from Long Monocular Videos

Recovering a dynamic 3D scene from a long monocular video is crucial for dense geometry, camera motion, and temporal correspondence to remain consistent in a shared coordinate system. Existing methods face two key challenges: (1) feed-forward reconstruction models provide accurate local predictions but are limited to short clips, and (2) long-range trackers preserve correspondences without producing dense sequence-level reconstruction. This paper presents LongDPM, a novel overlap-aware framework for scalable long-range monocular dynamic reconstruction. First, LongDPM processes long videos in overlapping chunks, keeping inference memory bounded by the chunk length. Second, it connects chunk-local coordinate systems through confidence-weighted registration with static-aware overlap abstraction. Third, it associates dynamic identities across chunk boundaries and fuses matched trajectories to recover coherent long-range 3D motion. Experimental results demonstrate that LongDPM achieves superior long-range reconstruction and tracking performance, reducing dense tracking EPE over V-DPM on PointOdyssey, Kubric-F, and Kubric-G, while obtaining the best TUM-dynamics ATE for camera pose estimation.

cs.CV

Hybrid renormalization for distribution amplitude of a light baryon in large momentum effective theory

Lightcone distribution amplitudes for a light baryon can be extracted through the simulation of the quasi-distribution amplitudes (quasi-DAs) on the lattice. We implement the hybrid renormalization for the quasi DAs of light baryons. Lattice simulations are performed using $N_f = 2+1$ stout-smeared clover fermions and a tree-level Symanzik-improved gauge action, with three lattice spacings of ${0.105, 0.077, 0.052}$ fm. By analyzing zero-momentum matrix elements for different lattice spacings, we extract the linear divergence associated with the Wilson-line self-energy. Matching to perturbative matrix elements in the $\overline{\text{MS}}$ scheme yields the residual self-renormalization factors. Using these factors, we renormalize the quasi-DAs within the hybrid scheme, which combines self-renormalization at large separations and the ratio scheme at short distances. The renormalized results demonstrate effective cancellation of linear divergences and yield smooth, continuum-like coordinate-space distributions suitable for subsequent Fourier transformation and perturbative matching. These results establish the viability of both self and hybrid renormalization frameworks for light baryon quasi-DAs, providing a robust foundation for LaMET-based determinations of light-cone distribution amplitudes.

hep-lat

Ultra High-Resolution Image Inpainting with Patch-Based Content Consistency Adapter

In this work, we present Patch-Adapter, an effective framework for high-resolution text-guided image inpainting. Unlike existing methods limited to lower resolutions, our approach achieves 4K+ resolution while maintaining precise content consistency and prompt alignment, two critical challenges in image inpainting that intensify with increasing resolution and texture complexity. Patch-Adapter leverages a two-stage adapter architecture to scale the diffusion model's resolution from 1K to 4K+ without requiring structural overhauls: (1) Dual Context Adapter learns coherence between masked and unmasked regions at reduced resolutions to establish global structural consistency; and (2) Reference Patch Adapter implements a patch-level attention mechanism for full-resolution inpainting, preserving local detail fidelity through adaptive feature fusion. This dual-stage architecture uniquely addresses the scalability gap in high-resolution inpainting by decoupling global semantics from localized refinement. Experiments demonstrate that Patch-Adapter not only resolves artifacts common in large-scale inpainting but also achieves state-of-the-art performance on the OpenImages and Photo-Concept-Bucket datasets, outperforming existing methods in both perceptual quality and text-prompt adherence.

cs.CV

Coding-Prior Guided Diffusion Network for Video Deblurring

While recent video deblurring methods have advanced significantly, they often overlook two valuable prior information: (1) motion vectors (MVs) and coding residuals (CRs) from video codecs, which provide efficient inter-frame alignment cues, and (2) the rich real-world knowledge embedded in pre-trained diffusion generative models. We present CPGDNet, a novel two-stage framework that effectively leverages both coding priors and generative diffusion priors for high-quality deblurring. First, our coding-prior feature propagation (CPFP) module utilizes MVs for efficient frame alignment and CRs to generate attention masks, addressing motion inaccuracies and texture variations. Second, a coding-prior controlled generation (CPC) module network integrates coding priors into a pretrained diffusion model, guiding it to enhance critical regions and synthesize realistic details. Experiments demonstrate our method achieves state-of-the-art perceptual quality with up to 30% improvement in IQA metrics. Both the code and the codingprior-augmented dataset will be open-sourced.

cs.CV

Radiance Field Learners As UAV First-Person Viewers

First-Person-View (FPV) holds immense potential for revolutionizing the trajectory of Unmanned Aerial Vehicles (UAVs), offering an exhilarating avenue for navigating complex building structures. Yet, traditional Neural Radiance Field (NeRF) methods face challenges such as sampling single points per iteration and requiring an extensive array of views for supervision. UAV videos exacerbate these issues with limited viewpoints and significant spatial scale variations, resulting in inadequate detail rendering across diverse scales. In response, we introduce FPV-NeRF, addressing these challenges through three key facets: (1) Temporal consistency. Leveraging spatio-temporal continuity ensures seamless coherence between frames; (2) Global structure. Incorporating various global features during point sampling preserves space integrity; (3) Local granularity. Employing a comprehensive framework and multi-resolution supervision for multi-scale scene feature representation tackles the intricacies of UAV video spatial scales. Additionally, due to the scarcity of publicly available FPV videos, we introduce an innovative view synthesis method using NeRF to generate FPV perspectives from UAV footage, enhancing spatial perception for drones. Our novel dataset spans diverse trajectories, from outdoor to indoor environments, in the UAV domain, differing significantly from traditional NeRF scenarios. Through extensive experiments encompassing both interior and exterior building structures, FPV-NeRF demonstrates a superior understanding of the UAV flying space, outperforming state-of-the-art methods in our curated UAV dataset. Explore our project page for further insights: https://fpv-nerf.github.io/.

cs.CV

How should the contact angle of a noncircular wetting boundary be described?

For over 200 years, wettability has made significant contributions to understanding the properties of objects, advancing technological progress. Theoretical model of the contact angle (CA) for evaluating wettability has constantly been modified to address relevant emerging issues. However, these existing models disregard the difference in the CA along the contact line and use a single-point CA to evaluate the entire contact line. From this perspective, there is no reasonable explanation for noncircular wetting. Here, we reveal that noncircular wetting boundaries result from property differences in the surfaces along the boundary, and utilize friction as a comprehensive factor reflecting local wettability. Average CA is proposed to evaluate the contact line instead of the single-point CA, making the Cassie method and Wenzel method obsolete, which will take an average property of the whole surface as a weight coefficient of the single-point CA, ignoring the subordination between physical properties and roughness in systematics.

cond-mat.soft

Electron-Ion Collider in China

Lepton scattering is an established ideal tool for studying inner structure of small particles such as nucleons as well as nuclei. As a future high energy nuclear physics project, an Electron-ion collider in China (EicC) has been proposed. It will be constructed based on an upgraded heavy-ion accelerator, High Intensity heavy-ion Accelerator Facility (HIAF) which is currently under construction, together with a new electron ring. The proposed collider will provide highly polarized electrons (with a polarization of $\sim$80%) and protons (with a polarization of $\sim$70%) with variable center of mass energies from 15 to 20 GeV and the luminosity of (2-3) $\times$ 10$^{33}$ cm$^{-2}$ s$^{-1}$. Polarized deuterons and Helium-3, as well as unpolarized ion beams from Carbon to Uranium, will be also available at the EicC. The main foci of the EicC will be precision measurements of the structure of the nucleon in the sea quark region, including 3D tomography of nucleon; the partonic structure of nuclei and the parton interaction with the nuclear environment; the exotic states, especially those with heavy flavor quark contents. In addition, issues fundamental to understanding the origin of mass could be addressed by measurements of heavy quarkonia near-threshold production at the EicC. In order to achieve the above-mentioned physics goals, a hermetical detector system will be constructed with cutting-edge technologies. This document is the result of collective contributions and valuable inputs from experts across the globe. The EicC physics program complements the ongoing scientific programs at the Jefferson Laboratory and the future EIC project in the United States. The success of this project will also advance both nuclear and particle physics as well as accelerator and detector technology in China.

nucl-ex

BeeCup: A Bio-Inspired Energy-Efficient Clustering Protocol for Mobile Learning

Mobile devices have become a popular tool for ubiquitous learning in recent years. Multiple mobile users can be connected via ad hoc networks for the purpose of learning. In this context, due to limited battery capacity, energy efficiency of mobile devices becomes a very important factor that remarkably affects the user experience of mobile learning. Based on the artificial bee colony (ABC) algorithm, we propose a new clustering protocol, namely BeeCup, to save the energy of mobile devices while guaranteeing the quality of learning. The BeeCup protocol takes advantage of biologically-inspired computation, with focus on improving the energy efficiency of mobile devices. It first estimates the number of cluster heads (CHs) adaptively according to the network scale, and then selects the CHs by employing the ABC algorithm. In case some CHs consume energy excessively, clusters will be dynamically updated to keep energy consumption balanced within the whole network. Simulation results demonstrate the effectiveness and superiority of the proposed protocol.

cs.NI

EASM: Efficiency-Aware Switch Migration for Balancing Controller Loads in Software-Defined Networking

Distributed multi-controller deployment is a promising method to achieve a scalable and reliable control plane of Software-Defined Networking (SDN). However, it brings a new challenge for balancing loads on the distributed controllers as the network traffic dynamically changes. The unbalanced load distribution on the controllers will increase response delay for processing flows and reduce the controllers'throughput. Switch migration is an effective approach to solve the problem. However, existing schemes focus only on the load balancing performance but ignore migration efficiency, which may result in high migration costs and unnecessary control overheads. This paper proposes Efficiency-Aware Switch Migration (EASM) to balance the controllers'loads and improve migration efficiency. We introduce load difference matrix and trigger factor to measure load balancing on controllers. We also introduce the migration efficiency problem, which considers load balancing rate and migration cost simultaneously to optimally migrate switches. We propose EASM to efficiently solve to the problem. The simulation results show that EASM outperforms baseline schemes by reducing the controller response time by about 21.9%, improving the controller throughput by 30.4% on average, maintaining good load balancing rate, low migration costs and migration time, when the network scale changes.

cs.NI

Dynamics of a diffusive predator-prey model: the effect of conversion rate

A general diffusive predator-prey model is investigated in this paper. We prove the global attractivity of constant equilibria when the conversion rate is small, and the non-existence of non-constant positive steady states when the conversion rate is large. The results are applied to several predator-prey models and give some ranges of parameters where complex pattern formation cannot occur.

math.DS

Stochastic Duty Cycling for Heterogenous Energy Harvesting Networks

In recent years, there have been several kinds of energy harvesting networks containing some tiny devices, such as ambient backscatter, ring and renewable sensor networks. During energy harvesting, such networks suffer from the energy heterogeneity, dynamics and prediction hardness because the access to natural resources is often spatiotemporal different and timely changing among the devices. Meanwhile, the charging efficiency is quite low especially when the power of the harvested energy is weak. It results in the energy waste to store the harvested energy indirectly. These features bring challenging and interesting issues on efficient allocation of the harvested energy. This paper studies the \emph{stochastic duty cycling} by considering these features with the objective characterized by maximizing the common active time. We consider two cases: offline and online stochastic duty cycling. For the offline case, we design an optimal solution: offline duty cycling algorithm. For the online case, we design an online duty cycling algorithm, which achieves the approximation ratio with at least $1-e^{-γ^2}$, where $γ$ is the probability able to harvest energy. We also evaluate our algorithms with the experiment on a real energy harvesting network. The experiment results show that the performance of the online algorithm can be very close to the offline algorithm.

cs.NI

Value of Information Aware Opportunistic Duty Cycling in Solar Harvesting Sensor Networks

The energy-harvested Wireless Sensor Networks (WSNs) may operate perpetually with the extra energy supply from ambient natural energy, such as solar energy. Nevertheless, the harvested energy is still limited so it's not able to support the perpetual network operation with full duty cycle. To achieve the perpetual network operation and process the data with high importance, measured by Value of Information (VoI), the network has to operate under partial duty cycle and to improve the efficiency to consume the harvested energy. The challenging problem is how to deal with the stochastic feature of the natural energy and the variable data VoI. We consider the energy consumption during storing and the diversity of the data process including sampling, transmitting and receiving, which consume different power levels. The problem is then mapped as the budget-dynamic Multi-Arm Bandit (MAB) problem by treating the energy as the budget and the data process as arm pulling. This paper proposes an Opportunistic Duty Cycling (ODC) scheme to improve the energy efficiency while satisfying the perpetual network operation. ODC chooses the proper opportunities to store the harvested energy or to spend it on the data process based on the historical information of the energy harvesting and the VoI of the processed data. With this scheme, each sensor node need only estimate the ambient natural energy in short term so as to reduce the computation and the storage for the historical information. It also can distributively adjust its own duty cycle according to its local historical information. This paper also conducts the extensive analysis on the performance of our scheme ODC, and the theoretical results validate the regret, which is the difference between the optimal scheme and ours. Our experimental results also manifest the promising performance of ODC.

cs.NI

Quorum-based Localized Scheme for Duty Cycling in Asynchronous Sensor Networks

Many TDMA- and CSMA-based protocols try to obtain fair channel access and to increase channel utilization. It is still challenging and crucial in Wireless Sensor Networks (WSNs), especially when the time synchronization cannot be well guaranteed and consumes much extra energy. This paper presents a localized and ondemand scheme ADC to adaptively adjust duty cycle based on quorum systems. ADC takes advantages of TDMA and CSMA and guarantees that (1) each node can fairly access channel based on its demand, (2) channel utilization can be increased by reducing competition for channel access among neighboring nodes, (3) every node has at least one rendezvous active time slot with each of its neighboring nodes even under asynchronization. The latency bound of data aggregation is analyzed under ADC to show that ADC can bound the latency under both synchronization and asynchronization. We conduct extensive experiments in TinyOS on a real test-bed with TelosB nodes to evaluate the performance of ADC. Comparing with B-MAC, ADC substantially reduces the contention for channel access and energy consumption, and improves network throughput.

cs.NI