Searcharxiv⌕ Search

arXiv subjects

Hao Wu

Publications and source records attributed to Hao Wu.

At least 271 records · Page 15Linked to original sources

Regular Cyclic $(q+1)$-Arcs in $\PG(3,2^m)$: Spectral Rigidity, Descent, and an MDS Criterion

Let $q=2^m$ with $m\ge 3$ and set $n:=q+1$. We investigate $(q+1)$-arcs $\mathcal A\subset \mathrm{PG}(3,q)$ that admit a regular cyclic subgroup $C\le \mathrm{PGL}(4,q)$ of order $n$. Over $K=\mathbb{F}_{q^2}$, such an action can be conjugated to a diagonal one, producing explicit cyclic monomial models \[ \mathcal M_a = \{[1:t:t^a:t^{a+1}]:t\in U_n\}\subset \mathrm{PG}(3,K), \qquad U_n=\{u\in K^\times:u^n=1\}, \] with $a\in(\mathbb{Z}/n\mathbb{Z})^\times$. We develop a spectral rigidity principle to obtain a precise descent criterion: $\mathcal M_a$ is $K$-projectively equivalent to a $(q+1)$-arc defined over $\mathbb{F}_q$ if and only if $a\equiv \pm 2^e \pmod n$ for some integer $e$ with $\gcd(e,m)=1$. Consequently, regular cyclic pairs $(\mathcal A,C)$ fall into exactly $φ(m)/2$ $K$-projective equivalence classes. As an immediate coding-theoretic application, we resolve the remaining AMDS/MDS dichotomy for the BCH family $\mathcal C_{(q,q+1,3,h)}$ studied by Xu et al.: $\mathcal C_{(q,q+1,3,h)}$ is MDS if and only if $2h+1\equiv \pm 2^e \pmod n$ for some $e$ with $\gcd(e,m)=1$. The underlying spectral rigidity step is formulated in a general setting for diagonal regular cyclic pairs in $\mathrm{PG}(r,K)$, providing a portable reduction of projective equivalence questions to explicit congruences on exponent data.

math.CO↗

Towards Ancient Plant Seed Classification: A Benchmark Dataset and Baseline Model

Understanding the dietary preferences of ancient societies and their evolution across periods and regions is crucial for revealing human-environment interactions. Seeds, as important archaeological artifacts, represent a fundamental subject of archaeobotanical research. However, traditional studies rely heavily on expert knowledge, which is often time-consuming and inefficient. Intelligent analysis methods have made progress in various fields of archaeology, but there remains a research gap in data and methods in archaeobotany, especially in the classification task of ancient plant seeds. To address this, we construct the first Ancient Plant Seed Image Classification (APS) dataset. It contains 8,340 images from 17 genus- or species-level seed categories excavated from 18 archaeological sites across China. In addition, we design a framework specifically for the ancient plant seed classification task (APSNet), which introduces the scale feature (size) of seeds based on learning fine-grained information to guide the network in discovering key "evidence" for sufficient classification. Specifically, we design a Size Perception and Embedding (SPE) module in the encoder part to explicitly extract size information for the purpose of complementing fine-grained information. We propose an Asynchronous Decoupled Decoding (ADD) architecture based on traditional progressive learning to decode features from both channel and spatial perspectives, enabling efficient learning of discriminative features. In both quantitative and qualitative analyses, our approach surpasses existing state-of-the-art image classification methods, achieving an accuracy of 90.5%. This demonstrates that our work provides an effective tool for large-scale, systematic archaeological research.

cs.CV↗

Step-GUI Technical Report

Recent advances in multimodal large language models unlock unprecedented opportunities for GUI automation. However, a fundamental challenge remains: how to efficiently acquire high-quality training data while maintaining annotation reliability? We introduce a self-evolving training pipeline powered by the Calibrated Step Reward System, which converts model-generated trajectories into reliable training signals through trajectory-level calibration, achieving >90% annotation accuracy with 10-100x lower cost. Leveraging this pipeline, we introduce Step-GUI, a family of models (4B/8B) that achieves state-of-the-art GUI performance (8B: 80.2% AndroidWorld, 48.5% OSWorld, 62.6% ScreenShot-Pro) while maintaining robust general capabilities. As GUI agent capabilities improve, practical deployment demands standardized interfaces across heterogeneous devices while protecting user privacy. To this end, we propose GUI-MCP, the first Model Context Protocol for GUI automation with hierarchical architecture that combines low-level atomic operations and high-level task delegation to local specialist models, enabling high-privacy execution where sensitive data stays on-device. Finally, to assess whether agents can handle authentic everyday usage, we introduce AndroidDaily, a benchmark grounded in real-world mobile usage patterns with 3146 static actions and 235 end-to-end tasks across high-frequency daily scenarios (8B: static 89.91%, end-to-end 52.50%). Our work advances the development of practical GUI agents and demonstrates strong potential for real-world deployment in everyday digital interactions.

