Searcharxiv⌕ Search

arXiv subjects

Hao Zhong

Publications and source records attributed to Hao Zhong.

At least 37 records · Page 2Linked to original sources
arXiv2025

Quasi-steady electron-excitonic complexes coupling in a two-dimensional semiconductor

Excitons and their complexes govern optical-related behaviors in semiconductors. Here, using angle-resolved photoemission spectroscopy (ARPES), we have elucidated the light-matter interaction mediated by quasi-steady excitonic complexes within a monolayer of the prototypical two-dimensional (2D) semiconductor WSe2. Under continuous incident light, we have observed the generation of quasi-steady excitons and their complexes, encompassing ground and excited state excitons, trions, as well as their intricate interplay. We further show spectral evidence of electronic excitation states within the background of quasi-steady excitonic complexes, characterized by valence band (VB) effective mass renormalization, the enhanced spin-orbit coupling (SOC), the formation of an excitonic gap near the Fermi level (EF ) of the conduction band (CB), and intervalley excitonic band folding. Our findings not only unveil a quasi-steady excitonic complex background for the creation of diverse electronic excitations in 2D semiconductors but also offer new insights into the role of excitons in the charge density wave (CDW) formation mechanism and facilitate the advancement of correlated electronic state engineering based on the coupling between electrons and excitonic complexes in a quasi-equilibrium state.

cond-mat.str-el↗
arXiv2025

Surface band-selective moiré effect induces flat band in mixed-dimensional heterostructures

In this work, we reveal a curious type of moiré effect that selectively modifies the surface states of bulk crystal. We synthesize mixed-dimensional heterostructures consisting of a noble gas monolayer grow on the surface of bulk Bi(111), and determine the electronic structure of the heterostructures using angle-resolved photoemission spectroscopy. We directly observe moiré replicas of the Bi(111) surface states, while the bulk states remain barely changed. Meanwhile, we achieve control over the moiré period in the range of 25 Å to 80 Å by selecting monolayers of different noble gases and adjusting the annealing temperature. At large moiré periods, we observe hybridization between the surface band replicas, which leads to the formation of a correlated flat band. Our results serve as a bridge for understanding the moiré modulation effect from 2D to 3D systems, and provide a feasible approach for the realization of correlated phenomena through the engineering of surface states via moiré effects.

cond-mat.str-el↗
arXiv2025

GUI-Shepherd: Reliable Process Reward and Verification for Long-Sequence GUI Tasks

Autonomous agents for long-sequence Graphical User Interface tasks are hindered by sparse rewards and the intractable credit assignment problem. To address these challenges, we introduce GUI-Shepherd, a Process Reward Model that provides dense, step-by-step feedback to guide agents. GUI-Shepherd is trained on a diverse large-scale data set of $52$k interactions that features human-annotated scores and GPT-4o generated rationales, enabling it to serve both as a reward provider for RL training and as a verifier for inference. As far as we know, we are the first to conduct a systematic study of process supervision in GUI agents, across diverse settings from online long-horizon tasks to offline single-step prediction. On the online AndroidWorld benchmark, GUI-Shepherd improves success rate by $7.7$ points via multi-turn online PPO, significantly outperforming Outcome Reward Model based competitors. When used as an inference verifier, it brings $5.1$ points improvements. The benefits generalize to the offline AndroidControl benchmark, with gains of $2.2$ points as a reward provider and $4.3$ points as a verifier. Collectively, our results establish that high-fidelity process supervision is critical for building more capable GUI agents and present a generalizable solution.

cs.AI↗
arXiv2025

$q$-Binomial Identities Finder

This paper presents a symbolic computation method for automatically transforming $q$-hypergeometric identities to $q$-binomial identities. Through this method, many previously proven $q$-binomial identities, including $q$-Saalschütz's formula and $q$-Suranyi's formula, are re-fund, and numerous new ones are discovered. Moreover, the generation of the identities is accompanied by the corresponding proofs. During the transformation process, different ranges of variable values and various combinations of $q$-Pochhammer symbols yield different identities. The algorithm maps variable constraints to positive elements in an ordered vector space and employs a backtracking method to provide the feasible variable constraints and $q$-binomial coefficient combinations for each step.

math.CO↗
arXiv2025

Observation of quasi-steady dark excitons and gap phase in a doped semiconductor

