5,164 research outputs found

    Analytical computation of the off-axis Effective Area of grazing incidence X-ray mirrors

    Full text link
    Focusing mirrors for X-ray telescopes in grazing incidence, introduced in the 70s, are characterized in terms of their performance by their imaging quality and effective area, which in turn determines their sensitivity. Even though the on-axis effective area is assumed in general to characterize the collecting power of an X-ray optic, the telescope capability of imaging extended X-ray sources is also determined by the variation in its effective area with the off-axis angle. [...] The complex task of designing optics for future X-ray telescopes entails detailed computations of both imaging quality and effective area on- and off-axis. Because of their apparent complexity, both aspects have been, so far, treated by using ray-tracing routines aimed at simulating the interaction of X-ray photons with the reflecting surfaces of a given focusing system. Although this approach has been widely exploited and proven to be effective, it would also be attractive to regard the same problem from an analytical viewpoint, to assess an optical design of an X-ray optical module with a simpler calculation than a ray-tracing routine. [...] We have developed useful analytical formulae for the off-axis effective area of a double-reflection mirror in the double cone approximation, requiring only an integration and the standard routines to calculate the X-ray coating reflectivity for a given incidence angle. [...] Algebraic expressions are provided for the mirror geometric area, as a function of the off-axis angle. Finally, the results of the analytical computations presented here are validated by comparison with the corresponding predictions of a ray-tracing code.Comment: 12 pages, 11 figures, accepted for publication in "Astronomy & Astrophysics", section "Instruments, observational techniques, and data processing". Updated version after grammatical revision and typos correctio

    Altered Mesolimbic Dopamine System in THC Dependence

    Get PDF
    To explore the functional consequences of cannabinoid withdrawal in the rat mesolimbic dopamine system, we investigated the anatomical morphology of the mesencephalic, presumed dopaminergic, neurons and their main post-synaptic target in the Nucleus Accumbens. We found that TH-positive neurons shrink and Golgi-stained medium spiny neurons loose dendritic spines in withdrawal rats after chronic cannabinoids administration. Similar results were observed after administration of the cannabinoid antagonist rimonabant to drug-naïve rats supporting a role for endocannabinoids in neurogenesis, axonal growth and synaptogenesis. This evidence supports the tenet that withdrawal from addictive compounds alters functioning of the mesolimbic system. The data add to a growing body of work which indicates a hypodopaminergic state as a distinctive feature of the “addicted brain”

    On the orders of zeros of irreducible characters

    Get PDF
    Let G be a finite group and p a prime number. We say that an element g in G is a vanishing element of G if there exists an irreducible character χ of G such that χ(g)=0. The main result of this paper shows that, if G does not have any vanishing element of p-power order, then G has a normal Sylow p-subgroup. Also, we prove that this result is a generalization of some classical theorems in Character Theory of finite groups

    The 2DECOMP&FFT library: an update with new CPU/GPU capabilities

    Get PDF
    The 2DECOMP&FFT library is a software framework written in modern Fortran to build large-scale parallel applications. It is designed for applications using three-dimensional structured meshes with a particular focus on spatially implicit numerical algorithms. However, the library can be easily used with other discretisation schemes based on a structured layout and where pencil decomposition can apply. It is based on a general-purpose 2D pencil decomposition for data distribution and data Input Output (I/O). A 1D slab decomposition is also available as a special case of the 2D pencil decomposition. The library includes a highly scalable and efficient interface to perform three-dimensional Fast Fourier Transforms (FFTs). The library has been designed to be user-friendly, with a clean application programming interface hiding most communication details from application developers, and portable with support for modern CPUs and NVIDIA GPUs (support for AMD and Intel GPUs to follow)

    On the vanishing prime graph of finite groups

    Get PDF
    Let G be a finite group. An element g 08 G is called a vanishing element of G if there exists an irreducible complex character \u3c7 of G such that \u3c7(g) = 0. In this paper we study the vanishing prime graph \u393(G), whose vertices are the prime numbers dividing the orders of some vanishing element of G, and two distinct vertices p and q are adjacent if and only if G has a vanishing element of order divisible by pq. Among other things we prove that, similarly to what holds for the prime graph of G, the graph \u393(G) has at most six connected components
    corecore