A topological characterization of classical BRST cohomology

The recent identification of classical BRST cohomology with the vertical cohomology of a certain fibration is used to compute it in terms of the classical observables and the topology of the gauge orbits. When the gauge orbits are compact and orientable, a duality theorem is exhibited.     

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 .