arXiv subjects

X. He

Publications and source records attributed to X. He.

93 records · Page 6Linked to original sources

arXiv2014

Concept for an Electron Ion Collider (EIC) detector built around the BaBar solenoid

The PHENIX collaboration presents here a concept for a detector at a future Electron Ion Collider (EIC). The EIC detector proposed here, referred to as ePHENIX, will have excellent performance for a broad range of exciting EIC physics measurements, providing powerful investigations not currently available that will dramatically advance our understanding of how quantum chromodynamics binds the proton and forms nuclear matter.

nucl-ex↗

arXiv2006

Re-Identification of the `Enigmatic' X-ray Source 1RXS J114003.0+124112

The ROSAT X-ray source 1RXS J114003.0+124112 was identified as a starburst galaxy at redshift 0.177 by He et al. (2001). Meanwhile, the authors also noted that the source is almost two orders of magnitude brighter in X-ray than the X-ray-brightest starburst galaxy and it seems to be in a merging system, making this source an enigmatic system for further observations. This paper reports the re-identification of 1RXS J114003.0+124112 with the observations on the 2.6 m telescope at Byurakan Astrophysical Observatory, Armenia and with the SDSS data. The results indicate that the starburst activity is associated with the brighter object in the system, while the fainter object is a typical Seyfert 1 galaxy at redshift 0.282. Therefore, the two objects are not in a merging system, and the Seyfert 1 galaxy naturally accounts for the high X-ray flux. Three more objects reside in the vicinity, but they are all too faint to be responsible for the high X-ray flux.

astro-ph↗

arXiv2001

Bipartite graph partitioning and data clustering

Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, we propose a new data clustering method based on partitioning the underlying bipartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. We show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. We point out the connection of our clustering algorithm to correspondence analysis used in multivariate analysis. We also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, we apply our clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.

cs.IR↗