Researcher profile

Bing Zhu

Bing Zhu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
11works
0followers
14topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

ClimateIQA: A New Dataset and Benchmark to Advance Vision-Language Models in Meteorology Anomalies Analysis

Meteorological heatmaps play a vital role in deciphering extreme weather phenomena, yet their inherent complexities marked by irregular contours, unstructured patterns, and complex color variations present unique analytical hurdles for state-of-the-art Vision-Language Models (VLMs). Current state-of-the-art models like GPT-4o, Qwen-VL, and LLaVA 1.6 struggle with tasks such as precise color identification and spatial localization, resulting in inaccurate or incomplete interpretations. To address these challenges, we introduce Sparse Position and Outline Tracking (SPOT), a novel algorithm specifically designed to process irregularly shaped colored regions in visual data. SPOT identifies and localizes these regions by extracting their spatial coordinates, enabling structured representations of irregular shapes. Building on SPOT, we construct ClimateIQA, a novel meteorological visual question answering (VQA) dataset, comprising 26,280 high-resolution heatmaps and 762,120 instruction samples for wind gust, total precipitation, wind chill index and heat index analysis. ClimateIQA enhances VLM training by incorporating spatial cues, geographic metadata, and reanalysis data, improving model accuracy in interpreting and describing extreme weather features. Furthermore, we develop Climate-Zoo, a suite of fine-tuned VLMs based on SPOT-empowered ClimateIQA, which significantly outperforms existing models in meteorological heatmap tasks.

preprint2026arXiv

Library Drift: Diagnosing and Fixing a Silent Failure Mode in Self-Evolving LLM Skill Libraries

Self-evolving skill libraries face a silent failure mode we term \emph{library drift}: unbounded skill accumulation without outcome-driven lifecycle management causes retrieval degradation, false-positive injections, and performance stagnation. Recent evaluation confirms the symptom--LLM-authored skills deliver +0.0pp gain while human-curated ones deliver +16.2pp (SkillsBench)--yet the underlying mechanism has not been isolated. We provide (1) a reproducible trigger: ablations that isolate drift--one disables skill injection (flat floor, +0.002), one imposes premature retirement (active harm, $-$0.019); (2) trace-level diagnostics: an append-only evidence log with per-skill contribution scores, attribution verdicts, and router engagement metrics that make the failure visible before it reaches end-task scores; and (3) a verified fix: a minimal governance recipe (outcome-driven retirement + bounded active-cap + meta-skill authoring prior) that lifts held-out pass@1 from a 0.258 baseline to a late-window mean of 0.584 (rolling gain $+$0.328) on MBPP+ hard-100 over 100 rounds. Eight ablations decompose which governance mechanisms are load-bearing and which are subsumed, providing a concrete playbook for diagnosing library drift in any self-evolving agent.

preprint2022arXiv

Dead-beat model predictive control for discrete-time linear systems

In this paper, model predictive control (MPC) strategies are proposed for dead-beat control of linear systems with and without state and control constraints. In unconstrained MPC, deadbeat performance can be guaranteed by setting the control horizon to the system dimension, and adding an terminal equality constraint. It is proved that the unconstrained deadbeat MPC is equivalent to linear deadbeat control. The proposed constrained deadbeat MPC is designed by setting the control horizon equal to the system dimension and penalizing only the terminal cost. The recursive feasibility and deadbeat performance are proved theoretically.

preprint2022arXiv

Improved characterization of Feshbach resonances and interaction potentials between $^{23}$Na and $^{87}$Rb atoms

The ultracold mixture of \Na and \Rb atoms has become an important system for investigating physics in Bose-Bose atomic mixtures and for forming ultracold ground-state polar molecules. In this work, we provide an improved characterization of the most commonly used Feshbach resonance near 347.64 G between \Na and \Rb in their absolute ground states. We form Feshbach molecules using this resonance and measure their binding energies by dissociating them via magnetic field modulation. We use the binding energies to refine the singlet and triplet potential energy curves, using coupled-channel bound-state calculations. We then use coupled-channel scattering calculations on the resulting potentials to produce a high-precision mapping between magnetic field and scattering length. We also observe 10 additional $s$-wave Feshbach resonances for \Na and \Rb in different combinations of Zeeman sublevels of the $F = 1$ hyperfine states. Some of the resonances show 2-body inelastic decay due to spin exchange. We compare the resonance properties with coupled-channel scattering calculations that full take account of inelastic properties.

preprint2022arXiv

Observation of photon recoil effects in single-beam absorption spectroscopy with an ultracold strontium gas

We report on observing photon recoil effects in the absorption of a single monochromatic light at 689~nm through an ultracold $^{88}$Sr gas, where the recoil frequency is comparable to natural linewidth of the narrow-line transition $5\mathrm{s^2}\, ^1\textrm{S}_0 - 5\mathrm{s}5\mathrm{p}\, ^3\textrm{P}_1$ in strontium. In the regime of high-saturation, the absorption profile becomes asymmetric due to the photon-recoil shift, which is of the same order as the natural linewidth. The lineshape is described by an extension of the optical Bloch equations including the momentum transfers to atoms during emission and absorption of photons. Our work reveals the photon recoil effects in a simplest single-beam absorption setting, which is of significant relevance to other applications such as saturation spectroscopy, Ramsey interferometry, and absorption imaging.

