Searcharxiv⌕ Search

arXiv subjects

Heng Zhang

Publications and source records attributed to Heng Zhang.

At least 127 records · Page 7Linked to original sources

Exchange operation of Majorana zero modes in topological insulator-based Josephson trijunctions

Majorana zero modes are anyons obeying non-Abelian exchange statistics distinct from fermions or bosons. While significant progresses have been achieved in the past two decades in searching for these exotic excitations in solid-state systems, their non-Abelian nature remains unverified, as definitive proof requires braiding operations. Here, we report preliminarily experimental advances in creating, manipulating, and exchanging the presumed Majorana zero modes in an envelope-shaped Josephson device composed of multiple trijunctions on a topological insulator surface. We observed the signatures of in-gap states migration consistent with the expectations of the Fu-Kane model, supporting the realization of an exchange operation. This work would establish a critical pathway toward ultimately braiding Majorana zero modes in the Fu-Kane scheme of topological quantum computation.

cond-mat.mes-hall↗

OmniVIC: A Self-Improving Variable Impedance Controller with Vision-Language In-Context Learning for Safe Robotic Manipulation

We present OmniVIC, a universal variable impedance controller (VIC) enhanced by a vision language model (VLM), which improves safety and adaptation in any contact-rich robotic manipulation task to enhance safe physical interaction. Traditional VIC have shown advantages when the robot physically interacts with the environment, but lack generalization in unseen, complex, and unstructured safe interactions in universal task scenarios involving contact or uncertainty. To this end, the proposed OmniVIC interprets task context derived reasoning from images and natural language and generates adaptive impedance parameters for a VIC controller. Specifically, the core of OmniVIC is a self-improving Retrieval-Augmented Generation(RAG) and in-context learning (ICL), where RAG retrieves relevant prior experiences from a structured memory bank to inform the controller about similar past tasks, and ICL leverages these retrieved examples and the prompt of current task to query the VLM for generating context-aware and adaptive impedance parameters for the current manipulation scenario. Therefore, a self-improved RAG and ICL guarantee OmniVIC works in universal task scenarios. The impedance parameter regulation is further informed by real-time force/torque feedback to ensure interaction forces remain within safe thresholds. We demonstrate that our method outperforms baselines on a suite of complex contact-rich tasks, both in simulation and on real-world robotic tasks, with improved success rates and reduced force violations. OmniVIC takes a step towards bridging high-level semantic reasoning and low-level compliant control, enabling safer and more generalizable manipulation. Overall, the average success rate increases from 27% (baseline) to 61.4% (OmniVIC).

cs.RO↗

Online Handwritten Signature Verification Based on Temporal-Spatial Graph Attention Transformer

Handwritten signature verification is a crucial aspect of identity authentication, with applications in various domains such as finance and e-commerce. However, achieving high accuracy in signature verification remains challenging due to intra-user variability and the risk of forgery. This paper introduces a novel approach for dynamic signature verification: the Temporal-Spatial Graph Attention Transformer (TS-GATR). TS-GATR combines the Graph Attention Network (GAT) and the Gated Recurrent Unit (GRU) to model both spatial and temporal dependencies in signature data. TS-GATR enhances verification performance by representing signatures as graphs, where each node captures dynamic features (e.g. position, velocity, pressure), and by using attention mechanisms to model their complex relationships. The proposed method further employs a Dual-Graph Attention Transformer (DGATR) module, which utilizes k-step and k-nearest neighbor adjacency graphs to model local and global spatial features, respectively. To capture long-term temporal dependencies, the model integrates GRU, thereby enhancing its ability to learn dynamic features during signature verification. Comprehensive experiments conducted on benchmark datasets such as MSDS and DeepSignDB show that TS-GATR surpasses current state-of-the-art approaches, consistently achieving lower Equal Error Rates (EER) across various scenarios.

cs.CV↗

Can Representation Gaps Be the Key to Enhancing Robustness in Graph-Text Alignment?

Representation learning on text-attributed graphs (TAGs) integrates structural connectivity with rich textual semantics, enabling applications in diverse domains. Current methods largely rely on contrastive learning to maximize cross-modal similarity, assuming tighter coupling between graph and text representations improves transfer performance. However, our empirical analysis reveals that both natural gap expansion and forced gap reduction result in performance degradation by disrupting pre-trained knowledge structures and impairing generalization. This arises from the geometric incompatibility between encoders, where graph encoders capture topological patterns, while text encoders capture semantic structures. Over-alignment compresses these distinct spaces into shared subspaces, causing structure collapse that diminishes both topological reasoning and semantic understanding. We propose \textbf{LLM4GTA}, a gap-aware alignment framework that preserves representation gaps as geometric necessities for maintaining modality-specific knowledge and improving transfer performance. LLM4GTA includes an adaptive gap preservation module to prevent over-alignment by monitoring similarity evolution and an intra-modal compensation mechanism that boosts discriminative power using auxiliary classifiers in graph space. Extensive experiments show significant improvements over existing methods in zero-shot and few-shot scenarios.

cs.GR↗

H4G: Unlocking Faithful Inference for Zero-Shot Graph Learning in Hyperbolic Space

Text-attributed graphs are widely used across domains, offering rich opportunities for zero-shot learning via graph-text alignment. However, existing methods struggle with tasks requiring fine-grained pattern recognition, particularly on heterophilic graphs. Through empirical and theoretical analysis, we identify an \textbf{over-abstraction problem}: current approaches operate at excessively large hyperbolic radii, compressing multi-scale structural information into uniform high-level abstractions. This abstraction-induced information loss obscures critical local patterns essential for accurate predictions. By analyzing embeddings in hyperbolic space, we demonstrate that optimal graph learning requires \textbf{faithful preservation} of fine-grained structural details, better retained by representations positioned closer to the origin. To address this, we propose \textbf{H4G}, a framework that systematically reduces embedding radii using learnable block-diagonal scaling matrices and Möbius matrix multiplication. This approach restores access to fine-grained patterns while maintaining global receptive ability with minimal computational overhead. Experiments show H4G achieves state-of-the-art zero-shot performance with \textbf{12.8\%} improvement on heterophilic graphs and \textbf{8.4\%} on homophilic graphs, confirming that radius reduction enables faithful multi-scale representation for advancing zero-shot graph learning.

cs.LG↗

Field-free superconducting diode effect of NbSe2 induced by strain

Superconducting diodes, similar to semiconductor diodes, possess unidirectional superconducting properties and are the fundamental units for constructing superconducting quantum computing, thus attracting widespread attention. At present, most of superconducting diodes require an external magnetic field or proximity effect to break time reversal symmetry (TRS). The cases of intrinsic superconducting diode effect (SDE) under zero magnetic field are relatively scarce, and there are still some puzzles especially regarding the reasons for the TRS breaking. Here, we not only report field free SDE in NbSe2 induced by strain, but also large values of the difference of Ic+ and |Ic-| (ΔIc) of 286 μA and the superconducting diode efficiency (η) of 6.76 % are achieved. Interestingly, ΔIc varies with the magnetic field and exhibits two distinct evolutionary behaviors with B-odd or B-even symmetry in various devices. We attribute this to the selective activation of two independent, spatially-orthogonal mechanisms: a stress-induced real-space polarity and a field-induced reciprocal-space asymmetric energy bands. In general, we propose an extremely effectively method to produce field free SDE, even when the material itself does not possess field free SDE, and provide new perspectives to understand the SDE which build new avenues for superconducting quantum devices.

cond-mat.mtrl-sci↗

Automated Generation of Research Workflows from Academic Papers: A Full-text Mining Framework

The automated generation of research workflows is essential for improving the reproducibility of research and accelerating the paradigm of "AI for Science". However, existing methods typically extract merely fragmented procedural components and thus fail to capture complete research workflows. To address this gap, we propose an end-to-end framework that generates comprehensive, structured research workflows by mining full-text academic papers. As a case study in the Natural Language Processing (NLP) domain, our paragraph-centric approach first employs Positive-Unlabeled (PU) Learning with SciBERT to identify workflow-descriptive paragraphs, achieving an F1-score of 0.9772. Subsequently, we utilize Flan-T5 with prompt learning to generate workflow phrases from these paragraphs, yielding ROUGE-1, ROUGE-2, and ROUGE-L scores of 0.4543, 0.2877, and 0.4427, respectively. These phrases are then systematically categorized into data preparation, data processing, and data analysis stages using ChatGPT with few-shot learning, achieving a classification precision of 0.958. By mapping categorized phrases to their document locations in the documents, we finally generate readable visual flowcharts of the entire research workflows. This approach facilitates the analysis of workflows derived from an NLP corpus and reveals key methodological shifts over the past two decades, including the increasing emphasis on data analysis and the transition from feature engineering to ablation studies. Our work offers a validated technical framework for automated workflow generation, along with a novel, process-oriented perspective for the empirical investigation of evolving scientific paradigms. Source code and data are available at: https://github.com/ZH-heng/research_workflow.

cs.CL↗

A large language model system for the field of chemical engineering technology

The development of chemical engineering technology is a multi-stage process that encompasses laboratory research, scaling up, and industrial deployment. This process demands interdisciplinary col laboration and typically incurs significant time and economic costs. To tackle these challenges, we have developed a system based on ChemELLM in this work. This system enables users to interact freely with the chem ical engineering model, establishing a new paradigm for AI-driven in novation and accelerating technological advancements in the chemical sector.If you would like to experience our system, please visit our official website at: https://chemindustry.iflytek.com/chat.

