Searcharxiv⌕ Search

arXiv subjects

Shan Zhang

Publications and source records attributed to Shan Zhang.

At least 37 records · Page 2Linked to original sources

Turing Pattern Engineering Enables Kinetically Ultrastable yet Ductile Metallic Glasses

Enhancing the kinetic stability of glasses often necessitates deepening thermodynamic stability, which typically compromises ductility due to increased structural rigidity. Decoupling these properties remains a critical challenge for functional applications. Here, we demonstrate that pattern engineering in metallic glasses (MGs) enables unprecedented kinetic ultrastability while retaining thermodynamic metastability and intrinsic plasticity. Through atomistic simulations guided by machine-learning interatomic potentials and replica-exchange molecular dynamics, we reveal that clustering oxygen contents, driven by reaction-diffusion-coupled pattern dynamics, act as localized pinning sites. These motifs drastically slow structural relaxation, yielding kinetic stability comparable to crystal-like ultrastable glasses while retaining an energetic as-cast state. Remarkably, the thermodynamically metastable state preserves heterogeneous atomic mobility, allowing strain delocalization under mechanical stress. By tailoring oxygen modulation via geometric patterning, we achieve an approximately 200 K increase in the onset temperature of the glass transition (Tonset) while maintaining fracture toughness akin to conventional MGs. This work establishes a paradigm of kinetic stabilization without thermodynamic compromise, offering a roadmap to additively manufacture bulk amorphous materials with combined hyperstability and plasticity.

cond-mat.mtrl-sci↗

Math Blind: Failures in Diagram Understanding Undermine Reasoning in MLLMs

Diagrams represent a form of visual language that encodes abstract concepts and relationships through structured symbols and their spatial arrangements. Unlike natural images, they are inherently symbolic, and entirely artificial. They thus pose unique challenges for Multimodal Large Language Models (MLLMs) distinct from natural image processing. Recent studies have shown that MLLMs often exhibit flawed reasoning and hallucinations when handling diagram inputs. We investigate here whether these limitations stem from shortcomings in the models' ability to interpret diagrams themselves. To this end, we develop a diagnostic test suite that isolates perception from reasoning. Our systematic evaluation reveals that MLLMs perform poorly on basic perceptual tasks, e.g., shape classification, object counting, relationship identification, and object grounding, with near-zero accuracy on fine-grained grounding. Further analysis shows that weak diagram perception leads to "blind faith in text", where models rely on textual shortcuts rather than visual understanding (that is, they are Math Blind). We hypothesize that enabling models to capture the inherent structural properties of diagrams, represented as graphs of primitives and their interrelationships, is essential for improving diagram understanding. Experiments with 7B and 32B MLLMs validate this assumption, with models trained on such representations achieving a +79% gain on the grounding task. Crucially, these gains transfer to reasoning, achieving 3-4% cross-suite improvements on three public benchmarks even without additional chain-of-thought reasoning data. Our findings demonstrate that low-level perception supports faithful high-level reasoning in mathematical MLLMs. We provide both methodological frameworks and empirical evidence to guide future research in this direction.

cs.CV↗

Hierarchical Process Reward Models are Symbolic Vision Learners

Symbolic computer vision represents diagrams through explicit logical rules and structured representations, enabling interpretable understanding in machine vision. This requires fundamentally different learning paradigms from pixel-based visual models. Symbolic visual learners parse diagrams into geometric primitives-points, lines, and shapes-whereas pixel-based learners operate on textures and colors. We propose a novel self-supervised symbolic auto-encoder that encodes diagrams into structured primitives and their interrelationships within the latent space, and decodes them through our executable engine to reconstruct the input diagrams. Central to this architecture is Symbolic Hierarchical Process Reward Modeling, which applies hierarchical step-level parsing rewards to enforce point-on-line, line-on-shape, and shape-on-relation consistency. Since vanilla reinforcement learning exhibits poor exploration in the policy space during diagram reconstruction; we thus introduce stabilization mechanisms to balance exploration and exploitation. We fine-tune our symbolic encoder on downstream tasks, developing a neuro-symbolic system that integrates the reasoning capabilities of neural networks with the interpretability of symbolic models through reasoning-grounded visual rewards. Evaluations across reconstruction, perception, and reasoning tasks demonstrate the effectiveness of our approach: achieving a 98.2% reduction in MSE for geometric diagram reconstruction, surpassing GPT-4o by 0.6% with a 7B model on chart reconstruction, and improving by +13% on the MathGlance perception benchmark, and by +3% on MathVerse and GeoQA reasoning benchmarks.

cs.CV↗

VRP-SAM: SAM with Visual Reference Prompt

In this paper, we propose a novel Visual Reference Prompt (VRP) encoder that empowers the Segment Anything Model (SAM) to utilize annotated reference images as prompts for segmentation, creating the VRP-SAM model. In essence, VRP-SAM can utilize annotated reference images to comprehend specific objects and perform segmentation of specific objects in target image. It is note that the VRP encoder can support a variety of annotation formats for reference images, including \textbf{point}, \textbf{box}, \textbf{scribble}, and \textbf{mask}. VRP-SAM achieves a breakthrough within the SAM framework by extending its versatility and applicability while preserving SAM's inherent strengths, thus enhancing user-friendliness. To enhance the generalization ability of VRP-SAM, the VRP encoder adopts a meta-learning strategy. To validate the effectiveness of VRP-SAM, we conducted extensive empirical studies on the Pascal and COCO datasets. Remarkably, VRP-SAM achieved state-of-the-art performance in visual reference segmentation with minimal learnable parameters. Furthermore, VRP-SAM demonstrates strong generalization capabilities, allowing it to perform segmentation of unseen objects and enabling cross-domain segmentation. The source code and models will be available at https://github.com/syp2ysy/VRP-SAM

cs.CV↗

DETree: DEtecting Human-AI Collaborative Texts via Tree-Structured Hierarchical Representation Learning

Detecting AI-involved text is essential for combating misinformation, plagiarism, and academic misconduct. However, AI text generation includes diverse collaborative processes (AI-written text edited by humans, human-written text edited by AI, and AI-generated text refined by other AI), where various or even new LLMs could be involved. Texts generated through these varied processes exhibit complex characteristics, presenting significant challenges for detection. Current methods model these processes rather crudely, primarily employing binary classification (purely human vs. AI-involved) or multi-classification (treating human-AI collaboration as a new class). We observe that representations of texts generated through different processes exhibit inherent clustering relationships. Therefore, we propose DETree, a novel approach that models the relationships among different processes as a Hierarchical Affinity Tree structure, and introduces a specialized loss function that aligns text representations with this tree. To facilitate this learning, we developed RealBench, a comprehensive benchmark dataset that automatically incorporates a wide spectrum of hybrid texts produced through various human-AI collaboration processes. Our method improves performance in hybrid text detection tasks and significantly enhances robustness and generalization in out-of-distribution scenarios, particularly in few-shot learning conditions, further demonstrating the promise of training-based approaches in OOD settings. Our code and dataset are available at https://github.com/heyongxin233/DETree.

cs.CL↗

Enhanced superconductivity in PbTe-In hybrids

We report the realization of epitaxial indium thin films on PbTe nanowires. The film is continuous and forms an atomically sharp interface with PbTe. Tunneling devices reveal a hard superconducting gap. The gap size, 1.08 to 1.18 meV, is twice as large as bulk indium's ($\sim$ 0.5 meV), due to the presence of PbTe. A similar enhancement is also observed in the critical temperature of In on a PbTe substrate. Subgap peaks appear at finite magnetic fields. The effective $g$-factor (15-45) is notably enhanced compared to bare PbTe wires ($<$ 10) due to the presence of In, differing from Al-hybrids. Josephson devices exhibit gate-tunable supercurrents. The PbTe-In hybrid enhances the properties of both, the superconductivity of In and g-factors of PbTe, and thus may enable exotic phases of matter such as topological superconductivity.

cond-mat.mes-hall↗

OpenSN: An Open Source Library for Emulating LEO Satellite Networks

