arXiv subjects

Juan Zhang

Publications and source records attributed to Juan Zhang.

At least 91 records · Page 5Linked to original sources

arXiv2024

Thermal x-ray studies of neutron stars and the equation of state

The understanding of neutron star equation of state hinges on a comprehensive analysis of multi-messenger, multi-wavelength data. The recent scrutiny of PSR J0030+0451 data by NICER introduces complexities, unveiling a tension with another X-ray observation of the central compact object in HESS J1731-347, specifically concerning the mass-radius constraint of low-mass neutron stars. This tension persists when integrating NICER's updated data with LIGO/Virgo's gravitational-wave data from the GW170817 binary neutron star merger. Despite attempts to reconcile these disparate observations, the current combined data still can not distinguish different types of neutron stars -- whether they are pure neutron stars or hybrid stars. Bayesian inference indicates only modest changes in the posterior ranges of parameters related to the nuclear matter and deconfinement phase transition. This ongoing exploration underscores the intricate challenges in precisely characterizing neutron stars. It also points out that it is possible to probe the equation of state at different density regimes from future more accurate radii of neutron stars with various masses.

astro-ph.HE↗

arXiv2024

AdaMR: Adaptable Molecular Representation for Unified Pre-training Strategy

We propose Adjustable Molecular Representation (AdaMR), a new large-scale uniform pre-training strategy for small-molecule drugs, as a novel unified pre-training strategy. AdaMR utilizes a granularity-adjustable molecular encoding strategy, which is accomplished through a pre-training job termed molecular canonicalization, setting it apart from recent large-scale molecular models. This adaptability in granularity enriches the model's learning capability at multiple levels and improves its performance in multi-task scenarios. Specifically, the substructure-level molecular representation preserves information about specific atom groups or arrangements, influencing chemical properties and functionalities. This proves advantageous for tasks such as property prediction. Simultaneously, the atomic-level representation, combined with generative molecular canonicalization pre-training tasks, enhances validity, novelty, and uniqueness in generative tasks. All of these features work together to give AdaMR outstanding performance on a range of downstream tasks. We fine-tuned our proposed pre-trained model on six molecular property prediction tasks (MoleculeNet datasets) and two generative tasks (ZINC250K datasets), achieving state-of-the-art (SOTA) results on five out of eight tasks.

q-bio.BM↗

arXiv2024

Low-rank alternating direction doubling algorithm for solving large-scale continuous time algebraic Riccati equations

This paper proposes an effective low-rank alternating direction doubling algorithm (R-ADDA) for computing numerical low-rank solutions to large-scale sparse continuous-time algebraic Riccati matrix equations. The method is based on the alternating direction doubling algorithm (ADDA), utilizing the low-rank property of matrices and employing Cholesky factorization for solving. The advantage of the new algorithm lies in computing only the $2^k$-th approximation during the iterative process, instead of every approximation. Its efficient low-rank formula saves storage space and is highly effective from a computational perspective. Finally, the effectiveness of the new algorithm is demonstrated through theoretical analysis and numerical experiments.

math.NA↗

arXiv2024

A general alternating direction implicit iteration method for solving complex symmetric linear systems

We have introduced the generalized alternating direction implicit iteration (GADI) method for solving large sparse complex symmetric linear systems and proved its convergence properties. Additionally, some numerical results have demonstrated the effectiveness of this algorithm. Furthermore, as an application of the GADI method in solving complex symmetric linear systems, we utilized the flattening operator and Kronecker product properties to solve Lyapunov and Riccati equations with complex coefficients using the GADI method. In solving the Riccati equation, we combined inner and outer iterations, first simplifying the Riccati equation into a Lyapunov equation using the Newton method, and then applying the GADI method for solution. Finally, we provided convergence analysis of the method and corresponding numerical results.

math.NA↗

arXiv2024

Fusion-Mamba for Cross-modality Object Detection