cs.CV↗

Sharpness-aware Second-order Latent Factor Model for High-dimensional and Incomplete Data

Second-order Latent Factor (SLF) model, a class of low-rank representation learning methods, has proven effective at extracting node-to-node interaction patterns from High-dimensional and Incomplete (HDI) data. However, its optimization is notoriously difficult due to its bilinear and non-convex nature. Sharpness-aware Minimization (SAM) has recently proposed to find flat local minima when minimizing non-convex objectives, thereby improving the generalization of representation-learning models. To address this challenge, we propose a Sharpness-aware SLF (SSLF) model. SSLF embodies two key ideas: (1) acquiring second-order information via Hessian-vector products; and (2) injecting a sharpness term into the curvature (Hessian) through the designed Hessian-vector products. Experiments on multiple industrial datasets demonstrate that the proposed model consistently outperforms state-of-the-art baselines.

cs.LG↗

A Systematic Study of Code Obfuscation Against LLM-based Vulnerability Detection

As large language models (LLMs) are increasingly adopted for code vulnerability detection, their reliability and robustness across diverse vulnerability types have become a pressing concern. In traditional adversarial settings, code obfuscation has long been used as a general strategy to bypass auditing tools, preserving exploitability without tampering with the tools themselves. Numerous efforts have explored obfuscation methods and tools, yet their capabilities differ in terms of supported techniques, granularity, and programming languages, making it difficult to systematically assess their impact on LLM-based vulnerability detection. To address this gap, we provide a structured systematization of obfuscation techniques and evaluate them under a unified framework. Specifically, we categorize existing obfuscation methods into three major classes (layout, data flow, and control flow) covering 11 subcategories and 19 concrete techniques. We implement these techniques across four programming languages (Solidity, C, C++, and Python) using a consistent LLM-driven approach, and evaluate their effects on 15 LLMs spanning four model families (DeepSeek, OpenAI, Qwen, and LLaMA), as well as on two coding agents (GitHub Copilot and Codex). Our findings reveal both positive and negative impacts of code obfuscation on LLM-based vulnerability detection, highlighting conditions under which obfuscation leads to performance improvements or degradations. We further analyze these outcomes with respect to vulnerability characteristics, code properties, and model attributes. Finally, we outline several open problems and propose future directions to enhance the robustness of LLMs for real-world vulnerability detection.

cs.CR↗

Probing Scientific General Intelligence of LLMs with Scientist-Aligned Workflows

Despite advances in scientific AI, a coherent framework for Scientific General Intelligence (SGI)-the ability to autonomously conceive, investigate, and reason across scientific domains-remains lacking. We present an operational SGI definition grounded in the Practical Inquiry Model (PIM: Deliberation, Conception, Action, Perception) and operationalize it via four scientist-aligned tasks: deep research, idea generation, dry/wet experiments, and experimental reasoning. SGI-Bench comprises over 1,000 expert-curated, cross-disciplinary samples inspired by Science's 125 Big Questions, enabling systematic evaluation of state-of-the-art LLMs. Results reveal gaps: low exact match (10--20%) in deep research despite step-level alignment; ideas lacking feasibility and detail; high code executability but low execution result accuracy in dry experiments; low sequence fidelity in wet protocols; and persistent multimodal comparative-reasoning challenges. We further introduce Test-Time Reinforcement Learning (TTRL), which optimizes retrieval-augmented novelty rewards at inference, enhancing hypothesis novelty without reference answer. Together, our PIM-grounded definition, workflow-centric benchmark, and empirical insights establish a foundation for AI systems that genuinely participate in scientific discovery.

cs.AI↗

NeuralOGCM: Differentiable Ocean Modeling with Learnable Physics