preprint2021arXiv

Dynamics of position disordered Ising spins with a soft-core potential

We theoretically study magnetization relaxation of Ising spins distributed randomly in a $d$-dimension homogeneous and Gaussian profile under a soft-core two-body interaction potential $\propto1/[1+(r/R_c)^α]$ ($α\ge d$), where $r$ is the inter-spin distance and $R_c$ is the soft-core radius. The dynamics starts with all spins polarized in the transverse direction. In the homogeneous case, an analytic expression is derived at the thermodynamic limit, which starts as $\propto\exp(-t^2)$ and follows a stretched-exponential law asymptotically at long time with an exponent $β=d/α$. In between an oscillating behaviour is observed with a damping amplitude. For Gaussian samples, the degree of disorder in the system can be controlled by the ratio $l_ρ/R_c$ with $l_ρ$ the mean inter-spin distance and the magnetization dynamics is investigated numerically. In the limit of $l_ρ/R_c\ll1$, a coherent many-body dynamics is recovered for the total magnetization despite of the position disorder of spins. In the opposite limit of $l_ρ/R_c\gg1$, a similar dynamics as that in the homogeneous case emerges at later time after a initial fast decay of the magnetization. We obtain a stretched exponent of $β\approx0.18$ for the asymptotic evolution with $d=3, α=6$, which is different from that in the homogeneous case ($β=0.5$).

preprint2020arXiv

Manipulation of heteronuclear spin dynamics with microwave and vector light shift

We report the observation and manipulation of heteronuclear spin dynamics in a spin-1 mixture of ultracold $^{87}$Rb and $^{23}$Na atoms. The dynamics is driven by the interspecies spin-dependent interaction and shows a pronounced dependence on magnetic fields with influences from both linear and quadratic Zeeman shifts. Similar to the well-studied homonuclear cases, the interspecies spin dynamics can be controlled by tuning the quadratic Zeeman shift with far-detuned microwave fields. In addition, we successfully realize spin dynamics control with vector light shifts which act as a species-selective effective magnetic field on $^{87}$Rb atoms. Both methods show negligible loss of atoms thus will be powerful techniques for investigating spin dynamics with fast temporal and high spatial resolutions.

preprint2020arXiv

On the Optimal Minimum Distance of Fractional Repetition Codes

Fractional repetition (FR) codes are a class of repair efficient erasure codes that can recover a failed storage node with both optimal repair bandwidth and complexity. In this paper, we study the minimum distance of FR codes, which is the smallest number of nodes whose failure leads to the unrecoverable loss of the stored file. We consider upper bounds on the minimum distance and present several families of explicit FR codes attaining these bounds. The optimal constructions are derived from regular graphs and combinatorial designs, respectively.

preprint2018arXiv

On the Duality and File Size Hierarchy of Fractional Repetition Codes

Distributed storage systems that deploy erasure codes can provide better features such as lower storage overhead and higher data reliability. In this paper, we focus on fractional repetition (FR) codes, which are a class of storage codes characterized by the features of uncoded exact repair and minimum repair bandwidth. We study the duality of FR codes, and investigate the relationship between the supported file size of an FR code and its dual code. Based on the established relationship, we derive an improved dual bound on the supported file size of FR codes. We further show that FR codes constructed from $t$-designs are optimal when the size of the stored file is sufficiently large. Moreover, we present the tensor product technique for combining FR codes, and elaborate on the file size hierarchy of resulting codes.

preprint2017arXiv

On the Duality of Fractional Repetition Codes

Erasure codes have emerged as an efficient technology for providing data redundancy in distributed storage systems. However, it is a challenging task to repair the failed storage nodes in erasure-coded storage systems, which requires large quantities of network resources. In this paper, we study fractional repetition (FR) codes, which enable the minimal repair complexity and also minimum repair bandwidth during node repair. We focus on the duality of FR codes, and investigate the relationship between the supported file size of an FR code and its dual code. Furthermore, we present a dual bound on the supported file size of FR codes.

preprint2015arXiv

HFR Code: A Flexible Replication Scheme for Cloud Storage Systems

Fractional repetition (FR) codes are a family of repair-efficient storage codes that provide exact and uncoded node repair at the minimum bandwidth regenerating point. The advantageous repair properties are achieved by a tailor-made two-layer encoding scheme which concatenates an outer maximum-distance-separable (MDS) code and an inner repetition code. In this paper, we generalize the application of FR codes and propose heterogeneous fractional repetition (HFR) code, which is adaptable to the scenario where the repetition degrees of coded packets are different. We provide explicit code constructions by utilizing group divisible designs, which allow the design of HFR codes over a large range of parameters. The constructed codes achieve the system storage capacity under random access repair and have multiple repair alternatives for node failures. Further, we take advantage of the systematic feature of MDS codes and present a novel design framework of HFR codes, in which storage nodes can be wisely partitioned into clusters such that data reconstruction time can be reduced when contacting nodes in the same cluster.