Searcharxiv⌕ Search

arXiv subjects

Xu Zhang

Publications and source records attributed to Xu Zhang.

At least 235 records · Page 13Linked to original sources

Evidence for multiband gapless superconductivity in the topological superconductor candidate 4Hb-TaS2

We present the ultralow-temperature thermal conductivity measurements on single crystals of transition-metal dichalcogenide material 4Hb-TaS$_{2}$, which has recently been proposed as a topological superconductor candidate. In zero field, a small residual linear term $κ_{0}/T$ is observed, indicating the existence of a residual density of states in the superconducting state. The slow field dependence of $κ_{0}/T$ at low fields rules out the presence of nodes in the superconducting gap, and the S-shaped field dependence across the full field range suggests multiple superconducting gaps in 4Hb-TaS$_{2}$. Our results provide evidence for multiband gapless superconductivity in 4Hb-TaS$_{2}$, and the residual density of states come from certain gapless Fermi surfaces.

cond-mat.supr-con↗

Elucidating the thermal spike effect by using a coupled classical oscillator model

Atomic heating is a fundamental phenomenon governed by the thermal spike effect during energetic deposition. This work presented another insight into thermal spike using a coupled classical oscillator model instead of a typical heat diffusion model. The temperature profile of deposited atoms was replaced by oscillator amplitude as an energy descriptor. Solving associated partial differential equations (PDEs)suggests the efficiency of energy transfer from the coupled hot to cold oscillators essentially relies on the atomic distance r and the spring constant k. The solution towards the damped wave equation further emphasize that a localized thermal fluctuation during energy propagation.

physics.comp-ph↗

A convenient setting for infinite-dimensional analysis

In this work, we propose a convenient framework for infinite-dimensional analysis (including both real and complex analysis in infinite dimensions), in which differentiation (in some weak sense) and integration operations can be easily performed, integration by parts can be conveniently established under rather weak conditions, and especially some nice properties and consequences obtained by convolution in Euclidean spaces can be extended to infinite-dimensional spaces in some sense by taking the limit. Compared to the existing tools in infinite-dimensional analysis, our setting enjoys more convenient and clearer links with that of finite dimensions, and hence it is more suitable for computation and studying some analysis problems in infinite-dimensional spaces.

math.FA↗

Constrained Online Recursive Source Separation Framework for Real-time Electrophysiological Signal Processing

Background and Objective: Processing electrophysiological signals often requires blind source separation (BSS) due to the nature of mixing source signals. However, its complex computational demands make real-time BSS challenging. The objective of this work is to develop an advanced real-time BSS method suitable for processing electrophysiological signals. Methods: In this paper, a novel BSS framework termed constrained online recursive source separation (CORSS) was proposed. In the framework, a stepwise recursive unmixing matrix learning rule was adopted to enable real-time updates with minimal computational cost. Moreover, by incorporating prior information of target signals to optimize the cost function, the framework algorithm was more likely to converge to the target sources. To validate its performance, the proposed framework was applied to both downstream tasks, namely real-time surface electromyogram (sEMG) decomposition and real-time respiratory intent monitoring based on diaphragmatic electromyogram (sEMGdi) extraction. Results: The proposed method achieved a matching rate of 96.00 % for the sEMG decomposition task and 98.12 % for the sEMGdi extraction task, exhibiting superior performance over other comparison methods (p < 0.05). Our method also exhibited minimal time delay during computation, with only 12.5 ms delay when the block size was 0.1s, demonstrating its good capabilities in online processing. Conclusions: The proposed method was demonstrated to enable real-time BSS with both improved separation performance and low computational latency. It is of substantial importance for real-time electrophysiological signal processing and applications towards advanced neural-machine interaction and clinical monitoring.

cs.HC↗

Noninvasive Extraction of Maternal and Fetal Electrocardiograms Using Progressive Periodic Source Peel-off

