arXiv subjects

Hanlin Zhou

Publications and source records attributed to Hanlin Zhou.

4 recordsLinked to original sources

arXiv2026

Physics-governed executable modelling of triboelectric nanogenerators

Predictive modelling of triboelectric nanogenerators (TENGs) remains fragmented across analytical theories, finite-geometry solvers and disconnected simulation workflows. These disparate approaches must be unified into an executable framework to advance quantitative TENG research.Here we introduce a charge-defined modelling framework and implement it as TENG-CLAW, a physics-governed platform for traceable TENG simulation. The framework establishes a self-consistent electrostatic hierarchy in which triboelectric charges, pre-charging charges and compensating electrode charges serve as defining state variables.This hierarchy connects the infinite plate analytical limit for near-uniform fields with finite-geometry numerical formulations required for edge-dominated devices. Built on this basis, TENG-CLAW converts user-defined research requests into physically admissible simulation tasks, so that generated outputs are tied to explicit charge states, boundary conditions, solver routes and reusable artifacts across spatial, temporal, field-level, comparative and reporting workflows. This work establishes a rigorous computational basis for interpreting TENG mechanisms and provides reproducible research infrastructure for simulation and physics-guided device design.

physics.app-ph↗

arXiv2026

ORCH: many analyses, one merge-a deterministic multi-agent orchestrator for discrete-choice reasoning with EMA-guided routing

Recent advances in large-scale language models (LLMs) have made multi-agent architectures attractive for challenging reasoning tasks. However, many existing systems rely on stochastic routing or ad-hoc heuristics, making their behavior difficult to reproduce and their decision process hard to interpret. We propose ORCH, a deterministic coordination framework for discrete-choice reasoning that orchestrates heterogeneous LLMs. ORCH follows a ``many analyses, one decision'' paradigm: multiple base models independently produce structured analyses, and a dedicated merge agent outputs the final choice. The framework uses fixed rules for task decomposition and answer aggregation, keeping the pipeline predictable, reproducible, and training-free. Determinism here refers to fixed routing and aggregation rules under a fixed evaluation protocol, rather than strict bit-level reproducibility across deployments. To exploit model complementarity, we optionally introduce an EMA-guided router that updates agent selection using historical accuracy, latency, or cost; since it relies on answer-based feedback, it is mainly intended for benchmarking, controlled evaluation, or delayed-feedback settings. Experiments on MMLU, MMLU-Pro, and GSM8K show that ORCH consistently outperforms single-model baselines and a majority-vote ensemble. On MMLU-Pro, ORCH improves accuracy by over 10 points compared to the strongest baseline, and on GSM8K it yields gains exceeding 50 points; McNemar tests confirm statistical significance. The EMA router provides an additional 0.7--2.0 point accuracy boost, and ablations show that both multi-agent collaboration and routing contribute substantially. Overall, ORCH offers a practical path toward controllable, interpretable, and deployment-ready LLM-based agent systems for discrete-choice reasoning.

cs.AI↗

arXiv2026

A Kubernetes custom scheduler based on reinforcement learning for compute-intensive pods

With the rise of cloud computing and lightweight containers, Docker has emerged as a leading technology for rapid service deployment, with Kubernetes responsible for pod orchestration. However, for compute-intensive workloads-particularly web services executing containerized machine-learning training-the default Kubernetes scheduler does not always achieve optimal placement. To address this, we propose two custom, reinforcement-learning-based schedulers, SDQN and SDQN-n, both built on the Deep Q-Network (DQN) framework. In compute-intensive scenarios, these models outperform the default Kubernetes scheduler as well as Transformer-and LSTM-based alternatives, reducing average CPU utilization per cluster node by 10%, and by over 20% when using SDQN-n. Moreover, our results show that SDQN-n approach of consolidating pods onto fewer nodes further amplifies resource savings and helps advance greener, more energy-efficient data centers.Therefore, pod scheduling must employ different strategies tailored to each scenario in order to achieve better performance.Since the reinforcement-learning components of the SDQN and SDQN-n architectures proposed in this paper can be easily tuned by adjusting their parameters, they can accommodate the requirements of various future scenarios.

cs.DC↗

arXiv2026

Automatic Adjustment of HPA Parameters and Attack Prevention in Kubernetes Using Random Forests

In this paper, HTTP status codes are used as custom metrics within the HPA as the experimental scenario. By integrating the Random Forest classification algorithm from machine learning, attacks are assessed and predicted, dynamically adjusting the maximum pod parameter in the HPA to manage attack traffic. This approach enables the adjustment of HPA parameters using machine learning scripts in targeted attack scenarios while effectively managing attack traffic. All access from attacking IPs is redirected to honeypot pods, achieving a lower incidence of 5XX status codes through HPA pod adjustments under high load conditions. This method also ensures effective isolation of attack traffic, preventing excessive HPA expansion due to attacks. Additionally, experiments conducted under various conditions demonstrate the importance of setting appropriate thresholds for HPA adjustments.

cs.CR↗