Sheng Ma

Xianpeng, Sun, Haonan Sun et al.

Evaluation of repository-aware software engineering systems is often confounded by synthetic task design, prompt leakage, and temporal contamination between repository knowledge and future code changes. We present a time-consistent benchmark methodology that snapshots a repository at time T0, constructs repository-derived code knowledge using only artifacts available before T0, and evaluates on engineering tasks derived from pull requests merged in the future interval (T0, T1]. Each historical pull request is transformed into a natural-language task through an LLM-assisted prompt-generation pipeline, and the benchmark is formalized as a matched A/B comparison in which the same software engineering agent is evaluated with and without repository-derived code knowledge while all other variables are held constant. We also report a baseline characterization study on two open-source repositories, DragonFly and React, using three Claude-family models and four prompt granularities. Across both repositories, file-level F1 increases monotonically from minimal to guided prompts, reaching 0.8081 on DragonFly and 0.8078 on React for the strongest tested model. These results show that prompt construction is a first-order benchmark variable. More broadly, the benchmark highlights that temporal consistency and prompt control are core validity requirements for repository-aware software engineering evaluation.

Siqing Fu, Lizhou Wu, Tiejun Li et al.

Monte Carlo particle transport problems play a vital role in scientific computing, but solving them on exiting von Neumann architectures suffers from random branching and irregular memory access, causing computing inefficiency due to a fundamental mismatch between stochastic algorithms and deterministic hardware. To bridge this gap, we propose MCPT-Solver, a spin-based hardware true random number generator (TRNG) with tunable output probability enabled by a Bayesian inference network architecture. It is dedicated for efficiently solving stochastic applications including Monte Carlo particle transport problems. First, we leverage the stochastic switching property of spin devices to provide a high-quality entropy source for the TRNG and achieve high generating throughput and process-voltage-temperature tolerance through optimized control logic and write mechanism designs. Next, we propose a hardware Bayesian inference network to enable probability-tunable random number outputs. Finally, we present a system-level simulation framework to evaluate MCPT-Solver. Experimental results show that MCPT-Solver achieves a mean squared error of 7.6e-6 for solving transport problems while demonstrating a dramatic acceleration effect over general-purpose processors. Additionally, the MCPT-Solver's throughput reaches 185 Mb/s with an area of 27.8 um2/bit and energy consumption of 8.6 pJ/bit, making it the first spin-based TRNG that offers both process-voltage-temperature tolerance and adjustable probability.