Exciton plays an important role in optics and optics-related behaviors and leads to novel correlated phases like charge order, exciton insulator, and exciton-polariton condensation. Dark exciton shows distinct properties from bright one. However, it cannot be directly detected by conventional optic measurements. The electronic modulation effect of dark excitons in quasi-equilibrium distribution, critical for electronic devices in working status, is still elusive. Here, using angle-resolved photoemission spectroscopy, we report creating, detecting, and controlling dark excitons in the quasi-equilibrium distribution in a doped semiconductor SnSe2. Surprisingly, we observe an excitonic gap phase, with a conduction band opening an anisotropic gap. Our results broaden the scope of dark excitons, extending their studies from the picosecond timescale in the ultrafast photoemission process to conditions occurring under quasi-equilibrium. We reveal the light-matter interaction in the engineering of electronic structures and provide a new way to realize the excitonic gap phase in semiconductors with large band gaps.

cond-mat.mtrl-sci↗
arXiv2025

Omni-R1: Reinforcement Learning for Omnimodal Reasoning via Two-System Collaboration

Long-horizon video-audio reasoning and fine-grained pixel understanding impose conflicting requirements on omnimodal models: dense temporal coverage demands many low-resolution frames, whereas precise grounding calls for high-resolution inputs. We tackle this trade-off with a two-system architecture: a Global Reasoning System selects informative keyframes and rewrites the task at low spatial cost, while a Detail Understanding System performs pixel-level grounding on the selected high-resolution snippets. Because ``optimal'' keyframe selection and reformulation are ambiguous and hard to supervise, we formulate them as a reinforcement learning (RL) problem and present Omni-R1, an end-to-end RL framework built on Group Relative Policy Optimization. Omni-R1 trains the Global Reasoning System through hierarchical rewards obtained via online collaboration with the Detail Understanding System, requiring only one epoch of RL on small task splits. Experiments on two challenging benchmarks, namely Referring Audio-Visual Segmentation (RefAVS) and Reasoning Video Object Segmentation (REVOS), show that Omni-R1 not only surpasses strong supervised baselines but also outperforms specialized state-of-the-art models, while substantially improving out-of-domain generalization and mitigating multimodal hallucination. Our results demonstrate the first successful application of RL to large-scale omnimodal reasoning and highlight a scalable path toward universally foundation models.

cs.CV↗
arXiv2024

A Flat Plasmonic Biosensing Interface on Optical Fiber End-Facet via SPP-MIM Hybridization

We found that the specific dispersion of metal-insulator-metal (MIM) waveguide allows the hybridization of surface plasmon polaritons (SPPs) and the waveguide, which is not possible with dielectric waveguides. The SPP-MIM hybridization structure forms such a meta-film that integrates the previously incompatible respective merits of SPR and LSPR, including flat interfaces, high sensitivities, short evanescent fields and easy coupling with confined light. On the other hand, to achieve stable and reproducible performance is one of the greatest unresolved challenges for the development of nanophotonic biosensors. We point out that the key is to obtain well-controlled biomolecular behaviors using simple physical interfaces, for which the SPP-MIM meta-film provides a capable solution. We embed the SPP-MIM meta-film with a plasmonic crystal cavity and integrate it on a single-mode fiber's end-facet to detect biomolecular interactions. This device demonstrates highly reproducible sensorgrams and convincing detection of biotinylated proteins at down to 30 fM, with the sensorgrams following the Langmuir model. By unprecedentedly having both high sensitivity and high reproducibility, our device proposal provides a comprehensive solution for optical fiber-tip plasmonic devices to turn into a useful industrial biosensing technology.

physics.optics↗
arXiv2024

Automation Configuration in Smart Home Systems: Challenges and Opportunities

As the innovation of smart devices and internet-of-things (IoT), smart homes have become prevalent. People tend to transform residences into smart homes by customizing off-the-shelf smart home platforms, instead of creating IoT systems from scratch. Among the alternatives, Home Assistant (HA) is one of the most popular platforms. It allows end-users (i.e., home residents) to smartify homes by (S1) integrating selected devices into the system, and (S2) creating YAML files to control those devices. Unfortunately, due to the diversity of devices and complexity of automatic configurations, many users have difficulty correctly creating YAML files. Consequently, their smart homes may not work as expected, causing frustration and concern in users. This paper presents a novel study on issues of YAML-based automation configuration in smart homes (issues related to S2). We mined the online forum Home Assistant Community for discussion threads related to automation configuration. By manually inspecting 190 threads, we revealed 3 categories of concerns: implementation, optimization, and debugging. Under each category, we classified discussions based on the issue locations and technical concepts involved. Among debugging discussions, we further classified discussions based on users' resolution strategies; we also applied existing analysis tools to buggy YAML files, to assess the tool effectiveness. Our study reveals the common challenges faced by users and frequently applied resolution strategies. There are 129 (68%) examined issues concerning debugging, but existing tools can detect at most 14 issues and fix none. It implies that existing tools provide limited assistance in automation configuration. Our research sheds light on future directions in smart home development.