Abdominal electrocardiogram (AECG) gives a safe and non-invasive way to monitor fetal well-being during pregnancy using surface electrodes. However, it is challenging to extract weak fetal ECG (fECG) from the AECG recordings with larger maternal ECG (mECG) and external noises. In this study, we introduce a novel progressive periodic source peel-off (PPSP) method for extracting periodic ECG sources from multi-channel AECG recordings, including three main modules: 1) A periodic constrained FastICA (PCFICA) module with ECG physiology-informed constraints for extracting precise ECG spike trains, 2) A singular value decomposition module for estimating ECG waveforms, and 3) A peel-off strategy that facilitates to discern weak fECG source by eliminating previously separated sources or noises. The performance of the PPSP method was examined on two public databases, synthetic data and our clinical data. For extracting fECG spike trains, our PPSP method achieved an F1-scores of 99.59% on public data, 99.50% on synthetic data at the highest noise level. It further yielded the lowest RMSE of fetal heart rate of 6.20% on clinical data. It significantly outperformed other state-of-the-art methods on any set of data (p < 0.05). This study demonstrated effectiveness of the PPSP method for extracting and separating mECG and weak fECG signals, with high precision especially at high noise levels. Our study promotes noninvasive measurement and intelligent monitoring of both fetal and maternal heart activities towards advanced healthcare in perinatal medicine.

physics.med-ph↗

A constant potential reactor framework for electrochemical reaction simulations

Understanding the evolution of electrified solid-liquid interfaces during electrochemical reactions is crucial. However, capturing the dynamic behavior of the interfaces with high temporal resolution and accuracy over long timescales remains a major challenge for both experimental and computational techniques. Here, we present a constant potential reactor framework that enables the simulation of electrochemical reactions with ab initio accuracy over extended timescales, allowing for real-time atomic scale observations for the electrified solid-liquid interface evolution. By implementing an enhanced sampling active learning protocol, we develop fast, accurate, and scalable neural network potentials that generalize across systems with varying electron counts, based on high-throughput density functional theory computations within an explicit-implicit hybrid solvent model. The simulation of reactions in realistic electrochemical environments uncovers the intrinsic mechanisms through which alkali metal cations promote CO2 adsorption and suppress the hydrogen evolution reaction. These findings align with previous experimental results and clarify previously elusive observations, offering valuable computational insights. Our framework lay the groundwork for future studies exploring the dynamic interplay between interfacial structure and reactivity in electrochemical environments.

physics.chem-ph↗

FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning

To reduce computational overhead while maintaining model performance, model pruning techniques have been proposed. Among these, structured pruning, which removes entire convolutional channels or layers, significantly enhances computational efficiency and is compatible with hardware acceleration. However, existing pruning methods that rely solely on image features or gradients often result in the retention of redundant channels, negatively impacting inference efficiency. To address this issue, this paper introduces a novel pruning method called Feature-Gradient Pruning (FGP). This approach integrates both feature-based and gradient-based information to more effectively evaluate the importance of channels across various target classes, enabling a more accurate identification of channels that are critical to model performance. Experimental results demonstrate that the proposed method improves both model compactness and practicality while maintaining stable performance. Experiments conducted across multiple tasks and datasets show that FGP significantly reduces computational costs and minimizes accuracy loss compared to existing methods, highlighting its effectiveness in optimizing pruning outcomes. The source code is available at: https://github.com/FGP-code/FGP.

cs.CV↗

QARM: Quantitative Alignment Multi-Modal Recommendation at Kuaishou

In recent years, with the significant evolution of multi-modal large models, many recommender researchers realized the potential of multi-modal information for user interest modeling. In industry, a wide-used modeling architecture is a cascading paradigm: (1) first pre-training a multi-modal model to provide omnipotent representations for downstream services; (2) The downstream recommendation model takes the multi-modal representation as additional input to fit real user-item behaviours. Although such paradigm achieves remarkable improvements, however, there still exist two problems that limit model performance: (1) Representation Unmatching: The pre-trained multi-modal model is always supervised by the classic NLP/CV tasks, while the recommendation models are supervised by real user-item interaction. As a result, the two fundamentally different tasks' goals were relatively separate, and there was a lack of consistent objective on their representations; (2) Representation Unlearning: The generated multi-modal representations are always stored in cache store and serve as extra fixed input of recommendation model, thus could not be updated by recommendation model gradient, further unfriendly for downstream training. Inspired by the two difficulties challenges in downstream tasks usage, we introduce a quantitative multi-modal framework to customize the specialized and trainable multi-modal information for different downstream models.

