Searcharxiv⌕ Search

arXiv subjects

Chun Huang

Publications and source records attributed to Chun Huang.

33 records · Page 2Linked to original sources

Equation of State Independent Determination on the Radius of a 1.4 $M_{\odot}$ Neutron Star Using Mass-Radius Measurements

Traditional methods for determining the radius of a 1.4 $M_{\odot}$ neutron star ($R_{1.4}$) rely on specific equations of state (EOS) models that describe various types of dense nuclear matter. This dependence on EOS models can introduce substantial systematic uncertainties, which may exceed the measurement uncertainties when constraining $R_{1.4}$. In this study, we explore a novel approach to constraining $R_{1.4}$ using data from NICER observations of PSR J0030+0451 (J0030) and PSR J0437-4715 (J0437). However, this work presents a more data-driven analysis framework, substantially decreasing the need for EOS assumptions. By analyzing the Mass-Radius measurements of these two neutron stars, we infer $R_{1.4}$ using statistical methods based mostly on observational data. We examine various hotspot configurations for J0030, along with new J0437 observations, and their effects on the inferred radius. Our results are consistent with X-ray timing, gravitational wave, and nuclear physics constraints, while avoiding EOS-related biases. The same method has also been applied to a simulated mass-radius dataset, based on our knowledge of future X-ray telescopes, demonstrating the model's ability to recover the injected $R_{1.4}$ value in certain cases. This method provides a data-driven pathway for extracting neutron star properties and offers a new approach for future observational efforts in neutron star astrophysics.

astro-ph.HE↗

CompactObject: An open-source Python package for full-scope neutron star equation of state inference

The CompactObject package is an open-source software framework developed to constrain the neutron star equation of state (EOS) through Bayesian statistical inference. It integrates astrophysical observational constraints from X-ray timing, gravitational wave events, and radio measurements, as well as nuclear experimental constraints derived from perturbative Quantum Chromodynamics (pQCD) and Chiral Effective Field Theory ($χ$EFT). The package supports a diverse range of EOS models, including meta-model like and several physics-motivated EOS models. It comprises three independent components: an EOS generator module that currently provides seven EOS choices, a Tolman-Oppenheimer-Volkoff (TOV) equation solver, that allows the determination of the Mass Radius and Tidal deformability as observables, and a comprehensive Bayesian inference workflow module, including a complete pipeline for implementing EOS Bayesian inference. Each component can be used independently in different scientific research contexts, such as nuclear physics and astrophysics. In addition, CompactObject is designed to work in synergy with existing software such as CompOSE, allowing the use of the CompOSE EOS database to extend the EOS options available.

astro-ph.HE↗

Bayesian Insights into post-Glitch Dynamics: Model comparison and parameter constraint from decades long observation data of the Crab pulsar

The Crab Pulsar has exhibited numerous glitches accompanied by persistent shifts in its spin-down rate. The explanation of the observed persistent shifts remain a challenge. We perform a detailed Bayesian analysis to compare four data-fitting models, ranging from a simple linear model to more complex power-law and logarithmic models, using a dataset of observed glitches and persistent shifts. Our results show the large observed events are difficult to explain by the usually assumed linear model due to starquakes. A particularly notable finding is that the logarithmic model provides the best fit to the observation data but the two power-law models show a close tie to it. Detail differences of these models may be further clarified by the understanding of internal physics of neutron stars.

astro-ph.HE↗

Unusual charge density wave introduced by Janus structure in monolayer vanadium dichalcogenides

As a fundamental structural feature, the symmetry of materials determines the exotic quantum properties in transition metal dichalcogenides (TMDs) with charge density wave (CDW). Breaking the inversion symmetry, the Janus structure, an artificially constructed lattice, provides an opportunity to tune the CDW states and the related properties. However, limited by the difficulties in atomic-level fabrication and material stability, the experimental visualization of the CDW states in 2D TMDs with Janus structure is still rare. Here, using surface selenization of VTe2, we fabricated monolayer Janus VTeSe. With scanning tunneling microscopy, an unusual root13-root13 CDW state with threefold rotational symmetry breaking was observed and characterized. Combined with theoretical calculations, we find this CDW state can be attributed to the charge modulation in the Janus VTeSe, beyond the conventional electron-phonon coupling. Our findings provide a promising platform for studying the CDW states and artificially tuning the electronic properties toward the applications.

cond-mat.mtrl-sci↗

Constraining a relativistic mean field model using neutron star mass-radius measurements I: Nucleonic models

Measurements of neutron star mass and radius or tidal deformability deliver unique insight into the equation of state (EOS) of cold dense matter. EOS inference is very often done using generalized parametric or non-parametric models which deliver no information on composition. In this paper we consider a microscopic nuclear EOS model based on a field theoretical approach. We show that current measurements from NICER and gravitational wave observations constrain primarily the symmetric nuclear matter EOS. We then explore what could be delivered by measurements of mass and radius at the level anticipated for future large-area X-ray timing telescopes. These should be able to place very strong limits on the symmetric nuclear matter EOS, in addition to constraining the nuclear symmetry energy that determines the proton fraction inside the neutron star.

astro-ph.HE↗

Low-Complexity Channel Estimation for Extremely Large-Scale MIMO in Near Field

The extremely large-scale massive multiple-input multiple-output (XL-MIMO) has the potential to achieve boosted spectral efficiency and refined spatial resolution for future wireless networks. However, channel estimation for XL-MIMO is challenging since the large number of antennas results in high computational complexity with the near-field effect. In this letter, we propose a low-complexity sequential angle-distance channel estimation (SADCE) method for near-field XL-MIMO systems equipped with uniformly planar arrays (UPA). Specifically, we first successfully decouple the angle and distance parameters, which allows us to devise a two-dimensional discrete Fourier transform (2D-DFT) method for angle parameters estimation. Then, a low-complexity distance estimation method is proposed with a closed-form solution. Compared with existing methods, the proposed method achieves significant performance gain with noticeably reduced computational complexity.Numerical results verify the superiority of the proposed near-field channel estimation algorithm.

cs.IT↗

Programming Bare-Metal Accelerators with Heterogeneous Threading Models: A Case Study of Matrix-3000

As the hardware industry moves towards using specialized heterogeneous many-cores to avoid the effects of the power wall, software developers are finding it hard to deal with the complexity of these systems. This article shares our experience when developing a programming model and its supporting compiler and libraries for Matrix-3000, which is designed for next-generation exascale supercomputers but has a complex memory hierarchy and processor organization. To assist its software development, we developed a software stack from scratch that includes a low-level programming interface and a high-level OpenCL compiler. Our low-level programming model offers native programming support for using the bare-metal accelerators of Matrix-3000, while the high-level model allows programmers to use the OpenCL programming standard. We detail our design choices and highlight the lessons learned from developing systems software to enable the programming of bare-metal accelerators. Our programming models have been deployed to the production environment of an exascale prototype system.

cs.PL↗

Symmetry breaking Paradigm In Typical Laminar-Turbulence Transition System

A stationary cylindrical vessel containing a rotating plate near the bottle surface is partially filled with liquid. With the bottom rotating, the shape of the liquid surface would become polygon-like. This polygon vortex phenomenon is an ideal system to demonstrate the Laminar-Turbulent transition process. Within the framework of equilibrium statistical mechanics, a profound comparison with Landau's phase transition theory was applied in the symmetry-breaking aspect to derive the evolution equation of this system phenomenologically. A comparison between theoretical prediction and experimental data is carried out. We concluded a considerably highly matched result, while some exceptions are viewed as the natural result that the experiment breaks through the up-limit of using equilibrium mechanics as an effective theory, namely breaking through the Arnold Tongue. Some extremely complex Non-equilibrium approaches were desired to solve this problem thoroughly in the future. So our method could be viewed as a linear approximation of this theoretical framework.

physics.flu-dyn↗

Neutron Star Persistent Shift Phenomena and Relavant Data Fitting Analysis

Pulsar glitches are the sudden increase in their spin frequency, most accompanied with a long timescale recovery process. A permanent shift would be remained in the first order derivative of spin frequency with time. Relevant data fitting research about this persistent shift was performed in this essay, we have found a more suitable fitting strategy by choosing a fitting function form $k\ln(ax + b)$ and demonstrated that would be more meaningful in pure mathematical aspect in describe the correlation between the time scale of Delayed-Spin-Up $τ_{d}$ (so as the persistent shift $Δ\dotν_{p}$) and glitch size $Δν$.Some possible physical ideas about this fitting also have been presented while the clear physical mechanism behind this strategy still remain unknown.

astro-ph.HE↗

Parallel Programming Models for Heterogeneous Many-Cores : A Survey

Heterogeneous many-cores are now an integral part of modern computing systems ranging from embedding systems to supercomputers. While heterogeneous many-core design offers the potential for energy-efficient high-performance, such potential can only be unlocked if the application programs are suitably parallel and can be made to match the underlying heterogeneous platform. In this article, we provide a comprehensive survey for parallel programming models for heterogeneous many-core architectures and review the compiling techniques of improving programmability and portability. We examine various software optimization techniques for minimizing the communicating overhead between heterogeneous computing devices. We provide a road map for a wide variety of different research areas. We conclude with a discussion on open issues in the area and potential research directions. This article provides both an accessible introduction to the fast-moving area of heterogeneous programming and a detailed bibliography of its main achievements.

