SearcharxivSearch

arXiv subjects

Kaiming Zhang

Publications and source records attributed to Kaiming Zhang.

6 recordsLinked to original sources

PeopleSearchBench: Evaluating AI-Powered People Search Platforms with Criteria-Grounded Verification

AI-powered people search platforms are increasingly deployed for recruiting, sales prospecting, and professional networking, yet no standardized benchmark exists for their rigorous evaluation. We present PeopleSearchBench, an open-source benchmark comprising 119 multilingual queries across four scenarios: corporate recruiting, B2B sales prospecting, expert search, and influencer discovery. A central contribution is Criteria-Grounded Verification, an evaluation methodology that decomposes each query into explicit, independently checkable criteria and verifies each returned individual via live web search, producing factual relevance judgments rather than subjective LLM-as-judge scores (Cohen's kappa = 0.84 with human annotators). We evaluate four architecturally diverse platforms along three complementary dimensions---Relevance Precision, Effective Coverage, and Information Utility---and find that multi-source search agents significantly outperform single-domain systems, particularly in influencer discovery where the performance gap is largest. Platform rankings are robust across ablations on scoring thresholds, dimension weights, and judge models. All code, queries, and evaluation prompts are publicly available.

cs.AI

LogPrism: Unifying Structure and Variable Encoding for Effective Log Compression

In the field of log compression, the prevailing "parse-then-compress" paradigm fundamentally limits effectiveness by treating log parsing and compression as isolated objectives. While parsers prioritize semantic accuracy (i.e., event identification), they often obscure deep correlations between static templates and dynamic variables that are critical for storage efficiency. In this paper, we investigate this misalignment through a comprehensive empirical study and propose LogPrism, a framework that bridges the gap via unified redundancy encoding. Rather than relying on a rigid pre-parsing step, LogPrism dynamically integrates structural extraction with variable encoding by constructing a Unified Redundancy Tree (URT). This hierarchical approach effectively mines "structure+variable" co-occurrence patterns, capturing deep contextual redundancies while accelerating processing through pre-emptive pattern encoding. Extensive experiments on 16 benchmark datasets confirm that LogPrism establishes a new state-of-the-art. It achieves the highest compression ratio on 14 datasets, surpassing existing baselines by margins of 6.12% to 83.34%, while delivering superior throughput at 29.87 MB/s (1.68$\times$~43.04$\times$ faster than competitors). Moreover, when configured in single-archive mode to maximize global pattern discovery, LogPrism boosts its compression ratio by 273.27%, outperforming the best baseline by 19.39% with a 2.62$\times$ speed advantage.

cs.SE

Cast: Automated Resilience Testing for Production Cloud Service Systems

The distributed nature of microservice architecture introduces significant resilience challenges. Traditional testing methods, limited by extensive manual effort and oversimplified test environments, fail to capture production system complexity. To address these limitations, we present Cast, an automated, end-to-end framework for microservice resilience testing in production. It achieves high test fidelity by replaying production traffic against a comprehensive library of application-level faults to exercise internal error-handling logic. To manage the combinatorial test space, Cast employs a complexity-driven strategy to systematically prune redundant tests and prioritize high-value tests targeting the most critical service execution paths. Cast automates the testing lifecycle through a three-phase pipeline (i.e., startup, fault injection, and recovery) and uses a multi-faceted oracle to automatically verify system resilience against nuanced criteria. Deployed in Huawei Cloud for over eight months, Cast has been adopted by many service teams to proactively address resilience vulnerabilities. Our analysis on four large-scale applications with millions of traces reveals 137 potential vulnerabilities, with 89 confirmed by developers. To further quantify its performance, Cast is evaluated on a benchmark set of 48 reproduced bugs, achieving a high coverage of 90%. The results show that Cast is a practical and effective solution for systematically improving the reliability of industrial microservice systems.

cs.SE

Goodness-of-fit Test for Generalized Functional Linear Models via Projection Averaging

Assessing model adequacy is a crucial step in regression analysis, ensuring the validity of statistical inferences. For Generalized Functional Linear Models (GFLMs), which are widely used for modeling relationships between scalar responses and functional predictors, there is a recognized need for formal goodness-of-fit testing procedures. Current literature on this specific topic remains limited. This paper introduces a novel goodness-of-fit test for GFLMs. The test statistic is formulated as a U-statistic derived from a Cramér-von-Mises metric integrated over all one-dimensional projections of the functional predictor. This projection averaging strategy is designed to effectively mitigate the curse of dimensionality. We establish the asymptotic normality of the test statistic under the null hypothesis and prove the consistency under the alternatives. As the asymptotic variance of the limiting null distribution can be complex for practical use, we also propose practical bootstrap resampling methods for both continuous and discrete responses to compute p-values. Simulation studies confirm that the proposed test demonstrates good power performance across various settings, showing advantages over existing methods.

stat.ME

Ultra-high mobility semiconducting epitaxial graphene on silicon carbide

Graphene nanoelectronics potential was limited by the lack of an intrinsic bandgap[1] and attempts to tailor a bandgap either by quantum confinement or by chemical functionalization failed to produce a semiconductor with a large enough band gap and a sufficient mobility. It is well known that by evaporating silicon from commercial electronics grade silicon carbide crystals an epitaxial graphene layer forms on the surfaces [2]. The first epigraphene layer to form on the silicon terminated face, known as the buffer layer, is insulating. It is chemically bonded to the SiC and spectroscopic measurements [3] have identified semiconducting signatures on the microscopic domains. However, the bonding to the SiC is disordered and the mobilities are small. Here we demonstrate a quasi-equilibrium annealing method that produces macroscopic atomically flat terraces covered with a well ordered epigraphene buffer layer that has a 0.6 eV bandgap. Room temperature mobilities exceed 5000 cm2/Vs which is much larger than silicon and 20 times larger than the phonon scattering imposed limit of current 2D semiconductors. Critical for nanotechnology, its lattice is aligned with the SiC substrate, it is chemically, mechanically, and thermally robust, and it can be conventionally patterned and seamlessly connected to semimetallic epigraphene making semiconducting epigraphene ideally suited for nanoelectronics.

cond-mat.mes-hall

Sand Creep Motion in Slow Spin-up Experiment: An Analogue of Regolith Migration on Asteroids

We studied the creep motion of granular materials in a gradient potential field that is created using a slow spin-up experiment device. Natural sand confined in the acrylic box is spun up by a controlled turntable and the surface flows are captured using video-based measurements. Various spin-up accelerations were considered to understand the responses of creep motion on different accelerating paths. Convergent behaviors in the morphological change of sand surface were observed in the final steady state. To quantify the quasi-static spin-up process, we examined the net flux and the surface slope as a function of the spin rate and offset from the rotation axis. Evolution of sand creep motion demonstrated behaviors similar to regolith migration in numeric simulations, showing intermittency like general sheared granular systems. We noticed the sand surface approaches criticality as the spin-up proceeding, consistent with the observation that top-shaped asteroids near limiting spin rate take on critical shape. Comparisons to large-scale numeric simulations and analytical solutions reveal underlying similarities between our experiments and the million-year evolution of asteroid regolith under YORP acceleration, which raises the possibility of studying asteroid surface processes in laboratory analogue experiments.

astro-ph.EP