4,044 research outputs found

    A Possible Hermitian Neutrino Mixing Ansatz

    Get PDF
    Using a recent global analysis result after the precise measurement of θ13\theta_ {13}, a possible Herimtian neutrino mixing ansatz is discussed, the mixing matrix is symmetric and also symmetric with respect with the second diagonal line in the leading order. This leading order ansatz predicts θ13=12.2\theta_{13}=12.2^\circ. Next, consider the hierarchy structure of the lepton mass matrix as the origin of perturbation of the mixing matrix, we find that this ansatz with perturbation can fit current data very well.Comment: 13 pages, 4 figure

    Holographic R\'enyi Entropy and Generalized Entropy method

    Get PDF
    In this paper we use the method of generalized gravitational entropy in \cite{Lewkowycz:2013nqa} to construct the dual bulk geometry for a spherical entangling surface, and calculate the R\'enyi entropy with the dual bulk gravity theory being either Einstein gravity or Lovelock gravity, this approach is closely related to that in \cite{Casini:2011kv}. For a general entangling surface we derive the area law of entanglement entropy. The area law is closely related with the local property of the entangling surface.Comment: 17+6 page

    An Affect-Rich Neural Conversational Model with Biased Attention and Weighted Cross-Entropy Loss

    Full text link
    Affect conveys important implicit information in human communication. Having the capability to correctly express affect during human-machine conversations is one of the major milestones in artificial intelligence. In recent years, extensive research on open-domain neural conversational models has been conducted. However, embedding affect into such models is still under explored. In this paper, we propose an end-to-end affect-rich open-domain neural conversational model that produces responses not only appropriate in syntax and semantics, but also with rich affect. Our model extends the Seq2Seq model and adopts VAD (Valence, Arousal and Dominance) affective notations to embed each word with affects. In addition, our model considers the effect of negators and intensifiers via a novel affective attention mechanism, which biases attention towards affect-rich words in input sentences. Lastly, we train our model with an affect-incorporated objective function to encourage the generation of affect-rich words in the output responses. Evaluations based on both perplexity and human evaluations show that our model outperforms the state-of-the-art baseline model of comparable size in producing natural and affect-rich responses.Comment: AAAI-1

    Entropy for gravitational Chern-Simons terms by squashed cone method

    Get PDF
    In this paper we investigate the entropy of gravitational Chern-Simons terms for the horizon with non-vanishing extrinsic curvatures, or the holographic entanglement entropy for arbitrary entangling surface. In 3D we find no anomaly of entropy appears. But the squashed cone method can not be used directly to get the correct result. For higher dimensions the anomaly of entropy would appear, still, we can not use the squashed cone method directly. That is becasuse the Chern-Simons action is not gauge invariant. To get a reasonable result we suggest two methods. One is by adding a boundary term to recover the gauge invariance. This boundary term can be derived from the variation of the Chern-Simons action. The other one is by using the Chern-Simons relation dΩ4n1=tr(R2n)d\bm{\Omega_{4n-1}}=tr(\bm{R}^{2n}). We notice that the entropy of tr(R2n)tr(\bm{R}^{2n}) is a total derivative locally, i.e. S=dsCSS=d s_{CS}. We propose to identify sCSs_{CS} with the entropy of gravitational Chern-Simons terms Ω4n1\Omega_{4n-1}. In the first method we could get the correct result for Wald entropy in arbitrary dimension. In the second approach, in addition to Wald entropy, we can also obtain the anomaly of entropy with non-zero extrinsic curvatures. Our results imply that the entropy of a topological invariant, such as the Pontryagin term tr(R2n)tr(\bm{R}^{2n}) and the Euler density, is a topological invariant on the entangling surface.Comment: 19 pag

    Holographic Entanglement Entropy for the Most General Higher Derivative Gravity

    Get PDF
    The holographic entanglement entropy for the most general higher derivative gravity is investigated. We find a new type of Wald entropy, which appears on entangling surface without the rotational symmetry and reduces to usual Wald entropy on Killing horizon. Furthermore, we obtain a formal formula of HEE for the most general higher derivative gravity and work it out exactly for some squashed cones. As an important application, we derive HEE for gravitational action with one derivative of the curvature when the extrinsic curvature vanishes. We also study some toy models with non-zero extrinsic curvature. We prove that our formula yields the correct universal term of entanglement entropy for 4d CFTs. Furthermore, we solve the puzzle raised by Hung, Myers and Smolkin that the logarithmic term of entanglement entropy derived from Weyl anomaly of CFTs does not match the holographic result even if the extrinsic curvature vanishes. We find that such mismatch comes from the `anomaly of entropy' of the derivative of curvature. After considering such contributions carefully, we resolve the puzzle successfully. In general, we need to fix the splitting problem for the conical metrics in order to derive the holographic entanglement entropy. We find that, at least for Einstein gravity, the splitting problem can be fixed by using equations of motion. How to derive the splittings for higher derivative gravity is a non-trivial and open question. For simplicity, we ignore the splitting problem in this paper and find that it does not affect our main results.Comment: 28 pages, no figures, published in JHE

    EEG-Based Emotion Recognition Using Regularized Graph Neural Networks

    Full text link
    Electroencephalography (EEG) measures the neuronal activities in different brain regions via electrodes. Many existing studies on EEG-based emotion recognition do not fully exploit the topology of EEG channels. In this paper, we propose a regularized graph neural network (RGNN) for EEG-based emotion recognition. RGNN considers the biological topology among different brain regions to capture both local and global relations among different EEG channels. Specifically, we model the inter-channel relations in EEG signals via an adjacency matrix in a graph neural network where the connection and sparseness of the adjacency matrix are inspired by neuroscience theories of human brain organization. In addition, we propose two regularizers, namely node-wise domain adversarial training (NodeDAT) and emotion-aware distribution learning (EmotionDL), to better handle cross-subject EEG variations and noisy labels, respectively. Extensive experiments on two public datasets, SEED and SEED-IV, demonstrate the superior performance of our model than state-of-the-art models in most experimental settings. Moreover, ablation studies show that the proposed adjacency matrix and two regularizers contribute consistent and significant gain to the performance of our RGNN model. Finally, investigations on the neuronal activities reveal important brain regions and inter-channel relations for EEG-based emotion recognition

    Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks

    Get PDF
    Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well
    corecore