Low-earth-orbit (LEO) satellite constellations (e.g., Starlink) are becoming a necessary component of future Internet. There have been increasing studies on LEO satellite networking. It is a crucial problem how to evaluate these studies in a systematic and reproducible manner. In this paper, we present OpenSN, i.e., an open source library for emulating large-scale satellite network (SN). Different from Mininet-based SN emulators (e.g., LeoEM), OpenSN adopts container-based virtualization, thus allows for running distributed routing software on each node, and can achieve horizontal scalability via flexible multi-machine extension. Compared to other container-based SN emulators (e.g., StarryNet), OpenSN streamlines the interaction with Docker command line interface and significantly reduces unnecessary operations of creating virtual links. These modifications improve emulation efficiency and vertical scalability on a single machine. Furthermore, OpenSN separates user-defined configuration from container network management via a Key-Value Database that records the necessary information for SN emulation. Such a separation architecture enhances the function extensibility. To sum up, OpenSN exhibits advantages in efficiency, scalability, and extensibility, thus is a valuable open source library that empowers research on LEO satellite networking. Experiment results show that OpenSN constructs mega-constellations 5X-10X faster than StarryNet, and updates link state 2X-4X faster than LeoEM. We also verify the scalability of OpenSN by successfully emulating the five-shell Starlink constellation with a total of 4408 satellites.

cs.NI↗

ARCHED: A Human-Centered Framework for Transparent, Responsible, and Collaborative AI-Assisted Instructional Design

Integrating Large Language Models (LLMs) in educational technology presents unprecedented opportunities to improve instructional design (ID), yet existing approaches often prioritize automation over pedagogical rigor and human agency. This paper introduces ARCHED (AI for Responsible, Collaborative, Human-centered Education Instructional Design), a structured multi-stage framework that ensures human educators remain central in the design process while leveraging AI capabilities. Unlike traditional AI-generated instructional materials that lack transparency, ARCHED employs a cascaded workflow aligned with Bloom's taxonomy. The framework integrates specialized AI agents - one generating diverse pedagogical options and another evaluating alignment with learning objectives - while maintaining educators as primary decision-makers. This approach addresses key limitations in current AI-assisted instructional design, ensuring transparency, pedagogical foundation, and meaningful human agency. Empirical evaluations demonstrate that ARCHED enhances instructional design quality while preserving educator oversight, marking a step forward in responsible AI integration in education.

cs.CY↗

Open Eyes, Then Reason: Fine-grained Visual Mathematical Understanding in MLLMs

Current multimodal large language models (MLLMs) often underperform on mathematical problem-solving tasks that require fine-grained visual understanding. The limitation is largely attributable to inadequate perception of geometric primitives during image-level contrastive pre-training (e.g., CLIP). While recent efforts to improve math MLLMs have focused on scaling up mathematical visual instruction datasets and employing stronger LLM backbones, they often overlook persistent errors in visual recognition. In this paper, we systematically evaluate the visual grounding capabilities of state-of-the-art MLLMs and reveal a significant negative correlation between visual grounding accuracy and problem-solving performance, underscoring the critical role of fine-grained visual understanding. Notably, advanced models like GPT-4o exhibit a 70% error rate when identifying geometric entities, highlighting that this remains a key bottleneck in visual mathematical reasoning. To address this, we propose a novel approach, SVE-Math (Selective Vision-Enhanced Mathematical MLLM), featuring a geometric-grounded vision encoder and a feature router that dynamically adjusts the contribution of hierarchical visual feature maps. Our model recognizes accurate visual primitives and generates precise visual prompts tailored to the language model's reasoning needs. In experiments, SVE-Math-Qwen2.5-7B outperforms other 7B models by 15% on MathVerse and is compatible with GPT-4V on MathVista. Despite being trained on smaller datasets, SVE-Math-7B achieves competitive performance on GeoQA, rivaling models trained on significantly larger datasets. Our findings emphasize the importance of incorporating fine-grained visual understanding into MLLMs and provide a promising direction for future research.

cs.CV↗

Reducing disorder in PbTe nanowires for Majorana research

Material challenges are the key issue in Majorana research where surface disorder constrains device performance. Here, we tackle this challenge by embedding PbTe nanowires within a lattice-constant-matched crystal. The wire edges are shaped by self-organized growth instead of lithography, resulting in nearly-atomic-flat facets along both cross-sectional and longitudinal directions. Quantized conductance is observed at zero magnetic field with channel lengths maximally reaching 1.7 $μ$m, significantly surpassing the state-of-the-art of III-V nanowires (an order-of-magnitude improvement compared to InSb). Coupling PbTe to a Pb film unveils a flat interface spanning microns and a large superconducting gap of 1 meV. Our result not only represents a stride toward meeting the stringent low-disorder requirement for Majoranas, but may also open the door to various hybrid quantum devices requiring a low level of disorder.

cond-mat.mes-hall↗

Anisotropy of PbTe nanowires with and without a superconductor

We investigate the anisotropic behaviors in PbTe and PbTe-Pb hybrid nanowires. In previous studies on PbTe, wire-to-wire variations in anisotropy indicate poor device control, posing a serious challenge for applications. Here, we achieve reproducible anisotropy in PbTe nanowires through a substantial reduction of disorder. We then couple PbTe to a superconductor Pb, and observe a pronounced deviation in the anisotropy behavior compared to bare PbTe nanowires. This deviation is gate-tunable and attributed to spin-orbit interaction and orbital effect, controlled by charge transfer between Pb and PbTe. These results provide a guidance for the controlled engineering of exotic quantum states in this hybrid material platform.

cond-mat.mes-hall↗

Link-identified Routing Architecture in Space

Low earth orbit (LEO) satellite networks have the potential to provide low-latency communication with global coverage. To unleash this potential, it is crucial to achieve efficient packet delivery. In this paper, we propose a Link-identified Routing (LiR) architecture for LEO satellite networks. The LiR architecture leverages the deterministic neighbor relation of LEO constellations, and identifies each inter-satellite link (ISL). Moreover, LiR architecture adopts source-route-style forwarding based on in-packet bloom filter (BF). Each satellite could efficiently encode multiple ISL identifiers via an in-packet BF to specify the end-to-end path for the packets. Due to false positives caused by BF, the more ISLs are encoded at a time, the more redundant forwarding cases emerge. Based on the topology characteristics, we derive the expected forwarding overhead in a closed-form and propose the optimal encoding policy. To accommodate link-state changes in LEO satellite networks, we propose the on-demand rerouting scheme and the on-demand detouring scheme to address the intermittent ISLs. We also elaborate how to take advantage of LiR architecture to achieve seamless handover for ground-satellite links (GSLs). Finally, we conduct extensive numerical experiments and packet-level simulations to verify our analytical results and evaluate the performance of the LiR architecture.

cs.NI↗

DeTeCtive: Detecting AI-generated Text via Multi-Level Contrastive Learning

Current techniques for detecting AI-generated text are largely confined to manual feature crafting and supervised binary classification paradigms. These methodologies typically lead to performance bottlenecks and unsatisfactory generalizability. Consequently, these methods are often inapplicable for out-of-distribution (OOD) data and newly emerged large language models (LLMs). In this paper, we revisit the task of AI-generated text detection. We argue that the key to accomplishing this task lies in distinguishing writing styles of different authors, rather than simply classifying the text into human-written or AI-generated text. To this end, we propose DeTeCtive, a multi-task auxiliary, multi-level contrastive learning framework. DeTeCtive is designed to facilitate the learning of distinct writing styles, combined with a dense information retrieval pipeline for AI-generated text detection. Our method is compatible with a range of text encoders. Extensive experiments demonstrate that our method enhances the ability of various text encoders in detecting AI-generated text across multiple benchmarks and achieves state-of-the-art results. Notably, in OOD zero-shot evaluation, our method outperforms existing approaches by a large margin. Moreover, we find our method boasts a Training-Free Incremental Adaptation (TFIA) capability towards OOD data, further enhancing its efficacy in OOD detection scenarios. We will open-source our code and models in hopes that our work will spark new thoughts in the field of AI-generated text detection, ensuring safe application of LLMs and enhancing compliance. Our code is available at https://github.com/heyongxin233/DeTeCtive.

cs.CL↗

Marine Microplastics and Infant Health

A century of plastic usage has led to an accumulation of plastic waste in waterways and oceans. Over time, these wastes break down into particles smaller than 5 microns -- or ''microplastics'' -- which can infiltrate human biological systems. Despite decades of research into this emerging source of environmental pollution, there is a paucity of direct evidence on the health impacts of microplastics exposure at a population scale. This paper reports the first empirical link between in-utero microplastic exposure and adverse birth outcomes. Our analysis is based on a compiled dataset of 3 million births that occurred in coastal areas of 15 countries spanning four continents, which we merge with a novel remote-sensing measurements of marine microplastic concentrations. We show that in-utero exposure to microplastics, particularly during the third trimester of pregnancy, leads to a significant increase in the likelihood of low birth weight. A doubling of exposure increases low birth weight hazard by 0.37 per 1,000 births, which implies over 205,000 cases per year globally can be attributed to microplastic exposure. We further show that aerosolization -- whereby microplastic particles become airborne and inhalable due to seawater evaporation -- is an important pathway for health impact, a challenge that is likely to escalate as ocean temperatures continue to rise.

