The weakly neighborly polyhedral maps on the 2-manifold with euler characteristic −1

A weakly neighborly polyhedral map (w.n.p. map) is a two-dimensional cell-complex which decomposes a closed 2-manifold without boundary, such that for every two vertices there is a 2-cell containing them. We prove that there are just four w.n.p. maps with Euler characteristic –1 and we describe them.     

Endomorphisms of graphs II. Various unretractive graphs

In this part of the article we investigate graphs for which different endomorphism monoids coincide. We consider endomorphisms, strong endomorphisms and automorphisms. Coincidences are investigated for joins of graphs and some lexicographic products. In an additional section the graphs with the respective properties are listed up to 8 vertices in two cases and up to 5 vertices in the remaining case.     

Investigation,Modelling and Analysis of stiffened GFRP-Samples

Glasfibre structures feature high potentials for optimization and substitution of conventional materials like steel and aluminum and their alloys. The paper deals with the insertion of glasfibre trusses into thin glasfibre structures to reinforce them. The effective material properties of the glasfibre structures were estimated by experiments and simulations. Furthermore the Young's modulus of the trusses was obtained by bending tests and tension tests. A comparison between bending experiments and bending simulations is given. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The materials science X‐ray beamline BL8 at the DELTA storage ring

The hard X‐ray beamline BL8 at the superconducting asymmetric wiggler at the 1.5 GeV Dortmund Electron Accelerator DELTA is described. This beamline is dedicated to X‐ray studies in the spectral range from ～1 keV to ～25 keV photon energy. The monochromator as well as the other optical components of the beamline are optimized accordingly. The endstation comprises a six‐axis diffractometer that is capable of carrying heavy loads related to non‐ambient sample environments such as, for example, ultrahigh‐vacuum systems, high‐pressure cells or liquid‐helium cryostats. X‐ray absorption spectra from several reference compounds illustrate the performance. Besides transmission measurements, fluorescence detection for dilute sample systems as well as surface‐sensitive reflection‐mode experiments have been performed. The results show that high‐quality EXAFS data can be obtained in the quick‐scanning EXAFS mode within a few seconds of acquisition time, enabling time‐resolved in situ experiments using standard beamline equipment that is permanently available. The performance of the new beamline, especially in terms of the photon flux and energy resolution, is competitive with other insertion‐device beamlines worldwide, and several sophisticated experiments including surface‐sensitive EXAFS experiments are feasible.     

Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

Optimal control of Markovian jump processes with partial information and applications to a parallel queueing model

We consider a stochastic control problem over an infinite horizon where the state process is influenced by an unobservable environment process. In particular, the Hidden-Markov-model and the Bayesian model are included. This model under partial information is transformed into an equivalent one with complete information by using the well-known filter technique. In particular, the optimal controls and the value functions of the original and the transformed problem are the same. An explicit representation of the filter process which is a piecewise-deterministic process, is also given. Then we propose two solution techniques for the transformed model. First, a generalized verification technique (with a generalized Hamilton–Jacobi–Bellman equation) is formulated where the strict differentiability of the value function is weaken to local Lipschitz continuity. Second, we present a discrete-time Markovian decision model by which we are able to compute an optimal control of our given problem. In this context we are also able to state a general existence result for optimal controls. The power of both solution techniques is finally demonstrated for a parallel queueing model with unknown service rates. In particular, the filter process is discussed in detail, the value function is explicitly computed and the optimal control is completely characterized in the symmetric case.     

Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles

In hybrid electric vehicles, the electrical powertrain system has multiple energy sources that it can gather power from to satisfy the propulsion power requested by the vehicle at each instant. This paper focusses on the minimization of the fuel consumption of such a vehicle, taking advantage of the different energy sources. Based on global optimization approaches, the proposed heuristics find solutions that best split the power requested between the multi-electrical sources available. A lower bounding procedure is introduced to validate the quality of the solutions. Computational results show a significant improvement over previous results from the literature in both the computing time and the quality of the solutions.     

Analysis,modeling and solution of the concrete delivery problem

This paper describes a specific local search approach to solve a problem arising in logistics which we prove to be NP-hard. The problem is a complex scheduling or vehicle routing problem where we have to schedule the tours of concrete mixer vehicles over a working day from concrete-producing depots to concrete-demanding customers and vice versa. We give a general mixed integer programming model which is too hard to solve for state of the art mixed integer programming optimizers in the case of the usually huge problem instances coming from practice. Therefore we present a certain local search approach to be able to handle huge practical problem instances.     

Low rank matrix recovery from rank one measurements

We study the recovery of Hermitian low rank matrices $X\in {\mathbb{C}}^{n\times n}$ from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form $a_j{a}_j^{?}$ for some measurement vectors $a_1,\dots ,a_m$, i.e., the measurements are given by $b_j=\mathrm{tr}(X{a}_j{a}_j^{?})$. The case where the matrix $X=x{x}^{?}$ to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements $b_j=|〈x,a_j〉{|}^2$) via the PhaseLift approach, which has been introduced recently. We derive bounds for the number m of measurements that guarantee successful uniform recovery of Hermitian rank r matrices, either for the vectors $a_j$, $j=1,\dots ,m$, being chosen independently at random according to a standard Gaussian distribution, or $a_j$ being sampled independently from an (approximate) complex projective t-design with $t=4$. In the Gaussian case, we require $m\ge Crn$ measurements, while in the case of 4-designs we need $m\ge \mathit{Cr}n\log ?(n)$. Our results are uniform in the sense that one random choice of the measurement vectors $a_j$ guarantees recovery of all rank r-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 4-designs generalizes and improves a recent bound on phase retrieval due to Gross, Krahmer and Kueng. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii.