127,429 research outputs found
Automated Sensitivity Analysis for Probabilistic Loops
We present an exact approach to analyze and quantify the sensitivity of
higher moments of probabilistic loops with symbolic parameters, polynomial
arithmetic and potentially uncountable state spaces. Our approach integrates
methods from symbolic computation, probability theory, and static analysis in
order to automatically capture sensitivity information about probabilistic
loops. Sensitivity information allows us to formally establish how value
distributions of probabilistic loop variables influence the functional behavior
of loops, which can in particular be helpful when choosing values of loop
variables in order to ensure efficient/expected computations. Our work uses
algebraic techniques to model higher moments of loop variables via linear
recurrence equations and introduce the notion of sensitivity recurrences. We
show that sensitivity recurrences precisely model loop sensitivities, even in
cases where the moments of loop variables do not satisfy a system of linear
recurrences. As such, we enlarge the class of probabilistic loops for which
sensitivity analysis was so far feasible. We demonstrate the success of our
approach while analyzing the sensitivities of probabilistic loops
Wilson loops stability in the gauge/string correspondence
We study the stability of some classical string worldsheet solutions employed
for computing the potential energy between two static fundamental quarks in
confining and non-confining gravity duals. We discuss the fixing of the
diffeomorphism invariance of the string action, its relation with the
fluctuation orientation and the interpretation of the quark mass substraction
worldsheet needed for computing the potential energy in smooth (confining)
gravity background. We consider various dual gravity backgrounds and show by a
numerical analysis the existence of instabilities under linear fluctuations for
classical string embedding solutions having positive length function derivative
. Finally we make a brief discussion of 't Hooft loops in
non-conformal backgrounds.Comment: 34 pages, 36 figures. Reference added. Final version JHEP accepte
Automatic modular abstractions for template numerical constraints
We propose a method for automatically generating abstract transformers for
static analysis by abstract interpretation. The method focuses on linear
constraints on programs operating on rational, real or floating-point variables
and containing linear assignments and tests. In addition to loop-free code, the
same method also applies for obtaining least fixed points as functions of the
precondition, which permits the analysis of loops and recursive functions. Our
algorithms are based on new quantifier elimination and symbolic manipulation
techniques. Given the specification of an abstract domain, and a program block,
our method automatically outputs an implementation of the corresponding
abstract transformer. It is thus a form of program transformation. The
motivation of our work is data-flow synchronous programming languages, used for
building control-command embedded systems, but it also applies to imperative
and functional programming
Force analysis of an open TBM gripping–thrusting–regripping mechanism
This paper presents an approach for the force analysis of an open TBM gripping–thrusting–regripping mechanism, which is a special parallel mechanism driven by hydraulic actuators and constrained by rocky surroundings. The static equilibrium equations of the cutterhead–mainbeam–saddle subassembly are formulated first by exploring the reaction forces in the cross pin situated between the saddle and the gripper cylinder. This is followed by formulating the static equilibrium equations of the inner closed loops formed by the above subassembly, the torque, and gripper cylinders. Consequently, the linear map between the externally applied wrench imposed on the shield and the equivalent thrust forces of the cylinders is developed. The functionality of the force model developed is twofold, i.e., it can be used either to estimate the thrust forces of the cylinders required to resist against the tunneling loads, or to predict the tunneling loads using the measured thrust forces of these cylinders, thus providing important theoretical basis for the design and control of the mechanism
To what distances do we know the confining potential?
We argue that asymptotically linear static potential is built in into the
common procedure of extracting it from lattice Wilson loop measurements. To
illustrate the point, we extract the potential by the standard lattice method
in a model vacuum made of instantons. A beautiful infinitely rising linear
potential is obtained in the case where the true potential is actually
flattening. We argue that the flux tube formation might be also an artifact of
the lattice procedure and not necessarily a measured physical effect.
We conclude that at present the rising potential is known for sure up to no
more than about 0.7 fm. It may explain why no screening has been clearly
observed so far for adjoint sources and for fundamental sources but with
dynamical fermions.
Finally, we speculate on how confinement could be achieved even if the static
potential in the pure glue theory is not infinitely rising.Comment: 16 pages, 5 figures. Additional arguments presented, a new figure and
references adde
Pair Correlation Function of Wilson Loops
We give a path integral prescription for the pair correlation function of
Wilson loops lying in the worldvolume of Dbranes in the bosonic open and closed
string theory. The results can be applied both in ordinary flat spacetime in
the critical dimension d or in the presence of a generic background for the
Liouville field. We compute the potential between heavy nonrelativistic sources
in an abelian gauge theory in relative collinear motion with velocity v =
tanh(u), probing length scales down to r_min^2 = 2 \pi \alpha' u. We predict a
universal -(d-2)/r static interaction at short distances. We show that the
velocity dependent corrections to the short distance potential in the bosonic
string take the form of an infinite power series in the dimensionless variables
z = r_min^2/r^2, uz/\pi, and u^2.Comment: 16 pages, 1 figure, Revtex. Corrected factor of two in potential.
Some changes in discussio
The static potential: lattice versus perturbation theory in a renormalon-based approach
We compare, for the static potential and at short distances, perturbation
theory with the results of lattice simulations. We show that a
renormalon-dominance picture explains why in the literature sometimes
agreement, and another disagreement, is found between lattice simulations and
perturbation theory depending on the different implementations of the latter.
We also show that, within a renormalon-based scheme, perturbation theory agrees
with lattice simulations.Comment: 18 pages, 11 figures, lattice data of Necco and Sommer introduced,
references added, some lengthier explanations given, physical results
unchange
Using shared-data localization to reduce the cost of inspector-execution in unified-parallel-C programs
Programs written in the Unified Parallel C (UPC) language can access any location of the entire local and remote address space via read/write operations. However, UPC programs that contain fine-grained shared accesses can exhibit performance degradation. One solution is to use the inspector-executor technique to coalesce fine-grained shared accesses to larger remote access operations. A straightforward implementation of the inspector executor transformation results in excessive instrumentation that hinders performance.; This paper addresses this issue and introduces various techniques that aim at reducing the generated instrumentation code: a shared-data localization transformation based on Constant-Stride Linear Memory Descriptors (CSLMADs) [S. Aarseth, Gravitational N-Body Simulations: Tools and Algorithms, Cambridge Monographs on Mathematical Physics, Cambridge University Press, 2003.], the inlining of data locality checks and the usage of an index vector to aggregate the data. Finally, the paper introduces a lightweight loop code motion transformation to privatize shared scalars that were propagated through the loop body.; A performance evaluation, using up to 2048 cores of a POWER 775, explores the impact of each optimization and characterizes the overheads of UPC programs. It also shows that the presented optimizations increase performance of UPC programs up to 1.8 x their UPC hand-optimized counterpart for applications with regular accesses and up to 6.3 x for applications with irregular accesses.Peer ReviewedPostprint (author's final draft
Observing string breaking with Wilson loops
An uncontroversial observation of adjoint string breaking is proposed, while
measuring the static potential from Wilson loops only. The overlap of the
Wilson loop with the broken-string state is small, but non-vanishing, so that
the broken-string groundstate can be seen if the Wilson loop is long enough. We
demonstrate this in the context of the (2+1)d SU(2) adjoint static potential,
using an improved version of the Luscher-Weisz exponential variance reduction.
To complete the picture we perform the more usual multichannel analysis with
two basis states, the unbroken-string state and the broken-string state (two
so-called gluelumps).
As by-products, we obtain the temperature-dependent static potential measured
from Polyakov loop correlations, and the fundamental SU(2) static potential
with improved accuracy. Comparing the latter with the adjoint potential, we see
clear deviations from Casimir scaling.Comment: 35 pages, 12 figures. 1 reference adde
Succinct Representations for Abstract Interpretation
Abstract interpretation techniques can be made more precise by distinguishing
paths inside loops, at the expense of possibly exponential complexity.
SMT-solving techniques and sparse representations of paths and sets of paths
avoid this pitfall. We improve previously proposed techniques for guided static
analysis and the generation of disjunctive invariants by combining them with
techniques for succinct representations of paths and symbolic representations
for transitions based on static single assignment. Because of the
non-monotonicity of the results of abstract interpretation with widening
operators, it is difficult to conclude that some abstraction is more precise
than another based on theoretical local precision results. We thus conducted
extensive comparisons between our new techniques and previous ones, on a
variety of open-source packages.Comment: Static analysis symposium (SAS), Deauville : France (2012
- …