Search arXiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 505 records · Page 28Linked to original sources

FAST Drift Scan Survey for HI Intensity Mapping. II. Stacking-based Beam Construction of the 19-feed Array at $1.4$ GHz

Neutral hydrogen (HI) intensity mapping (IM) presents great promise for future cosmological large-scale structure surveys. However, a major challenge for HIIM cosmological studies is to accurately subtract the foreground contamination. An accurate beam model is crucial for improving the quality of foreground subtraction. In this work, we develop a stacking-based beam reconstruction method utilizing the radio continuum point sources within the drift-scan field. Based on the Five-hundred-meter Aperture Spherical radio Telescope (FAST), we employ two sets of drift-scan survey data and merge the measurements to construct the beam patterns of the 19 FAST L-band feeds. To model the beams, we utilize the Zernike polynomial (ZP), which effectively captures asymmetric features of the main beam and the different side lobes. Due to the symmetric location of the beams, the main features of the beams are closely related to the distance from the center of the feed array, e.g., as the distance increases, side lobes become more pronounced. This modeling pipeline leverages the stable drift-scan data to extract beam patterns while accounting for and excluding the reflector's changing effects. It provides a more accurate measurement beam and a more precise model beam for FAST HIIM cosmology surveys.

astro-ph.IM↗

FAST drift scan survey for HI intensity mapping: simulation on hunting HI filament with pairwise stacking

Filaments stand as pivotal structures within the cosmic web. However, direct detection of the cold gas content of the filaments remains challenging due to its inherent low brightness temperature. With the TNG hydrodynamical simulations, we demonstrate the effectiveness of isolating faint filament HI signal from the FAST HI intensity mapping (IM) survey through pairwise stacking of galaxies, which yields an average HI filament signal amplitude of $\sim 0.29\ {μ{\rm K}}$ at $z\simeq 0.1$. However, our simulations reveal a non-negligible contribution from HI-rich galaxies within or near the filaments. Particularly, the faint galaxies dominantly contribute to the extra filament HI signal. Our simulation also shows that the measurement uncertainty is produced by both thermal noise and background variation caused by brightness leakage from surrounding random galaxies. Given a fixed total observation time, a wide-field HI IM survey, which includes a large number of galaxy pairs, can simultaneously reduce thermal noise to below the filament signal level and minimize background variation to a negligible level. Through the end-to-end simulation, this work demonstrates the critical role of the galaxy pairwise stacking method in future filament HI detection, outlining a road map for filament HI detection in the next-generation HI IM surveys.

astro-ph.CO↗

Impacts of dark energy on weighing neutrinos after DESI BAO

Recently, DESI has released baryon acoustic oscillation (BAO) data, and DES has also published its five-year supernova (SN) data. These observations, combined with cosmic microwave background (CMB) data, support a dynamically evolving dark energy at a high confidence level. When using cosmological observations to weigh neutrinos, the results of weighing neutrinos will be significantly affected by the measurement of dark energy due to the degeneracy between neutrino mass and the dark-energy equation of state. Therefore, we need to understand how the dynamical evolution of dark energy in the current situation will affect the measurement of neutrino mass. In this work, we utilize these latest observations and other additional distance measurements to discuss the mutual influence between neutrinos and dark energy, then calculate the Bayes factor to compare models. We consider three neutrino mass hierarchies including degenerate hierarchy (DH), normal hierarchy (NH), and inverted hierarchy (IH), as well as three dark energy models including $Λ\rm CDM$, $w\rm CDM$, and $w_0w_a \rm CDM$ models. Cosmological data combined with the prior of particle physics experiments can provide strong to decisive evidence favoring the $w_0w_a {\rm CDM}+\sum m_ν$ model with NH. In the $w_0w_a \rm CDM$ model, using the CMB+DESI+DESY5 data, we obtain constraints on the total neutrino mass, $\sum m_ν<0.171\ \rm eV,\ 0.204\ \rm eV,\ 0.220\ \rm eV$, for DH, NH, and IH, respectively. Furthermore, taking into account the neutrino hierarchy or incorporating additional distance measurements results in a more pronounced deviation from the $Λ$CDM model for dark energy. The latter, particularly, exhibits a deviation at a confidence level that surpasses $4σ$.

astro-ph.CO↗