cs.SE↗
arXiv2024

Quantum simulation of honeycomb lattice model by high-order moiré pattern

Moiré superlattices have become an emergent solid-state platform for simulating quantum lattice models. However, in single moiré device, Hamiltonians parameters like lattice constant, hopping and interaction terms can hardly be manipulated, limiting the controllability and accessibility of moire quantum simulator. Here, by combining angle-resolved photoemission spectroscopy and theoretical analysis, we demonstrate that high-order moiré patterns in graphene-monolayered xenon/krypton heterostructures can simulate honeycomb model in mesoscale, with in-situ tunable Hamiltonians parameters. The length scale of simulated lattice constant can be tuned by annealing processes, which in-situ adjusts intervalley interaction and hopping parameters in the simulated honeycomb lattice. The sign of the lattice constant can be switched by choosing xenon or krypton monolayer deposited on graphene, which controls sublattice degree of freedom and valley arrangment of Dirac fermions. Our work establishes a novel path for experimentally simulating the honeycomb model with tunable parameters by high-order moiré patterns.

cond-mat.mtrl-sci↗
arXiv2024

Surface region band enhancement in noble gas adsorption assisted ARPES on kagome superconductor RbV3Sb5

Electronic states near surface regions can be distinct from bulk states, which are paramount in understanding various physical phenomena occurring at surfaces and in applications in semiconductors, energy, and catalysis. Here, we report an abnormal surface region band enhancement effect in angle-resolved photoemission spectroscopy on kagome superconductor RbV3Sb5, by depositing noble gases with fine control. In contrast to conventional surface contamination, the intensity of surface region Sb band can be enhanced more than three times with noble gas adsorption. In the meantime, a hole-dope effect is observed for the enhanced surface region band, with other bands hardly changing. The doping effect is more pronounced with heavier noble gases. We propose that noble gas atoms selectively fill into alkali metal vacancy sites on the surface, which improves the surface condition, boosts surface region bands, and effectively dopes it with the Pauli repulsion mechanism. Our results provide a novel and reversible way to improve surface conditions and tune surface region bands by controlled surface noble gas deposition.

cond-mat.mtrl-sci↗
arXiv2022

Privacy-Utility Trade-Off

In this paper, we investigate the privacy-utility trade-off (PUT) problem, which considers the minimal privacy loss at a fixed expense of utility. Several different kinds of privacy in the PUT problem are studied, including differential privacy, approximate differential privacy, maximal information, maximal leakage, Renyi differential privacy, Sibson mutual information and mutual information. The average Hamming distance is used to measure the distortion caused by the privacy mechanism. We consider two scenarios: global privacy and local privacy. In the framework of global privacy framework, the privacy-distortion function is upper-bounded by the privacy loss of a special mechanism, and lower-bounded by the optimal privacy loss with any possible prior input distribution. In the framework of local privacy, we generalize a coloring method for the PUT problem.

cs.IT↗
arXiv2021

Migrating Client Code without Change Examples

API developers evolve software libraries to fix bugs, add new features, or refactor code. To benefit from such library evolution, the programmers of client projects have to repetitively upgrade their library usages and adapt their codebases to any library API breaking changes (e.g., API renaming). Such adaptive changes can be tedious and error-prone. Existing tools provide limited support to help programmers migrate client projects from old library versions to new ones. For instance, some tools extract API mappings be-tween library versions and only suggest simple adaptive changes (i.e., statement updates); other tools suggest or automate more complicated edits (e.g., statement insertions) based on user-provided exemplar code migrations. However, when new library versions are available, it is usually cumbersome and time-consuming for users to provide sufficient human-crafted samples in order to guide automatic migration. In this paper, we propose a novel approach, AutoUpdate, to further improve the state of the art. Instead of learning from change examples, we designed AutoUpdate to automate migration in a compiler-directed way. Namely, given a compilation error triggered by upgrading libraries, AutoUpdate exploits 13 migration opera-tors to generate candidate edits, and tentatively applies each edit until the error is resolved or all edits are explored. We conducted two experiments. The first experiment involves migrating 371 tutorial examples between versions of 5 popular libraries. AutoUpdate reduced migration-related compilation errors for 92.7% of tasks. It eliminated such errors for 32.4% of tasks, and 33.9% of the tasks have identical edits to manual migrations. In the second experiment, we applied AutoUpdate to migrate two real client projects of lucene. AutoUpdate successfully migrated both projects, and the migrated code passed all tests.

