23,858 research outputs found

    Cumulants in the 3-dimensional Ising, O(2) and O(4) spin models

    Full text link
    Based on the universal properties of a critical point in different systems and that the QCD phase transitions fall into the same universality classes as the 3-dimensional Ising, O(2)O(2) or O(4)O(4) spin models, the critical behavior of cumulants and higher cumulant ratios of the order parameter from the three kinds of spin models is studied. We found that all higher cumulant ratios change dramatically the sign near the critical temperature. The qualitative critical behavior of the same order cumulant ratio is consistent in these three models.Comment: 5 pages, 5 figure

    Material modelling and springback analysis for multi-stage rotary draw bending of thin-walled tube using homogeneous anisotropic hardening model

    Get PDF
    The aim of this paper is to compare several hardening models and to show their relevance for the prediction of springback and deformation of an asymmetric aluminium alloy tube in multi-stage rotary draw bending process. A three-dimensional finite-element model of the process is developed using the ABAQUS code. For material modelling, the newly developed homogeneous anisotropic hardening model is adopted to capture the Bauschinger effect and transient hardening behaviour of the aluminium alloy tube subjected to non-proportional loading. The material parameters of the hardening model are obtained from uniaxial tension and forward-reverse shear test results of tube specimens. This work shows that this approach reproduces the transient Bauschinger behaviour of the material reasonably well. However, a curve-crossing phenomenon observed for this material cannot be captured by the homogeneous anisotropic hardening model. For comparison purpose, the isotropic and combined isotropic-kinematic hardening models are also adopted for the analysis of the same problem. The predictions of springback and cross-section deformation based on these models are discussed. (C) 2014 The Authors. Published by Elsevier Ltd.open1134Nsciescopu

    Scheme for sharing classical information via tripartite entangled states

    Full text link
    We investigate schemes for quantum secret sharing and quantum dense coding via tripartite entangled states. We present a scheme for sharing classical information via entanglement swapping using two tripartite entangled GHZ states. In order to throw light upon the security affairs of the quantum dense coding protocol, we also suggest a secure quantum dense coding scheme via W state in analogy with the theory of sharing information among involved users.Comment: 4 pages, no figure. A complete rewrritten vession, accepted for publication in Chinese Physic

    First-principles study of native point defects in Bi2Se3

    Full text link
    Using first-principles method within the framework of the density functional theory, we study the influence of native point defect on the structural and electronic properties of Bi2_2Se3_3. Se vacancy in Bi2_2Se3_3 is a double donor, and Bi vacancy is a triple acceptor. Se antisite (SeBi_{Bi}) is always an active donor in the system because its donor level (ε\varepsilon(+1/0)) enters into the conduction band. Interestingly, Bi antisite(BiSe1_{Se1}) in Bi2_2Se3_3 is an amphoteric dopant, acting as a donor when μ\mue_e<<0.119eV (the material is typical p-type) and as an acceptor when μ\mue_e>>0.251eV (the material is typical n-type). The formation energies under different growth environments (such as Bi-rich or Se-rich) indicate that under Se-rich condition, SeBi_{Bi} is the most stable native defect independent of electron chemical potential μ\mue_e. Under Bi-rich condition, Se vacancy is the most stable native defect except for under the growth window as μ\mue_e>>0.262eV (the material is typical n-type) and Δ\Deltaμ\muSe_{Se}<<-0.459eV(Bi-rich), under such growth windows one negative charged BiSe1_{Se1} is the most stable one.Comment: 7 pages, 4 figure

    Photometric identification of blue horizontal branch stars

    Full text link
    We investigate the performance of some common machine learning techniques in identifying BHB stars from photometric data. To train the machine learning algorithms, we use previously published spectroscopic identifications of BHB stars from SDSS data. We investigate the performance of three different techniques, namely k nearest neighbour classification, kernel density estimation and a support vector machine (SVM). We discuss the performance of the methods in terms of both completeness and contamination. We discuss the prospect of trading off these values, achieving lower contamination at the expense of lower completeness, by adjusting probability thresholds for the classification. We also discuss the role of prior probabilities in the classification performance, and we assess via simulations the reliability of the dataset used for training. Overall it seems that no-prior gives the best completeness, but adopting a prior lowers the contamination. We find that the SVM generally delivers the lowest contamination for a given level of completeness, and so is our method of choice. Finally, we classify a large sample of SDSS DR7 photometry using the SVM trained on the spectroscopic sample. We identify 27,074 probable BHB stars out of a sample of 294,652 stars. We derive photometric parallaxes and demonstrate that our results are reasonable by comparing to known distances for a selection of globular clusters. We attach our classifications, including probabilities, as an electronic table, so that they can be used either directly as a BHB star catalogue, or as priors to a spectroscopic or other classification method. We also provide our final models so that they can be directly applied to new data.Comment: To appear in A&A. 19 pages, 22 figures. Tables 7, A3 and A4 available electronically onlin

    Deep Learning for Single Image Super-Resolution: A Brief Review

    Get PDF
    Single image super-resolution (SISR) is a notoriously challenging ill-posed problem, which aims to obtain a high-resolution (HR) output from one of its low-resolution (LR) versions. To solve the SISR problem, recently powerful deep learning algorithms have been employed and achieved the state-of-the-art performance. In this survey, we review representative deep learning-based SISR methods, and group them into two categories according to their major contributions to two essential aspects of SISR: the exploration of efficient neural network architectures for SISR, and the development of effective optimization objectives for deep SISR learning. For each category, a baseline is firstly established and several critical limitations of the baseline are summarized. Then representative works on overcoming these limitations are presented based on their original contents as well as our critical understandings and analyses, and relevant comparisons are conducted from a variety of perspectives. Finally we conclude this review with some vital current challenges and future trends in SISR leveraging deep learning algorithms.Comment: Accepted by IEEE Transactions on Multimedia (TMM
    corecore