A Multi-Mechanism Hybrid Model of Peaked-Spectrum Radio Sources

The peaked-spectrum (PS) sources exhibit turnover characteristics in their broad radio spectra. However, the mechanism underlying this phenomenon remains elusive. The two most common hypotheses are synchrotron self-absorption (SSA) and free-free absorption (FFA). By incorporating multiple absorption scenarios, we propose a multi-mechanism hybrid (MMH) model, which aligns well with current observational data and provides a good physical explanation. Using the GLEAM survey data, we identified a sample of 4,315 sources with peak frequencies approximately between 72--3000 MHz, most of which are MHz-peaked-spectrum sources (MPS). Our analysis shows that instead of SSA, the FFA is the dominant mechanism in producing the spectral turnover for most of the sources in this sample. The index of the optically thick spectrum alpha_thick has a lower boundary due to the FFA, and the steeper alpha_thick indicates a complex multi-absorption mechanism. In particular, the external FFA produces substantial alpha_thick, which exhibits a weak correlation with the peak frequency. Future ultra-long wavelength observations would also provide data on the spectrum of these sources at even lower frequencies. Determining the absorption mechanism that shaped the spectrum of these sources would be a crucial part of understanding their nature.

astro-ph.GA↗

Odd coloring of 2-boundary planar graphs and beyond

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring of a graph is odd if every non-isolated vertex has some color that appears an odd number of times on its neighborhood. Petruševski and Škrekovski conjectured in 2022 that every planar graph admits an odd 5-coloring. We confirm this conjecture for 2-boundary planar graphs. Moreover, we present several questions regarding 2-boundary planar graphs that are of independent interest.

math.CO↗

SmartFL: Semantics Based Probabilistic Fault Localization

Testing-based fault localization has been a research focus in software engineering in the past decades. It localizes faulty program elements based on a set of passing and failing test executions. Since whether a fault could be triggered and detected by a test is related to program semantics, it is crucial to model program semantics in fault localization approaches. Existing approaches either consider the full semantics of the program (e.g., mutation-based fault localization and angelic debugging), leading to scalability issues, or ignore the semantics of the program (e.g., spectrum-based fault localization), leading to imprecise localization results. Our key idea is: by modeling only the correctness of program values but not their full semantics, a balance could be reached between effectiveness and scalability. To realize this idea, we introduce a probabilistic model by efficient approximation of program semantics and several techniques to address scalability challenges. Our approach, SmartFL(SeMantics bAsed pRobabilisTic Fault Localization), is evaluated on a real-world dataset, Defects4J 2.0. The top-1 statement-level accuracy of our approach is {14\%}, which improves 130\% over the best SBFL and MBFL methods. The average time cost is {205} seconds per fault, which is half of SBFL methods. After combining our approach with existing approaches using the CombineFL framework, the performance of the combined approach is significantly boosted by an average of 10\% on top-1, top-3, and top-5 accuracy compared to state-of-the-art combination methods.

cs.SE↗

GME: Improving Universal Multimodal Retrieval by Multimodal LLMs

Universal Multimodal Retrieval (UMR) aims to enable search across various modalities using a unified model, where queries and candidates can consist of pure text, images, or a combination of both. Previous work has attempted to adopt multimodal large language models (MLLMs) to realize UMR using only text data. However, our preliminary experiments demonstrate that more diverse multimodal training data can further unlock the potential of MLLMs. Despite its effectiveness, the existing multimodal training data is highly imbalanced in terms of modality, which motivates us to develop a training data synthesis pipeline and construct a large-scale, high-quality fused-modal training dataset. Based on the synthetic training data, we develop the General Multimodal Embedder (GME), an MLLM-based dense retriever designed for UMR. Furthermore, we construct a comprehensive UMR Benchmark (UMRB) to evaluate the effectiveness of our approach. Experimental results show that our method achieves state-of-the-art performance among existing UMR methods. Last, we provide in-depth analyses of model scaling and training strategies, and perform ablation studies on both the model and synthetic data.

cs.CL↗

MuseFace: Text-driven Face Editing via Diffusion-based Mask Generation Approach