Cross-modality fusing complementary information from different modalities effectively improves object detection performance, making it more useful and robust for a wider range of applications. Existing fusion strategies combine different types of images or merge different backbone features through elaborated neural network modules. However, these methods neglect that modality disparities affect cross-modality fusion performance, as different modalities with different camera focal lengths, placements, and angles are hardly fused. In this paper, we investigate cross-modality fusion by associating cross-modal features in a hidden state space based on an improved Mamba with a gating mechanism. We design a Fusion-Mamba block (FMB) to map cross-modal features into a hidden state space for interaction, thereby reducing disparities between cross-modal features and enhancing the representation consistency of fused features. FMB contains two modules: the State Space Channel Swapping (SSCS) module facilitates shallow feature fusion, and the Dual State Space Fusion (DSSF) enables deep fusion in a hidden state space. Through extensive experiments on public datasets, our proposed approach outperforms the state-of-the-art methods on $m$AP with 5.9% on $M^3FD$ and 4.9% on FLIR-Aligned datasets, demonstrating superior object detection performance. To the best of our knowledge, this is the first work to explore the potential of Mamba for cross-modal fusion and establish a new baseline for cross-modality object detection.

cs.CV↗

arXiv2024

Preprocessed GMRES for fast solution of linear equations

The article mainly introduces preprocessing algorithms for solving linear equation systems. This algorithm uses three algorithms as inner iterations, namely RPCG algorithm, ADI algorithm, and Kaczmarz algorithm. Then, it uses BA-GMRES as an outer iteration to solve the linear equation system. These three algorithms can indirectly generate preprocessing matrices, which are used for solving equation systems. In addition, we provide corresponding convergence analysis and numerical examples. Through numerical examples, we demonstrate the effectiveness and feasibility of these preprocessing methods. Furthermore, in the Kaczmarz algorithm, we introduce both constant step size and adaptive step size, and extend the parameter range of the Kaczmarz algorithm to $α\in(0,\infty)$. We also study the solution rate of linear equation systems using different step sizes. Numerical examples show that both constant step size and adaptive step size have higher solution efficiency than the solving algorithm without preprocessing.

math.NA↗

arXiv2024

Optimization methods for solving matrix equations

In this paper, we focus on using optimization methods to solve matrix equations by transforming the problem of solving the Sylvester matrix equation or continuous algebraic Riccati equation into an optimization problem. Initially, we use a constrained convex optimization method (CCOM) to solve the Sylvester matrix equation with $\ell_{2,1}$-norm, where we provide a convergence analysis and numerical examples of CCOM; however, the results show that the algorithm is not efficient. To address this issue, we employ classical quasi-Newton methods such as DFP and BFGS algorithms to solve the Sylvester matrix equation and present the convergence and numerical results of the algorithm. Additionally, we compare these algorithms with the CG algorithm and AR algorithm, and our results demonstrate that the presented algorithms are effective. Furthermore, we propose a unified framework of the alternating direction multiplier method (ADMM) for directly solving the continuous algebraic Riccati equation (CARE), and we provide the convergence and numerical results of ADMM. Our experimental results indicate that ADMM is an effective optimization algorithm for solving CARE. Finally, to improve the effectiveness of the optimization method for solving Riccati equation, we propose the Newton-ADMM algorithm framework, where the outer iteration of this method is the classical Newton method, and the inner iteration involves using ADMM to solve Lyapunov matrix equations inexactly. We also provide the convergence and numerical results of this algorithm, which our results demonstrate are more efficient than ADMM for solving CARE.

math.NA↗

arXiv2024

Low-rank generalized alternating direction implicit iteration method for solving matrix equations

This paper presents an effective low-rank generalized alternating direction implicit iteration (R-GADI) method for solving large-scale sparse and stable Lyapunov matrix equations and continuous-time algebraic Riccati matrix equations. The method is based on generalized alternating direction implicit iteration (GADI), which exploits the low-rank property of matrices and utilizes the Cholesky factorization approach for solving. The advantage of the new algorithm lies in its direct and efficient low-rank formulation, which is a variant of the Cholesky decomposition in the Lyapunov GADI method, saving storage space and making it computationally effective. When solving the continuous-time algebraic Riccati matrix equation, the Riccati equation is first simplified to a Lyapunov equation using the Newton method, and then the R-GADI method is employed for computation. Additionally, we analyze the convergence of the R-GADI method and prove its consistency with the convergence of the GADI method. Finally, the effectiveness of the new algorithm is demonstrated through corresponding numerical experiments.

math.NA↗

arXiv2024

A preconditioned iteration method for solving saddle point problems

This paper introduces a preconditioned method designed to comprehensively address the saddle point system with the aim of improving convergence efficiency. In the preprocessor construction phase, a technical approach for solving the approximate inverse matrix of sparse matrices is presented. The effectiveness of the proposed method is demonstrated through numerical examples, emphasizing its efficacy in approximating the inverse matrix. Furthermore, the preprocessing technology includes a low-rank processing step, effectively reducing algorithmic complexity. Numerical experiments validate the effectiveness and feasibility of PSLR-GMRES in solving the saddle point system.

