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.     

High dose iron implantation into silicon and metals

High dose implantations of Fe into metals and semiconductors have been performed with beam energies up to 1 MeV at the UNILAC-injector at GSI. Unusual high concentrations of 70 atomic % for Si and 20 atomic % for Cu have been obtained, with doses of 10¹⁸ Fe/cm² in the case of Si and several 10¹⁷ Fe/cm² in the case of Cu. For Si the thickness of the layers were determined by Rutherford backscattering to be 4500 Å. These results are consistent with calculations, which show that these high concentrations are due to the reduction of the sputter yield at the relative high particle energies. Samples have been characterized using several complementary methods (Mössbauer Spectroscopy (MS), Rutherford Backscattering Spectroscopy (RBS), Auger electron Spectroscopy (AES). Scanning Electron Microscopy (SEM), X-ray diffraction (XRD)).     

Rectangular convexity of convex domains of constant width

An E R ² is r-convex if for every x, y E there exists a closed rectangle R such that x, y R and R E. Several results about r-convexity appeared in [1]. Its authors formulated a conjecture about conditions for a compact, convex set in R ² to be r-convex. We prove this conjecture in the case of convex domains of constant width.     

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.     

On the dimension to represent a graph by a unit distance graph

It is proved that if a graphG has maximum degreed, then its vertices can be represented by distinct unit vectors inR ^2d so that two vectors are orthogonal if and only if the corresponding vertices are adjacent. As a corollary it follows that if a graph has maximum degreed, then it is isomorphic to a unit distance graph inR ^2d.