arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 667 records · Page 37Linked to original sources

arXiv2024

Prospects for probing the interaction between dark energy and dark matter using gravitational-wave dark sirens with neutron star tidal deformation

Gravitational wave (GW) standard siren observations provide a rather useful tool to explore the evolution of the Universe. In this work, we wish to investigate whether dark sirens with neutron star (NS) deformation from third-generation GW detectors could help probe the interaction between dark energy and dark matter. We simulate the GW dark sirens of four detection strategies based on 3 yr observation and consider four phenomenological interacting dark energy (IDE) models to perform cosmological analysis. We find that GW dark sirens could provide tight constraints on $Ω_{\rm m}$ and $H_0$ in the four IDE models, but do not perform well in constraining the dimensionless coupling parameter $β$ in models of the interaction proportional to the energy density of cold dark matter. Nevertheless, the parameter degeneracy orientations of cosmic microwave background (CMB) and GW are almost orthogonal, and thus, the combination of them could effectively break cosmological parameter degeneracies, with the constraint errors of $β$ being $0.00068-0.018$. In addition, we choose three typical equations of state (EoSs) of an NS, i.e., SLy, MPA1, and MS1, to investigate the effect of an NS's EoS in cosmological analysis. The stiffer EoS could give tighter constraints than the softer EoS. Nonetheless, the combination of CMB and GW dark sirens (using different EoSs of an NS) shows basically the same constraint results of cosmological parameters. We conclude that the dark sirens from 3G GW detectors would play a crucial role in helping probe the interaction between dark energy and dark matter, and the CMB+GW results are basically not affected by the EoS of an NS.

astro-ph.CO↗

arXiv2024

URLLC in IRS-Aided MIMO Systems: Finite Blocklength Analysis and Design

This paper investigates the ultra reliable and low latency communication (URLLC) performance of the IRS-aided MIMO system. The upper and lower bounds of the optimal average error probability (OAEP) for the coding rate 1/sqrt(Mn) of the capacity are derived, where n and M represent the blocklength and the number of transmit antennas, respectively. To achieve this goal, a new central limit theorem (CLT) for the mutual information density over the IRS-aided MIMO system is derived in the asymptotic regime where the block-length, the IRS size, and number of the antennas go to infinity with the same pace. The CLT is then utilized to derive the closed form upper and lower bounds for the OAEP. Based on the analysis result, a gradient-based algorithm is proposed to minimize the lower bound of the OAEP by optimizing the phase shift of the IRS. Simulation results validate the fitness of the CLT and the effectiveness of the proposed algorithm in optimizing the theoretical bound, as well as the performance of practical LDPC code.

cs.IT↗

arXiv2024

A robust near-field body area network based on coaxially-shielded textile metamaterial

A body area network (BAN) involving wearable sensors populated around the human body can continuously monitor physiological signals, finding applications in personal healthcare and athletic evaluation. Existing near-field communication (NFC)-enabled BAN solutions, while facilitating reliable and secure interconnection among battery-free sensors, face challenges such as limited spectral stability against external interference. Here we demonstrate a textile metamaterial featuring a coaxially-shielded internal structure designed to mitigate interference from extraneous loadings. The metamaterial can be patterned onto clothing to form a scalable, customizable network, enabling communication between NFC-enabled devices and developed battery-free textile NFC sensing nodes placed within the network. Proof of concept demonstration shows the metamaterial's robustness against mechanical deformation and exposure to lossy, conductive saline solutions, underscoring its potential applications in wet environments, particularly in athletic activities involving water or significant perspiration, offering insights for the future development of radio frequency components for a robust BAN at the system level.

physics.app-ph↗

arXiv2024

Velocity acoustic oscillations on Cosmic Dawn 21 cm power spectrum as a probe of small-scale density fluctuations