cs.IR↗

Content-Based Collaborative Generation for Recommender Systems

Generative models have emerged as a promising utility to enhance recommender systems. It is essential to model both item content and user-item collaborative interactions in a unified generative framework for better recommendation. Although some existing large language model (LLM)-based methods contribute to fusing content information and collaborative signals, they fundamentally rely on textual language generation, which is not fully aligned with the recommendation task. How to integrate content knowledge and collaborative interaction signals in a generative framework tailored for item recommendation is still an open research challenge. In this paper, we propose content-based collaborative generation for recommender systems, namely ColaRec. ColaRec is a sequence-to-sequence framework which is tailored for directly generating the recommended item identifier. Precisely, the input sequence comprises data pertaining to the user's interacted items, and the output sequence represents the generative identifier (GID) for the suggested item. To model collaborative signals, the GIDs are constructed from a pretrained collaborative filtering model, and the user is represented as the content aggregation of interacted items. To this end, ColaRec captures both collaborative signals and content information in a unified framework. Then an item indexing task is proposed to conduct the alignment between the content-based semantic space and the interaction-based collaborative space. Besides, a contrastive loss is further introduced to ensure that items with similar collaborative GIDs have similar content representations. To verify the effectiveness of ColaRec, we conduct experiments on four benchmark datasets. Empirical results demonstrate the superior performance of ColaRec.

cs.IR↗

Emergence of steady quantum transport in a superconducting processor

Non-equilibrium quantum transport is crucial to technological advances ranging from nanoelectronics to thermal management. In essence, it deals with the coherent transfer of energy and (quasi-)particles through quantum channels between thermodynamic baths. A complete understanding of quantum transport thus requires the ability to simulate and probe macroscopic and microscopic physics on equal footing. Using a superconducting quantum processor, we demonstrate the emergence of non-equilibrium steady quantum transport by emulating the baths with qubit ladders and realising steady particle currents between the baths. We experimentally show that the currents are independent of the microscopic details of bath initialisation, and their temporal fluctuations decrease rapidly with the size of the baths, emulating those predicted by thermodynamic baths. The above characteristics are experimental evidence of pure-state statistical mechanics and prethermalisation in non-equilibrium many-body quantum systems. Furthermore, by utilising precise controls and measurements with single-site resolution, we demonstrate the capability to tune steady currents by manipulating the macroscopic properties of the baths, including filling and spectral properties. Our investigation paves the way for a new generation of experimental exploration of non-equilibrium quantum transport in strongly correlated quantum matter.

quant-ph↗

DMPlug: A Plug-in Method for Solving Inverse Problems with Diffusion Models

Pretrained diffusion models (DMs) have recently been popularly used in solving inverse problems (IPs). The existing methods mostly interleave iterative steps in the reverse diffusion process and iterative steps to bring the iterates closer to satisfying the measurement constraint. However, such interleaving methods struggle to produce final results that look like natural objects of interest (i.e., manifold feasibility) and fit the measurement (i.e., measurement feasibility), especially for nonlinear IPs. Moreover, their capabilities to deal with noisy IPs with unknown types and levels of measurement noise are unknown. In this paper, we advocate viewing the reverse process in DMs as a function and propose a novel plug-in method for solving IPs using pretrained DMs, dubbed DMPlug. DMPlug addresses the issues of manifold feasibility and measurement feasibility in a principled manner, and also shows great potential for being robust to unknown types and levels of noise. Through extensive experiments across various IP tasks, including two linear and three nonlinear IPs, we demonstrate that DMPlug consistently outperforms state-of-the-art methods, often by large margins especially for nonlinear IPs. The code is available at https://github.com/sun-umn/DMPlug.

cs.LG↗

PVPUFormer: Probabilistic Visual Prompt Unified Transformer for Interactive Image Segmentation

