The airborne lava-seawater interaction plume at Kilauea Volcano, Hawaii

Petrology igneous metamorphic and volcanic studies; medm0

Hypergraphic LP Relaxations for Steiner Trees

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Koenemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the integrality gap of this LP, and studying its relation to other linear relaxations. Our results are the following. Structural results: We extend the technique of uncrossing, usually applied to families of sets, to families of partitions. As a consequence we show that any basic feasible solution to the partition LP formulation has sparse support. Although the number of variables could be exponential, the number of positive variables is at most the number of terminals. Relations with other relaxations: We show the equivalence of the partition LP relaxation with other known hypergraphic relaxations. We also show that these hypergraphic relaxations are equivalent to the well studied bidirected cut relaxation, if the instance is quasibipartite. Integrality gap upper bounds: We show an upper bound of sqrt(3) ~ 1.729 on the integrality gap of these hypergraph relaxations in general graphs. In the special case of uniformly quasibipartite instances, we show an improved upper bound of 73/60 ~ 1.216. By our equivalence theorem, the latter result implies an improved upper bound for the bidirected cut relaxation as well.Comment: Revised full version; a shorter version will appear at IPCO 2010

Composite Fermions in Negative Effective Magnetic Field: A Monte-Carlo Study

The method of Jain and Kamilla [PRB {\bf 55}, R4895 (1997)] allows numerical generation of composite fermion trial wavefunctions for large numbers of electrons in high magnetic fields at filling fractions of the form nu=p/(2mp+1) with m and p positive integers. In the current paper we generalize this method to the case where the composite fermions are in an effective (mean) field with opposite sign from the actual physical field, i.e. when p is negative. We examine both the ground state energies and the low energy neutral excitation spectra of these states. Using particle-hole symmetry we can confirm the correctness of our method by comparing results for the series m=1 with p>0 (previously calculated by others) to our results for the conjugate series m=1 with p <0. Finally, we present similar results for ground state energies and low energy neutral excitations for the states with m=2 and p <0 which were not previously addressable, comparing our results to the m=1 case and the p > 0, m=2 cases.Comment: 11 page

An exactly solvable limit of low energy QCD

Starting from the QCD Hamiltonian, we derive a schematic Hamiltonian for low energy quark dynamics with quarks restricted to the lowest s-level. The resulting eigenvalue problem can be solved analytically. Even though the Hamiltonian exhibits explicit chiral symmetry the severe restriction of the number of degrees of freedom breaks the pattern of chiral symmetry breaking for finite quark masses.Comment: 7 page

Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design

We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same time maximize a given valuation function. This framework captures the budgeted version of several well known optimization problems, and when the resources are owned by strategic agents the goal is to design truthful and budget feasible mechanisms, i.e. elicit the true cost of the resources and ensure the payments of the mechanism do not exceed the budget. Budget feasibility introduces more challenges in mechanism design, and we study instantiations of this problem for certain classes of submodular and XOS valuation functions. We first obtain mechanisms with an improved approximation ratio for weighted coverage valuations, a special class of submodular functions that has already attracted attention in previous works. We then provide a general scheme for designing randomized and deterministic polynomial time mechanisms for a class of XOS problems. This class contains problems whose feasible set forms an independence system (a more general structure than matroids), and some representative problems include, among others, finding maximum weighted matchings, maximum weighted matroid members, and maximum weighted 3D-matchings. For most of these problems, only randomized mechanisms with very high approximation ratios were known prior to our results

Study protocol: Delayed intervention randomised controlled trial within the Medical Research Council (MRC) Framework to assess the effectiveness of a new palliative care service

Background: Palliative care has been proposed to help meet the needs of patients who suffer progressive non-cancer conditions but there have been few evaluations of service development initiatives. We report here a novel protocol for the evaluation of a new palliative care service in this context. Methods/Design: Using the MRC Framework for the Evaluation of Complex Interventions we modelled a new palliative care and neurology service for patients severely affected by Multiple Sclerosis (MS). We conducted qualitative interviews with patients, families and staff, plus a literature review to model and pilot the service. Then we designed a delayed intervention randomised controlled trial to test its effectiveness as part of phase II of the MRC framework. Inclusion criteria for the trial were patients identified by referring clinicians as having unresolved symptoms or psychological concerns. Referrers were advised to use a score of greater than 8 on the Expanded Disability Scale was a benchmark. Consenting patients newly referred to the new service were randomised to either receive the palliative care service immediately (fast-track) or after a 12-week wait (standard best practice). Face to face interviews were conducted at baseline (before intervention), and at 4–6, 10–12 (before intervention for the standard-practice group), 16– 18 and 22–24 weeks with patients and their carers using standard questionnaires to assess symptoms, palliative care outcomes, function, service use and open comments. Ethics committee approval was granted separately for the qualitative phase and then for the trial. Discussion: We publish the protocol trial here, to allow methods to be reviewed in advance of publication of the results. The MRC Framework for the Evaluation of Complex Interventions was helpful in both the design of the service, methods for evaluation in convincing staff and the ethics committee to accept the trial. The research will provide valuable information on the effects of palliative care among non-cancer patients and a method to evaluate palliative care in this context

Electrostatic Modulation of the Electronic Properties of Dirac Semimetal Na3Bi

Large-area thin films of topological Dirac semimetal Na$_3$Bi are grown on amorphous SiO$_2$:Si substrates to realise a field-effect transistor with the doped Si acting as back gate. As-grown films show charge carrier mobilities exceeding 7,000 cm$^2$/Vs and carrier densities below 3 $\times$10$^{18}$ cm$^{-3}$, comparable to the best thin-film Na$_3$Bi. An ambipolar field effect and minimum conductivity are observed, characteristic of Dirac electronic systems. The results are quantitatively understood within a model of disorder-induced charge inhomogeneity in topological Dirac semimetals. Due to the inverted band structure, the hole mobility is significantly larger than the electron mobility in Na$_3$Bi, and when present, these holes dominate the transport properties.Comment: 5 pages, 4 figures; minor corrections and revisions for readabilit

Reconstructing a Simple Polytope from its Graph

Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope P from its graph can be formulated as a combinatorial optimization problem that is strongly dual to the problem of finding an abstract objective function on P (i.e., a shelling order of the facets of the dual polytope of P). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of P. The paper is a variation on joint work with Michael Joswig and Friederike Koerner (2001).Comment: 14 page