3,118 research outputs found

    Antiproton annihilation on light nuclei at very low energies

    Get PDF
    The recent experimental data obtained by the OBELIX group on pˉ\bar{p}D and pˉ4\bar{p}^4He total annihilation cross sections are analyzed. The combined analysis of these data with existing antiprotonic atom data allows, for the first time, the imaginary parts of the S-wave scattering lengths for the two nuclei to be extracted. The obtained values are: Ima0sc=[0.62±0.02(stat)±0.04(sys)]fmIm a^{sc}_0 = [- 0.62 \pm 0.02 ({stat}) \pm 0.04 ({sys})] fm for pˉ\bar{p}D and Ima0sc=[0.36±0.03(stat)0.11+0.19(sys)]fmIm a^{sc}_0 = [- 0.36\pm 0.03({stat})^{+0.19}_{-0.11}({sys})] fm for pˉ4\bar{p}^4He. This analysis indicates an unexpected behaviour of the imaginary part of the pˉ\bar{p}-nucleus S-wave scattering length as a function of the atomic weight A: Ima0sc|Im a^{sc}_0| (pˉ\bar{p}p) > Ima0sc|Im a^{sc}_0| (pˉ\bar{p}D) > Ima0sc|Im a^{sc}_0| (pˉ4\bar{p}^4He).Comment: 13 pages, 5 figure

    Limits on the low energy antinucleon-nucleus annihilations from the Heisenberg principle

    Full text link
    We show that the quantum uncertainty principle puts some limits on the effectiveness of the antinucleon-nucleus annihilation at very low energies. This is caused by the fact that the realization a very effective short-distance reaction process implies information on the relative distance of the reacting particles. Some quantitative predictions are possible on this ground, including the approximate A-independence of antinucleon-nucleus annihilation rates.Comment: 10 pages, no figure

    Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem

    Get PDF
    One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually strongly influenced by the choice of a placement rule. We introduce the extreme point concept and present a new extreme point-based rule for packing items inside a three-dimensional container. The extreme point rule is independent from the particular packing problem addressed and can handle additional constraints, such as fixing the position of the items. The new extreme point rule is also used to derive new constructive heuristics for the three-dimensional bin-packing problem. Extensive computational results show the effectiveness of the new heuristics compared to state-of-the-art results. Moreover, the same heuristics, when applied to the two-dimensional bin-packing problem, outperform those specifically designed for the proble
    corecore