Synthesis and Reactivity of the First Isolated Hydrogen‐Bridged Silanol–Silanolate Anions

We report on the first examples of isolated silanol–silanolate anions, obtained by utilizing weakly coordinating phosphazenium counterions. The silanolate anions were synthesized from the recently published phosphazenium hydroxide hydrate salt with siloxanes. The silanol–silanolate anions are postulated intermediates in the hydroxide‐mediated polymerization of aryl and alkyl siloxanes. The silanolate anions are strong nucleophiles because of the weakly coordinating character of the phosphazenium cation, which is perceptible in their activity in polysiloxane depolymerization.     

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.     

Mathematical Modeling, Control, Computer Simulation and Laboratory Experiments of a Spatial Servopneumatic Parallel Robot

In this paper, the special construction of a parallel robot, called spatial servopneumatic multi-axis test facility, will be discussed. The investigations include the following aspects: (i) the laboratory set-up of the robot, (ii) various results obtained in laboratory experiments, taking into account quite different control algorithms and command-input signals, (iii) a comparison of the laboratory experiments with the computer simulations of Part I of this paper, and ({vi}) a quality check of the results compared with the cost of the different controller realizations. The results of both the computer simulations and the laboratory experiments show: (i) The dynamic behavior of the parallel structure can be tremendously improved by using sophisticated nonlinear control algorithms. (ii) This improvement has to be paid by a drastically increased amount of work for deriving the model equations and control algorithms, and by augmented hardware cost of the sensing elements and controller electronics. (iii) Carefully developed model equations and identified model parameters provide theoretical models of the complex parallel structure that are very close to reality. This enables the design engineer to systematically investigate constructive alternatives of the design parameters, sensor and actuator concepts, and control strategies of the MAP prior to their hardware realization.This work has been supported by the German Science Foundation (DFG) under Contract No. Ha 1666/6-3.     

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.