2,342 research outputs found

    On object specificity

    Get PDF
    [W]e have demonstrated that the object specificity follows from the same principle as the subject specificity under the EMH. Furthermore, the semantic discrepancy between the realis and irrealis object shift constructions turns out to be a subcase of the more general indicative-modal asymmetry. Although our analysis presented here is nothing but conclusive, it does suggest that the EMH is a potent candidate for explaining the indicative-modal asymmetry, as well as for building a general theory of the specificity effects in question

    Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking

    Full text link
    Bipartite ranking is a fundamental ranking problem that learns to order relevant instances ahead of irrelevant ones. The pair-wise approach for bi-partite ranking construct a quadratic number of pairs to solve the problem, which is infeasible for large-scale data sets. The point-wise approach, albeit more efficient, often results in inferior performance. That is, it is difficult to conduct bipartite ranking accurately and efficiently at the same time. In this paper, we develop a novel active sampling scheme within the pair-wise approach to conduct bipartite ranking efficiently. The scheme is inspired from active learning and can reach a competitive ranking performance while focusing only on a small subset of the many pairs during training. Moreover, we propose a general Combined Ranking and Classification (CRC) framework to accurately conduct bipartite ranking. The framework unifies point-wise and pair-wise approaches and is simply based on the idea of treating each instance point as a pseudo-pair. Experiments on 14 real-word large-scale data sets demonstrate that the proposed algorithm of Active Sampling within CRC, when coupled with a linear Support Vector Machine, usually outperforms state-of-the-art point-wise and pair-wise ranking approaches in terms of both accuracy and efficiency.Comment: a shorter version was presented in ACML 201

    Singly Cabibbo suppressed decays of Ξ›c+\Lambda_{c}^+ with SU(3) flavor symmetry

    Full text link
    We analyze the weak processes of anti-triplet charmed baryons decaying to octet baryons and mesons with the SU(3) flavor symmetry and topological quark diagram scheme. We study the decay branching ratios without neglecting the contributions from O(15β€Ύ){\cal O}(\overline{15}) for the first time in the SU(3) flavor symmetry approach. The fitting results for the Cabibbo allowed and suppressed decays of Ξ›c+\Lambda_{c}^+ are all consistent with the experimental data. We predict all singly Cabibbo suppressed decays. In particular, we find that B(Ξ›c+β†’pΟ€0)=(1.3Β±0.7)Γ—10βˆ’4{\cal B}(\Lambda_c^+\to p \pi^0)=(1.3\pm0.7)\times 10^{-4}, which is slightly below the current experimental upper limit of 2.7Γ—10βˆ’42.7\times 10^{-4} and can be tested by the ongoing experiment at BESIII as well as the future one at Belle-II.Comment: 11 pages, 2 figure, revised version accepted by PL

    Charmed Baryon Weak Decays with SU(3) Flavor Symmetry

    Full text link
    We study the semileptonic and non-leptonic charmed baryon decays with SU(3)SU(3) flavor symmetry, where the charmed baryons can be Bc=(Ξc0,Ξc+,Ξ›c+){\bf B}_{c}=(\Xi_c^0,\Xi_c^+,\Lambda_c^+), Bcβ€²=(Ξ£c(++,+,0),Ξcβ€²(+,0),Ξ©c0){\bf B}'_{c}=(\Sigma_c^{(++,+,0)},\Xi_{c}^{\prime(+,0)},\Omega_c^0), Bcc=(Ξcc++,Ξcc+,Ξ©cc+){\bf B}_{cc}=(\Xi_{cc}^{++},\Xi_{cc}^+,\Omega_{cc}^+), or Bccc=Ξ©ccc++{\bf B}_{ccc}=\Omega^{++}_{ccc}. With Bn(β€²){\bf B}_n^{(\prime)} denoted as the baryon octet (decuplet), we find that the Bcβ†’Bnβ€²β„“+Ξ½β„“{\bf B}_{c}\to {\bf B}'_n\ell^+\nu_\ell decays are forbidden, while the Ξ©c0β†’Ξ©βˆ’β„“+Ξ½β„“\Omega_c^0\to \Omega^-\ell^+\nu_\ell, Ξ©cc+β†’Ξ©c0β„“+Ξ½β„“\Omega_{cc}^+\to\Omega_c^0\ell^+\nu_\ell, and Ξ©ccc++β†’Ξ©cc+β„“+Ξ½β„“\Omega_{ccc}^{++}\to \Omega_{cc}^+\ell^+\nu_\ell decays are the only existing Cabibbo-allowed modes for Bcβ€²β†’Bnβ€²β„“+Ξ½β„“{\bf B}'_{c}\to {\bf B}'_n\ell^+\nu_\ell, Bccβ†’Bcβ€²β„“+Ξ½β„“{\bf B}_{cc}\to {\bf B}'_c\ell^+\nu_\ell, and Bcccβ†’Bcc(β€²)β„“+Ξ½β„“{\bf B}_{ccc}\to {\bf B}_{cc}^{(\prime)}\ell^+\nu_\ell, respectively. We predict the rarely studied Bcβ†’Bn(β€²)M{\bf B}_{c}\to {\bf B}_n^{(\prime)}M decays, such as B(Ξc0β†’Ξ›0KΛ‰0,β€‰Ξžc+β†’Ξž0Ο€+)=(8.3Β±0.9,8.0Β±4.1)Γ—10βˆ’3{\cal B}(\Xi_c^0\to\Lambda^0\bar K^0,\,\Xi_c^+\to\Xi^0\pi^+)=(8.3\pm 0.9,8.0\pm 4.1)\times 10^{-3} and B(Ξ›c+β†’Ξ”++Ο€βˆ’,β€‰Ξžc0β†’Ξ©βˆ’K+)=(5.5Β±1.3,4.8Β±0.5)Γ—10βˆ’3{\cal B}(\Lambda_c^+\to \Delta^{++}\pi^-,\,\Xi_c^0\to\Omega^- K^+)=(5.5\pm 1.3,4.8\pm 0.5)\times 10^{-3}. For the observation, the doubly and triply charmed baryon decays of Ξ©cc+β†’Ξžc+KΛ‰0\Omega_{cc}^{+}\to \Xi_c^+\bar K^0, Ξcc++β†’(Ξc+Ο€+\Xi_{cc}^{++}\to (\Xi_c^+\pi^+, Ξ£c++KΛ‰0)\Sigma_c^{++}\bar K^0), and Ξ©ccc++β†’(Ξcc++KΛ‰0,Ξ©cc+Ο€+,Ξc+D+)\Omega_{ccc}^{++}\to (\Xi_{cc}^{++}\bar K^0,\Omega_{cc}^+\pi^+,\Xi_c^+ D^+) are the favored Cabibbo-allowed decays, which are accessible to the BESIII and LHCb experiments.Comment: 29 pages, no figure, a typo in the table correcte

    Soft Methodology for Cost-and-error Sensitive Classification

    Full text link
    Many real-world data mining applications need varying cost for different types of classification errors and thus call for cost-sensitive classification algorithms. Existing algorithms for cost-sensitive classification are successful in terms of minimizing the cost, but can result in a high error rate as the trade-off. The high error rate holds back the practical use of those algorithms. In this paper, we propose a novel cost-sensitive classification methodology that takes both the cost and the error rate into account. The methodology, called soft cost-sensitive classification, is established from a multicriteria optimization problem of the cost and the error rate, and can be viewed as regularizing cost-sensitive classification with the error rate. The simple methodology allows immediate improvements of existing cost-sensitive classification algorithms. Experiments on the benchmark and the real-world data sets show that our proposed methodology indeed achieves lower test error rates and similar (sometimes lower) test costs than existing cost-sensitive classification algorithms. We also demonstrate that the methodology can be extended for considering the weighted error rate instead of the original error rate. This extension is useful for tackling unbalanced classification problems.Comment: A shorter version appeared in KDD '1
    • …
    corecore