cs.DC↗

Optimizing Streaming Parallelism on Heterogeneous Many-Core Architectures: A Machine Learning Based Approach

This article presents an automatic approach to quickly derive a good solution for hardware resource partition and task granularity for task-based parallel applications on heterogeneous many-core architectures. Our approach employs a performance model to estimate the resulting performance of the target application under a given resource partition and task granularity configuration. The model is used as a utility to quickly search for a good configuration at runtime. Instead of hand-crafting an analytical model that requires expert insights into low-level hardware details, we employ machine learning techniques to automatically learn it. We achieve this by first learning a predictive model offline using training programs. The learnt model can then be used to predict the performance of any unseen program at runtime. We apply our approach to 39 representative parallel applications and evaluate it on two representative heterogeneous many-core platforms: a CPU-XeonPhi platform and a CPU-GPU platform. Compared to the single-stream version, our approach achieves, on average, a 1.6x and 1.1x speedup on the XeonPhi and the GPU platform, respectively. These results translate to over 93% of the performance delivered by a theoretically perfect predictor.

cs.DC↗

Combining Symbolic Execution and Model Checking to Verify MPI Programs

Message passing is the standard paradigm of programming in high-performance computing. However, verifying Message Passing Interface (MPI) programs is challenging, due to the complex program features (such as non-determinism and non-blocking operations). In this work, we present MPI symbolic verifier (MPI-SV), the first symbolic execution based tool for automatically verifying MPI programs with non-blocking operations. MPI-SV combines symbolic execution and model checking in a synergistic way to tackle the challenges in MPI program verification. The synergy improves the scalability and enlarges the scope of verifiable properties. We have implemented MPI-SV (footnote: https://mpi-sv.github.io) and evaluated it with 111 real-world MPI verification tasks. The pure symbolic execution-based technique successfully verifies 61 out of the 111 tasks (55\%) within one hour, while in comparison, MPI-SV verifies 100 tasks (90\%). On average, compared with pure symbolic execution, MPI-SV achieves 19x speedups on verifying the satisfaction of the critical property and 5x speedups on finding violations.

cs.PL↗

Non-ergodic Convergence Analysis of Heavy-Ball Algorithms

In this paper, we revisit the convergence of the Heavy-ball method, and present improved convergence complexity results in the convex setting. We provide the first non-ergodic O(1/k) rate result of the Heavy-ball algorithm with constant step size for coercive objective functions. For objective functions satisfying a relaxed strongly convex condition, the linear convergence is established under weaker assumptions on the step size and inertial parameter than made in the existing literature. We extend our results to multi-block version of the algorithm with both the cyclic and stochastic update rules. In addition, our results can also be extended to decentralized optimization, where the ergodic analysis is not applicable.

math.OC↗

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

In this paper, an efficient divide-and-conquer (DC) algorithm is proposed for the symmetric tridiagonal matrices based on ScaLAPACK and the hierarchically semiseparable (HSS) matrices. HSS is an important type of rank-structured matrices.Most time of the DC algorithm is cost by computing the eigenvectors via the matrix-matrix multiplications (MMM). In our parallel hybrid DC (PHDC) algorithm, MMM is accelerated by using the HSS matrix techniques when the intermediate matrix is large. All the HSS algorithms are done via the package STRUMPACK. PHDC has been tested by using many different matrices. Compared with the DC implementation in MKL, PHDC can be faster for some matrices with few deflations when using hundreds of processes. However, the gains decrease as the number of processes increases. The comparisons of PHDC with ELPA (the Eigenvalue soLvers for Petascale Applications library) are similar. PHDC is usually slower than MKL and ELPA when using 300 or more processes on Tianhe-2 supercomputer.

cs.MS↗

MPISE: Symbolic Execution of MPI Programs

Message Passing Interfaces (MPI) plays an important role in parallel computing. Many parallel applications are implemented as MPI programs. The existing methods of bug detection for MPI programs have the shortage of providing both input and non-determinism coverage, leading to missed bugs. In this paper, we employ symbolic execution to ensure the input coverage, and propose an on-the-fly schedule algorithm to reduce the interleaving explorations for non-determinism coverage, while ensuring the soundness and completeness. We have implemented our approach as a tool, called MPISE, which can automatically detect the deadlock and runtime bugs in MPI programs. The results of the experiments on benchmark programs and real world MPI programs indicate that MPISE finds bugs effectively and efficiently. In addition, our tool also provides diagnostic information and replay mechanism to help understanding bugs.

cs.DC↗