8,464 research outputs found

    New Ωc0\Omega_c^0 baryons discovered by LHCb as the members of 1P1P and 2S2S states

    Full text link
    Inspired by the newly observed Ωc0\Omega_c^0 states at LHCb, we decode their properties by performing an analysis of mass spectrum and decay behavior. Our studies show that the five narrow states, i.e., Ωc(3000)0\Omega_c(3000)^0, Ωc(3050)0\Omega_c(3050)^0, Ωc(3066)0\Omega_c(3066)^0, Ωc(3090)0\Omega_c(3090)^0, and Ωc(3119)0\Omega_c(3119)^0, could be grouped into the 1P1P states with negative parity. Among them, the Ωc(3000)0\Omega_c(3000)^0 and Ωc(3090)0\Omega_c(3090)^0 states could be the JP=1/2J^P=1/2^- candidates, while Ωc(3050)0\Omega_c(3050)^0 and Ωc(3119)0\Omega_c(3119)^0 are suggested as the JP=3/2J^P=3/2^- states. Ωc(3066)0\Omega_c(3066)^0 could be regarded as a JP=5/2J^P=5/2^- state. Since the the spin-parity, the electromagnetic transitions, and the possible hadronic decay channels Ωc()π\Omega_c^{(\ast)}\pi have not been measured yet, other explanations are also probable for these narrow Ωc0\Omega_c^0 states. Additionally, we discuss the possibility of the broad structure Ωc(3188)0\Omega_c(3188)^0 as a 2S2S state with JP=1/2+J^P=1/2^+ or JP=3/2+J^P=3/2^+. In our scheme, Ωc(3119)0\Omega_c(3119)^0 cannot be a 2S2S candidate.Comment: 10 pages, 3 figures, 5 tables, typos corrected. Published in Phys. Rev.

    Group Sparse CNNs for Question Classification with Answer Sets

    Full text link
    Question classification is an important task with wide applications. However, traditional techniques treat questions as general sentences, ignoring the corresponding answer data. In order to consider answer information into question modeling, we first introduce novel group sparse autoencoders which refine question representation by utilizing group information in the answer set. We then propose novel group sparse CNNs which naturally learn question representation with respect to their answers by implanting group sparse autoencoders into traditional CNNs. The proposed model significantly outperform strong baselines on four datasets.Comment: 6, ACL 201

    Classifying Relations by Ranking with Convolutional Neural Networks

    Full text link
    Relation classification is an important semantic processing task for which state-ofthe-art systems still rely on costly handcrafted features. In this work we tackle the relation classification task using a convolutional neural network that performs classification by ranking (CR-CNN). We propose a new pairwise ranking loss function that makes it easy to reduce the impact of artificial classes. We perform experiments using the the SemEval-2010 Task 8 dataset, which is designed for the task of classifying the relationship between two nominals marked in a sentence. Using CRCNN, we outperform the state-of-the-art for this dataset and achieve a F1 of 84.1 without using any costly handcrafted features. Additionally, our experimental results show that: (1) our approach is more effective than CNN followed by a softmax classifier; (2) omitting the representation of the artificial class Other improves both precision and recall; and (3) using only word embeddings as input features is enough to achieve state-of-the-art results if we consider only the text between the two target nominals.Comment: Accepted as a long paper in the 53rd Annual Meeting of the Association for Computational Linguistics (ACL 2015

    Dependency-based Convolutional Neural Networks for Sentence Embedding

    Full text link
    In sentence modeling and classification, convolutional neural network approaches have recently achieved state-of-the-art results, but all such efforts process word vectors sequentially and neglect long-distance dependencies. To exploit both deep learning and linguistic structures, we propose a tree-based convolutional neural network model which exploit various long-distance relationships between words. Our model improves the sequential baselines on all three sentiment and question classification tasks, and achieves the highest published accuracy on TREC.Comment: this paper has been accepted by ACL 201

    Correlations and Scaling Laws in Human Mobility

    Get PDF
    Human mobility patterns deeply affect the dynamics of many social systems. In this paper, we empirically analyze the real-world human movements based GPS records, and observe rich scaling properties in the temporal-spatial patterns as well as an abnormal transition in the speed-displacement patterns. We notice that the displacements at the population level show significant positive correlation, indicating a cascade-like nature in human movements. Furthermore, our analysis at the individual level finds that the displacement distributions of users with strong correlation of displacements are closer to power laws, implying a relationship between the positive correlation of the series of displacements and the form of an individual's displacement distribution. These findings from our empirical analysis show a factor directly relevant to the origin of the scaling properties in human mobility.Comment: 10 pages, 9 figure
    corecore