Researcher profile

Chao Han

Chao Han contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
8works
0followers
7topics
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

8 published item(s)

preprint2026arXiv

Artificial Intelligence-Assistant Cardiotocography: Unified Model for Signal Reconstruction, Fetal Heart Rate Analysis, and Variability Assessment

The monitoring of fetal heart rate (FHR) and the assessment of its variability are crucial for preventing fetal compromise and adverse outcomes. However, traditional methods encounter limitations arising from equipment performance, data transmission, and subjective assessments by doctors. We have developed a tailored AI-based FHrCTG model specifically for FHR monitoring, which effectively mitigates noise interference and precisely reconstructs signals. Our model was pre-trained on a massive dataset consisting of 558,412 unlabeled data points and further refined using 7,266 expert-reviewed entries. To validate FHR, we introduced the Intersection Overlapping Labels (IOL) approach, which transforms rate analysis into categorical judgments. Testing revealed that our model demonstrates high sensitivity and specificity in detecting critical FHR decelerations (89.13% and 87.78%, respectively) and accelerations (62.5% and 92.04%, respectively). Furthermore, based on Fischer's criteria for clinical application, our model achieved impressive AUC scores of 0.7214 and 0.9643 for verifying FHR periodicity and amplitude variation, respectively.

preprint2026arXiv

Good to Go: The LOOP Skill Engine That Hits 99% Success and Slashes Token Usage by 99% via One-Shot Recording and Deterministic Replay

Deploying AI agents for repetitive periodic tasks exposes a critical tension: Large Language Models (LLMs) offer unmatched flexibility in tool orchestration, yet their inherent stochasticity causes unpredictable failures, and repeated invocations incur prohibitive token costs. We present the LOOP SKILL ENGINE, a system that achieves a combined 99% success rate and 99% token reduction for periodic agent tasks through a one-shot recording, deterministic replay paradigm. On its first run, the agent executes the task with full LLM reasoning while the system transparently intercepts and records the complete tool-call trajectory. A greedy length-descending template extraction algorithm then converts this recording into a parameterized, branch-free Loop Skill -- a deterministic execution plan that captures the task's functional intent while parameterizing time-dependent and result-dependent variables. All subsequent executions bypass the LLM entirely: the engine resolves template variables against real-time values and replays the tool sequence deterministically. We prove two theorems: (1) Replay Determinism -- the step sequence of a validated Loop Skill is invariant across all future executions; (2) Write Safety -- concurrent access to persistent configuration is serialized through reentrant locks and atomic file replacement. Across a benchmark of periodic agent tasks spanning intervals from 5 minutes to 24 hours, the Loop Skill Engine reduces monthly token consumption by 93.3%--99.98% and cuts execution latency by 8.7x while eliminating output non-determinism. A multi-layer degradation strategy guarantees that tasks never stall. We release the engine as part of the buddyMe open-source agent framework.

preprint2022arXiv

Anisotropy and quench dynamics of quasiholes in fractional quantum Hall liquids

We present a microscopic study of quasiholes in bosonic fractional quantum Hall (FQH) liquids at filling factor $ν=1/2$ in the lowest Landau level with anisotropic band mass tensors. We use the spatial density profile to characterize the shape of a quasihole and analyze its anisotropy. We then compare the quasihole's anisotropy with the intrinsic geometric metric of the system that is extracted from the maximal overlap between the numerically obtained quasihole ground state and a set of model wave functions of anisotropic quasiholes. For a static system, we find that the quasihole's anisotropy, similar to the intrinsic metric, grows with the anisotropy of the band mass tensor. When the quasihole develops well, we observe a correspondence between the anisotropy of the quasihole and the intrinsic metric of the underlying anisotropic FQH state. We also drive the system out of equilibrium by suddenly changing the band mass tensor. In this case, the shape of the quasihole evolves with time and shows similar dynamics with the intrinsic metric of the postquench state. The evolving frequency matches the energy of a spin-$2$ quadrupole degree of freedom in the system. Our results suggest that the density profile of a quasihole is a useful tool to estimate the intrinsic metric and capture the dynamics of an FQH system.