High-precision scientific simulation faces a long-standing trade-off between computational efficiency and physical fidelity. To address this challenge, we propose NeuralOGCM, an ocean modeling framework that fuses differentiable programming with deep learning. At the core of NeuralOGCM is a fully differentiable dynamical solver, which leverages physics knowledge as its core inductive bias. The learnable physics integration captures large-scale, deterministic physical evolution, and transforms key physical parameters (e.g., diffusion coefficients) into learnable parameters, enabling the model to autonomously optimize its physical core via end-to-end training. Concurrently, a deep neural network learns to correct for subgrid-scale processes and discretization errors not captured by the physics model. Both components work in synergy, with their outputs integrated by a unified ODE solver. Experiments demonstrate that NeuralOGCM maintains long-term stability and physical consistency, significantly outperforming traditional numerical models in speed and pure AI baselines in accuracy. Our work paves a new path for building fast, stable, and physically-plausible models for scientific computing.

cs.LG↗

Large Excursions of Reflected Lévy Processes: Asymptotic Shapes

This paper primarily investigates the geometric properties of excursions of Lévy processes reflected at the past infimum with long lifetime or large height. For an oscillating process in the domain of attraction of a stable law, our results state that excursions with a long lifetime need not have a large height. After a suitable scaling, they behave like stable excursions with lifetime or height greater than one. These extend the related results in Doney and Rivero [Prob. Theory Relat. Fields, 157(1) (2013) 1-45]. In contrast, for the negative-drift case we prove that under a heavy-tailed condition, long lifetime and large height are asymptotically equivalent. Conditioned on either event, excursions converge under spatial scaling to a single-jump process with Pareto-distributed jump size and size-biased jump time. Moreover, after a suitable time rescaling, the effect of the negative drift becomes apparent.

math.PR↗

Watt-level coherent microwave emission from dissipation engineered solid-state quantum batteries

Recently proposed metastability-induced quantum batteries have shown particular promise for coherent microwave generation. However, achieving high-power coherent microwave generation in quantum batteries remains fundamentally challenging due to quantum correlations, aging, and self-discharging processes. For the cavity-quantum-electrodynamics (CQED)-based quantum batteries, a further trade-off arises between strong spin-photon coupling for energy storage and sufficient output coupling for power delivery. To overcome these constraints, we introduce dissipation engineering as a dynamic control strategy that temporally separates energy storage and release. By suppressing emission during charging and rapidly enhancing the output coupling during discharging, we realize nanosecond microwave bursts with watt-level peak power. By optimizing three dissipation schemes, we improve work extraction efficiency of the quantum battery by over two orders of magnitude and achieve high power compression factors outperforming the state-of-the-art techniques, establishing dissipation engineering as a pathway toward room-temperature, high-power coherent microwave sources.

quant-ph↗

MemOS: A Memory OS for AI System

Large Language Models (LLMs) have become an essential infrastructure for Artificial General Intelligence (AGI), yet their lack of well-defined memory management systems hinders the development of long-context reasoning, continual personalization, and knowledge consistency.Existing models mainly rely on static parameters and short-lived contextual states, limiting their ability to track user preferences or update knowledge over extended periods.While Retrieval-Augmented Generation (RAG) introduces external knowledge in plain text, it remains a stateless workaround without lifecycle control or integration with persistent representations.Recent work has modeled the training and inference cost of LLMs from a memory hierarchy perspective, showing that introducing an explicit memory layer between parameter memory and external retrieval can substantially reduce these costs by externalizing specific knowledge. Beyond computational efficiency, LLMs face broader challenges arising from how information is distributed over time and context, requiring systems capable of managing heterogeneous knowledge spanning different temporal scales and sources. To address this challenge, we propose MemOS, a memory operating system that treats memory as a manageable system resource. It unifies the representation, scheduling, and evolution of plaintext, activation-based, and parameter-level memories, enabling cost-efficient storage and retrieval. As the basic unit, a MemCube encapsulates both memory content and metadata such as provenance and versioning. MemCubes can be composed, migrated, and fused over time, enabling flexible transitions between memory types and bridging retrieval with parameter-based learning. MemOS establishes a memory-centric system framework that brings controllability, plasticity, and evolvability to LLMs, laying the foundation for continual learning and personalized modeling.

cs.CL↗

"MCP Does Not Stand for Misuse Cryptography Protocol": Uncovering Cryptographic Misuse in Model Context Protocol at Scale

