Search arXiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 613 records · Page 34Linked to original sources

Standard siren cosmology in the era of the 2.5-generation ground-based gravitational wave detectors: bright and dark sirens of LIGO Voyager and NEMO

The 2.5-generation (2.5G) ground-based gravitational wave (GW) detectors LIGO Voyager and NEMO are expected to be operational in the late 2020s and early 2030s. In this work, we explore the potential of GW standard sirens observed by the 2.5G GW detectors in measuring cosmological parameters, especially for the Hubble constant. Using GWs to measure cosmological parameters is inherently challenging, especially for 2.5G detectors, given their limited capability, which results in weaker constraints on cosmological parameters from the detected standard sirens. However, the measurement of the Hubble constant using standard siren observations from Voyager and NEMO is still promising. For example, using bright sirens from Voyager and NEMO can measure the Hubble constant with a precision of about $2\%$ and $6\%$ respectively, and using the Voyager-NEMO network can improve the precision to about $1.6\%$. Moreover, bright sirens can be used to break the degeneracy of cosmological parameters generated by CMB data, and to a certain extent, 2.5G detectors can also play a role in this aspect. Observations of dark sirens by 2.5G detectors can achieve relatively good results in measuring the Hubble constant, with a precision of within $2\%$, and if combining observations of bright and dark sirens, the precision of the Hubble constant measurement can reach about $1.4\%$. Finally, we also discussed the impact of the uncertainty in the binary neutron star merger rate on the estimation of cosmological parameters. We conclude that the magnificent prospect for solving the Hubble tension is worth expecting in the era of the 2.5G ground-based GW detectors.

astro-ph.CO↗

RGDA-DDI: Residual graph attention network and dual-attention based framework for drug-drug interaction prediction

Recent studies suggest that drug-drug interaction (DDI) prediction via computational approaches has significant importance for understanding the functions and co-prescriptions of multiple drugs. However, the existing silico DDI prediction methods either ignore the potential interactions among drug-drug pairs (DDPs), or fail to explicitly model and fuse the multi-scale drug feature representations for better prediction. In this study, we propose RGDA-DDI, a residual graph attention network (residual-GAT) and dual-attention based framework for drug-drug interaction prediction. A residual-GAT module is introduced to simultaneously learn multi-scale feature representations from drugs and DDPs. In addition, a dual-attention based feature fusion block is constructed to learn local joint interaction representations. A series of evaluation metrics demonstrate that the RGDA-DDI significantly improved DDI prediction performance on two public benchmark datasets, which provides a new insight into drug development.

q-bio.MN↗

A novel k-generation propagation model for cyber risk and its application to cyber insurance

The frequent occurrence of cyber risks and their serious economic consequences have created a growth market for cyber insurance. The calculation of aggregate losses, an essential step in insurance pricing, has attracted considerable attention in recent years. This research develops a path-based k-generation risk contagion model in a tree-shaped network structure that incorporates the impact of the origin contagion location and the heterogeneity of security levels on contagion probability and local loss, distinguishing it from most existing models. Furthermore, we discuss the properties of k-generation risk contagion among multi-paths using the concept of d-separation in Bayesian network (BN), and derive explicit expressions for the mean and variance of local loss on a single path. By combining these results, we compute the mean and variance values for aggregate loss across the entire network until time $t$, which is crucial for accurate cyber insurance pricing. Finally, through numerical calculations and relevant probability properties, we have obtained several findings that are valuable to risk managers and insurers.

q-fin.RM↗

ICFRNet: Image Complexity Prior Guided Feature Refinement for Real-time Semantic Segmentation

In this paper, we leverage image complexity as a prior for refining segmentation features to achieve accurate real-time semantic segmentation. The design philosophy is based on the observation that different pixel regions within an image exhibit varying levels of complexity, with higher complexities posing a greater challenge for accurate segmentation. We thus introduce image complexity as prior guidance and propose the Image Complexity prior-guided Feature Refinement Network (ICFRNet). This network aggregates both complexity and segmentation features to produce an attention map for refining segmentation features within an Image Complexity Guided Attention (ICGA) module. We optimize the network in terms of both segmentation and image complexity prediction tasks with a combined loss function. Experimental results on the Cityscapes and CamViD datasets have shown that our ICFRNet achieves higher accuracy with a competitive efficiency for real-time segmentation.

cs.CV↗

Stochastic linear-quadratic differential game with Markovian jumps in an infinite horizon

This paper investigates a two-person non-homogeneous linear-quadratic stochastic differential game (LQ-SDG, for short) in an infinite horizon for a system regulated by a time-invariant Markov chain. Both non-zero-sum and zero-sum LQ-SDG problems are studied. It is shown that the zero-sum LQ-SDG problem can be considered a special non-zero-sum LQ-SDG problem. The open-loop Nash equilibrium point of non-zero-sum (zero-sum, respectively) LQ-SDG problem is characterized by the solvability of a system of constrained forward-backward stochastic differential equations (FBSDEs, for short) in an infinite horizon and the convexity (convexity-concavity, respectively) of the performance functional and their corresponding closed-loop Nash equilibrium strategy are characterized by the solvability of a system of constrained coupled algebra Riccati equations (CAREs, for short) with certain stabilizing conditions. In addition, the closed-loop representation of open-loop Nash equilibrium point for non-zero-sum (zero-sum, respectively) LQ-SDG is provided by the non-symmetric (symmetric, respectively) solution to a system CAREs. At the end of this paper, we provide three concrete examples and solve their open-loop/closed-loop Nash equilibrium strategy based on the obtained results.

math.OC↗

The Velocity Aberration Effect of the CSST Main Survey Camera

In this study, we conducted simulations to find the geometric aberrations expected for images taken by the Main Survey Camera (MSC) of the Chinese Space Station Telescope (CSST) due to its motion. As anticipated by previous work, our findings indicate that the geometric distortion of light impacts the focal plane's apparent scale, with a more pronounced influence as the size of the focal plane increases. Our models suggest that the effect consistently influences the pixel scale in both the vertical and parallel directions. The apparent scale variation follows a sinusoidal distribution throughout one orbit period. Simulations reveal that the effect is particularly pronounced in the center of the Galaxy and gradually diminishes along the direction of ecliptic latitude. At low ecliptic latitudes, the total aberration leads to about 0.94 pixels offset (a 20-minute exposure) and 0.26 pixels offset (a 300-second exposure) at the edge of the field of view, respectively. Appropriate processings for the geometric effect during the CSST pre- and post-observation phases are presented.

astro-ph.IM↗

Study of the effects of external imaginary electric field and chiral chemical potential on quark matter

The behavior of quark matter with both external electric field and chiral chemical potential is theoretically and experimentally interesting to consider. In this paper, the case of simultaneous presence of imaginary electric field and chiral chemical potential is investigated using the lattice QCD approach with $N_f=1+1$ dynamical staggered fermions. We find that overall both the imaginary electric field and the chiral chemical potential can exacerbate chiral symmetry breaking, which is consistent with theoretical predictions. However we also find a non-monotonic behavior of chiral condensation at specific electric field strengths and chiral chemical potentials. In addition to this, we find that the behavior of Polyakov loop in the complex plane is not significantly affected by chiral chemical potential in the region of the parameters consider in this paper.

hep-lat↗

PromptKD: Unsupervised Prompt Distillation for Vision-Language Models

Prompt learning has emerged as a valuable technique in enhancing vision-language models (VLMs) such as CLIP for downstream tasks in specific domains. Existing work mainly focuses on designing various learning forms of prompts, neglecting the potential of prompts as effective distillers for learning from larger teacher models. In this paper, we introduce an unsupervised domain prompt distillation framework, which aims to transfer the knowledge of a larger teacher model to a lightweight target model through prompt-driven imitation using unlabeled domain images. Specifically, our framework consists of two distinct stages. In the initial stage, we pre-train a large CLIP teacher model using domain (few-shot) labels. After pre-training, we leverage the unique decoupled-modality characteristics of CLIP by pre-computing and storing the text features as class vectors only once through the teacher text encoder. In the subsequent stage, the stored class vectors are shared across teacher and student image encoders for calculating the predicted logits. Further, we align the logits of both the teacher and student models via KL divergence, encouraging the student image encoder to generate similar probability distributions to the teacher through the learnable prompts. The proposed prompt distillation process eliminates the reliance on labeled data, enabling the algorithm to leverage a vast amount of unlabeled images within the domain. Finally, the well-trained student image encoders and pre-stored text features (class vectors) are utilized for inference. To our best knowledge, we are the first to (1) perform unsupervised domain-specific prompt-driven knowledge distillation for CLIP, and (2) establish a practical pre-storing mechanism of text features as shared class vectors between teacher and student. Extensive experiments on 11 datasets demonstrate the effectiveness of our method.

cs.CV↗

The oscillating and vibrating cylinder: a benchmark to study low Mach number aeroacoustics

Hydrodynamic and acoustic scales separate as the Mach number decreases, making the modelling of aeroacoustic phenomena singular in this flow regime. The benchmark of the flow developing around an oscillating and vibrating cylinder is one of the scarce configuration that is fully analytically tractable, and is thus precious in the validation of new theories or solvers. This work carefully derives the complete incompressible flow solution for this case, extending the axisymmetric results of the literature to more complex cylinder motion. High-order finite element method solution of the incompressible Navier-Stokes equations provide a reference to validate the analytical formulae derived here. Both analytical and numerical investigations agree on an independence of the configuration to the Reynolds number. Up to the critical Reynolds number, found to lie above $10^4$, the hydrodynamic solution of this configuration is solely governed by the Stokes number. The exact expression of the sound radiated in the far field is computed by accounting for the cylinder scattering by means of tailored Green's functions.

physics.flu-dyn↗

Cooperative colorings of hypergraphs

Given a class $\mathcal{H}$ of $m$ hypergraphs ${H}_1, {H}_2, \ldots, {H}_m$ with the same vertex set $V$, a cooperative coloring of them is a partition $\{I_1, I_2, \ldots, I_m\}$ of $V$ in such a way that each $I_i$ is an independent set in ${H}_i$ for $1\leq i\leq m$. The cooperative chromatic number of a class $\mathcal{H}$ is the smallest number of hypergraphs from $\mathcal{H}$ that always possess a cooperative coloring. For the classes of $k$-uniform tight cycles, $k$-uniform loose cycles, $k$-uniform tight paths, and $k$-uniform loose paths, we find that their cooperative chromatic numbers are all exactly two utilizing a new proved set system partition theorem, which also has its independent interests and offers a broader perspective. For the class of $k$-partite $k$-uniform hypergraphs with sufficient large maximum degree $d$, we prove that its cooperative chromatic number has lower bound $Ω(\log_k d)$ and upper bound $\text{O}\left(\frac{d}{\ln d}\right)^{\frac{1}{k-1}}$.

math.CO↗

Cosmological perturbations in the energy-momentum squared gravity theory: constraints from gravitational wave standard sirens and redshift space distortions

We investigate the linear cosmological perturbations in the context of the so-called energy-momentum squared gravity (EMSG) theory. Recent researches show that the EMSG theory can reproduce viable background cosmological evolution comparable to $Λ$CDM, while the matter-dominated era exhibits slight distinctions. In this paper, we mainly focus on the power-law EMSG models and derive the equations for the linear cosmological perturbations. We explore the propagation of the gravitational wave (GW) and the growth of matter density perturbation at the first order, and estimate the model parameters from the simulated GW data and the observed redshift space distortion data. Our analysis reveals that the model parameters should be small and positive in $1σ$ confidence interval, which indicates that the theory is in good agreement with the observational data and can be regarded as an alternative for the standard cosmological model.

astro-ph.CO↗

3D Variational Inference-Based Double-Difference Seismic Tomography Method and Application to the SAFOD Site, California

Seismic tomography is a crucial technique used to image subsurface structures at various scales, accomplished by solving a nonlinear and nonunique inverse problem. It is therefore important to quantify velocity model uncertainties for accurate earthquake locations and geological interpretations. Monte Carlo sampling techniques are usually used for this purpose, but those methods are computationally intensive, especially for large datasets or high-dimensional parameter spaces. In comparison, Bayesian variational inference provides a more efficient alternative by delivering probabilistic solutions through optimization. The method has been proven to be efficient in 2D tomographic problems. In this study, we apply variational inference to solve 3D double-difference (DD) seismic tomographic system using both absolute and differential travel time data. Synthetic tests demonstrate that the new method can produce more accurate velocity models than the original DD tomography method by avoiding regularization constraints, and at the same time provides more reliable uncertainty estimates. Compared to traditional checkerboard resolution tests, the resulting uncertainty estimates measure more accurately the reliability of the solution. We further apply the new method to data recorded by a local dense seismic array around the San Andreas Fault Observatory at Depth (SAFOD) site along the San Andreas Fault (SAF) at Parkfield. Similar to other researches, the obtained velocity models show significant velocity contrasts across the fault. More importantly, the new method produces velocity uncertainties of less than 0.34 km/s for Vp and 0.23 km/s for Vs. We therefore conclude that variational inference provides a powerful and efficient tool for solving 3D seismic tomographic problems and quantifying model uncertainties.

