Pressure-induced hole doping of the Hg-based cuprate superconductors

We investigate the electronic structure and the hole content in the copper-oxygen planes of Hg based high Tc cuprates for one to four CuO2 layers and hydrostatic pressures up to 15 GPa. We find that with the pressure-induced additional number of holes of the order of 0.05e the density of states at the Fermi level changes approximately by a factor of 2. At the same time the saddle point is moved to the Fermi level accompanied by an enhanced k_z dispersion. This finding explains the pressure behavior of Tc and leads to the conclusion that the applicability of the van Hove scenario is restricted. By comparison with experiment, we estimate the coupling constant to be of the order of 1, ruling out the weak coupling limit.Comment: 4 pages, 4 figure

An efficient algorithm for learning with semi-bandit feedback

We consider the problem of online combinatorial optimization under semi-bandit feedback. The goal of the learner is to sequentially select its actions from a combinatorial decision set so as to minimize its cumulative loss. We propose a learning algorithm for this problem based on combining the Follow-the-Perturbed-Leader (FPL) prediction method with a novel loss estimation procedure called Geometric Resampling (GR). Contrary to previous solutions, the resulting algorithm can be efficiently implemented for any decision set where efficient offline combinatorial optimization is possible at all. Assuming that the elements of the decision set can be described with d-dimensional binary vectors with at most m non-zero entries, we show that the expected regret of our algorithm after T rounds is O(m sqrt(dT log d)). As a side result, we also improve the best known regret bounds for FPL in the full information setting to O(m^(3/2) sqrt(T log d)), gaining a factor of sqrt(d/m) over previous bounds for this algorithm.Comment: submitted to ALT 201

Retrieval of publications addressing shared decision making: an evaluation of full-text searches on medical journal websites.

BACKGROUND: Full-text searches of articles increase the recall, defined by the proportion of relevant publications that are retrieved. However, this method is rarely used in medical research due to resource constraints. For the purpose of a systematic review of publications addressing shared decision making, a full-text search method was required to retrieve publications where shared decision making does not appear in the title or abstract. OBJECTIVE: The objective of our study was to assess the efficiency and reliability of full-text searches in major medical journals for identifying shared decision making publications. METHODS: A full-text search was performed on the websites of 15 high-impact journals in general internal medicine to look up publications of any type from 1996-2011 containing the phrase "shared decision making". The search method was compared with a PubMed search of titles and abstracts only. The full-text search was further validated by requesting all publications from the same time period from the individual journal publishers and searching through the collected dataset. RESULTS: The full-text search for "shared decision making" on journal websites identified 1286 publications in 15 journals compared to 119 through the PubMed search. The search within the publisher-provided publications of 6 journals identified 613 publications compared to 646 with the full-text search on the respective journal websites. The concordance rate was 94.3% between both full-text searches. CONCLUSIONS: Full-text searching on medical journal websites is an efficient and reliable way to identify relevant articles in the field of shared decision making for review or other purposes. It may be more widely used in biomedical research in other fields in the future, with the collaboration of publishers and journals toward open-access data

Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Re-embedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). This is an extended abstract. For a full version of this paper, see Hong S-H, Nagamochi H.: Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time, Technical Report TR 2016-002, Department of Applied Mathematics and Physics, Kyoto University (2016

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given

Radiative Transfer in Obliquely Illuminated Accretion Disks

The illumination of an accretion disk around a black hole or neutron star by the central compact object or the disk itself often determines its spectrum, stability, and dynamics. The transport of radiation within the disk is in general a multi-dimensional, non-axisymmetric problem, which is challenging to solve. Here, I present a method of decomposing the radiative transfer equation that describes absorption, emission, and Compton scattering in an obliquely illuminated disk into a set of four one-dimensional transfer equations. I show that the exact calculation of the ionization balance and radiation heating of the accretion disk requires the solution of only one of the one-dimensional equations, which can be solved using existing numerical methods. I present a variant of the Feautrier method for solving the full set of equations, which accounts for the fact that the scattering kernels in the individual transfer equations are not forward-backward symmetric. I then apply this method in calculating the albedo of a cold, geometrically thin accretion disk.Comment: 16 pages, 3 figures; to appear in The Astrophysical Journa

Recognizing and Drawing IC-planar Graphs

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$ vertices, we present an $O(n)$-time algorithm that computes a straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm that computes a straight-line drawing of $G$ with right-angle crossings in exponential area. Both these area requirements are worst-case optimal. We also show that it is NP-complete to test IC-planarity both in the general case and in the case in which a rotation system is fixed for the input graph. Furthermore, we describe a polynomial-time algorithm to test whether a set of matching edges can be added to a triangulated planar graph such that the resulting graph is IC-planar

Nucleon-nucleon elastic scattering analysis to 2.5 GeV

A partial-wave analysis of NN elastic scattering data has been completed. This analysis covers an expanded energy range, from threshold to a laboratory kinetic energy of 2.5 GeV, in order to include recent elastic pp scattering data from the EDDA collaboration. The results of both single-energy and energy-dependent analyses are described.Comment: 23 pages of text. Postscript files for the figures are available from ftp://clsaid.phys.vt.edu/pub/said/n

Homogeneous nucleation of colloidal melts under the influence of shearing fields

We study the effect of shear flow on homogeneous crystal nucleation, using Brownian Dynamics simulations in combination with an umbrella sampling like technique. The symmetry breaking due to shear results in anisotropic radial distribution functions. The homogeneous shear rate suppresses crystal nucleation and leads to an increase of the size of the critical nucleus. These observations can be described by a simple, phenomenological extension of classical nucleation theory. In addition, we find that nuclei have a preferential orientation with respect to the direction of shear. On average the longest dimension of a nucleus is along the vorticity direction, while the shortest dimension is preferably perpendicular to that and slightly tilted with respect to the gradient direction.Comment: 10 pages, 8 figures, Submitted to J. Phys.: Condens. Matte