Integration of diverse visual prompts like clicks, scribbles, and boxes in interactive image segmentation significantly facilitates users' interaction as well as improves interaction efficiency. However, existing studies primarily encode the position or pixel regions of prompts without considering the contextual areas around them, resulting in insufficient prompt feedback, which is not conducive to performance acceleration. To tackle this problem, this paper proposes a simple yet effective Probabilistic Visual Prompt Unified Transformer (PVPUFormer) for interactive image segmentation, which allows users to flexibly input diverse visual prompts with the probabilistic prompt encoding and feature post-processing to excavate sufficient and robust prompt features for performance boosting. Specifically, we first propose a Probabilistic Prompt-unified Encoder (PPuE) to generate a unified one-dimensional vector by exploring both prompt and non-prompt contextual information, offering richer feedback cues to accelerate performance improvement. On this basis, we further present a Prompt-to-Pixel Contrastive (P$^2$C) loss to accurately align both prompt and pixel features, bridging the representation gap between them to offer consistent feature representations for mask prediction. Moreover, our approach designs a Dual-cross Merging Attention (DMA) module to implement bidirectional feature interaction between image and prompt features, generating notable features for performance improvement. A comprehensive variety of experiments on several challenging datasets demonstrates that the proposed components achieve consistent improvements, yielding state-of-the-art interactive segmentation performance. Our code is available at https://github.com/XuZhang1211/PVPUFormer.

cs.CV↗

Understanding and Co-designing Photo-based Reminiscence with Older Adults

Reminiscence, the act of revisiting past memories, is crucial for self-reflection and social interaction, significantly enhancing psychological well-being, life satisfaction, and self-identity among older adults. In HCI and CSCW, there is growing interest in leveraging technology to support reminiscence for older adults. However, understanding how older adults actively use technologies for realistic and practical reminiscence in their daily lives remains limited. This paper addresses this gap by providing an in-depth, empirical understanding of technology-mediated, photo-based reminiscence among older adults. Through a two-part study involving 20 older adults, we conducted semi-structured interviews and co-design sessions to explore their use and vision of digital technologies for photo-based reminiscence activities. Based on these insights, we propose design implications to make future reminiscence technologies more accessible and empowering for older adults.

cs.HC↗

Similarity and Dissimilarity Guided Co-association Matrix Construction for Ensemble Clustering

Ensemble clustering aggregates multiple weak clusterings to achieve a more accurate and robust consensus result. The Co-Association matrix (CA matrix) based method is the mainstream ensemble clustering approach that constructs the similarity relationships between sample pairs according the weak clustering partitions to generate the final clustering result. However, the existing methods neglect that the quality of cluster is related to its size, i.e., a cluster with smaller size tends to higher accuracy. Moreover, they also do not consider the valuable dissimilarity information in the base clusterings which can reflect the varying importance of sample pairs that are completely disconnected. To this end, we propose the Similarity and Dissimilarity Guided Co-association matrix (SDGCA) to achieve ensemble clustering. First, we introduce normalized ensemble entropy to estimate the quality of each cluster, and construct a similarity matrix based on this estimation. Then, we employ the random walk to explore high-order proximity of base clusterings to construct a dissimilarity matrix. Finally, the adversarial relationship between the similarity matrix and the dissimilarity matrix is utilized to construct a promoted CA matrix for ensemble clustering. We compared our method with 13 state-of-the-art methods across 12 datasets, and the results demonstrated the superiority clustering ability and robustness of the proposed approach. The code is available at https://github.com/xuz2019/SDGCA.

cs.LG↗

MC-MKE: A Fine-Grained Multimodal Knowledge Editing Benchmark Emphasizing Modality Consistency

Multimodal large language models (MLLMs) are prone to non-factual or outdated knowledge issues, which can manifest as misreading and misrecognition errors due to the complexity of multimodal knowledge. Previous benchmarks have not systematically analyzed the performance of editing methods in correcting these two error types. To better represent and correct these errors, we decompose multimodal knowledge into its visual and textual components. Different error types correspond to different editing formats, which edit distinct parts of the multimodal knowledge. We present MC-MKE, a fine-grained Multimodal Knowledge Editing benchmark emphasizing Modality Consistency. Our benchmark facilitates independent correction of misreading and misrecognition errors by editing the corresponding knowledge component. We evaluate four multimodal knowledge editing methods on MC-MKE, revealing their limitations, particularly in terms of modality consistency. Our work highlights the challenges posed by multimodal knowledge editing and motivates further research in developing effective techniques for this task.

cs.CV↗

