564 research outputs found
Nonequilibrium thermodynamics as a gauge theory
We assume that markovian dynamics on a finite graph enjoys a gauge symmetry
under local scalings of the probability density, derive the transformation law
for the transition rates and interpret the thermodynamic force as a gauge
potential. A widely accepted expression for the total entropy production of a
system arises as the simplest gauge-invariant completion of the time derivative
of Gibbs's entropy. We show that transition rates can be given a simple
physical characterization in terms of locally-detailed-balanced heat
reservoirs. It follows that Clausius's measure of irreversibility along a
cyclic transformation is a geometric phase. In this picture, the gauge symmetry
arises as the arbitrariness in the choice of a prior probability. Thermostatics
depends on the information that is disposable to an observer; thermodynamics
does not.Comment: 6 pages. Non-fatal errors in eq.(6), eq.(26) and eq.(31) have been
amende
Two-Level Rectilinear Steiner Trees
Given a set of terminals in the plane and a partition of into
subsets , a two-level rectilinear Steiner tree consists of a
rectilinear Steiner tree connecting the terminals in each set
() and a top-level tree connecting the trees . The goal is to minimize the total length of all trees. This problem
arises naturally in the design of low-power physical implementations of parity
functions on a computer chip.
For bounded we present a polynomial time approximation scheme (PTAS) that
is based on Arora's PTAS for rectilinear Steiner trees after lifting each
partition into an extra dimension. For the general case we propose an algorithm
that predetermines a connection point for each and
().
Then, we apply any approximation algorithm for minimum rectilinear Steiner
trees in the plane to compute each and independently.
This gives us a -factor approximation with a running time of
suitable for fast practical computations. The
approximation factor reduces to by applying Arora's approximation scheme
in the plane
Built to Last or Built Too Fast? Evaluating Prediction Models for Build Times
Automated builds are integral to the Continuous Integration (CI) software
development practice. In CI, developers are encouraged to integrate early and
often. However, long build times can be an issue when integrations are
frequent. This research focuses on finding a balance between integrating often
and keeping developers productive. We propose and analyze models that can
predict the build time of a job. Such models can help developers to better
manage their time and tasks. Also, project managers can explore different
factors to determine the best setup for a build job that will keep the build
wait time to an acceptable level. Software organizations transitioning to CI
practices can use the predictive models to anticipate build times before CI is
implemented. The research community can modify our predictive models to further
understand the factors and relationships affecting build times.Comment: 4 paged version published in the Proceedings of the IEEE/ACM 14th
International Conference on Mining Software Repositories (MSR) Pages 487-490.
MSR 201
The edge-disjoint path problem on random graphs by message-passing
We present a message-passing algorithm to solve the edge disjoint path
problem (EDP) on graphs incorporating under a unique framework both traffic
optimization and path length minimization. The min-sum equations for this
problem present an exponential computational cost in the number of paths. To
overcome this obstacle we propose an efficient implementation by mapping the
equations onto a weighted combinatorial matching problem over an auxiliary
graph. We perform extensive numerical simulations on random graphs of various
types to test the performance both in terms of path length minimization and
maximization of the number of accommodated paths. In addition, we test the
performance on benchmark instances on various graphs by comparison with
state-of-the-art algorithms and results found in the literature. Our
message-passing algorithm always outperforms the others in terms of the number
of accommodated paths when considering non trivial instances (otherwise it
gives the same trivial results). Remarkably, the largest improvement in
performance with respect to the other methods employed is found in the case of
benchmarks with meshes, where the validity hypothesis behind message-passing is
expected to worsen. In these cases, even though the exact message-passing
equations do not converge, by introducing a reinforcement parameter to force
convergence towards a sub optimal solution, we were able to always outperform
the other algorithms with a peak of 27% performance improvement in terms of
accommodated paths. On random graphs, we numerically observe two separated
regimes: one in which all paths can be accommodated and one in which this is
not possible. We also investigate the behaviour of both the number of paths to
be accommodated and their minimum total length.Comment: 14 pages, 8 figure
- …