We investigate the feasibility of using the velocity acoustic oscillations (VAO) features on the Cosmic Dawn 21 cm power spectrum to probe small-scale density fluctuations. In the standard cold dark matter (CDM) model, Pop III stars form in minihalos and affect the 21 cm signal through Ly$α$ and X-ray radiation. Such a process is modulated by the relative motion between dark matter and baryons, generating the VAO wiggles on the 21 cm power spectrum. In the fuzzy or warm dark matter models for which the number of minihalos is reduced, the VAO wiggles are weaker or even fully invisible. We investigate the wiggle features in the CDM with different astrophysical models and in different dark matter models. We find: 1) In the CDM model the relative streaming velocities can generate the VAO wiggles for broad ranges of parameters $f_*$, $ζ_X$ and $f_{\rm esc,LW}ζ_{\rm LW}$, though for different parameters the wiggles would appear at different redshifts and have different amplitudes. 2) For the axion model with $m_{\rm a} \lesssim10^{-19}$ eV, the VAO wiggles are negligible. In the mixed model, the VAO signal is sensitive to the axion fraction. For example, the wiggles almost disappear when $f_{\rm a} \gtrsim 10\%$ for $m_{\rm a}=10^{-21}$ eV. Therefore, the VAO signal can be an effective indicator for small-scale density fluctuations and a useful probe of the nature of dark matter. The SKA-low with $\sim$2000 hour observation time has the ability to detect the VAO signal and constraint dark matter models.

astro-ph.CO↗

arXiv2024

Knowledge Graph Assisted Automatic Sports News Writing

In this paper, we present a novel method for automatically generating sports news, which employs a unique algorithm that extracts pivotal moments from live text broadcasts and uses them to create an initial draft of the news. This draft is further refined by incorporating key details and background information from a specially designed sports knowledge graph. This graph contains 5,893 entities, which are classified into three distinct conceptual categories, interconnected through four relationship types, and characterized by 27 unique attributes. In addition, we create a multi-stage learning model by combining convolutional neural networks and a transformer encoder. This model expresses entity-task interactions using convolutional neural networks and enriches entity representations in the query set with the transformer encoder. It also includes a processor to compute matching scores for incomplete triples, addressing few-shot knowledge graph completion problem. The efficiency of this approach has been confirmed through both subjective and objective evaluations of 50 selected test cases, demonstrating its capability in revolutionizing the creation of sports news.

cs.CL↗

arXiv2024

Cooperative coloring of some graph families

In a family ${G_1, G_2, \ldots, G_m}$ of graphs sharing the same vertex set $V$, a cooperative coloring involves selecting one independent set $I_i$ from $G_i$ for each $i\in \{1,2,\ldots,m\}$ such that $\bigcup_{i=1}^m I_i = V$. For a graph class $\mathcal{G}$, let $m_{\mathcal{G}}(d)$ denote the minimum $m$ required to ensure that any graph family ${G_1, G_2, \ldots, G_m}$ on the same vertex set, where $G_i\in\mathcal{G}$ and $Δ(G_i)\leq d$ for each $i\in \{1,2,\ldots,m\}$, admits a cooperative coloring. For the graph classes $\mathcal{T}$ (trees) and $\mathcal{W}$ (wheels), we find that $m_\mathcal{T}(3)=4$ and $m_\mathcal{W}(4)=5$. Also, we prove that $m_{\mathcal{B}^*}(d)=O(\log_2 d)$ and $m_{\mathcal{L}}(d)=O\left(\frac{\log d}{\log\log d}\right)$, where $\mathcal{B}^*$ represents the class of graphs whose components are balanced complete bipartite graphs, and $\mathcal{L}$ represents the class of graphs whose components are generalized theta graphs.

math.CO↗

arXiv2024

Dynamic Patch-aware Enrichment Transformer for Occluded Person Re-Identification

Person re-identification (re-ID) continues to pose a significant challenge, particularly in scenarios involving occlusions. Prior approaches aimed at tackling occlusions have predominantly focused on aligning physical body features through the utilization of external semantic cues. However, these methods tend to be intricate and susceptible to noise. To address the aforementioned challenges, we present an innovative end-to-end solution known as the Dynamic Patch-aware Enrichment Transformer (DPEFormer). This model effectively distinguishes human body information from occlusions automatically and dynamically, eliminating the need for external detectors or precise image alignment. Specifically, we introduce a dynamic patch token selection module (DPSM). DPSM utilizes a label-guided proxy token as an intermediary to identify informative occlusion-free tokens. These tokens are then selected for deriving subsequent local part features. To facilitate the seamless integration of global classification features with the finely detailed local features selected by DPSM, we introduce a novel feature blending module (FBM). FBM enhances feature representation through the complementary nature of information and the exploitation of part diversity. Furthermore, to ensure that DPSM and the entire DPEFormer can effectively learn with only identity labels, we also propose a Realistic Occlusion Augmentation (ROA) strategy. This strategy leverages the recent advances in the Segment Anything Model (SAM). As a result, it generates occlusion images that closely resemble real-world occlusions, greatly enhancing the subsequent contrastive learning process. Experiments on occluded and holistic re-ID benchmarks signify a substantial advancement of DPEFormer over existing state-of-the-art approaches. The code will be made publicly available.

cs.CV↗

arXiv2024

FedMT: Federated Learning with Mixed-type Labels

In federated learning (FL), classifiers (e.g., deep networks) are trained on datasets from multiple data centers without exchanging data across them, which improves the sample efficiency. However, the conventional FL setting assumes the same labeling criterion in all data centers involved, thus limiting its practical utility. This limitation becomes particularly notable in domains like disease diagnosis, where different clinical centers may adhere to different standards, making traditional FL methods unsuitable. This paper addresses this important yet under-explored setting of FL, namely FL with mixed-type labels, where the allowance of different labeling criteria introduces inter-center label space differences. To address this challenge effectively and efficiently, we introduce a model-agnostic approach called FedMT, which estimates label space correspondences and projects classification scores to construct loss functions. The proposed FedMT is versatile and integrates seamlessly with various FL methods, such as FedAvg. Experimental results on benchmark and medical datasets highlight the substantial improvement in classification accuracy achieved by FedMT in the presence of mixed-type labels.

cs.LG↗

arXiv2024

Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications

The classical Rician Weichselberger channel and the emerging holographic multiple-input multiple-output (MIMO) channel share a common characteristic of non-separable correlation, which captures the interdependence between transmit and receiver antennas. However, this correlation structure makes it very challenging to characterize the fundamental limits of non-centered (Rician), non-separable MIMO channels. In fact, there is a dearth of existing literature that addresses this specific aspect, underscoring the need for further research in this area. In this paper, we investigate the mutual information (MI) of non-centered non-separable MIMO channels, where both the line-of-sight and non-line-of-sight components are considered. By utilizing random matrix theory (RMT), we set up a central limit theorem for the MI and give the closed-form expressions for its mean and variance. The derived results are then utilized to approximate the ergodic MI and outage probability of holographic MIMO channels. Numerical simulations validate the accuracy of the theoretical results.

cs.IT↗

arXiv2024

Interference Mitigation for Network-Level ISAC: An Optimization Perspective

Future wireless networks are envisioned to simultaneously provide high data-rate communication and ubiquitous environment-aware services for numerous users. One promising approach to meet this demand is to employ network-level integrated sensing and communications (ISAC) by jointly designing the signal processing and resource allocation over the entire network. However, to unleash the full potential of network-level ISAC, some critical challenges must be tackled. Among them, interference management is one of the most significant ones. In this article, we build up a bridge between interference mitigation techniques and the corresponding optimization methods, which facilitates efficient interference mitigation in network-level ISAC systems. In particular, we first identify several types of interference in network-level ISAC systems, including self-interference, mutual interference, crosstalk, clutter, and multiuser interference. Then, we present several promising techniques that can be utilized to suppress specific types of interference. For each type of interference, we discuss the corresponding problem formulation and identify the associated optimization methods. Moreover, to illustrate the effectiveness of the proposed interference mitigation techniques, two concrete network-level ISAC systems, namely coordinated cellular network-based and distributed antenna-based ISAC systems, are investigated from interference management perspective. Experiment results indicate that it is beneficial to collaboratively employ different interference mitigation techniques and leverage the network structure to achieve the full potential of network-level ISAC. Finally, we highlight several promising future research directions for the design of ISAC systems.

cs.IT↗

arXiv2024

ICDPO: Effectively Borrowing Alignment Capability of Others via In-context Direct Preference Optimization

Large Language Models (LLMs) rely on Human Preference Alignment (HPA) to ensure the generation of safe content. Due to the heavy cost associated with fine-tuning, fine-tuning-free methods have emerged, typically modifying LLM decoding with external auxiliary methods. However, these methods do not essentially enhance the LLM itself. In this paper, we rethink the derivation procedures of DPO, based on which we conversely build an instant scorer using the states of the LLM before and after In-context Learning (ICL). Accordingly, we propose a novel approach called In-Context Direct Preference Optimization (ICDPO). It enables LLMs to borrow the HPA capabilities from superior LLMs with ICL, generating well-aligned responses as estimated by the aforementioned instant scorer, thereby enhancing the final performance. ICDPO can be further enhanced with a two-stage retriever and an upgraded scorer, both offering benefits. Extensive experiments show its effectiveness, particularly in outperforming two fine-tuning-free baselines, and it exhibits competitiveness with SFT + LoRA. We also conduct detailed analyses to offer comprehensive insights into ICDPO.

cs.CL↗

arXiv2024

Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large-scale random matrix theory (RMT), specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solution for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.

cs.IT↗

arXiv2024

Photonic Spin-Orbit Coupling Induced by Deep-Subwavelength Structured Light

We demonstrate both theoretically and experimentally beam-dependent photonic spin-orbit coupling in a two-wave mixing process described by an equivalent of the Pauli equation in quantum mechanics. The considered structured light in the system is comprising a superposition of two orthogonal spin-orbit-coupled states defined as spin up and spin down equivalents. The spin-orbit coupling is manifested by prominent pseudo spin precession as well as spin-transport-induced orbital angular momentum generation in a photonic crystal film of wavelength thickness. The coupling effect is significantly enhanced by using a deep-subwavelength carrier envelope, different from previous studies which depend on materials. The beam-dependent coupling effect can find intriguing applications; for instance, it is used in precisely measuring variation of light with spatial resolution up to 15 nm.

physics.optics↗

arXiv2024

UV-SAM: Adapting Segment Anything Model for Urban Village Identification

Urban villages, defined as informal residential areas in or around urban centers, are characterized by inadequate infrastructures and poor living conditions, closely related to the Sustainable Development Goals (SDGs) on poverty, adequate housing, and sustainable cities. Traditionally, governments heavily depend on field survey methods to monitor the urban villages, which however are time-consuming, labor-intensive, and possibly delayed. Thanks to widely available and timely updated satellite images, recent studies develop computer vision techniques to detect urban villages efficiently. However, existing studies either focus on simple urban village image classification or fail to provide accurate boundary information. To accurately identify urban village boundaries from satellite images, we harness the power of the vision foundation model and adapt the Segment Anything Model (SAM) to urban village segmentation, named UV-SAM. Specifically, UV-SAM first leverages a small-sized semantic segmentation model to produce mixed prompts for urban villages, including mask, bounding box, and image representations, which are then fed into SAM for fine-grained boundary identification. Extensive experimental results on two datasets in China demonstrate that UV-SAM outperforms existing baselines, and identification results over multiple years show that both the number and area of urban villages are decreasing over time, providing deeper insights into the development trends of urban villages and sheds light on the vision foundation models for sustainable cities. The dataset and codes of this study are available at https://github.com/tsinghua-fib-lab/UV-SAM.

cs.CV↗

arXiv2024

Map-assisted TDOA Localization Enhancement Based On CNN

For signal processing related to localization technologies, non line of sight (NLOS) multipaths have a significant impact on the localization error level. This study proposes a localization correction method based on convolution neural network (CNN), which extracts obstacle features from maps to predict the localization errors caused by NLOS effects. A novel compensation scheme is developed and structured around the localization error in terms of distance and azimuth angle predicted by the CNN. Four prediction tasks are executed over different building distributions within the maps for typical urban scenario, resulting in CNN models with high prediction accuracy. Finally, a thorough comparison of the accuracy performance between the time difference of arrival (TDOA) localization algorithm and the results after the error compensation reveals that, generally, the CNN prediction approach demonstrates great localization error correction performance, improving TDOA accuracy by 75%. It can be observed that the powerful feature extraction capability of CNN can be exploited by processing surrounding maps to predict the localization error distribution, showing great potential for further enhancement of TDOA performance under challenging scenarios with rich multipath propagation.

