Metallized polymeric foam material

Open-celled polyurethane foams can be coated uniformly with thin film of metal by vapor deposition of aluminum or by sensitization of foam followed by electroless deposition of nickel or copper. Foam can be further processed to increase thickness of metal overcoat to impart rigidity or to provide inert surface with only modest increase in weight

Grundversorgung: Der Weg aus der Krise führt auch über die MPA

Die meisten Hausärzte und Hausärztinnen in der Schweiz sind dauerhaft überlastet. Um zusätzliche Kapazitäten zu schaffen, sind ihre Leistungen auf mehr Schultern zu verteilen und die Betreuung im (Praxis-)Team zu verstärken. Besonders dafür geeignet ist die Begleitung von chronisch kranken Patienten durch die Medizinische Praxisassistentin. Das Problem: Der Arzt kann diese Leistungen nicht abrechnen. Dies ist so rasch wie möglich zu ändern, damit die MPA endlich den Wert erhält, den sie längst verdient

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach

In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is to construct a minimum-cost subgraph that connects at least $k$ demands. The problem is hard to approximate---the best-known approximation ratio is $O(\min\{\sqrt{n}, \sqrt{k}\})$. Furthermore, $k$-forest is as hard to approximate as the notoriously-hard densest $k$-subgraph problem. While the $k$-forest problem is hard to approximate in the worst-case, we show that with the use of resource augmentation, we can efficiently approximate it up to a constant factor. First, we restate the problem in terms of the number of demands that are {\em not} connected. In particular, the objective of the $k$-forest problem can be viewed as to remove at most $m-k$ demands and find a minimum-cost subgraph that connects the remaining demands. We use this perspective of the problem to explain the performance of our algorithm (in terms of the augmentation) in a more intuitive way. Specifically, we present a polynomial-time algorithm for the $k$-forest problem that, for every $\epsilon>0$, removes at most $m-k$ demands and has cost no more than $O(1/\epsilon^{2})$ times the cost of an optimal algorithm that removes at most $(1-\epsilon)(m-k)$ demands

Dynamical Autler-Townes control of a phase qubit

Routers, switches, and repeaters are essential components of modern information-processing systems. Similar devices will be needed in future superconducting quantum computers. In this work we investigate experimentally the time evolution of Autler-Townes splitting in a superconducting phase qubit under the application of a control tone resonantly coupled to the second transition. A three-level model that includes independently determined parameters for relaxation and dephasing gives excellent agreement with the experiment. The results demonstrate that the qubit can be used as a ON/OFF switch with 100 ns operating time-scale for the reflection/transmission of photons coming from an applied probe microwave tone. The ON state is realized when the control tone is sufficiently strong to generate an Autler-Townes doublet, suppressing the absorption of the probe tone photons and resulting in a maximum of transmission.Comment: 8 pages, 8 figure

Spin Degeneracy and Conductance Fluctuations in Open Quantum Dots

The dependence of mesoscopic conductance fluctuations on parallel magnetic field is used as a probe of spin degeneracy in open GaAs quantum dots. The variance of fluctuations at high parallel field is reduced from the low-field variance (with broken time-reversal symmetry) by factors ranging from roughly two in a 1 square-micron dot at low temperature, to four or greater in 8 square-micron dots. The factor of two is expected for simple Zeeman splitting of spin degenerate channels. A possible explanation for the unexpected larger factors in terms of field-dependent spin orbit scattering is proposed.Comment: Includes new reference to related theoretical work, cond-mat/0010064. Other minor changes. Related papers at http://marcuslab.harvard.ed

A Match in Time Saves Nine: Deterministic Online Matching With Delays

We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match them in pairs. In contrast to traditional online matching problems, in MPMD all requests appear online and an algorithm can match any pair of requests, but such decision may be delayed (e.g., to find a better match). The cost is the sum of matching distances and the introduced delays. We present the first deterministic online algorithm for this problem. Its competitive ratio is $O(m^{\log_2 5.5})$ $= O(m^{2.46})$, where $2 m$ is the number of requests. This is polynomial in the number of metric space points if all requests are given at different points. In particular, the bound does not depend on other parameters of the metric, such as its aspect ratio. Unlike previous (randomized) solutions for the MPMD problem, our algorithm does not need to know the metric space in advance

Cross Sections from 800 MeV Proton Irradiation of Terbium

A single terbium foil was irradiated with 800 MeV protons to ascertain the potential for production of lanthanide isotopes of interest in medical, astrophysical, and basic science research and to contribute to nuclear data repositories. Isotopes produced in the foil were quantified by gamma spectroscopy. Cross sections for 36 isotopes produced in the irradiation are reported and compared with predictions by the MCNP6 transport code using the CEM03.03, Bertini, and INCL+ABLA event generators. Our results indicate the need to accurately consider fission and fragmentation of relatively light target nuclei like terbium in the modeling of nuclear reactions at 800 MeV. The predictive power of the code was found to be different for each event generator tested but was satisfactory for most of the product yields in the mass region where spallation reactions dominate. However, none of the event generators' results are in complete agreement with measured data.Comment: 16 pages, 3 figures, 1 tables, only pdf, submitted to Nuclear Physics