Face editing modifies the appearance of face, which plays a key role in customization and enhancement of personal images. Although much work have achieved remarkable success in text-driven face editing, they still face significant challenges as none of them simultaneously fulfill the characteristics of diversity, controllability and flexibility. To address this challenge, we propose MuseFace, a text-driven face editing framework, which relies solely on text prompt to enable face editing. Specifically, MuseFace integrates a Text-to-Mask diffusion model and a semantic-aware face editing model, capable of directly generating fine-grained semantic masks from text and performing face editing. The Text-to-Mask diffusion model provides \textit{diversity} and \textit{flexibility} to the framework, while the semantic-aware face editing model ensures \textit{controllability} of the framework. Our framework can create fine-grained semantic masks, making precise face editing possible, and significantly enhancing the controllability and flexibility of face editing models. Extensive experiments demonstrate that MuseFace achieves superior high-fidelity performance.

cs.CV↗

Object Isolated Attention for Consistent Story Visualization

Open-ended story visualization is a challenging task that involves generating coherent image sequences from a given storyline. One of the main difficulties is maintaining character consistency while creating natural and contextually fitting scenes--an area where many existing methods struggle. In this paper, we propose an enhanced Transformer module that uses separate self attention and cross attention mechanisms, leveraging prior knowledge from pre-trained diffusion models to ensure logical scene creation. The isolated self attention mechanism improves character consistency by refining attention maps to reduce focus on irrelevant areas and highlight key features of the same character. Meanwhile, the isolated cross attention mechanism independently processes each character's features, avoiding feature fusion and further strengthening consistency. Notably, our method is training-free, allowing the continuous generation of new characters and storylines without re-tuning. Both qualitative and quantitative evaluations show that our approach outperforms current methods, demonstrating its effectiveness.

cs.CV↗

Nanohertz gravitational waves from a quasar-based supermassive black hole binary population model as dark sirens

Recently, several pulsar timing array (PTA) projects have detected evidence of the existence of a stochastic gravitational wave background (SGWB) in the nanohertz frequency band, providing confidence in detecting individual supermassive black hole binaries (SMBHBs) in the future. Nanohertz GWs emitted by inspiraling SMBHBs encode the luminosity distances of SMBHBs. They can serve as dark sirens to explore the cosmic expansion history via a statistical method to obtain the redshift information of GW sources' host galaxies using galaxy catalogs. The theoretical analysis of the dark siren method relies on the modeling of the population of SMBHBs. Using a population model consistent with the latest SGWB observations is essential, as the SGWB provides significant information about the distribution of SMBHBs. In this work, we employ a quasar-based model, which can self-consistently account for the SGWB amplitude, to estimate the population of SMBHBs. We constrain the Hubble constant using the mock GW data from different detection cases of PTAs in the future. Our results show that a PTA consisting of 100 pulsars with a white noise level of 20 ns could measure the Hubble constant with a precision close to $1\%$ over a 10-year observation period, and a PTA with 200 pulsars may achieve this goal over a 5-year observation period. The results indicate that modeling the SMBHB population significantly influences the analysis of dark sirens, and SMBHB dark sirens have the potential to be developed as a valuable cosmological probe.

astro-ph.CO↗

Molecular Insights into Yb(III) Speciation in Sulfate-Bearing Hydrothermal Fluids from X-ray Absorption Spectra Informed by ab initio Molecular Dynamics

Rare earth elements (REEs) are critical for advanced technologies, yet in hydrothermal aqueous solutions the molecular level details of their interaction with ligands that control their geochemical transport and deposition remain poorly understood. This study elucidates the coordination behavior of Yb(III) in sulfate-rich hydrothermal fluids using in situ extended X-ray absorption fine structure (EXAFS) spectroscopy and ab initio molecular dynamics (AIMD) simulations. By integrating multi-angle EXAFS with AIMD-derived constraints, we precisely resolve Yb(III) coordination structures and ligand interactions under hydrothermal conditions. At room temperature, Yb (III) is coordinated by five water molecules and two sulfate ligands (coordination number, CN = 8), forming a distorted square antiprism geometry. Increasing temperature induces progressive dehydration, reducing the hydration shell and favoring stronger sulfate complexation. At 200 Celsius, sulfate ligands reorganize around Yb(III), shifting its geometry to a capped dodecahedron (CN = 7). At 300 Celsius, sulfate binding dominates, leading to structural reorganization that parallels the onset of sulfate mineral precipitation, consistent with the retrograde solubility of REE sulfates. These findings provide direct molecular-scale evidence that sulfate acts as both a transport and deposition ligand, critically influencing REE mobility in geochemical environments. Our results can also help to refine thermodynamic models of REE speciation in high-temperature hydrothermal fluids and improve our understanding of REE ore formation processes in nature.

physics.chem-ph↗

CTSAC: Curriculum-Based Transformer Soft Actor-Critic for Goal-Oriented Robot Exploration

With the increasing demand for efficient and flexible robotic exploration solutions, Reinforcement Learning (RL) is becoming a promising approach in the field of autonomous robotic exploration. However, current RL-based exploration algorithms often face limited environmental reasoning capabilities, slow convergence rates, and substantial challenges in Sim-To-Real (S2R) transfer. To address these issues, we propose a Curriculum Learning-based Transformer Reinforcement Learning Algorithm (CTSAC) aimed at improving both exploration efficiency and transfer performance. To enhance the robot's reasoning ability, a Transformer is integrated into the perception network of the Soft Actor-Critic (SAC) framework, leveraging historical information to improve the farsightedness of the strategy. A periodic review-based curriculum learning is proposed, which enhances training efficiency while mitigating catastrophic forgetting during curriculum transitions. Training is conducted on the ROS-Gazebo continuous robotic simulation platform, with LiDAR clustering optimization to further reduce the S2R gap. Experimental results demonstrate the CTSAC algorithm outperforms the state-of-the-art non-learning and learning-based algorithms in terms of success rate and success rate-weighted exploration time. Moreover, real-world experiments validate the strong S2R transfer capabilities of CTSAC.

cs.RO↗

A robust score test in g-computation for covariate adjustment in randomized clinical trials leveraging different variance estimators via influence functions

G-computation has become a widely used robust method for estimating unconditional (marginal) treatment effects with covariate adjustment in the analysis of randomized clinical trials. Statistical inference in this context typically relies on the Wald test or Wald interval, which can be easily implemented using a consistent variance estimator. However, existing literature suggests that when sample sizes are small or when parameters of interest are near boundary values, Wald-based methods may be less reliable due to type I error rate inflation and insufficient interval coverage. In this article, we propose a robust score test for g-computation estimators in the context of two-sample treatment comparisons. The proposed test is asymptotically valid under simple and stratified (biased-coin) randomization schemes, even when regression models are misspecified. These test statistics can be conveniently computed using existing variance estimators, and the corresponding confidence intervals have closed-form expressions, making them convenient to implement. Through extensive simulations, we demonstrate the superior finite-sample performance of the proposed method. Finally, we apply the proposed method to reanalyze a completed randomized clinical trial. The new analysis using our proposed score test achieves statistical significance, whilst reducing the issue of type I error inflation.

stat.ME↗

A search for sterile neutrinos in interacting dark energy models using DESI baryon acoustic oscillations and DES supernovae data

Sterile neutrinos can influence the evolution of the universe, and thus cosmological observations can be used to search for sterile neutrinos. In this study, we utilized the latest baryon acoustic oscillations data from DESI, combined with the cosmic microwave background data from Planck and the five-year supernova data from DES, to constrain the interacting dark energy (IDE) models involving both cases of massless and massive sterile neutrinos. We consider four typical forms of the interaction term $Q=βH ρ_{\rm de}$, $Q=βH ρ_{\rm c}$, $Q=βH_{0} ρ_{\rm de}$, and $Q=βH_{0} ρ_{\rm c}$, respectively. Our analysis indicates that the current data provide only a hint of the existence of massless sterile neutrinos (as dark radiation) at about the $1σ$ level. In contrast, no evidence supports the existence of massive sterile neutrinos. Furthermore, in IDE models, the inclusion of (massless/massive) sterile neutrinos has a negligible impact on the constraint of the coupling parameter $β$. The IDE model of $Q=βH ρ_{\rm c}$ with sterile neutrinos does not favor an interaction. However, the other three IDE models with sterile neutrinos support an interaction in which dark energy decays into dark matter.

astro-ph.CO↗

Overcoming Data and Model Heterogeneities in Decentralized Federated Learning via Synthetic Anchors