eess.SP↗

arXiv2024

Unrestricted Error-Type Codebook Generation for Error Correction Code in DNA Storage Inspired by NLP

Recently, DNA storage has surfaced as a promising alternative for data storage, presenting notable benefits in terms of storage capacity, cost-effectiveness in maintenance, and the capability for parallel replication. Mathematically, the DNA storage process can be conceptualized as an insertion, deletion, and substitution (IDS) channel. Due to the mathematical complexity associated with the Levenshtein distance, creating a code that corrects for IDS remains a challenging task. In this paper, we propose a bottom-up generation approach to grow the required codebook based on the computation of Edit Computational Graph (ECG) which differs from the algebraic constructions by incorporating the Derivative-Free Optimization (DFO) method. Specifically, this approach is regardless of the type of errors. Compared the results with the work for 1-substitution-1-deletion and 2-deletion, the redundancy is reduced by about 30-bit and 60-bit, respectively. As far as we know, our method is the first IDS-correcting code designed using classical Natural Language Process (NLP) techniques, marking a turning point in the field of error correction code research. Based on the codebook generated by our method, there may be significant breakthroughs in the complexity of encoding and decoding algorithms.

cs.IT↗

arXiv2024

ReTaSA: A Nonparametric Functional Estimation Approach for Addressing Continuous Target Shift

The presence of distribution shifts poses a significant challenge for deploying modern machine learning models in real-world applications. This work focuses on the target shift problem in a regression setting (Zhang et al., 2013; Nguyen et al., 2016). More specifically, the target variable y (also known as the response variable), which is continuous, has different marginal distributions in the training source and testing domain, while the conditional distribution of features x given y remains the same. While most literature focuses on classification tasks with finite target space, the regression problem has an infinite dimensional target space, which makes many of the existing methods inapplicable. In this work, we show that the continuous target shift problem can be addressed by estimating the importance weight function from an ill-posed integral equation. We propose a nonparametric regularized approach named ReTaSA to solve the ill-posed integral equation and provide theoretical justification for the estimated importance weight function. The effectiveness of the proposed method has been demonstrated with extensive numerical studies on synthetic and real-world datasets.

stat.ML↗

arXiv2024

CSST Large-scale Structure Analysis Pipeline: II. the CSST Emulator for Slitless Spectroscopy (CESS)

The Chinese Space Station Telescope (CSST) slitless spectroscopic survey will observe objects to a limiting magnitude of ~ 23 mag (5$σ$, point sources) in U, V, and I over 17500 deg$^2$. The spectroscopic observations are expected to be highly efficient and complete for mapping galaxies over 0 < z < 1 with secure redshift measurements at spectral resolutions of R ~ 200, providing unprecedented data sets for cosmological studies. To quantitatively examine the survey potential, we develop a software tool, namely the CSST Emulator for Slitless Spectroscopy (CESS), to quickly generate simulated 1D slitless spectra with limited computing resources. We introduce the architecture of CESS and the detailed process of creating simulated CSST slitless spectra. The extended light distribution of a galaxy induces the self-broadening effect on the 1D slitless spectrum. We quantify the effect using morphological parameters: Sérsic index, effective radius, position angle, and axis ratio. Moreover, we also develop a module for CESS to estimate the overlap contamination rate for CSST grating observations of galaxies in galaxy clusters. Applying CESS to the high-resolution model spectra of a sample of ~ 140 million galaxies with m_z < 21 mag selected from the Dark Energy Spectroscopic Instrument LS DR9 catalogue, we obtain the simulated CSST slitless spectra. We examine the dependence of measurement errors on different types of galaxies due to instrumental and observational effects and quantitatively investigate the redshift completeness for different environments out to z ~ 1. Our results show that the CSST spectroscopy is able to provide secure redshifts for about one-quarter of the sample galaxies.

astro-ph.GA↗