Vortex pinning by cylindrical defects in type-II superconductors: Numerical solutions to the Ginzburg-Landau equations

We numerically integrate the one-dimensional, cylindrically symmetric Ginzburg-Landau equations to calculate the spatial variation of the order parameter and supercurrents for a vortex trapped by a cylindrical defect. We use the resulting field distributions to estimate the pinning energy, and make use of the vortex/two-dimensional boson analogy to calculate the depinning temperature. The microscopic behavior oi the fields depends on the size, and the conductivity of the cylindrical defect appears to be important for the pinning

Modified Bennett-Brassard 1984 Quantum Key Distribution With Two-way Classical Communications

The quantum key distribution protocol without public announcement of bases is equipped with a two-way classical communication symmetric entanglement purification protocol. This modified key distribution protocol is unconditionally secure and has a higher tolerable error rate of 20%, which is higher than previous scheme without public announcement of bases.Comment: 5 pages. To appear in Physical Review

Effects of boundaries in mesoscopic superconductors

A thin superconducting disk, with radius $R=4\xi$ and height $H=\xi$, is studied in the presence of an applied magnetic field parallel to its major axis. We study how the boundaries influence the decay of the order parameter near the edges for three-dimensional vortex states.Comment: To appear in Physica C as a special issue of M2S-HTS

NASA follow-on to the Bangladesh Agro-Climatic Environmental Monitoring Project

The NASA responsibility and activities for the follow-on to the original Agro-Climatic Environmental Monitoring Project (ACEMP) which was completed during 1987 is described. Five training sessions which comprise the NASA ACEMP follow-on are: Agrometeorology, Meteorology of Severe Storms Using GEMPAK, Satellite Oceanography, Hydrology, and Meteorology with TOVS. The objective of the follow-on is to train Bangladesh Government staff in the use of satellite data for remote sensing applications. This activity also encourages the scientific connection between NASA/Goddard Space Flight Center and The Bangladesh Space and Remote Sensing Organization (SPARRSO)

Close to Uniform Prime Number Generation With Fewer Random Bits

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.L. Montgomery, made precise by Friedlander and Granville; then the Extended Riemann Hypothesis; and finally fully unconditionally using the Barban-Davenport-Halberstam theorem. We argue that this approach has a number of desirable properties compared to previous algorithms.Comment: Full version of ICALP 2014 paper. Alternate version of IACR ePrint Report 2011/48