Conventional Federated Learning (FL) involves collaborative training of a global model while maintaining user data privacy. One of its branches, decentralized FL, is a serverless network that allows clients to own and optimize different local models separately, which results in saving management and communication resources. Despite the promising advancements in decentralized FL, it may reduce model generalizability due to lacking a global model. In this scenario, managing data and model heterogeneity among clients becomes a crucial problem, which poses a unique challenge that must be overcome: How can every client's local model learn generalizable representation in a decentralized manner? To address this challenge, we propose a novel Decentralized FL technique by introducing Synthetic Anchors, dubbed as DeSA. Based on the theory of domain adaptation and Knowledge Distillation (KD), we theoretically and empirically show that synthesizing global anchors based on raw data distribution facilitates mutual knowledge transfer. We further design two effective regularization terms for local training: 1) REG loss that regularizes the distribution of the client's latent embedding with the anchors and 2) KD loss that enables clients to learn from others. Through extensive experiments on diverse client data distributions, we showcase the effectiveness of DeSA in enhancing both inter- and intra-domain accuracy of each client.

cs.LG↗

Enhanced Multi-Tuple Extraction for Alloys: Integrating Pointer Networks and Augmented Attention

Extracting high-quality structured information from scientific literature is crucial for advancing material design through data-driven methods. Despite the considerable research in natural language processing for dataset extraction, effective approaches for multi-tuple extraction in scientific literature remain scarce due to the complex interrelations of tuples and contextual ambiguities. In the study, we illustrate the multi-tuple extraction of mechanical properties from multi-principal-element alloys and presents a novel framework that combines an entity extraction model based on MatSciBERT with pointer networks and an allocation model utilizing inter- and intra-entity attention. Our rigorous experiments on tuple extraction demonstrate impressive F1 scores of 0.963, 0.947, 0.848, and 0.753 across datasets with 1, 2, 3, and 4 tuples, confirming the effectiveness of the model. Furthermore, an F1 score of 0.854 was achieved on a randomly curated dataset. These results highlight the model's capacity to deliver precise and structured information, offering a robust alternative to large language models and equipping researchers with essential data for fostering data-driven innovations.

cs.CL↗

M$^3$amba: CLIP-driven Mamba Model for Multi-modal Remote Sensing Classification

Multi-modal fusion holds great promise for integrating information from different modalities. However, due to a lack of consideration for modal consistency, existing multi-modal fusion methods in the field of remote sensing still face challenges of incomplete semantic information and low computational efficiency in their fusion designs. Inspired by the observation that the visual language pre-training model CLIP can effectively extract strong semantic information from visual features, we propose M$^3$amba, a novel end-to-end CLIP-driven Mamba model for multi-modal fusion to address these challenges. Specifically, we introduce CLIP-driven modality-specific adapters in the fusion architecture to avoid the bias of understanding specific domains caused by direct inference, making the original CLIP encoder modality-specific perception. This unified framework enables minimal training to achieve a comprehensive semantic understanding of different modalities, thereby guiding cross-modal feature fusion. To further enhance the consistent association between modality mappings, a multi-modal Mamba fusion architecture with linear complexity and a cross-attention module Cross-SS2D are designed, which fully considers effective and efficient information interaction to achieve complete fusion. Extensive experiments have shown that M$^3$amba has an average performance improvement of at least 5.98\% compared with the state-of-the-art methods in multi-modal hyperspectral image classification tasks in the remote sensing field, while also demonstrating excellent training efficiency, achieving a double improvement in accuracy and efficiency. The code is released at https://github.com/kaka-Cao/M3amba.

cs.CV↗

Distributed quantum algorithm for the dihedral hidden subgroup problem

To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original function into multiple subfunctions and distributing them to multiple quantum nodes for parallel processing, the algorithm significantly reduces the quantum circuit depth and qubit requirements for individual nodes. Theoretical analysis shows that when $n\gg t$ ($t$ is the number of quantum nodes), the time complexity of the distributed version is optimized from $2^{O(\sqrt{n})}$ (the traditional algorithm's complexity) to $2^{o(\sqrt{n-t})}$. Furthermore, we carried out the simulation on the Qiskit platform, and the accuracy of the algorithm is verified. Compared to the original algorithm, the distributed version not only reduces the influence of circuit depth and noise, but also improves the probability of measurement success.

quant-ph↗