math.NA↗

arXiv2024

Virbo: Multimodal Multilingual Avatar Video Generation in Digital Marketing

With the widespread popularity of internet celebrity marketing all over the world, short video production has gradually become a popular way of presenting products information. However, the traditional video production industry usually includes series of procedures as script writing, video filming in a professional studio, video clipping, special effects rendering, customized post-processing, and so forth. Not to mention that multilingual videos is not accessible for those who could not speak multilingual languages. These complicated procedures usually needs a professional team to complete, and this made short video production costly in both time and money. This paper presents an intelligent system that supports the automatic generation of talking avatar videos, namely Virbo. With simply a user-specified script, Virbo could use a deep generative model to generate a target talking videos. Meanwhile, the system also supports multimodal inputs to customize the video with specified face, specified voice and special effects. This system also integrated a multilingual customization module that supports generate multilingual talking avatar videos in a batch with hundreds of delicate templates and creative special effects. Through a series of user studies and demo tests, we found that Virbo can generate talking avatar videos that maintained a high quality of videos as those from a professional team while reducing the entire production costs significantly. This intelligent system will effectively promote the video production industry and facilitate the internet marketing neglecting of language barriers and cost challenges.

cs.MM↗

arXiv2024

G4G:A Generic Framework for High Fidelity Talking Face Generation with Fine-grained Intra-modal Alignment

Despite numerous completed studies, achieving high fidelity talking face generation with highly synchronized lip movements corresponding to arbitrary audio remains a significant challenge in the field. The shortcomings of published studies continue to confuse many researchers. This paper introduces G4G, a generic framework for high fidelity talking face generation with fine-grained intra-modal alignment. G4G can reenact the high fidelity of original video while producing highly synchronized lip movements regardless of given audio tones or volumes. The key to G4G's success is the use of a diagonal matrix to enhance the ordinary alignment of audio-image intra-modal features, which significantly increases the comparative learning between positive and negative samples. Additionally, a multi-scaled supervision module is introduced to comprehensively reenact the perceptional fidelity of original video across the facial region while emphasizing the synchronization of lip movements and the input audio. A fusion network is then used to further fuse the facial region and the rest. Our experimental results demonstrate significant achievements in reenactment of original video quality as well as highly synchronized talking lips. G4G is an outperforming generic framework that can produce talking videos competitively closer to ground truth level than current state-of-the-art methods.

cs.CV↗

arXiv2024

Simulation Studies for the First Pathfinder of the CATCH Space Mission

The Chasing All Transients Constellation Hunters (CATCH) space mission is an intelligent constellation consisting of 126 micro-satellites in three types (A, B, and C), designed for X-ray observation with the objective of studying the dynamic universe. Currently, we are actively developing the first Pathfinder (CATCH-1) for the CATCH mission, specifically for type-A satellites. CATCH-1 is equipped with Micro Pore Optics (MPO) and a 4-pixel Silicon Drift Detector (SDD) array. To assess its scientific performance, including the effective area of the optical system, on-orbit background, and telescope sensitivity, we employ the Monte Carlo software Geant4 for simulation in this study. The MPO optics exhibit an effective area of $41$ cm$^2$ at the focal spot for 1 keV X-rays, while the entire telescope system achieves an effective area of $29$ cm$^2$ at 1 keV when taking into account the SDD detector's detection efficiency. The primary contribution to the background is found to be from the Cosmic X-ray Background. Assuming a 625 km orbit with an inclination of $29^\circ$, the total background for CATCH-1 is estimated to be $8.13\times10^{-2}$ counts s$^{-1}$ in the energy range of 0.5--4 keV. Based on the background within the central detector and assuming a Crab-like source spectrum, the estimated ideal sensitivity could achieve $1.9\times10^{-12}$ erg cm$^{-2}$ s$^{-1}$ for an exposure of 10$^4$ s in the energy band of 0.5--4 keV. Furthermore, after simulating the background caused by low-energy charged particles near the geomagnetic equator, we have determined that there is no need to install a magnetic deflector.

astro-ph.IM↗

arXiv2023

High-accuracy numerical methods and convergence analysis for Schrödinger equation with incommensurate potentials

