35,762 research outputs found
Feshbach resonant scattering of three fermions in one-dimensional wells
We study the weak-tunnelling limit for a system of cold 40K atoms trapped in
a one-dimensional optical lattice close to an s-wave Feshbach resonance. We
calculate the local spectrum for three atoms at one site of the lattice within
a two-channel model. Our results indicate that, for this one-dimensional
system, one- and two-channel models will differ close to the Feshbach
resonance, although the two theories would converge in the limit of strong
Feshbach coupling. We also find level crossings in the low-energy spectrum of a
single well with three atoms that may lead to quantum phase transition for an
optical lattice of many wells. We discuss the stability of the system to a
phase with non-uniform density.Comment: 10 pages, 5 figure
Research on a non-destructive fluidic storage control device
Fluidic memory device with associated fluidic alpha numerical displa
Double Phase Transitions in Magnetized Spinor Bose-Einstein Condensation
It is investigated theoretically that magnetized Bose-Einstein condensation
(BEC) with the internal (spin) degrees of freedom exhibits a rich variety of
phase transitions, depending on the sign of the interaction in the spin
channel. In the antiferromagnetic interaction case there exist always double
BEC transitions from single component BEC to multiple component BEC. In the
ferromagnetic case BEC becomes always unstable at a lower temperature, leading
to a phase separation. The detailed phase diagram for the temperature vs the
polarization, the spatial spin structure, the distribution of non-condensates
and the excitation spectrum are examined for the harmonically trapped systems.Comment: 6 pages, 7 figures. Submitted to J. Phys. Soc. Jp
Retrospective study of more than 9000 feline cutaneous tumours in the UK: 2006–2013
The aim of the study was to utilise a large database available from a UK-based, commercial veterinary diagnostic laboratory to ascertain the prevalence of different forms of cutaneous neoplasia within the feline population, and to detect any breed, sex or age predilections for the more common tumours
An Automated Social Graph De-anonymization Technique
We present a generic and automated approach to re-identifying nodes in
anonymized social networks which enables novel anonymization techniques to be
quickly evaluated. It uses machine learning (decision forests) to matching
pairs of nodes in disparate anonymized sub-graphs. The technique uncovers
artefacts and invariants of any black-box anonymization scheme from a small set
of examples. Despite a high degree of automation, classification succeeds with
significant true positive rates even when small false positive rates are
sought. Our evaluation uses publicly available real world datasets to study the
performance of our approach against real-world anonymization strategies, namely
the schemes used to protect datasets of The Data for Development (D4D)
Challenge. We show that the technique is effective even when only small numbers
of samples are used for training. Further, since it detects weaknesses in the
black-box anonymization scheme it can re-identify nodes in one social network
when trained on another.Comment: 12 page
Topological Excitations in Spinor Bose-Einstein Condensates
We investigate the properties of skyrmion in the ferromagnetic state of
spin-1 Bose-Einstein condensates by means of the mean-field theory and show
that the size of skyrmion is fixed to the order of the healing length. It is
shown that the interaction between two skyrmions with oppositely rotating spin
textures is attractive when their separation is large, following a unique
power-law behavior with a power of -7/2.Comment: 4 pages, 5 figure
On Fast and Robust Information Spreading in the Vertex-Congest Model
This paper initiates the study of the impact of failures on the fundamental
problem of \emph{information spreading} in the Vertex-Congest model, in which
in every round, each of the nodes sends the same -bit message
to all of its neighbors.
Our contribution to coping with failures is twofold. First, we prove that the
randomized algorithm which chooses uniformly at random the next message to
forward is slow, requiring rounds on some graphs, which we
denote by , where is the vertex-connectivity.
Second, we design a randomized algorithm that makes dynamic message choices,
with probabilities that change over the execution. We prove that for
it requires only a near-optimal number of rounds, despite a
rate of failures per round. Our technique of choosing
probabilities that change according to the execution is of independent
interest.Comment: Appears in SIROCCO 2015 conferenc
- …