Chemical potentials of light flavor quarks from yield ratios of negative to positive particles in Au+Au collisions at RHIC

The transverse momentum spectra of $\pi^{-}$, $\pi^{+}$, $K^{-}$, $K^{+}$, $\bar{p}$, and $p$ produced in Au+Au collisions at center-of-mass energy $\sqrt{s_{NN}}=7.7$, 11.5, 19.6, 27, 39, 62.4, 130, and $200$ GeV are analyzed in the framework of a multisource thermal model. The experimental data measured at midrapidity by the STAR Collaboration are fitted by the (two-component) standard distribution. The effective temperature of emission source increases obviously with the increase of the particle mass and the collision energy. At different collision energies, the chemical potentials of up, down, and strange quarks are obtained from the antiparticle to particle yield ratios in given transverse momentum ranges available in experiments. With the increase of logarithmic collision energy, the chemical potentials of light flavor quarks decrease exponentially.Comment: 9 pages, 2 figures. Advances in High Energy Physics, accepte

(E)-N′-(5-Bromo-2-hy­droxy­benzyl­idene)-3-methyl­benzohydrazide

In the title mol­ecule, C15H13BrN2O2, an intra­molecular O—H⋯N hydrogen bond influences the mol­ecular conformation; the two benzene rings form a dihedral angle of 13.6 (3)°. In the crystal, inter­molecular N—H⋯O hydrogen bonds link the mol­ecules into chains along the a axis and weak inter­molecular C—H⋯O hydrogen bonds further link these chains into layers parallel to the ac plane

A Novel Rough Set Model in Generalized Single Valued Neutrosophic Approximation Spaces and Its Application

In this paper, we extend the rough set model on two different universes in intuitionistic fuzzy approximation spaces to a single-valued neutrosophic environment

Fast Iterative Graph Computation: A Path Centric Approach

Abstract—Large scale graph processing represents an inter-esting challenge due to the lack of locality. This paper presents PathGraph for improving iterative graph computation on graphs with billions of edges. Our system design has three unique features: First, we model a large graph using a collection of tree-based partitions and use an path-centric computation rather than vertex-centric or edge-centric computation. Our parallel computation model significantly improves the memory and disk locality for performing iterative computation algorithms. Second, we design a compact storage that further maximize sequential access and minimize random access on storage media. Third, we implement the path-centric computation model by using a scatter/gather programming model, which parallels the iterative computation at partition tree level and performs sequential updates for vertices in each partition tree. The experimental results show that the path-centric approach outperforms vertex-centric and edge-centric systems on a number of graph algorithms for both in-memory and out-of-core graphs