DFabric: Scaling Out Data Parallel Applications with CXL-Ethernet Hybrid Interconnects

Emerging interconnects, such as CXL and NVLink, have been integrated into the intra-host topology to scale more accelerators and facilitate efficient communication between them, such as GPUs. To keep pace with the accelerator's growing computing throughput, the interconnect has seen substantial enhancement in link bandwidth, e.g., 256GBps for CXL 3.0 links, which surpasses Ethernet and InfiniBand network links by an order of magnitude or more. Consequently, when data-intensive jobs, such as LLM training, scale across multiple hosts beyond the reach limit of the interconnect, the performance is significantly hindered by the limiting bandwidth of the network infrastructure. We address the problem by proposing DFabric, a two-tier interconnect architecture. We address the problem by proposing DFabric, a two-tier interconnect architecture. First, DFabric disaggregates rack's computing units with an interconnect fabric, i.e., CXL fabric, which scales at rack-level, so that they can enjoy intra-rack efficient interconnecting. Second, DFabric disaggregates NICs from hosts, and consolidates them to form a NIC pool with CXL fabric. By providing sufficient aggregated capacity comparable to interconnect bandwidth, the NIC pool bridges efficient communication across racks or beyond the reach limit of interconnect fabric. However, the local memory accessing becomes the bottleneck when enabling each host to utilize the NIC pool efficiently. To the end, DFabric builds a memory pool with sufficient bandwidth by disaggregating host local memory and adding more memory devices. We have implemented a prototype of DFabric that can run applications transparently. We validated its performance gain by running various microbenchmarks and compute-intensive applications such as DNN and graph.

cs.DC↗

Pentaquarks $P_c$ in a dynamical coupled-channel approach of $γp \to J/ψp$ reaction

We construct a dynamical coupled-channel approach to photon-induced $J/ψ$ production to search for the trace of the pentaquarks $P_c$. In this approach, the considered open-charm intermediate states are $Λ_c \bar{D}^{(*)}$ and $Σ_c \bar{D}^{(*)}$. Scattering amplitude involving $Λ_c \bar{D}^{(*)}$, $Σ_c \bar{D}^{(*)}$ and $J/ψp$ interactions is calculated from solving a set of coupled-channel integral equations. The coupled-channel interaction potentials are generated from one-boson-exchange. The pentaquarks $P_c$ are dynamically generated from the coupled-channel interactions. Moreover, the background contributions to the $P_c$ signals are assumed to be the Pomeron exchange and $σ$ exchange. The predicted total and differential cross sections of $J/ψ$ photoproduction are within the range of the data from the GlueX and $J/ψ$-$007$ experiments. It is found that the $σ$ exchange plays a crucial role for determining the very near threshold cross section. The total cross section gets enhanced due to the open-charm state rescattering in the $P_c(4312)$, $P_c(4440)$ and $P_c(4457)$ production regions, and is of order 1 nb.

hep-ph↗

Creating and controlling global Greenberger-Horne-Zeilinger entanglement on quantum processors

Greenberger-Horne-Zeilinger (GHZ) states, also known as two-component Schrödinger cats, play vital roles in the foundation of quantum physics and, more attractively, in future quantum technologies such as fault-tolerant quantum computation. Enlargement in size and coherent control of GHZ states are both crucial for harnessing entanglement in advanced computational tasks with practical advantages, which unfortunately pose tremendous challenges as GHZ states are vulnerable to noise. Here we propose a general strategy for creating, preserving, and manipulating large-scale GHZ entanglement, and demonstrate a series of experiments underlined by high-fidelity digital quantum circuits. For initialization, we employ a scalable protocol to create genuinely entangled GHZ states with up to 60 qubits, almost doubling the previous size record. For protection, we take a new perspective on discrete time crystals (DTCs), originally for exploring exotic nonequilibrium quantum matters, and embed a GHZ state into the eigenstates of a tailor-made cat scar DTC to extend its lifetime. For manipulation, we switch the DTC eigenstates with in-situ quantum gates to modify the effectiveness of the GHZ protection. Our findings establish a viable path towards coherent operations on large-scale entanglement, and further highlight superconducting processors as a promising platform to explore nonequilibrium quantum matters and emerging applications.

quant-ph↗