5,362 research outputs found
AN EXTENSION OF THE CHAPMAN-FERRARO THEORY OF GEOMAGNETIC STORMS
Extension of chapman-ferraro theory of geomagnetic storm
Ag-coverage-dependent symmetry of the electronic states of the Pt(111)-Ag-Bi interface: The ARPES view of a structural transition
We studied by angle-resolved photoelectron spectroscopy the strain-related
structural transition from a pseudomorphic monolayer (ML) to a striped
incommensurate phase in an Ag thin film grown on Pt(111). We exploited the
surfactant properties of Bi to grow ordered Pt(111)-xMLAg-Bi trilayers with 0 <
x < 5 ML, and monitored the dispersion of the Bi-derived interface states to
probe the structure of the underlying Ag film. We find that their symmetry
changes from threefold to sixfold and back to threefold in the Ag coverage
range studied. Together with previous scanning tunneling microscopy and
photoelectron diffraction data, these results provide a consistent microscopic
description of the coverage-dependent structural transition.Comment: 10 pages, 9 figure
Particle detection experiment for Applications Technology Satellite 1 /ATS-1/ Final report
Applications technology satellite particle detection experiment for measuring energy spectra of earth magnetic fiel
Comment on the Shiner-Davison-Landsberg Measure
The complexity measure from Shiner et al. [Physical Review E 59, 1999, 1459-1464] (henceforth abbreviated as SDL-measure) has recently been the subject of a fierce debate. We discuss the properties and shortcomings of this measure, from the point of view of our recently constructed fundamental, statistical mechanics-based measures of complexity Cs(γ,β) [Stoop et al., J. Stat. Phys. 114, 2004, 1127-1137]. We show explicitly, what the shortcomings of the SDL-measure are: It is over-universal, and the implemented temperature dependence is trivial. We also show how the original SDL-approach can be modified to rule out these points of critique. Results of this modification are shown for the logistic parabol
Integrated Atom Detector Based on Field Ionization near Carbon Nanotubes
We demonstrate an atom detector based on field ionization and subsequent ion
counting. We make use of field enhancement near tips of carbon nanotubes to
reach extreme electrostatic field values of up to 9x10^9 V/m, which ionize
ground state rubidium atoms. The detector is based on a carpet of multiwall
carbon nanotubes grown on a substrate and used for field ionization, and a
channel electron multiplier used for ion counting. We measure the field
enhancement at the tips of carbon nanotubes by field emission of electrons. We
demonstrate the operation of the field ionization detector by counting atoms
from a thermal beam of a rubidium dispenser source. By measuring the ionization
rate of rubidium as a function of the applied detector voltage we identify the
field ionization distance, which is below a few tens of nanometers in front of
nanotube tips. We deduce from the experimental data that field ionization of
rubidium near nanotube tips takes place on a time scale faster than 10^(-10)s.
This property is particularly interesting for the development of fast atom
detectors suitable for measuring correlations in ultracold quantum gases. We
also describe an application of the detector as partial pressure gauge.Comment: 7 pages, 8 figure
Residual AML at the time of allograft: Outcome analysis based on number of bone marrow blasts
The Least-core and Nucleolus of Path Cooperative Games
Cooperative games provide an appropriate framework for fair and stable profit
distribution in multiagent systems. In this paper, we study the algorithmic
issues on path cooperative games that arise from the situations where some
commodity flows through a network. In these games, a coalition of edges or
vertices is successful if it enables a path from the source to the sink in the
network, and lose otherwise. Based on dual theory of linear programming and the
relationship with flow games, we provide the characterizations on the CS-core,
least-core and nucleolus of path cooperative games. Furthermore, we show that
the least-core and nucleolus are polynomially solvable for path cooperative
games defined on both directed and undirected network
- …