arXiv subjects

Penghui Zhang

Publications and source records attributed to Penghui Zhang.

5 recordsLinked to original sources

arXiv2026

SimpleWikiSearch: A Clean Offline Wikipedia Environment for Agentic Search

Large language model (LLM)-based agentic search systems are often evaluated as if the underlying LLM were the only component that matters, yet their measured performance also depends on the surrounding search environment: the Wikipedia snapshot, preprocessing pipeline, chunking policy, retrieval backend, tool schema, observation format, and answer submission rule. These details are frequently under-specified, making it difficult to compare results or reproduce reported baselines. We present SimpleWikiSearch, whose corpus construction, retrieval stack, tool contract, and evaluation protocol are explicit and runnable. The environment starts from a full English Wikipedia dump, cleans and chunks the corpus, builds keyword and dense retrieval indexes, and exposes a minimal tool interface consisting of \texttt{search}, \texttt{open\_url}, and \texttt{submit\_answer}. We report baseline results on six QA datasets using open-source LLMs and provide a random-300 subset for comparisons with closed-source commercial models. SimpleWikiSearch provides a domain-specific agent harness and a controlled offline environment for reproducible agentic-search evaluation. Its contribution is this specified reference setup, rather than a new agent algorithm. Code and data will be available at: https://github.com/JimXiongGM/simple_wiki_search.

cs.IR↗

arXiv2025

NTP-INT: Network Traffic Prediction-Driven In-band Network Telemetry for High-load Switches

In-band network telemetry (INT) is essential to network management due to its real-time visibility. However, because of the rapid increase in network devices and services, it has become crucial to have targeted access to detailed network information in a dynamic network environment. This paper proposes an intelligent network telemetry system called NTP-INT to obtain more fine-grained network information on high-load switches. Specifically, NTP-INT consists of three modules: network traffic prediction module, network pruning module, and probe path planning module. Firstly, the network traffic prediction module adopts a Multi-Temporal Graph Neural Network (MTGNN) to predict future network traffic and identify high-load switches. Then, we design the network pruning algorithm to generate a subnetwork covering all high-load switches to reduce the complexity of probe path planning. Finally, the probe path planning module uses an attention-mechanism-based deep reinforcement learning (DEL) model to plan efficient probe paths in the network slice. The experimental results demonstrate that NTP-INT can acquire more precise network information on high-load switches while decreasing the control overhead by 50\%.

cs.NI↗

arXiv2023

AdapINT: A Flexible and Adaptive In-Band Network Telemetry System Based on Deep Reinforcement Learning

In-band Network Telemetry (INT) has emerged as a promising network measurement technology. However, existing network telemetry systems lack the flexibility to meet diverse telemetry requirements and are also difficult to adapt to dynamic network environments. In this paper, we propose AdapINT, a versatile and adaptive in-band network telemetry framework assisted by dual-timescale probes, including long-period auxiliary probes (APs) and short-period dynamic probes (DPs). Technically, the APs collect basic network status information, which is used for the path planning of DPs. To achieve full network coverage, we propose an auxiliary probes path deployment (APPD) algorithm based on the Depth-First-Search (DFS). The DPs collect specific network information for telemetry tasks. To ensure that the DPs can meet diverse telemetry requirements and adapt to dynamic network environments, we apply the deep reinforcement learning (DRL) technique and transfer learning method to design the dynamic probes path deployment (DPPD) algorithm. The evaluation results show that AdapINT can redesign the telemetry system according to telemetry requirements and network environments. AdapINT can reduce telemetry latency by 75\% in online games and video conferencing scenarios. For overhead-aware networks, AdapINT can reduce control overheads by 34\% in cloud computing services.

cs.NI↗

arXiv2021

Scam Pandemic: How Attackers Exploit Public Fear through Phishing

As the COVID-19 pandemic started triggering widespread lockdowns across the globe, cybercriminals did not hesitate to take advantage of users' increased usage of the Internet and their reliance on it. In this paper, we carry out a comprehensive measurement study of online social engineering attacks in the early months of the pandemic. By collecting, synthesizing, and analyzing DNS records, TLS certificates, phishing URLs, phishing website source code, phishing emails, web traffic to phishing websites, news articles, and government announcements, we track trends of phishing activity between January and May 2020 and seek to understand the key implications of the underlying trends. We find that phishing attack traffic in March and April 2020 skyrocketed up to 220\% of its pre-COVID-19 rate, far exceeding typical seasonal spikes. Attackers exploited victims' uncertainty and fear related to the pandemic through a variety of highly targeted scams, including emerging scam types against which current defenses are not sufficient as well as traditional phishing which outpaced the ecosystem's collective response.

cs.CR↗

arXiv2021

Normalized ground states for Kirchhoff equations in ${\mathbb{R}}^{3}$ with a critical nonlinearity

This paper is concerned with the existence of ground states for a class of Kirchhoff type equation with combined power nonlinearities \begin{equation*} -\left(a+b\int_{\mathbb{R}^{3}}|\nabla u(x)|^{2}\right) Δu =λu+|u|^{p-2}u+u^{5}\quad \ \text{for some} \ λ\in\mathbb{R},\quad x\in\mathbb{R}^{3}, \end{equation*} with prescribed $L^{2}$-norm mass \begin{equation*} \int_{\mathbb{R}^{3}}u^{2}=c^{2} \end{equation*} in Sobolev critical case and proves that the equation has a couple of solutions $(u_{c},λ_{c})\in S(c)\times \mathbb{R}$ for any $c>0$, $a,b >0$ and $\frac{14}{3}\leq p< 6,$ where $S(c)=\{u\in H^{1}(\mathbb{R}^{3}):\int_{\mathbb{R}^{3}}u^{2}=c^{2}\}.$ \textbf{Keywords:} Kirchhoff type equation; Critical nonlinearity; Normalized ground states \noindent{AMS Subject Classification:\, 37L05; 35B40; 35B41.}

math.AP↗