arXiv subjects

Wei Yu

Publications and source records attributed to Wei Yu.

At least 91 records · Page 5Linked to original sources

arXiv2024

Timing analysis of the newly discovered black hole candidate Swift J1727.8-1613 with Insight-HXMT

We present the results obtained from an X-ray timing study of the new black hole candidate (BHC) Swift J1727.8-1613. The work is based on Hard X-ray Modulation Telescope (Insight-HXMT) observations carried out during the 2023 outburst. Prominent type-C low-frequency Quasi-periodic Oscillations (LFQPOs) are detected throughout the observations. With the substantial effective area of the Insight-HXMT at high energies, we examine the energy dependence of various parameters, including the centroid frequency, fractional rms, and phase lags of the type-C QPOs. Our findings align closely with those observed in high-inclination systems. During the initial stage of the outburst, a peaked noise component is also detected, the frequency of which is highly correlated with the LFQPO frequency, aligning with the Psaltis-Belloni-van der Klis (PBK) relation. By assuming that the peaked noise originates from the precession of the accretion disc, the spin of this source can be constrained. Our results suggest that this source may possess a high spin.

astro-ph.HE↗

arXiv2024

Meta-Learning-Based Fronthaul Compression for Cloud Radio Access Networks

This paper investigates the fronthaul compression problem in a user-centric cloud radio access network, in which single-antenna users are served by a central processor (CP) cooperatively via a cluster of remote radio heads (RRHs). To satisfy the fronthaul capacity constraint, this paper proposes a transform-compress-forward scheme, which consists of well-designed transformation matrices and uniform quantizers. The transformation matrices perform dimension reduction in the uplink and dimension expansion in the downlink. To reduce the communication overhead for designing the transformation matrices, this paper further proposes a deep learning framework to first learn a suboptimal transformation matrix at each RRH based on the local channel state information (CSI), and then to refine it iteratively. To facilitate the refinement process, we propose an efficient signaling scheme that only requires the transmission of low-dimensional effective CSI and its gradient between the CP and RRH, and further, a meta-learning based gated recurrent unit network to reduce the number of signaling transmission rounds. For the sum-rate maximization problem, simulation results show that the proposed two-stage neural network can perform close to the fully cooperative global CSI based benchmark with significantly reduced communication overhead for both the uplink and the downlink. Moreover, using the first stage alone can already outperform the existing local CSI based benchmark.

cs.IT↗

arXiv2024

Dual-Context Aggregation for Universal Image Matting

Natural image matting aims to estimate the alpha matte of the foreground from a given image. Various approaches have been explored to address this problem, such as interactive matting methods that use guidance such as click or trimap, and automatic matting methods tailored to specific objects. However, existing matting methods are designed for specific objects or guidance, neglecting the common requirement of aggregating global and local contexts in image matting. As a result, these methods often encounter challenges in accurately identifying the foreground and generating precise boundaries, which limits their effectiveness in unforeseen scenarios. In this paper, we propose a simple and universal matting framework, named Dual-Context Aggregation Matting (DCAM), which enables robust image matting with arbitrary guidance or without guidance. Specifically, DCAM first adopts a semantic backbone network to extract low-level features and context features from the input image and guidance. Then, we introduce a dual-context aggregation network that incorporates global object aggregators and local appearance aggregators to iteratively refine the extracted context features. By performing both global contour segmentation and local boundary refinement, DCAM exhibits robustness to diverse types of guidance and objects. Finally, we adopt a matting decoder network to fuse the low-level features and the refined context features for alpha matte estimation. Experimental results on five matting datasets demonstrate that the proposed DCAM outperforms state-of-the-art matting methods in both automatic matting and interactive matting tasks, which highlights the strong universality and high performance of DCAM. The source code is available at \url{https://github.com/Windaway/DCAM}.

cs.CV↗

arXiv2024

Hybrid Online-Offline Learning for Task Offloading in Mobile Edge Computing Systems

We consider a multi-user multi-server mobile edge computing (MEC) system, in which users arrive on a network randomly over time and generate computation tasks, which will be computed either locally on their own computing devices or be offloaded to one of the MEC servers. Under such a dynamic network environment, we propose a novel task offloading policy based on hybrid online-offline learning, which can efficiently reduce the overall computation delay and energy consumption only with information available at nearest MEC servers from each user. We provide a practical signaling and learning framework that can train deep neural networks for both online and offline learning and can adjust its offloading policy based on the queuing status of each MEC server and network dynamics. Numerical results demonstrate that the proposed scheme significantly reduces the average computation delay for a broad class of network environments compared to the conventional offloading methods. It is further shown that the proposed hybrid online-offline learning framework can be extended to a general cost function reflecting both delay and energy-dependent metrics.

eess.SP↗

arXiv2024

Joint Activity and Data Detection for Massive Grant-Free Access Using Deterministic Non-Orthogonal Signatures

Grant-free access is a key enabler for connecting wireless devices with low latency and low signaling overhead in massive machine-type communications (mMTC). For massive grant-free access, user-specific signatures are uniquely assigned to mMTC devices. In this paper, we first derive a sufficient condition for the successful identification of active devices through maximum likelihood (ML) estimation in massive grant-free access. The condition is represented by the coherence of a signature sequence matrix containing the signatures of all devices. Then, we present a design framework of non-orthogonal signature sequences in a deterministic fashion. The design principle relies on unimodular masking sequences with low correlation, which are applied as masking sequences to the columns of the discrete Fourier transform (DFT) matrix. For example constructions, we use four polyphase masking sequences represented by characters over finite fields. Leveraging algebraic techniques, we show that the signature sequence matrix of proposed non-orthogonal sequences has theoretically bounded low coherence. Simulation results demonstrate that the deterministic non-orthogonal signatures achieve the excellent performance of joint activity and data detection by ML- and approximate message passing (AMP)-based algorithms for massive grant-free access in mMTC.

cs.IT↗

arXiv2024

Studies on the soft intermediate state X-ray flare of MAXI J1535-571 during its 2017 outburst

We analyzed an observation with the Nuclear Spectroscopic Telescope Array of the black-hole X-ray binary MAXI J1535-571 in the soft intermediate state, in which we detected a 2.5-ks long flare. Our spectral fitting results suggest that MAXI J1535-571 possesses a high spin of 0.97 (-0.10/+0.02) and a low inclination of approximately 24 deg. We observed a gradual increase in the inner disc radius, as determined from fits to the continuum spectrum. This trend is inconsistent with an increased flux ratio of the thermal component, as well as the source evolving towards the soft state. This inconsistency may be attributed to a gradual decrease of the color correction factor. Additionally, with a flare velocity of approximately 0.5 c and a higher hardness ratio during the flare period, the quasi-simultaneous detection of a type-B QPO in the Neutron Star Interior Composition Explorer data, and quasi-simultaneous ejecta launch through radio observations collectively provide strong evidence supporting the possibility that the flare originated from a discrete jet ejection.

astro-ph.HE↗

arXiv2023

Localization with Reconfigurable Intelligent Surface: An Active Sensing Approach

This paper addresses an uplink localization problem in which a base station (BS) aims to locate a remote user with the help of reconfigurable intelligent surfaces (RISs). We propose a strategy in which the user transmits pilots sequentially and the BS adaptively adjusts the sensing vectors, including the BS beamforming vector and multiple RIS reflection coefficients based on the observations already made, to eventually produce an estimated user position. This is a challenging active sensing problem for which finding an optimal solution involves searching through a complicated functional space whose dimension increases with the number of measurements. We show that the long short-term memory (LSTM) network can be used to exploit the latent temporal correlation between measurements to automatically construct scalable state vectors. Subsequently, the state vector is mapped to the sensing vectors for the next time frame via a deep neural network (DNN). A final DNN is used to map the state vector to the estimated user position. Numerical result illustrates the advantage of the active sensing design as compared to non-active sensing methods. The proposed solution produces interpretable results and is generalizable in the number of sensing stages. Remarkably, we show that a network with one BS and multiple RISs can outperform a comparable setting with multiple BSs.

cs.IT↗

arXiv2023

Levenshtein Distance Embedding with Poisson Regression for DNA Storage

Efficient computation or approximation of Levenshtein distance, a widely-used metric for evaluating sequence similarity, has attracted significant attention with the emergence of DNA storage and other biological applications. Sequence embedding, which maps Levenshtein distance to a conventional distance between embedding vectors, has emerged as a promising solution. In this paper, a novel neural network-based sequence embedding technique using Poisson regression is proposed. We first provide a theoretical analysis of the impact of embedding dimension on model performance and present a criterion for selecting an appropriate embedding dimension. Under this embedding dimension, the Poisson regression is introduced by assuming the Levenshtein distance between sequences of fixed length following a Poisson distribution, which naturally aligns with the definition of Levenshtein distance. Moreover, from the perspective of the distribution of embedding distances, Poisson regression approximates the negative log likelihood of the chi-squared distribution and offers advancements in removing the skewness. Through comprehensive experiments on real DNA storage data, we demonstrate the superior performance of the proposed method compared to state-of-the-art approaches.

cs.LG↗

arXiv2023

Discerning and Enhancing the Weighted Sum-Rate Maximization Algorithms in Communications

Weighted sum-rate (WSR) maximization plays a critical role in communication system design. This paper examines three optimization methods for WSR maximization, which ensure convergence to stationary points: two block coordinate ascent (BCA) algorithms, namely, weighted sum-minimum mean-square error (WMMSE) and WSR maximization via fractional programming (WSR-FP), along with a minorization-maximization (MM) algorithm, WSR maximization via MM (WSR-MM). Our contributions are threefold. Firstly, we delineate the exact relationships among WMMSE, WSR-FP, and WSR-MM, which, despite their extensive use in the literature, lack a comprehensive comparative study. By probing the theoretical underpinnings linking the BCA and MM algorithmic frameworks, we reveal the direct correlations between the equivalent transformation techniques, essential to the development of WMMSE and WSR-FP, and the surrogate functions pivotal to WSR-MM. Secondly, we propose a novel algorithm, WSR-MM+, harnessing the flexibility of selecting surrogate functions in MM framework. By circumventing the repeated matrix inversions in the search for optimal Lagrange multipliers in existing algorithms, WSR-MM+ significantly reduces the computational load per iteration and accelerates convergence. Thirdly, we reconceptualize WSR-MM+ within the BCA framework, introducing a new equivalent transform, which gives rise to an enhanced version of WSR-FP, named as WSR-FP+. We further demonstrate that WSR-MM+ can be construed as the basic gradient projection method. This perspective yields a deeper understanding into its computational intricacies. Numerical simulations corroborate the connections between WMMSE, WSR-FP, and WSR-MM and confirm the efficacy of the proposed WSR-MM+ and WSR-FP+ algorithms.

eess.SP↗

arXiv2023

Parameter and Computation Efficient Transfer Learning for Vision-Language Pre-trained Models

With ever increasing parameters and computation, vision-language pre-trained (VLP) models exhibit prohibitive expenditure in downstream task adaption. Recent endeavors mainly focus on parameter efficient transfer learning (PETL) for VLP models by only updating a small number of parameters. However, excessive computational overhead still plagues the application of VLPs. In this paper, we aim at parameter and computation efficient transfer learning (PCETL) for VLP models. In particular, PCETL not only needs to limit the number of trainable parameters in VLP models, but also to reduce the computational redundancy during inference, thus enabling a more efficient transfer. To approach this target, we propose a novel dynamic architecture skipping (DAS) approach towards effective PCETL. Instead of directly optimizing the intrinsic architectures of VLP models, DAS first observes the significances of their modules to downstream tasks via a reinforcement learning (RL) based process, and then skips the redundant ones with lightweight networks, i.e., adapters, according to the obtained rewards. In this case, the VLP model can well maintain the scale of trainable parameters while speeding up its inference on downstream tasks. To validate DAS, we apply it to two representative VLP models, namely ViLT and METER, and conduct extensive experiments on a bunch of VL tasks. The experimental results not only show the great advantages of DAS in reducing computational complexity, e.g. -11.97% FLOPs of METER on VQA2.0, but also confirm its competitiveness against existing PETL methods in terms of parameter scale and performance. Our source code is given in our appendix.

cs.CV↗

arXiv2023

Active Sensing for Localization with Reconfigurable Intelligent Surface

This paper addresses an uplink localization problem in which the base station (BS) aims to locate a remote user with the aid of reconfigurable intelligent surface (RIS). This paper proposes a strategy in which the user transmits pilots over multiple time frames, and the BS adaptively adjusts the RIS reflection coefficients based on the observations already received so far in order to produce an accurate estimate of the user location at the end. This is a challenging active sensing problem for which finding an optimal solution involves a search through a complicated functional space whose dimension increases with the number of measurements. In this paper, we show that the long short-term memory (LSTM) network can be used to exploit the latent temporal correlation between measurements to automatically construct scalable information vectors (called hidden state) based on the measurements. Subsequently, the state vector can be mapped to the RIS configuration for the next time frame in a codebook-free fashion via a deep neural network (DNN). After all the measurements have been received, a final DNN can be used to map the LSTM cell state to the estimated user equipment (UE) position. Numerical result shows that the proposed active RIS design results in lower localization error as compared to existing active and nonactive methods. The proposed solution produces interpretable results and is generalizable to early stopping in the sequence of sensing stages.

eess.SP↗

arXiv2023

Characterizing Aqueous Foams by In-situ Viscosity Measurement in a Foam Column

Foam characterization is essential in many applications of foams, such as cleaning, food processing, cosmetics, and oil production, due to these applications diversified requirements. The standard characterization method, the foam column test, cannot provide sufficient information for in-depth studies. Hence, there have been many studies that incorporated different characterization methods into the standard test. It should be enlightening and feasible to measure the foam viscosity, which is both of practical and fundamental interest, during the foam column test, but it has never been done before. Here, we demonstrate a method to characterize aqueous foams and their aging behaviors with simultaneous measurement of foam viscosity and foam height. Using a vibration viscometer, we integrate foam column experiments with in-situ foam viscosity measurements. We studied the correlation among the foam structure, foam height, and foam viscosity during the foam decay process. We found a drastic decrease in foam viscosity in the early foam decay while the foam height remained unchanged, which is explained by coarsening. This method is much more sensitive and time-efficient than conventional foam-height-based methods by comparing the half-life. This method successfully characterizes the stability of foams made of various combinations of surfactants and gases.

cond-mat.soft↗

arXiv2023

Bidirectional Correlation-Driven Inter-Frame Interaction Transformer for Referring Video Object Segmentation

Referring video object segmentation (RVOS) aims to segment the target object in a video sequence described by a language expression. Typical multimodal Transformer based RVOS approaches process video sequence in a frame-independent manner to reduce the high computational cost, which however restricts the performance due to the lack of inter-frame interaction for temporal coherence modeling and spatio-temporal representation learning of the referred object. Besides, the absence of sufficient cross-modal interactions results in weak correlation between the visual and linguistic features, which increases the difficulty of decoding the target information and limits the performance of the model. In this paper, we propose a bidirectional correlation-driven inter-frame interaction Transformer, dubbed BIFIT, to address these issues in RVOS. Specifically, we design a lightweight and plug-and-play inter-frame interaction module in the Transformer decoder to efficiently learn the spatio-temporal features of the referred object, so as to decode the object information in the video sequence more precisely and generate more accurate segmentation results. Moreover, a bidirectional vision-language interaction module is implemented before the multimodal Transformer to enhance the correlation between the visual and linguistic features, thus facilitating the language queries to decode more precise object information from visual features and ultimately improving the segmentation performance. Extensive experimental results on four benchmarks validate the superiority of our BIFIT over state-of-the-art methods and the effectiveness of our proposed modules.

cs.CV↗

arXiv2023

On the Choice of Perception Loss Function for Learned Video Compression

We study causal, low-latency, sequential video compression when the output is subjected to both a mean squared-error (MSE) distortion loss as well as a perception loss to target realism. Motivated by prior approaches, we consider two different perception loss functions (PLFs). The first, PLF-JD, considers the joint distribution (JD) of all the video frames up to the current one, while the second metric, PLF-FMD, considers the framewise marginal distributions (FMD) between the source and reconstruction. Using information theoretic analysis and deep-learning based experiments, we demonstrate that the choice of PLF can have a significant effect on the reconstruction, especially at low-bit rates. In particular, while the reconstruction based on PLF-JD can better preserve the temporal correlation across frames, it also imposes a significant penalty in distortion compared to PLF-FMD and further makes it more difficult to recover from errors made in the earlier output frames. Although the choice of PLF decisively affects reconstruction quality, we also demonstrate that it may not be essential to commit to a particular PLF during encoding and the choice of PLF can be delegated to the decoder. In particular, encoded representations generated by training a system to minimize the MSE (without requiring either PLF) can be {\em near universal} and can generate close to optimal reconstructions for either choice of PLF at the decoder. We validate our results using (one-shot) information-theoretic analysis, detailed study of the rate-distortion-perception tradeoff of the Gauss-Markov source model as well as deep-learning based experiments on moving MNIST and KTH datasets.

eess.IV↗

arXiv2023

A spectral-timing study of the inner flow geometry in MAXI J1535--571 with $Insight$-HXMT and NICER

We have performed a spectral-timing analysis on the black hole X-ray binary MAXI J1535--571 during its 2017 outburst, with the aim of exploring the evolution of the inner accretion flow geometry. X-ray reverberation lags are observed in the hard-intermediate state (HIMS) and soft-intermediate state (SIMS) of the outburst. During the HIMS, the characteristic frequency of the reverberation lags $ν_0$ (the frequency at which the soft lag turns to zero in the lag-frequency spectra) increases when the spectrum softens. This reflects a reduction of the spatial distance between the corona and accretion disc, when assuming the measured time lags are associated with the light travel time. We also find a strong correlation between $ν_0$ and type-C Quasi Periodic Oscillation (QPO) centroid frequency $ν_{QPO}$, which can be well explained by the Lense-Thirring (L-T) precession model under a truncated disk geometry. Despite the degeneracy in the spectral modellings, our results suggest that the accretion disc is largely truncated in the low hard state (LHS), and moves inward as the spectrum softens. Combine the spectral modelling results with the $ν_0$ - $ν_{QPO}$ evolution, we are inclined to believe that this source probably have a truncated disk geometry in the hard state.

astro-ph.HE↗

arXiv2023

The mHz quasi-regular modulations of 4U 1630--47 during its 1998 outburst

We present the results of a detailed timing and spectral analysis of the quasi-regular modulation (QRM) phenomenon in the black hole X-ray binary 4U 1630--47 during its 1998 outburst observed by Rossi X-ray Timing Explore (RXTE). We find that the $\sim$ 50-110 mHz QRM is flux dependent, and the QRM is detected with simultaneous low frequency quasi-periodic oscillations (LFQPOs). According to the behavior of the power density spectrum, we divide the observations into four groups. In the first group, namely behavior A, LFQPOs are detected, but no mHz QRM. The second group, namely behavior B, a QRM with frequency above $\sim$ 88 mHz is detected and the $\sim$ 5 Hz and $\sim$ 7 Hz LFQPOs are almost overlapping. In the third group, namely behavior C, the QRM frequency below $\sim$ 88 mHz is detected and the LFQPOs are significantly separated. In the forth group, namely behavior D, neither QRM nor LFQPOs are detected. We study the energy-dependence of the fractional rms, centroid frequency, and phase-lag of QRM and LFQPOs for behavior B and C. We then study the evolution of QRM and find that the frequency of QRM increases with hardness, while its rms decreases with hardness. We also analyze the spectra of each observation, and find that the QRM rms of behavior B has a positive correlation with $\rm F_{\rm powerlaw}$ / $\rm F_{\rm total}$. Finally, we give our understanding for this mHz QRM phenomena.

astro-ph.HE↗

arXiv2023

Hilbert-Huang Transform analysis of quasi-periodic oscillations in MAXI J1820+070

We present time-frequency analysis, based on the Hilbert-Huang transform (HHT), of the evolution on the low-frequency quasi-periodic oscillations (LFQPOs) observed in the black hole X-ray binary MAXI J1820+070. Through the empirical mode decomposition (EMD) method, we decompose the light curve of the QPO component and measure its intrinsic phase lag between photons from different energy bands. We find that the QPO phase lag is negative (low energy photons lag behind high energy photons), meanwhile the absolute value of the lag increases with energy. By applying the Hilbert transform to the light curve of the QPO, we further extract the instantaneous frequency and amplitude of the QPO. Compared these results with those from the Fourier analysis, we find that the broadening of the QPO peak is mainly caused by the frequency modulation. Through further analysis, we find that these modulations could share a common physical origin with the broad-band noise, and can be well explained by the internal shock model of the jet.

astro-ph.HE↗

arXiv2023

Active Sensing for Two-Sided Beam Alignment and Reflection Design Using Ping-Pong Pilots

Beam alignment is an important task for millimeter-wave (mmWave) communication, because constructing aligned narrow beams both at the transmitter (Tx) and the receiver (Rx) is crucial in terms of compensating the significant path loss in very high-frequency bands. However, beam alignment is also a highly nontrivial task because large antenna arrays typically have a limited number of radio-frequency chains, allowing only low-dimensional measurements of the high-dimensional channel. This paper considers a two-sided beam alignment problem based on an alternating ping-pong pilot scheme between Tx and Rx over multiple rounds without explicit feedback. We propose a deep active sensing framework in which two long short-term memory (LSTM) based neural networks are employed to learn the adaptive sensing strategies (i.e., measurement vectors) and to produce the final aligned beamformers at both sides. In the proposed ping-pong protocol, the Tx and the Rx alternately send pilots so that both sides can leverage local observations to sequentially design their respective sensing and data transmission beamformers. The proposed strategy can be extended to scenarios with a reconfigurable intelligent surface (RIS) for designing, in addition, the reflection coefficients at the RIS for both sensing and communications. Numerical experiments demonstrate significant and interpretable performance improvement. The proposed strategy works well even for the challenging multipath channel environments.

cs.IT↗