physics.chem-ph↗

TERL: Large-Scale Multi-Target Encirclement Using Transformer-Enhanced Reinforcement Learning

Pursuit-evasion (PE) problem is a critical challenge in multi-robot systems (MRS). While reinforcement learning (RL) has shown its promise in addressing PE tasks, research has primarily focused on single-target pursuit, with limited exploration of multi-target encirclement, particularly in large-scale settings. This paper proposes a Transformer-Enhanced Reinforcement Learning (TERL) framework for large-scale multi-target encirclement. By integrating a transformer-based policy network with target selection, TERL enables robots to adaptively prioritize targets and safely coordinate robots. Results show that TERL outperforms existing RL-based methods in terms of encirclement success rate and task completion time, while maintaining good performance in large-scale scenarios. Notably, TERL, trained on small-scale scenarios (15 pursuers, 4 targets), generalizes effectively to large-scale settings (80 pursuers, 20 targets) without retraining, achieving a 100% success rate. The code and demonstration video are available at https://github.com/ApricityZ/TERL.

cs.RO↗

Monotonic normalized heat diffusion for distance-regular graphs with classical parameters of diameter $3$

We prove the monotonic normalized heat diffusion property on distance-regular graphs with classical parameters of diameter $3$. Regev and Shinkar found a Cayley graph for which this property fails. On the other hand, this property has been proved on abelian Cayley graphs, graphs with $3$ distinct eigenvalues and regular bipartite graphs with $4$ distinct eigenvalues by Price, Nica and Kubo-Namba, respectively. A distance regular graph with classical parameters of diameter $3$ has $4$ distinct eigenvalues and is not necessarily bipartite or vertex transitive.

math.CO↗

INTENTION: Inferring Tendencies of Humanoid Robot Motion Through Interactive Intuition and Grounded VLM

Traditional control and planning for robotic manipulation heavily rely on precise physical models and predefined action sequences. While effective in structured environments, such approaches often fail in real-world scenarios due to modeling inaccuracies and struggle to generalize to novel tasks. In contrast, humans intuitively interact with their surroundings, demonstrating remarkable adaptability, making efficient decisions through implicit physical understanding. In this work, we propose INTENTION, a novel framework enabling robots with learned interactive intuition and autonomous manipulation in diverse scenarios, by integrating Vision-Language Models (VLMs) based scene reasoning with interaction-driven memory. We introduce Memory Graph to record scenes from previous task interactions which embodies human-like understanding and decision-making about different tasks in real world. Meanwhile, we design an Intuitive Perceptor that extracts physical relations and affordances from visual scenes. Together, these components empower robots to infer appropriate interaction behaviors in new scenes without relying on repetitive instructions. Videos: https://robo-intention.github.io

cs.RO↗

Learning Arbitrary-Scale RAW Image Downscaling with Wavelet-based Recurrent Reconstruction

Image downscaling is critical for efficient storage and transmission of high-resolution (HR) images. Existing learning-based methods focus on performing downscaling within the sRGB domain, which typically suffers from blurred details and unexpected artifacts. RAW images, with their unprocessed photonic information, offer greater flexibility but lack specialized downscaling frameworks. In this paper, we propose a wavelet-based recurrent reconstruction framework that leverages the information lossless attribute of wavelet transformation to fulfill the arbitrary-scale RAW image downscaling in a coarse-to-fine manner, in which the Low-Frequency Arbitrary-Scale Downscaling Module (LASDM) and the High-Frequency Prediction Module (HFPM) are proposed to preserve structural and textural integrity of the reconstructed low-resolution (LR) RAW images, alongside an energy-maximization loss to align high-frequency energy between HR and LR domain. Furthermore, we introduce the Realistic Non-Integer RAW Downscaling (Real-NIRD) dataset, featuring a non-integer downscaling factor of 1.3$\times$, and incorporate it with publicly available datasets with integer factors (2$\times$, 3$\times$, 4$\times$) for comprehensive benchmarking arbitrary-scale image downscaling purposes. Extensive experiments demonstrate that our method outperforms existing state-of-the-art competitors both quantitatively and visually. The code and dataset will be released at https://github.com/RenYangSCU/ASRD.

eess.IV↗

Asymmetrical Filtering Impairments Mitigation for Digital- Subcarrier-Multiplexing Transmissions Enabled by Multiplication-free K-State Reserved Complex MLSE

We propose a multiplication-free K-state reserved complex maximum-likelihood-sequence-estimation (MLSE) to mitigate asymmetrical filtering impairments in digital-subcarrier-multiplexing transmissions. A required optical-to-noise ratio of 1.63dB over the conventional real MLSE is obtained after transmitting 90 GBaud DSCM DP-16QAM signal over 14 WSSs without multiplications.

