Training interventions for improving telephone consultation skills in clinicians

The objectives are as follows: To assess the effectiveness of training interventions on clinician telephone skills

Hybrid Superconductor-Quantum Point Contact Devices using InSb Nanowires

Proposals for studying topological superconductivity and Majorana bound states in nanowires proximity coupled to superconductors require that transport in the nanowire is ballistic. Previous work on hybrid nanowire-superconductor systems has shown evidence for Majorana bound states, but these experiments were also marked by disorder, which disrupts ballistic transport. In this letter, we demonstrate ballistic transport in InSb nanowires interfaced directly with superconducting Al by observing quantized conductance at zero-magnetic field. Additionally, we demonstrate that the nanowire is proximity coupled to the superconducting contacts by observing Andreev reflection. These results are important steps for robustly establishing topological superconductivity in InSb nanowires

Space-efficient detection of unusual words

Detecting all the strings that occur in a text more frequently or less frequently than expected according to an IID or a Markov model is a basic problem in string mining, yet current algorithms are based on data structures that are either space-inefficient or incur large slowdowns, and current implementations cannot scale to genomes or metagenomes in practice. In this paper we engineer an algorithm based on the suffix tree of a string to use just a small data structure built on the Burrows-Wheeler transform, and a stack of $O(\sigma^2\log^2 n)$ bits, where $n$ is the length of the string and $\sigma$ is the size of the alphabet. The size of the stack is $o(n)$ except for very large values of $\sigma$. We further improve the algorithm by removing its time dependency on $\sigma$, by reporting only a subset of the maximal repeats and of the minimal rare words of the string, and by detecting and scoring candidate under-represented strings that $\textit{do not occur}$ in the string. Our algorithms are practical and work directly on the BWT, thus they can be immediately applied to a number of existing datasets that are available in this form, returning this string mining problem to a manageable scale.Comment: arXiv admin note: text overlap with arXiv:1502.0637

How well do Car-Parrinello simulations reproduce the Born-Oppenheimer surface ? Theory and Examples

We derive an analytic expression for the average difference between the forces on the ions in a Car-Parrinello simulation and the forces obtained at the same ionic positions when the electrons are at their ground state. We show that for common values of the fictitious electron mass, a systematic bias may affect the Car-Parrinello forces in systems where the electron-ion coupling is large. We show that in the limit where the electronic orbitals are rigidly dragged by the ions the difference between the two dynamics amounts to a rescaling of the ionic masses, thereby leaving the thermodynamics intact. We study the examples of crystalline magnesium oxide and crystalline and molten silicon. We find that for crystalline silicon the errors are very small. For crystalline MgO the errors are very large but the dynamics can be quite well corrected within the rigid-ion model. We conclude that it is important to control the effect of the electron mass parameter on the quantities extracted from Car-Parrinello simulations.Comment: Submitted to the Journal of Chemical Physic

Spin transport in ferromagnet-InSb nanowire quantum devices

Signatures of Majorana zero modes (MZMs), which are the building blocks for fault-tolerant topological quantum computing, have been observed in semiconductor nanowires (NW) with strong spin-orbital-interaction (SOI), such as InSb and InAs NWs with proximity-induced superconductivity. Realizing topological superconductivity and MZMs in this most widely-studied platform also requires eliminating spin degeneracy, which is realized by applying a magnetic field to induce a helical gap. However, the applied field can adversely impact the induced superconducting state in the NWs and also places geometric restrictions on the device, which can affect scaling of future MZM-based quantum registers. These challenges could be circumvented by integrating magnetic elements with the NWs. With this motivation, in this work we report the first experimental investigation of spin transport across InSb NWs, which are enabled by devices with ferromagnetic (FM) contacts. We observe signatures of spin polarization and spin-dependent transport in the quasi-one-dimensional ballistic regime. Moreover, we show that electrostatic gating tunes the observed magnetic signal and also reveals a transport regime where the device acts as a spin filter. These results open an avenue towards developing MZM devices in which spin degeneracy is lifted locally, without the need of an applied magnetic field. They also provide a path for realizing spin-based devices that leverage spin-orbital states in quantum wires.Comment: 30 pages, 12 figure

X-ray absorption signatures of the molecular environment in water and ice

The x-ray absorption spectra of water and ice are calculated with a many-body approach for electron-hole excitations. The experimental features, including the small effects of temperature change in the liquid, are quantitatively reproduced from molecular configurations generated by ab-initio molecular dynamics. The spectral difference between the solid and the liquid is due to two major short range order effects. One, due to breaking of hydrogen bonds, enhances the pre-edge intensity in the liquid. The other, due to a non-bonded molecular fraction in the first coordination shell, affects the main spectral edge in the conversion of ice to water. This effect may not involve hydrogen bond breaking as shown by experiment in high-density amorphous ice.Comment: 5 pages, 3 figure

Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible ones (irreducible but reducible over an extension field). One approach employs generating functions, another one uses a combinatorial method. They yield exact formulas and approximations with relative errors that essentially decrease exponentially in the input size.Comment: to appear in SIAM Journal on Discrete Mathematic

The millipedes of Barrow Island, Western Australia (Diplopoda)

Six species of millipedes are recorded from Barrow Island, including three species of pin-cushion millipedes of the order Polyxenida, Lophoturus madecassus (Marquet and Condé, 1950) (Lophoproctidae), Unixenus mjoebergi (Verhoeff, 1924) (Polyxenidae) and Phryssonotus novaehollandiae (Silvestri, 1923) (Synxenidae), a single species of the order Spirobolida, Speleostrophus nesiotes Hoffman, 1994 (Trigoniulidae), and two species of the order Polydesmida, Boreohesperus dubitalis Car and Harvey, 2013 (Paradoxosomatidae) and one species of the family Haplodesmidae (genus and species indet.). Lophoturus madecassus is circum-tropical in distribution, Unixenus mjoebergi and Phryssonotus novaehollandiae are found also on mainland Australia, but the other three species are endemic to the island. Speleostrophus nesiotes is a highly modified troglobiotic species, currently listed as threatened by the Western Australian government. It is unclear at present whether the haplodesmid specimen is a troglobite

Several types of types in programming languages

Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming languages with the concept of the same name in mathematical logic, an identification that is only the result of the convergence of two different paths, which started apart with different aims. The paper will present several remarks (some historical, some of more conceptual character) on the subject, as a basis for a further investigation. The thesis we will argue is that there are three different characters at play in programming languages, all of them now called types: the technical concept used in language design to guide implementation; the general abstraction mechanism used as a modelling tool; the classifying tool inherited from mathematical logic. We will suggest three possible dates ad quem for their presence in the programming language literature, suggesting that the emergence of the concept of type in computer science is relatively independent from the logical tradition, until the Curry-Howard isomorphism will make an explicit bridge between them.Comment: History and Philosophy of Computing, HAPOC 2015. To appear in LNC