23,068 research outputs found
Island formation without attractive interactions
We show that adsorbates on surfaces can form islands even if there are no
attractive interactions. Instead strong repulsion between adsorbates at short
distances can lead to islands, because such islands increase the entropy of the
adsorbates that are not part of the islands. We suggest that this mechanism
cause the observed island formation in O/Pt(111), but it may be important for
many other systems as well.Comment: 11 pages, 4 figure
Effects of liquid and vapor cesium on structural materials
Literature survey on corrosive effects of liquid and vapor cesium on structural materials, and compatibility of cesium as working fluid for Rankine cycle space power plan
Exciton-Exciton Annihilation Is Coherently Suppressed in H-Aggregates, but Not in J-Aggregates
We theoretically demonstrate a strong dependence of the annihilation rate
between (singlet) excitons on the sign of dipole-dipole couplings between
molecules. For molecular H-aggregates, where this sign is positive, the phase
relation of the delocalized two-exciton wavefunctions causes a destructive
interference in the annihilation probability. For J-aggregates, where this sign
is negative, the interference is constructive instead, as a result of which no
such coherent suppression of the annihilation rate occurs. As a consequence,
room temperature annihilation rates of typical H- and J-aggregates differ by a
factor of ~3, while an order of magnitude difference is found for
low-temperature aggregates with a low degree of disorder. These findings, which
explain experimental observations, reveal a fundamental principle underlying
exciton-exciton annihilation, with major implications for technological devices
and experimental studies involving high excitation densities
Fluid thrust control system
A pure fluid thrust control system is described for a pump-fed, regeneratively cooled liquid propellant rocket engine. A proportional fluid amplifier and a bistable fluid amplifier control overshoot in the starting of the engine and take it to a predetermined thrust. An ejector type pump is provided in the line between the liquid hydrogen rocket nozzle heat exchanger and the turbine driving the fuel pump to aid in bringing the fluid at this point back into the regular system when it is not bypassed. The thrust control system is intended to function in environments too severe for mechanical controls
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational
representation system for uncertain databases. U-relations support
attribute-level uncertainty using vertical partitioning. If we consider
positive relational algebra extended by an operation for computing possible
answers, a query on the logical level can be translated into, and evaluated as,
a single relational algebra query on the U-relation representation. The
translation scheme essentially preserves the size of the query in terms of
number of operations and, in particular, number of joins. Standard techniques
employed in off-the-shelf relational database management systems are effective
for optimizing and processing queries on U-relations. In our experiments we
show that query evaluation on U-relations scales to large amounts of data with
high degrees of uncertainty.Comment: 12 pages, 14 figure
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called
cross-composition. A classical problem L cross-composes into a parameterized
problem Q if an instance of Q with polynomially bounded parameter value can
express the logical OR of a sequence of instances of L. Building on work by
Bodlaender et al. (ICALP 2008) and using a result by Fortnow and Santhanam
(STOC 2008) we show that if an NP-complete problem cross-composes into a
parameterized problem Q then Q does not admit a polynomial kernel unless the
polynomial hierarchy collapses. Our technique generalizes and strengthens the
recent techniques of using OR-composition algorithms and of transferring the
lower bounds via polynomial parameter transformations. We show its
applicability by proving kernelization lower bounds for a number of important
graphs problems with structural (non-standard) parameterizations, e.g.,
Chromatic Number, Clique, and Weighted Feedback Vertex Set do not admit
polynomial kernels with respect to the vertex cover number of the input graphs
unless the polynomial hierarchy collapses, contrasting the fact that these
problems are trivially fixed-parameter tractable for this parameter. We have
similar lower bounds for Feedback Vertex Set.Comment: Updated information based on final version submitted to STACS 201
- …