econ.GN↗

Placing Timely Refreshing Services at the Network Edge

Accommodating services at the network edge is favorable for time-sensitive applications. However, maintaining service usability is resource-consuming in terms of pulling service images to the edge, synchronizing databases of service containers, and hot updates of service modules. Accordingly, it is critical to determine which service to place based on the received user requests and service refreshing (maintaining) cost, which is usually neglected in existing studies. In this work, we study how to cooperatively place timely refreshing services and offload user requests among edge servers to minimize the backhaul transmission costs. We formulate an integer non-linear programming problem and prove its NP-hardness. This problem is highly non-tractable due to the complex spatial-and-temporal coupling effect among service placement, offloading, and refreshing costs. We first decouple the problem in the temporal domain by transforming it into a Markov shortest-path problem. We then propose a light-weighted Discounted Value Approximation (DVA) method, which further decouples the problem in the spatial domain by estimating the offloading costs among edge servers. The worst performance of DVA is proved to be bounded. 5G service placement testbed experiments and real-trace simulations show that DVA reduces the total transmission cost by up to 59.1% compared with the state-of-the-art baselines.

cs.DC↗

Towards Timely Video Analytics Services at the Network Edge

Real-time video analytics services aim to provide users with accurate recognition results timely. However, existing studies usually fall into the dilemma between reducing delay and improving accuracy. The edge computing scenario imposes strict transmission and computation resource constraints, making balancing these conflicting metrics under dynamic network conditions difficult. In this regard, we introduce the age of processed information (AoPI) concept, which quantifies the time elapsed since the generation of the latest accurately recognized frame. AoPI depicts the integrated impact of recognition accuracy, transmission, and computation efficiency. We derive closed-form expressions for AoPI under preemptive and non-preemptive computation scheduling policies w.r.t. the transmission/computation rate and recognition accuracy of video frames. We then investigate the joint problem of edge server selection, video configuration adaptation, and bandwidth/computation resource allocation to minimize the long-term average AoPI over all cameras. We propose an online method, i.e., Lyapunov-based block coordinate descent (LBCD), to solve the problem, which decouples the original problem into two subproblems to optimize the video configuration/resource allocation and edge server selection strategy separately. We prove that LBCD achieves asymptotically optimal performance. According to the testbed experiments and simulation results, LBCD reduces the average AoPI by up to 10.94X compared to state-of-the-art baselines.

cs.DC↗

Quantized Andreev conductance in semiconductor nanowires

Clean one-dimensional electron systems can exhibit quantized conductance. The plateau conductance doubles if the transport is dominated by Andreev reflection. Here, we report quantized conductance observed in both Andreev and normal-state transports in PbTe-Pb and PbTe-In hybrid nanowires. The Andreev plateau is observed at $4e^2/h$, twice of the normal plateau value of $2e^2/h$. In comparison, Andreev conductance in the best-optimized III-V nanowires is non-quantized due to mode-mixing induced dips (a disorder effect), despite the quantization of normal-state transport. The negligible mode mixing in PbTe hybrids indicates an unprecedented low-disorder transport regime for nanowire devices, beneficial for Majorana researches.

cond-mat.mes-hall↗

A semi-implicit stochastic multiscale method for radiative heat transfer problem

In this paper, we propose and analyze a new semi-implicit stochastic multiscale method for the radiative heat transfer problem with additive noise fluctuation in composite materials. In the proposed method, the strong nonlinearity term induced by heat radiation is first approximated, by a semi-implicit predictor-corrected numerical scheme, for each fixed time step, resulting in a spatially random multiscale heat transfer equation. Then, the infinite-dimensional stochastic processes are modeled and truncated using a complete orthogonal system, facilitating the reduction of the model's dimensionality in the random space. The resulting low-rank random multiscale heat transfer equation is approximated and computed by using efficient spatial basis functions based multiscale method. The main advantage of the proposed method is that it separates the computational difficulty caused by the spatial multiscale properties, the high-dimensional randomness and the strong nonlinearity of the solution, so they can be overcome separately using different strategies. The convergence analysis is carried out, and the optimal rate of convergence is also obtained for the proposed semi-implicit stochastic multiscale method. Numerical experiments on several test problems for composite materials with various microstructures are also presented to gauge the efficiency and accuracy of the proposed semi-implicit stochastic multiscale method.

math.NA↗