cs.SE↗
arXiv2021

Locating Faulty Methods with a Mixed RNN and Attention Model

IR-based fault localization approaches achieves promising results when locating faulty files by comparing a bug report with source code. Unfortunately, they become less effective to locate faulty methods. We conduct a preliminary study to explore its challenges, and identify three problems: the semantic gap problem, the representation sparseness problem, and the single revision problem. To tackle these problems, we propose MRAM, a mixed RNN and attention model, which combines bug-fixing features and method structured features to explore both implicit and explicit relevance between methods and bug reports for method level fault localization task. The core ideas of our model are: (1) constructing code revision graphs from code, commits and past bug reports, which reveal the latent relations among methods to augment short methods and as well provide all revisions of code and past fixes to train more accurate models; (2) embedding three method structured features (token sequences, API invocation sequences, and comments) jointly with RNN and soft attention to represent source methods and obtain their implicit relevance with bug reports; and (3) integrating multirevision bug-fixing features, which provide the explicit relevance between bug reports and methods, to improve the performance. We have implemented MRAM and conducted a controlled experiment on five open-source projects. Comparing with stateof-the-art approaches, our MRAM improves MRR values by 3.8- 5.1% (3.7-5.4%) when the dataset contains (does not contain) localized bug reports. Our statistics test shows that our improvements are significant

cs.SE↗
arXiv2021

Investigating and Recommending Co-Changed Entities for JavaScript Programs

JavaScript (JS) is one of the most popular programming languages due to its flexibility and versatility, but maintaining JS code is tedious and error-prone. In our research, we conducted an empirical study to characterize the relationship between co-changed software entities (e.g., functions and variables), and built a machine learning (ML)-based approach to recommend additional entity to edit given developers' code changes. Specifically, we first crawled 14,747 commits in 10 open-source projects; for each commit, we created one or more change dependency graphs (CDGs) to model the referencer-referencee relationship between co-changed entities. Next, we extracted the common subgraphs between CDGs to locate recurring co-change patterns between entities. Finally, based on those patterns, we extracted code features from co-changed entities and trained an ML model that recommends entities-to-change given a program commit. According to our empirical investigation, (1) three recurring patterns commonly exist in all projects; (2) 80%--90% of co-changed function pairs either invoke the same function(s), access the same variable(s), or contain similar statement(s); (3) our ML-based approach CoRec recommended entity changes with high accuracy (73%--78%). CoRec complements prior work because it suggests changes based on program syntax, textual similarity, as well as software history; it achieved higher accuracy than two existing tools in our evaluation.

cs.SE↗
arXiv2019

Bijections between t-Core Partitions and t-Tuples

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts divisible by some integer, and distinct parts. For example, we prove that the number of $2t$-core partitions into $l$ even parts equals the number of $t$-core partitions into $l$ parts. We also generalize one expression for simultaneous cores, which was given by Baek, Nam and Yu, recently. Subsequently, we use this expression to obtain recurrence satisfied by numbers of $(s,s+1,\cdots,s+r)-$core partitions for $s\geq1$.

math.CO↗
arXiv2019

A Generalization of A Result of Gauss on Primitive Root

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its product is congruent to $μ(p-1)$ modulo $p$, where $μ$ is the Möbius function. In this paper, we will generalize these two interesting congruences and give the congruences of the sum and the product of integers with the same index modulo $n$.

math.NT↗
arXiv2019

Vulnerability Prediction Based on Weighted Software Network for Secure Software Building

To build a secure communications software, Vulnerability Prediction Models (VPMs) are used to predict vulnerable software modules in the software system before software security testing. At present many software security metrics have been proposed to design a VPM. In this paper, we predict vulnerable classes in a software system by establishing the system's weighted software network. The metrics are obtained from the nodes' attributes in the weighted software network. We design and implement a crawler tool to collect all public security vulnerabilities in Mozilla Firefox. Based on these data, the prediction model is trained and tested. The results show that the VPM based on weighted software network has a good performance in accuracy, precision, and recall. Compared to other studies, it shows that the performance of prediction has been improved greatly in Pr and Re.

cs.SE↗