Numerical solving the Schrödinger equation with incommensurate potentials presents a great challenge since its solutions could be space-filling quasiperiodic structures without translational symmetry nor decay. In this paper, we propose two high-accuracy numerical methods to solve the time-dependent quasiperiodic Schrödinger equation. Concretely, we discretize the spatial variables by the quasiperiodic spectral method and the projection method, and the time variable by the second-order operator splitting method. The corresponding convergence analysis is also presented and shows that the proposed methods both have exponential convergence rate in space and second order accuracy in time, respectively. Meanwhile, we analyse the computational complexity of these numerical algorithms. One- and two-dimensional numerical results verify these convergence conclusions, and demonstrate that the projection method is more efficient.

math.NA↗

arXiv2023

Equivalence of Strong Brunn-Minkowski Inequalities and CD Conditions in Heisenberg Groups

The present paper investigates the sub-Riemannian version of the equivalence between the curvature-dimension conditions and strong Brunn-Minkowski inequalities in the sub-Riemannian Heisenberg group Hn. We adopt the optimal transport and approximation of Hn developed by Ambrosio and Rigot [1] and combine the celebrated works by M. Magnabosco, L. Portinale and T. Rossi [17] to confirm this.

math.DG↗

arXiv2023

The Minkowski problem in Heisenberg groups

As we all know, the Minkowski type problem is the cornerstone of the Brunn-Minkowski theory in Euclidean space. The Heisenberg group as a sub-Riemannian space is the simplest non-Abelian degenerate Riemannian space that is completely different from a Euclidean space. By analogy with the Minkowski type problem in Euclidean space, the Minkowski type problem in Heisenberg groups is still open. In the present paper, we develop for the first time a sub-Riemannian version of Minkowski type problem in the horizontal distributions of Heisenberg groups, and further give a positive answer to this sub-Riemannian Minkowski type problem via the variational method.

math.DG↗

arXiv2023

Enhancing Psychological Counseling with Large Language Model: A Multifaceted Decision-Support System for Non-Professionals

In the contemporary landscape of social media, an alarming number of users express negative emotions, some of which manifest as strong suicidal intentions. This situation underscores a profound need for trained psychological counselors who can enact effective mental interventions. However, the development of these professionals is often an imperative but time-consuming task. Consequently, the mobilization of non-professionals or volunteers in this capacity emerges as a pressing concern. Leveraging the capabilities of artificial intelligence, and in particular, the recent advances in large language models, offers a viable solution to this challenge. This paper introduces a novel model constructed on the foundation of large language models to fully assist non-professionals in providing psychological interventions on online user discourses. This framework makes it plausible to harness the power of non-professional counselors in a meaningful way. A comprehensive study was conducted involving ten professional psychological counselors of varying expertise, evaluating the system across five critical dimensions. The findings affirm that our system is capable of analyzing patients' issues with relative accuracy and proffering professional-level strategies recommendations, thereby enhancing support for non-professionals. This research serves as a compelling validation of the application of large language models in the field of psychology and lays the groundwork for a new paradigm of community-based mental health support.

cs.AI↗

arXiv2023

In-orbit background simulation of a type-B CATCH satellite

The Chasing All Transients Constellation Hunters (CATCH) space mission plans to launch three types of micro-satellites (A, B, and C). The type-B CATCH satellites are dedicated to locating transients and detecting their time-dependent energy spectra. A type-B satellite is equipped with lightweight Wolter-I X-ray optics and an array of position-sensitive multi-pixel Silicon Drift Detectors. To optimize the scientific payloads for operating properly in orbit and performing the observations with high sensitivities, this work performs an in-orbit background simulation of a type-B CATCH satellite using the Geant4 toolkit. It shows that the persistent background is dominated by the cosmic X-ray diffuse background and the cosmic-ray protons. The dynamic background is also estimated considering trapped charged particles in the radiation belts and low-energy charged particles near the geomagnetic equator, which is dominated by the incident electrons outside the aperture. The simulated persistent background within the focal spot is used to estimate the observation sensitivity, i.e. 4.22$\times$10$^{-13}$ erg cm$^{-2}$ s$^{-1}$ with an exposure of 10$^{4}$ s and a Crab-like source spectrum, which can be utilized further to optimize the shielding design. The simulated in-orbit background also suggests that the magnetic diverter just underneath the optics may be unnecessary in this kind of micro-satellites, because the dynamic background induced by charged particles outside the aperture is around 3 orders of magnitude larger than that inside the aperture.

astro-ph.IM↗

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↗