Study of the charge-exchange reactions\pi ^ - p \to (\pi ^0 ,\eta ,\eta \prime )n at 63 GeV

Muon electron pairs were detected in an Al multiplate spark chamber, exposed to a neutrino beam from the CERN PS. The leptons were not accompanied by other particles, except occasionally by protons. The background came mainly from muon associated π⁰ production, with one decay gamma lost. It was determined empirically, together with the small contribution from υ _e reactions. For electron energies above 2 GeV the background is 5.7±1.5 events, whereas 18 (μe)-candidates have been observed. Hence the effect is established, with a rate of about 10^?4 as compared to the muonic reactions above 3 GeV. Charm creation as the origin of this (μe)-production process is excluded; heavy neutral lepton production does not fit the kinematics observed. Instead the events are compatible with the two-body decay of an object with variable invariant mass of order 1 GeV, possibly resulting from axion interactions.     

Constructing Invariant Fairness Measures for Surfaces

The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.