720 research outputs found

    Empirical metallicity-dependent calibrations of effective temperature against colours for dwarfs and giants based on interferometric data

    Full text link
    We present empirical metallicity-dependent calibrations of effective temperature against colours for dwarfs of luminosity classes IV and V and for giants of luminosity classes II and III, based on a collection from the literature of about two hundred nearby stars with direct effective temperature measurements of better than 2.5 per cent. The calibrations are valid for an effective temperature range 3,100 - 10,000 K for dwarfs of spectral types M5 to A0 and 3,100 - 5,700 K for giants of spectral types K5 to G5. A total of twenty-one colours for dwarfs and eighteen colours for giants of bands of four photometric systems, i.e. the Johnson (UBVRJIJJHKUBVR_{\rm J}I_{\rm J}JHK), the Cousins (RCICR_{\rm C}I_{\rm C}), the Sloan Digital Sky Survey (SDSS, grgr) and the Two Micron All Sky Survey (2MASS, JHKsJHK_{\rm s}), have been calibrated. Restricted by the metallicity range of the current sample, the calibrations are mainly applicable for disk stars ([Fe/H] ≳ −1.0\,\gtrsim\,-1.0). The normalized percentage residuals of the calibrations are typically 2.0 and 1.5 per cent for dwarfs and giants, respectively. Some systematic discrepancies at various levels are found between the current scales and those available in the literature (e.g. those based on the infrared flux method IRFM or spectroscopy). Based on the current calibrations, we have re-determined the colours of the Sun. We have also investigated the systematic errors in effective temperatures yielded by the current on-going large scale low- to intermediate-resolution stellar spectroscopic surveys. We show that the calibration of colour (g−Ksg-K_{\rm s}) presented in the current work provides an invaluable tool for the estimation of stellar effective temperature for those on-going or upcoming surveys.Comment: 28 pages, 19 figures, 8 tables, accepted for publication in MNRA

    Δ\Delta contribution in e++e−→p+pˉe^+ + e^- \to p + \bar{p} at small ss

    Get PDF
    Two-photon annihilate contributions in the process e++e−→p+pˉe^+ + e^- \to p + \bar{p} including NN and Δ\Delta intermediate are discussed in a simple hadronic model. The corrections to the unpolarized cross section and polarized observables Px,PzP_x,P_z are presented. The results show the two-photon annihilate correction to unpolarized cross section is small and its angle dependence becomes weak at small ss after considering the NN and Δ(1232)\Delta(1232) contributions simultaneously, while the correction to PzP_z is enhanced.Comment: 5 page

    Recent advances and current issues in single-cell sequencing of tumors

    Get PDF
    AbstractIntratumoral heterogeneity is a recently recognized but important feature of cancer that underlies the various biocharacteristics of cancer tissues. The advent of next-generation sequencing technologies has facilitated large scale capture of genomic data, while the recent development of single-cell sequencing has allowed for more in-depth studies into the complex molecular mechanisms of intratumoral heterogeneity. In this review, the recent advances and current challenges in single-cell sequencing methodologies are discussed, highlighting the potential power of these data to provide insights into oncological processes, from tumorigenesis through progression to metastasis and therapy resistance

    Identifying effective multiple spreaders by coloring complex networks

    Full text link
    How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to find \emph{effective multiple spreaders} in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our method, each node in a network is colored by one kind of color and nodes with the same color are sorted into an independent set. Then, for a given centrality index, the nodes with the highest centrality in an independent set are chosen as multiple spreaders. Comparing this approach with the traditional method, in which nodes with the highest centrality from the \emph{entire} network perspective are chosen, we find that our method is more effective in accelerating the spreading process and maximizing the spreading coverage than the traditional method, no matter in network models or in real social networks. Meanwhile, the low computational complexity of the coloring algorithm guarantees the potential applications of our method.Comment: 6 pages, 6 figure
    • …
    corecore