The Relation Between the Surface Brightness and the Diameter for Galactic Supernova Remnants

In this work, we have constructed a relation between the surface brightness ($\Sigma$) and diameter (D) of Galactic C- and S-type supernova remnants (SNRs). In order to calibrate the $\Sigma$-D dependence, we have carefully examined some intrinsic (e.g. explosion energy) and extrinsic (e.g. density of the ambient medium) properties of the remnants and, taking into account also the distance values given in the literature, we have adopted distances for some of the SNRs which have relatively more reliable distance values. These calibrator SNRs are all C- and S-type SNRs, i.e. F-type SNRs (and S-type SNR Cas A which has an exceptionally high surface brightness) are excluded. The Sigma-D relation has 2 slopes with a turning point at D=36.5 pc: $\Sigma$(at 1 GHz)=8.4$^{+19.5}_{-6.3}$$\times10^{-12}$ D$^{{-5.99}^{+0.38}_{-0.33}}$ Wm$^{-2}$Hz$^{-1}$ster$^{-1}$ (for $\Sigma$$\le3.7\times10^{-21}$ Wm$^{-2}$Hz$^{-1}$ster$^{-1}$ and D$\ge$36.5 pc) and $\Sigma$(at 1 GHz)=2.7$^{+2.1}_{-1.4}$$\times$ 10$^{-17}$ D$^{{-2.47}^{+0.20}_{-0.16}}$ Wm$^{-2}$Hz$^{-1}$ster$^{-1}$ (for $\Sigma$$>3.7\times10^{-21}$ Wm$^{-2}$Hz$^{-1}$ster$^{-1}$ and D$<$36.5 pc). We discussed the theoretical basis for the $\Sigma$-D dependence and particularly the reasons for the change in slope of the relation were stated. Added to this, we have shown the dependence between the radio luminosity and the diameter which seems to have a slope close to zero up to about D=36.5 pc. We have also adopted distance and diameter values for all of the observed Galactic SNRs by examining all the available distance values presented in the literature together with the distances found from our $\Sigma$-D relation.Comment: 45 pages, 2 figures, accepted for publication in Astronomical and Astrophysical Transaction

On-line adaptive parallel prefix computation

International audienceWe consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower bound for this problem. We introduce a new adaptive algorithm which is based on the on-line recursive coupling of an optimal sequential algorithm and a parallel one, non-optimal but recursive and fine-grain. The coupling relies on a work-stealing scheduling. Its theoretical performance is analysed on p processors of different and changing speeds. It is close to the lower bound both on identical processors and close to the lower bound for processors of changing speeds. Experiments performed on an eight-processor machine confirms this theoretical result

Black women, gender & families

Abstract. Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost of traversing the structure and ℓ ≤ n is the number of reported items satisfying the query. In this paper we focus on rank-sensitive data structures, which are additionally given a ranking of the n items, so that just the top k best-ranking items should be reported at query time, sorted in rank order, at a cost of O(t(n) + k) time. Note that k is part of the query as a parameter under the control of the user (as opposed to ℓ which is query-dependent). We explore the problem of adding rank-sensitivity to data structures such as suffix trees or range trees, where the ℓ items satisfying the query form O(polylog(n)) intervals of consecutive entries from which we choose the top k best-ranking ones. Letting s(n) be the number of items (including their copies) stored in the original data structures, we increase the space by an additional term of O(s(n) lg ǫ n) memory words of space, each of O(lg n) bits, for any positive constant ǫ &lt; 1. We allow for changing the ranking on the fly during the lifetime of the data structures, with ranking values in 0... O(n). In this case, query time becomes O(t(n)+k) plus O(lg n/lg lg n) per interval; each change in the ranking and each insertion/deletion of an item takes O(lg n) time; the additional term in space occupancy increases to O(s(n) lg n/lg lg n).

Low upper limits on the O2 abundance from the Odin satellite

NRC publication: Ye