746 research outputs found
Maximum Matching in Turnstile Streams
We consider the unweighted bipartite maximum matching problem in the one-pass
turnstile streaming model where the input stream consists of edge insertions
and deletions. In the insertion-only model, a one-pass -approximation
streaming algorithm can be easily obtained with space , where
denotes the number of vertices of the input graph. We show that no such result
is possible if edge deletions are allowed, even if space is
granted, for every . Specifically, for every , we show that in the one-pass turnstile streaming model, in order to compute
a -approximation, space is
required for constant error randomized algorithms, and, up to logarithmic
factors, space is sufficient. Our lower bound result is
proved in the simultaneous message model of communication and may be of
independent interest
EP-1518: Evaluation of dynamic delivery quality assurance process for internal target based RapidArc
n/
Hawking-Unruh effect and the entanglement of two-mode squeezed states in Riemannian spacetime
We consider the system of free scalar field, which is assumed to be a
two-mode squeezed state from an inertial point of view. This setting allows the
use of entanglement measure for continuous variables, which can be applied to
discuss free and bound entanglement from the point of view from non-inertial
observer.Comment: Phys. Lett. A, accepted for publicatio
Cholesterol granuloma in the wall of a mandibular dentigerous cyst: a rare case report
Cholesterol granuloma is an inflammatory reaction to cholesterol crystals deposition. It may develop in a variety of
sites including the middle ear, mastoid process or even paranasal sinuses. Very few cases of cholesterol granuloma
occurring in the jaws were reported. This report presents a rare case of cholesterol granuloma that developed in
the wall of a large mandibular dentigerous cyst. The condition was treated with hemimandibulectomy followed by
reconstruction with a free fibular flap
Measurement of the Xi-p Scattering Cross Sections at Low Energy
In this paper we report cross-section measurements for elastic and
inelastic scatterings at low energy using a scintillating fiber active target.
Upper limit on the total cross-section for the elastic scattering was found to
be 24 mb at 90% confidence level, and the total cross section for the
reaction was found to be mb. We
compare the results with currently competing theoretical estimates.Comment: 9 page
Model for tumour growth with treatment by continuous and pulsed chemotherapy
Peer reviewedPreprin
Three-dimensional flux states as a model for the pseudogap phase of transition metal oxides
We propose that the pseudogap state observed in the transition metal oxides
can be explained by a three-dimensional flux state, which exhibits
spontaneously generated currents in its ground state due to electron-electron
correlations. We compare the energy of the flux state to other classes of mean
field states, and find that it is stabilized over a wide range of and
. The signature of the state will be peaks in the neutron diffraction
spectra, the location and intensity of which are presented. The dependence of
the pseudogap in the optical conductivity is calculated based on the parameters
in the model.Comment: submitted to Phys. Rev. B on January 8, 200
Exo-hydrogenated Single Wall Carbon Nanotubes
An extensive first-principles study of fully exo-hydrogenated zigzag (n,0)
and armchair (n,n) single wall carbon nanotubes (CH), polyhedral
molecules including cubane, dodecahedrane, and CH points to
crucial differences in the electronic and atomic structures relevant to
hydrogen storage and device applications. CH's are estimated to be
stable up to the radius of a (8,8) nanotube, with binding energies proportional
to 1/R. Attaching a single hydrogen to any nanotube is always exothermic.
Hydrogenation of zigzag nanotubes is found to be more likely than armchair
nanotubes with similar radius. Our findings may have important implications for
selective functionalization and finding a way of separating similar radius
nanotubes from each other.Comment: 5 pages, 4 postscript figures, Revtex file, To be appear in Physical
Review
An efficient algorithm to calculate intrinsic thermoelectric parameters based on Landauer approach
The Landauer approach provides a conceptually simple way to calculate the
intrinsic thermoelectric (TE) parameters of materials from the ballistic to the
diffusive transport regime. This method relies on the calculation of the number
of propagating modes and the scattering rate for each mode. The modes are
calculated from the energy dispersion (E(k)) of the materials which require
heavy computation and often supply energy relation on sparse momentum (k)
grids. Here an efficient method to calculate the distribution of modes (DOM)
from a given E(k) relationship is presented. The main features of this
algorithm are, (i) its ability to work on sparse dispersion data, and (ii)
creation of an energy grid for the DOM that is almost independent of the
dispersion data therefore allowing for efficient and fast calculation of TE
parameters. The inclusion of scattering effects is also straight forward. The
effect of k-grid sparsity on the compute time for DOM and on the sensitivity of
the calculated TE results are provided. The algorithm calculates the TE
parameters within 5% accuracy when the K-grid sparsity is increased up to 60%
for all the dimensions (3D, 2D and 1D). The time taken for the DOM calculation
is strongly influenced by the transverse K density (K perpendicular to
transport direction) but is almost independent of the transport K density
(along the transport direction). The DOM and TE results from the algorithm are
bench-marked with, (i) analytical calculations for parabolic bands, and (ii)
realistic electronic and phonon results for .Comment: 16 Figures, 3 Tables, submitted to Journal of Computational
electronic
Line Graphs of Weighted Networks for Overlapping Communities
In this paper, we develop the idea to partition the edges of a weighted graph
in order to uncover overlapping communities of its nodes. Our approach is based
on the construction of different types of weighted line graphs, i.e. graphs
whose nodes are the links of the original graph, that encapsulate differently
the relations between the edges. Weighted line graphs are argued to provide an
alternative, valuable representation of the system's topology, and are shown to
have important applications in community detection, as the usual node partition
of a line graph naturally leads to an edge partition of the original graph.
This identification allows us to use traditional partitioning methods in order
to address the long-standing problem of the detection of overlapping
communities. We apply it to the analysis of different social and geographical
networks.Comment: 8 Pages. New title and text revisions to emphasise differences from
earlier paper
- …