physics.geo-ph↗

FSSC: Federated Learning of Transformer Neural Networks for Semantic Image Communication

In this paper, we address the problem of image semantic communication in a multi-user deployment scenario and propose a federated learning (FL) strategy for a Swin Transformer-based semantic communication system (FSSC). Firstly, we demonstrate that the adoption of a Swin Transformer for joint source-channel coding (JSCC) effectively extracts semantic information in the communication system. Next, the FL framework is introduced to collaboratively learn a global model by aggregating local model parameters, rather than directly sharing clients' data. This approach enhances user privacy protection and reduces the workload on the server or mobile edge. Simulation evaluations indicate that our method outperforms the typical JSCC algorithm and traditional separate-based communication algorithms. Particularly after integrating local semantics, the global aggregation model has further increased the Peak Signal-to-Noise Ratio (PSNR) by more than 2dB, thoroughly proving the effectiveness of our algorithm.

cs.AI↗

CSST Strong Lensing Preparation: Forecasting the galaxy-galaxy strong lensing population for the China Space Station Telescope

Galaxy-galaxy strong gravitational lensing (GGSL) is a powerful probe for the formation and evolution of galaxies and cosmology, while the sample size of GGSLs leads to considerable uncertainties and potential bias. The China Space Station Telescope (CSST, to be launched in late 2026) will conduct observations across 17,500 square degrees of the sky, capturing images in the $ugriz$ bands with a spatial resolution comparable to that of the Hubble Space Telescope. We ran a set of Monte Carlo simulations to predict that the CSST's wide-field survey will observe $\sim$160,000 galaxy-galaxy strong lenses over its lifespan, increasing the number of existing galaxy-galaxy strong lens samples by three orders of magnitude. This is comparable to the capabilities of the $\it Euclid$ telescope but with the added benefit of additional color information. Specifically, the CSST can detect strong lenses with Einstein radii about $0.64\pm0.42^{"}$, corresponding to the velocity dispersions of $217.19 \pm 50.55 \, \text{km/s}$. These lenses exhibit a median magnification of $\sim$5. The apparent magnitude of the unlensed sources in the g-band is $25.87 \pm 1.19$. The signal-to-noise ratio of the lensed images covers a range of $\sim 20$ to $\sim 1000$, allowing us to determine the Einstein radius with an accuracy ranging from $\sim 1 \%$ to $\sim 0.1 \%$, ignoring various modeling systematics. Our estimates indicate that CSST can observe rare systems like double source-plane and spiral galaxy lenses. The above selection functions of the CSST strong lensing observation help optimize the strategy of finding and modeling GGSLs.

astro-ph.GA↗

Revising the Problem of Partial Labels from the Perspective of CNNs' Robustness

Convolutional neural networks (CNNs) have gained increasing popularity and versatility in recent decades, finding applications in diverse domains. These remarkable achievements are greatly attributed to the support of extensive datasets with precise labels. However, annotating image datasets is intricate and complex, particularly in the case of multi-label datasets. Hence, the concept of partial-label setting has been proposed to reduce annotation costs, and numerous corresponding solutions have been introduced. The evaluation methods for these existing solutions have been primarily based on accuracy. That is, their performance is assessed by their predictive accuracy on the test set. However, we insist that such an evaluation is insufficient and one-sided. On one hand, since the quality of the test set has not been evaluated, the assessment results are unreliable. On the other hand, the partial-label problem may also be raised by undergoing adversarial attacks. Therefore, incorporating robustness into the evaluation system is crucial. For this purpose, we first propose two attack models to generate multiple partial-label datasets with varying degrees of label missing rates. Subsequently, we introduce a lightweight partial-label solution using pseudo-labeling techniques and a designed loss function. Then, we employ D-Score to analyze both the proposed and existing methods to determine whether they can enhance robustness while improving accuracy. Extensive experimental results demonstrate that while certain methods may improve accuracy, the enhancement in robustness is not significant, and in some cases, it even diminishes.

cs.CV↗

Prospects for weighing neutrinos in interacting dark energy models using joint observations of gravitational waves and $γ$-ray bursts

Cosmological observations can be used to weigh neutrinos, but this method is model-dependent, with results relying on the cosmological model considered. If we consider interactions between dark energy and dark matter, the neutrino mass constraints differ from those derived under the standard model. On the contrary, gravitational wave (GW) standard siren observations can measure absolute cosmological distances, helping to break parameter degeneracies inherent in traditional cosmological observations, thereby improving constraints on neutrino mass. This paper examines the constraints on neutrino mass within interacting dark energy (IDE) models and explores how future GW standard siren observations could enhance these results. For multi-messenger GW observations, we consider the joint observations of binary neutron star mergers by third-generation ground-based GW detectors and short $γ$-ray burst observations by missions similar to the THESEUS satellite project. Using current cosmological observations (CMB+BAO+SN), we obtain an upper limit on the neutrino mass in the IDE models of 0.15 (or 0.16) eV. With the inclusion of GW data, the upper limit on the neutrino mass improves to 0.14 eV. This indicates that in the context of IDE models, the improvement in neutrino mass constraints from GW observations is relatively limited. However, GW observations significantly enhance the constraints on other cosmological parameters, such as matter density parameter, the Hubble constant, and coupling strength between dark energy and dark matter.

astro-ph.CO↗

Universal control of four singlet-triplet qubits

The coherent control of interacting spins in semiconductor quantum dots is of strong interest for quantum information processing as well as for studying quantum magnetism from the bottom up. Here, we present a $2\times4$ germanium quantum dot array with full and controllable interactions between nearest-neighbor spins. As a demonstration of the level of control, we define four singlet-triplet qubits in this system and show two-axis single-qubit control of each qubit and SWAP-style two-qubit gates between all neighbouring qubit pairs, yielding average single-qubit gate fidelities of 99.49(8)-99.84(1)% and Bell state fidelities of 73(1)-90(1)%. Combining these operations, we experimentally implement a circuit designed to generate and distribute entanglement across the array. A remote Bell state with a fidelity of 75(2)% and concurrence of 22(4)% is achieved. These results highlight the potential of singlet-triplet qubits as a competing platform for quantum computing and indicate that scaling up the control of quantum dot spins in extended bilinear arrays can be feasible.

cond-mat.mes-hall↗

LDConv: Linear deformable convolution for improving convolutional neural networks

Neural networks based on convolutional operations have achieved remarkable results in the field of deep learning, but there are two inherent flaws in standard convolutional operations. On the one hand, the convolution operation is confined to a local window, so it cannot capture information from other locations, and its sampled shapes is fixed. On the other hand, the size of the convolutional kernel are fixed to k $\times$ k, which is a fixed square shape, and the number of parameters tends to grow squarely with size. Although Deformable Convolution (Deformable Conv) address the problem of fixed sampling of standard convolutions, the number of parameters also tends to grow in a squared manner. In response to the above questions, the Linear Deformable Convolution (LDConv) is explored in this work, which gives the convolution kernel an arbitrary number of parameters and arbitrary sampled shapes to provide richer options for the trade-off between network overhead and performance. In LDConv, a novel coordinate generation algorithm is defined to generate different initial sampled positions for convolutional kernels of arbitrary size. To adapt to changing targets, offsets are introduced to adjust the shape of the samples at each position. LDConv corrects the growth trend of the number of parameters for standard convolution and Deformable Conv to a linear growth. Moreover, it completes the process of efficient feature extraction by irregular convolutional operations and brings more exploration options for convolutional sampled shapes. Object detection experiments on representative datasets COCO2017, VOC 7+12, and VisDrone-DET2021 fully demonstrate the advantages of LDConv. LDConv is a plug-and-play convolutional operation that can replace the convolutional operation to improve network performance. The code for the relevant tasks can be found at https://github.com/CV-ZhangXin/LDConv.

cs.CV↗