39,507 research outputs found

    Neutrino Masses, Lepton Flavor Mixing and Leptogenesis in the Minimal Seesaw Model

    Full text link
    We present a review of neutrino phenomenology in the minimal seesaw model (MSM), an economical and intriguing extension of the Standard Model with only two heavy right-handed Majorana neutrinos. Given current neutrino oscillation data, the MSM can predict the neutrino mass spectrum and constrain the effective masses of the tritium beta decay and the neutrinoless double-beta decay. We outline five distinct schemes to parameterize the neutrino Yukawa-coupling matrix of the MSM. The lepton flavor mixing and baryogenesis via leptogenesis are investigated in some detail by taking account of possible texture zeros of the Dirac neutrino mass matrix. We derive an upper bound on the CP-violating asymmetry in the decay of the lighter right-handed Majorana neutrino. The effects of the renormalization-group evolution on the neutrino mixing parameters are analyzed, and the correlation between the CP-violating phenomena at low and high energies is highlighted. We show that the observed matter-antimatter asymmetry of the Universe can naturally be interpreted through the resonant leptogenesis mechanism at the TeV scale. The lepton-flavor-violating rare decays, such as μ→e+γ\mu \to e + \gamma, are also discussed in the supersymmetric extension of the MSM.Comment: 50 pages, 22 EPS figures, macro file ws-ijmpe.cls included, accepted for publication in Int. J. Mod. Phys.

    Learning Bayesian Networks using the Constrained Maximum a Posteriori Probability Method

    Get PDF
    Purely data-driven methods often fail to learn accurate conditional probability table (CPT) parameters of discrete Bayesian networks (BNs) when training data are scarce or incomplete. A practical and efficient means of overcoming this problem is to introduce qualitative parameter constraints derived from expert judgments. To exploit such knowledge, in this paper, we provide a constrained maximum a posteriori (CMAP) method to learn CPT parameters by incorporating convex constraints. To further improve the CMAP method, we present a type of constrained Bayesian Dirichlet priors that is compatible with the given constraints. Combined with the CMAP method, we propose an improved expectation maximum algorithm to process incomplete data. Experiments are conducted on learning standard BNs from complete and incomplete data. The results show that the proposed method outperforms existing methods, especially when data are extremely limited or incomplete. This finding suggests the potential effective application of CMAP to real-world problems. Moreover, a real facial action unit (AU) recognition case with incomplete data is conducted by applying different parameter learning methods. The results show that the recognition accuracy of respective recognition methods can be improved by the AU BN, which is trained by the proposed method
    • …
    corecore