preprint2022arXiv

Disorder-driven phase transitions in bosonic fractional quantum Hall liquids

We investigate the disorder-driven phase transitions in bosonic fractional quantum Hall liquids at filling factors $f=1/2$ and $f=1$ in the lowest Landau level. We use the evolution of ground-state entanglement entropy, fidelity susceptibility, and Hall conductance with increasing disorder strength to identify the underlying phase transitions. The critical disorder strengths obtained from these different quantities are consistent with each other, validating the reliability of our numerical calculations based on exact diagonalization. At $f=1/2$, we observe a clear transition from the bosonic Laughlin state to a trivial insulating phase. At $f=1$, we identify a direct phase transition from the non-Abelian bosonic Moore-Read state to a trivial insulating phase, although some signs of a disorder-induced intermediate fractional quantum Hall phase were recently reported for the $f=5/2$ fermionic cousin.

preprint2022arXiv

Large region targets observation scheduling by multiple satellites using resampling particle swarm optimization

The last decades have witnessed a rapid increase of Earth observation satellites (EOSs), leading to the increasing complexity of EOSs scheduling. On account of the widespread applications of large region observation, this paper aims to address the EOSs observation scheduling problem for large region targets. A rapid coverage calculation method employing a projection reference plane and a polygon clipping technique is first developed. We then formulate a nonlinear integer programming model for the scheduling problem, where the objective function is calculated based on the developed coverage calculation method. A greedy initialization-based resampling particle swarm optimization (GI-RPSO) algorithm is proposed to solve the model. The adopted greedy initialization strategy and particle resampling method contribute to generating efficient and effective solutions during the evolution process. In the end, extensive experiments are conducted to illustrate the effectiveness and reliability of the proposed method. Compared to the traditional particle swarm optimization and the widely used greedy algorithm, the proposed GI-RPSO can improve the scheduling result by 5.42% and 15.86%, respectively.

preprint2021arXiv

Artificial Intelligence Methods in In-Cabin Use Cases: A Survey

As interest in autonomous driving increases, efforts are being made to meet requirements for the high-level automation of vehicles. In this context, the functionality inside the vehicle cabin plays a key role in ensuring a safe and pleasant journey for driver and passenger alike. At the same time, recent advances in the field of artificial intelligence (AI) have enabled a whole range of new applications and assistance systems to solve automated problems in the vehicle cabin. This paper presents a thorough survey on existing work that utilizes AI methods for use-cases inside the driving cabin, focusing, in particular, on application scenarios related to (1) driving safety and (2) driving comfort. Results from the surveyed works show that AI technology has a promising future in tackling in-cabin tasks within the autonomous driving aspect.

preprint2020arXiv

b-baryon semi-tauonic decays in the Standard Model

Within the framework of HQET, $Λ_{b}\rightarrowΛ_{c}τ\barν_τ$ and $Ω_{b}\rightarrowΩ_{c}^{(*)}τ\barν_τ$ weak decays are studied to the order of $1/m_c$ and $1/m_b$. Helicity amplitudes are written down. Relevant Isgur-Wise functions given by QCD sum rule and large $N_c$ methods are applied in the numerical analysis. The baryonic R-ratios $R(Λ_c)$ and $R(Ω_c^{(*)})$ are obtained.

preprint2019arXiv

Multiple agile Earth observation satellites, oversubscribed targets scheduling using complex networks theory

The Earth observation satellites (EOSs) scheduling is of great importance to achieve efficient observation missions. The agile EOSs (AEOS) with stronger attitude maneuvering capacity can greatly improve observation efficiency while increasing scheduling complexity. The multiple AEOSs, oversubscribed targets scheduling problem with multiple observations are addressed, and the potential observation missions are modeled as nodes in the complex networks. To solve the problem, an improved feedback structured heuristic is designed by defining the node and target importance factors. On the basis of a real world Chinese AEOS constellation, simulation experiments are conducted to validate the heuristic efficiency in comparison with a constructive algorithm and a structured genetic algorithm.