Comparative analysis of (p,d), (d,t) and (3He, α) reactions on13C nucleus

The angular distributions of the (p, d), (d, t) and(³He, ) reactions on¹³C have been analysed within the framework of DWBA in which additional information on nuclear vertex constants was introduced. Although all these reactions seem to be similar single nucleon transfer, their mechanism is shown to be quite different and so is the information extracted thereof. While from the (p, d) reactions spectroscopic factors may be extracted unambiguously, from the (d, t) reactions it is possible to obtain directly the values of vertex constants only, which in turn are consistent with those determined by extrapolation of the experimental cross sections of the (p, d) reactions to the pole.In the case of (³He, ) reactions, however, the analysis indicates inadequacy of the DWBA concerning the calculations of central partial amplitudes. For a more reliable extraction of structural information, besides the correct normalization of peripheral amplitudes, a contribution of more complex mechanisms must be taken into account.     

Inclusive\bar K^{0*} (892) andK 0*(892) production on silicon by 200 GeVK − andπ −

The production of the neutralK ^? (892) resonances by 200 GeVK ^? andπ ^? has been studied over the kinematic range 0.0<x _f<1.0 andp _t ² <5.0 GeV². Longitudinal and transverse momentum distributions are presented. In addition the decay angular distributions inK ^? fragmentation to \(\bar K^{0*} \) have been investigated.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.     

The Choquet-Deny convolution equation μ=μ*σ for probability measures on Abelian semigroups

In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .