1,331 research outputs found
Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
International audienceFlow thinning (FT) is a concept of a traffic routing and protection strategy applicable to communication networks withvariable capacity of links. In such networks, the links do not attain their nominal (maximum) capacity simultaneously, so in atypical network state only some links are fully available whereas on each of the remaining links only a fraction of itsmaximum capacity is usable. Every end-to-end traffic demand is assigned a set of logical tunnels whose total capacity isdedicated to carry the demand’s traffic. The nominal (i.e., maximum) capacity of the tunnels, supported by the nominal(maximum) link capacity, is subject to state-dependent thinning to account for variable capacity of the links fluctuating belowthe maximum. Accordingly, the capacity available on the tunnels is also fluctuating below their nominal levels and hence theinstantaneous traffic sent between the demand’s end nodes must accommodate to the current total capacity available onits dedicated tunnels. The related multi-commodity flow optimization problem is NP-hard and its noncompact linearprogramming formulation requires path generation. For that, we formulate an integer programming pricing problem, atthe same time showing the cases when the pricing is polynomial. We also consider an important variant of FT, affinethinning, that may lead to practical FT implementations. We present a numerical study illustrating traffic efficiency of FT andcomputational efficiency of its optimization models. Our considerations are relevant, among others, for wireless meshnetworks utilizing multiprotocol label switching tunnels
Density profiles of a colloidal liquid at a wall under shear flow
Using a dynamical density functional theory we analyze the density profile of
a colloidal liquid near a wall under shear flow. Due to the symmetries of the
system considered, the naive application of dynamical density functional theory
does not lead to a shear induced modification of the equilibrium density
profile, which would be expected on physical grounds. By introducing a
physically motivated dynamic mean field correction we incorporate the missing
shear induced interparticle forces into the theory. We find that the shear flow
tends to enhance the oscillations in the density profile of hard-spheres at a
hard-wall and, at sufficiently high shear rates, induces a nonequilibrium
transition to a steady state characterized by planes of particles parallel to
the wall. Under gravity, we find that the center-of-mass of the density
distribution increases with shear rate, i.e., shear increases the potential
energy of the particles
Spatial networks with wireless applications
Many networks have nodes located in physical space, with links more common
between closely spaced pairs of nodes. For example, the nodes could be wireless
devices and links communication channels in a wireless mesh network. We
describe recent work involving such networks, considering effects due to the
geometry (convex,non-convex, and fractal), node distribution,
distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina
NiftyNet: a deep-learning platform for medical imaging
Medical image analysis and computer-assisted intervention problems are
increasingly being addressed with deep-learning-based solutions. Established
deep-learning platforms are flexible but do not provide specific functionality
for medical image analysis and adapting them for this application requires
substantial implementation effort. Thus, there has been substantial duplication
of effort and incompatible infrastructure developed across many research
groups. This work presents the open-source NiftyNet platform for deep learning
in medical imaging. The ambition of NiftyNet is to accelerate and simplify the
development of these solutions, and to provide a common mechanism for
disseminating research outputs for the community to use, adapt and build upon.
NiftyNet provides a modular deep-learning pipeline for a range of medical
imaging applications including segmentation, regression, image generation and
representation learning applications. Components of the NiftyNet pipeline
including data loading, data augmentation, network architectures, loss
functions and evaluation metrics are tailored to, and take advantage of, the
idiosyncracies of medical image analysis and computer-assisted intervention.
NiftyNet is built on TensorFlow and supports TensorBoard visualization of 2D
and 3D images and computational graphs by default.
We present 3 illustrative medical image analysis applications built using
NiftyNet: (1) segmentation of multiple abdominal organs from computed
tomography; (2) image regression to predict computed tomography attenuation
maps from brain magnetic resonance images; and (3) generation of simulated
ultrasound images for specified anatomical poses.
NiftyNet enables researchers to rapidly develop and distribute deep learning
solutions for segmentation, regression, image generation and representation
learning applications, or extend the platform to new applications.Comment: Wenqi Li and Eli Gibson contributed equally to this work. M. Jorge
Cardoso and Tom Vercauteren contributed equally to this work. 26 pages, 6
figures; Update includes additional applications, updated author list and
formatting for journal submissio
Stretching and folding versus cutting and shuffling: An illustrated perspective on mixing and deformations of continua
We compare and contrast two types of deformations inspired by mixing
applications -- one from the mixing of fluids (stretching and folding), the
other from the mixing of granular matter (cutting and shuffling). The
connection between mechanics and dynamical systems is discussed in the context
of the kinematics of deformation, emphasizing the equivalence between stretches
and Lyapunov exponents. The stretching and folding motion exemplified by the
baker's map is shown to give rise to a dynamical system with a positive
Lyapunov exponent, the hallmark of chaotic mixing. On the other hand, cutting
and shuffling does not stretch. When an interval exchange transformation is
used as the basis for cutting and shuffling, we establish that all of the map's
Lyapunov exponents are zero. Mixing, as quantified by the interfacial area per
unit volume, is shown to be exponentially fast when there is stretching and
folding, but linear when there is only cutting and shuffling. We also discuss
how a simple computational approach can discern stretching in discrete data.Comment: REVTeX 4.1, 9 pages, 3 figures; v2 corrects some misprints. The
following article appeared in the American Journal of Physics and may be
found at http://ajp.aapt.org/resource/1/ajpias/v79/i4/p359_s1 . Copyright
2011 American Association of Physics Teachers. This article may be downloaded
for personal use only. Any other use requires prior permission of the author
and the AAP
- …