The Model Context Protocol (MCP) is rapidly emerging as the middleware for LLM-based applications, offering a standardized interface for tool integration. However, its built-in security mechanisms are minimal: while schemas and declarations prevent malformed requests, MCP provides no guarantees of authenticity or confidentiality, forcing developers to implement cryptography themselves. Such ad hoc practices are historically prone to misuse, and within MCP they threaten sensitive data and services. We present MICRYSCOPE, the first domain-specific framework for detecting cryptographic misuses in MCP implementations. MICRYSCOPE combines three key innovations: a cross-language intermediate representation that normalizes cryptographic APIs across diverse ecosystems, a hybrid dependency analysis that uncovers explicit and implicit function relationships (including insecure runtime compositions orchestrated by LLMs) and a taint-based misuse detector that tracks sensitive data flows and flags violations of established cryptographic rules. Applying MICRYSCOPE to 9,403 MCP servers, we identified 720 with cryptographic logic, of which 19.7% exhibited misuses. These flaws are concentrated in certain markets (e.g., Smithery Registry with 42% insecure servers), languages (Python at 34% misuse rate), and categories (Developer Tools and Data Science & ML accounting for over 50% of all misuses). Case studies reveal real-world consequences, including leaked API keys, insecure DES/ECB tools, and MD5-based authentication bypasses. Our study establishes the first ecosystem-wide view of cryptographic misuse in MCP and provides both tools and insights to strengthen the security foundations of this rapidly growing protocol.

cs.CR↗

TECM*: A Data-Driven Assessment to Reinforcement Learning Methods and Application to Heparin Treatment Strategy for Surgical Sepsis

Objective: Sepsis is a life-threatening condition caused by severe infection leading to acute organ dysfunction. This study proposes a data-driven metric and a continuous reward function to optimize personalized heparin therapy in surgical sepsis patients. Methods: Data from the MIMIC-IV v1.0 and eICU v2.0 databases were used for model development and evaluation. The training cohort consisted of abdominal surgery patients receiving unfractionated heparin (UFH) after postoperative sepsis onset. We introduce a new RL-based framework: converting the discrete SOFA score to a continuous cxSOFA for more nuanced state and reward functions; Second, defining "good" or "bad" strategies based on cxSOFA by a stepwise manner; Third, proposing a Treatment Effect Comparison Matrix (TECM), analogous to a confusion matrix for classification tasks, to evaluate the treatment strategies. We applied different RL algorithms, Q-Learning, DQN, DDQN, BCQ and CQL to optimize the treatment and comprehensively evaluated the framework. Results: Among the AI-derived strategies, the cxSOFA-CQL model achieved the best performance, reducing mortality from 1.83% to 0.74% with the average hospital stay from 11.11 to 9.42 days. TECM demonstrated consistent outcomes across models, highlighting robustness. Conclusion: The proposed RL framework enables interpretable and robust optimization of heparin therapy in surgical sepsis. Continuous cxSOFA scoring and TECM-based evaluation provide nuanced treatment assessment, showing promise for improving clinical outcomes and decision-support reliability.

cs.LG↗

ICAS: Detecting Training Data from Autoregressive Image Generative Models

Autoregressive image generation has witnessed rapid advancements, with prominent models such as scale-wise visual auto-regression pushing the boundaries of visual synthesis. However, these developments also raise significant concerns regarding data privacy and copyright. In response, training data detection has emerged as a critical task for identifying unauthorized data usage in model training. To better understand the vulnerability of autoregressive image generative models to such detection, we conduct the first study applying membership inference to this domain. Our approach comprises two key components: implicit classification and an adaptive score aggregation strategy. First, we compute the implicit token-wise classification score within the query image. Then we propose an adaptive score aggregation strategy to acquire a final score, which places greater emphasis on the tokens with lower scores. A higher final score indicates that the sample is more likely to be involved in the training set. To validate the effectiveness of our method, we adapt existing detection algorithms originally designed for LLMs to visual autoregressive models. Extensive experiments demonstrate the superiority of our method in both class-conditional and text-to-image scenarios. Moreover, our approach exhibits strong robustness and generalization under various data transformations. Furthermore, sufficient experiments suggest two novel key findings: (1) A linear scaling law on membership inference, exposing the vulnerability of large foundation models. (2) Training data from scale-wise visual autoregressive models is easier to detect than other autoregressive paradigms. Our code is available at https://github.com/Chrisqcwx/ImageAR-MIA.

cs.CV↗

Global Weak Solutions of a Thermodynamically Consistent Diffuse Interface Model for Nonhomogeneous Incompressible Two-phase Flows with a Soluble Surfactant

We study a thermodynamically consistent diffuse interface model that describes the motion of a two-phase flow of two viscous incompressible Newtonian fluids with unmatched densities and a soluble surfactant in a bounded domain of two or three dimensions. The resulting hydrodynamic system consists of a nonhomogeneous Navier-Stokes system for the (volume averaged) velocity $\mathbf{u}$ and a coupled Cahn-Hilliard system for the phase-field variables $ϕ$ and $ψ$ that represent the difference in volume fractions of the binary fluids and the surfactant concentration, respectively. For the initial boundary value problem with physically relevant singular potentials subject to a no-slip boundary condition for the fluid velocity and homogeneous Neumann boundary conditions for the phase-field variables and the chemical potentials, we first establish the existence of global weak solutions in the case of non-degenerate mobilities based on a suitable semi-implicit time discretization. Next, we prove the existence of global weak solutions for a class of general degenerate mobilities, with the aid of a new type of approximations for both the mobilities and the singular parts of the potential densities.

math.AP↗

Data-constrained magnetohydrodynamic simulation of global solar corona including solar wind effects within 2.5 $R_\odot$

Total solar eclipses (TSEs) provide a unique opportunity to observe the large-scale solar corona. The solar wind plays an important role in forming the large-scale coronal structure and magnetohydrodynamic (MHD) simulations are used to reproduce it for further studying coronal mass ejections (CMEs). We conduct a data-constrained MHD simulation of the global solar corona including solar wind effects of the 2024 April 8 TSE with observed magnetograms using the Message Passing Interface Adaptive Mesh Refinement Versatile Advection Code (MPI-AMRVAC) within 2.5 $R_\odot$. This TSE happened within the solar maximum, hence the global corona was highly structured. Our MHD simulation includes the energy equation with a reduced polytropic index $γ=1.05$. We compare the global magnetic field for multiple magnetograms and use synchronic frames from the Solar Dynamics Observatory/Helioseismic and Magnetic Imager to initialize the magnetic field configuration from a magneto-frictionally equilibrium solution, called the Outflow field. We detail the initial and boundary conditions employed to time-advance the full set of ideal MHD equations such that the global corona is relaxed to a steady state. The magnetic field, the velocity field, and distributions of the density and thermal pressure are successfully reproduced. We demonstrate direct comparisons with TSE images in white-light and Fe XIV emission augmented with quasi-separatrix layers, the integrated current density, and the synthetic white-light radiation, and find a good agreement between simulations and observations. This provides a fundamental background for future simulations to study the triggering and acceleration mechanisms of CMEs under solar wind effects.

astro-ph.SR↗

Think How Your Teammates Think: Active Inference Can Benefit Decentralized Execution

In multi-agent systems, explicit cognition of teammates' decision logic serves as a critical factor in facilitating coordination. Communication (i.e., ``\textit{Tell}'') can assist in the cognitive development process by information dissemination, yet it is inevitably subject to real-world constraints such as noise, latency, and attacks. Therefore, building the understanding of teammates' decisions without communication remains challenging. To address this, we propose a novel non-communication MARL framework that realizes the construction of cognition through local observation-based modeling (i.e., \textit{``Think''}). Our framework enables agents to model teammates' \textbf{active inference} process. At first, the proposed method produces three teammate portraits: perception-belief-action. Specifically, we model the teammate's decision process as follows: 1) Perception: observing environments; 2) Belief: forming beliefs; 3) Action: making decisions. Then, we selectively integrate the belief portrait into the decision process based on the accuracy and relevance of the perception portrait. This enables the selection of cooperative teammates and facilitates effective collaboration. Extensive experiments on the SMAC, SMACv2, MPE, and GRF benchmarks demonstrate the superior performance of our method.

cs.MA↗

Recovering discontinuous viscosity coefficients for inverse Stokes problems by boundary measurements

In this paper, we investigate the inverse Stokes problem of determining a discontinuous viscosity coefficient $μ$ in a bounded domain $Ω\subset\mathbb{R}^3$. By analyzing the singularity of the Dirichlet Green's functions in $H^1$-norm and constructing a specifically coupled Stokes-Brinkman system in a localized domain, we prove a global uniqueness theorem that the viscosity coefficient $μ$ can be uniquely determined from boundary measurements.

math.AP↗