physics.optics↗

Strichartz estimate for discrete Schrödinger equation on layered King's grid

We establish the sharp \( l^1 \to l^{\infty} \) decay estimate for the discrete Schrödinger equation (DS) on the Layered King's Grid (LKG), with a dispersive decay rate of \( \langle t \rangle^{-13/12} \), which is faster than that for $3$-dimensional lattice (\( \langle t \rangle^{-1} \), see \cite{SK05}). This decay estimate enables us to derive the corresponding Strichartz estimate via the standard Keel--Tao argument. Our approach relies on using techniques from Newton polyhedra to analyze singularities.

math.AP↗

SyncMapV2: Robust and Adaptive Unsupervised Segmentation

Human vision excels at segmenting visual cues without the need for explicit training, and it remains remarkably robust even as noise severity increases. In contrast, existing AI algorithms struggle to maintain accuracy under similar conditions. Here, we present SyncMapV2, the first to solve unsupervised segmentation with state-of-the-art robustness. SyncMapV2 exhibits a minimal drop in mIoU, only 0.01%, under digital corruption, compared to a 23.8% drop observed in SOTA methods. This superior performance extends across various types of corruption: noise (7.3% vs. 37.7%), weather (7.5% vs. 33.8%), and blur (7.0% vs. 29.5%). Notably, SyncMapV2 accomplishes this without any robust training, supervision, or loss functions. It is based on a learning paradigm that uses self-organizing dynamical equations combined with concepts from random networks. Moreover, unlike conventional methods that require re-initialization for each new input, SyncMapV2 adapts online, mimicking the continuous adaptability of human vision. Thus, we go beyond the accurate and robust results, and present the first algorithm that can do all the above online, adapting to input rather than re-initializing. In adaptability tests, SyncMapV2 demonstrates near-zero performance degradation, which motivates and fosters a new generation of robust and adaptive intelligence in the near future.

cs.CV↗

Ricci curvature, diameter and eigenvalues of amply regular graphs

Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on Terwilliger's conjecture on finiteness of amply regular graphs. Terwilliger's conjecture can be considered as a natural extension of the Bannai-Ito conjecture about distance-regular graphs confirmed by Bang, Dubickas, Koolen, and Moulton. As a consequence, we show that there are only finitely many amply regular graphs with parameters $(n,d,α,β)$ satisfying $α\leq 6β-9$. We achieve these results by a significantly improved Lin--Lu--Yau curvature estimate and new Bakry--Émery curvature estimates. We further discuss applications of our curvature estimates to bounding eigenvalues, isoperimetric constants, and expansion properties. In addition, we obtain a volume estimate, which is sharp for hypercubes.

math.DG↗

Seedance 1.0: Exploring the Boundaries of Video Generation Models

Notable breakthroughs in diffusion modeling have propelled rapid improvements in video generation, yet current foundational model still face critical challenges in simultaneously balancing prompt following, motion plausibility, and visual quality. In this report, we introduce Seedance 1.0, a high-performance and inference-efficient video foundation generation model that integrates several core technical improvements: (i) multi-source data curation augmented with precision and meaningful video captioning, enabling comprehensive learning across diverse scenarios; (ii) an efficient architecture design with proposed training paradigm, which allows for natively supporting multi-shot generation and jointly learning of both text-to-video and image-to-video tasks. (iii) carefully-optimized post-training approaches leveraging fine-grained supervised fine-tuning, and video-specific RLHF with multi-dimensional reward mechanisms for comprehensive performance improvements; (iv) excellent model acceleration achieving ~10x inference speedup through multi-stage distillation strategies and system-level optimizations. Seedance 1.0 can generate a 5-second video at 1080p resolution only with 41.4 seconds (NVIDIA-L20). Compared to state-of-the-art video generation models, Seedance 1.0 stands out with high-quality and fast video generation having superior spatiotemporal fluidity with structural stability, precise instruction adherence in complex multi-subject contexts, native multi-shot narrative coherence with consistent subject representation.

cs.CV↗

A Survey on Imitation Learning for Contact-Rich Tasks in Robotics

This paper comprehensively surveys research trends in imitation learning for contact-rich robotic tasks. Contact-rich tasks, which require complex physical interactions with the environment, represent a central challenge in robotics due to their nonlinear dynamics and sensitivity to small positional deviations. The paper examines demonstration collection methodologies, including teaching methods and sensory modalities crucial for capturing subtle interaction dynamics. We then analyze imitation learning approaches, highlighting their applications to contact-rich manipulation. Recent advances in multimodal learning and foundation models have significantly enhanced performance in complex contact tasks across industrial, household, and healthcare domains. Through systematic organization of current research and identification of challenges, this survey provides a foundation for future advancements in contact-rich robotic manipulation.

cs.RO↗