135,222 research outputs found
Space-charge distortion of transverse profiles measured by electron-based Ionization Profile Monitors and correction methods
Measurements of transverse profiles using Ionization Profile Monitors (IPMs)
for high brightness beams are affected by the electromagnetic field of the
beam. This interaction may cause a distortion of the measured profile shape
despite strong external magnetic field applied to impose limits on the
transverse movement of electrons. The mechanisms leading to this distortion are
discussed in detail. The distortion itself is described by means of analytic
calculations for simplified beam distributions and a full simulation model for
realistic distributions. Simple relation for minimum magnetic field scaling
with beam parameters for avoiding profile distortions is presented. Further,
application of machine learning algorithms to the problem of reconstructing the
actual beam profile from distorted measured profile is presented. The obtained
results show good agreement for tests on simulation data. The performance of
these algorithms indicate that they could be very useful for operations of IPMs
on high brightness beams or IPMs with weak magnetic field
Kerncraft: A Tool for Analytic Performance Modeling of Loop Kernels
Achieving optimal program performance requires deep insight into the
interaction between hardware and software. For software developers without an
in-depth background in computer architecture, understanding and fully utilizing
modern architectures is close to impossible. Analytic loop performance modeling
is a useful way to understand the relevant bottlenecks of code execution based
on simple machine models. The Roofline Model and the Execution-Cache-Memory
(ECM) model are proven approaches to performance modeling of loop nests. In
comparison to the Roofline model, the ECM model can also describes the
single-core performance and saturation behavior on a multicore chip. We give an
introduction to the Roofline and ECM models, and to stencil performance
modeling using layer conditions (LC). We then present Kerncraft, a tool that
can automatically construct Roofline and ECM models for loop nests by
performing the required code, data transfer, and LC analysis. The layer
condition analysis allows to predict optimal spatial blocking factors for loop
nests. Together with the models it enables an ab-initio estimate of the
potential benefits of loop blocking optimizations and of useful block sizes. In
cases where LC analysis is not easily possible, Kerncraft supports a cache
simulator as a fallback option. Using a 25-point long-range stencil we
demonstrate the usefulness and predictive power of the Kerncraft tool.Comment: 22 pages, 5 figure
GPU Based Path Integral Control with Learned Dynamics
We present an algorithm which combines recent advances in model based path
integral control with machine learning approaches to learning forward dynamics
models. We take advantage of the parallel computing power of a GPU to quickly
take a massive number of samples from a learned probabilistic dynamics model,
which we use to approximate the path integral form of the optimal control. The
resulting algorithm runs in a receding-horizon fashion in realtime, and is
subject to no restrictive assumptions about costs, constraints, or dynamics. A
simple change to the path integral control formulation allows the algorithm to
take model uncertainty into account during planning, and we demonstrate its
performance on a quadrotor navigation task. In addition to this novel
adaptation of path integral control, this is the first time that a
receding-horizon implementation of iterative path integral control has been run
on a real system.Comment: 6 pages, NIPS 2014 - Autonomously Learning Robots Worksho
Modelling conditional probabilities with Riemann-Theta Boltzmann Machines
The probability density function for the visible sector of a Riemann-Theta
Boltzmann machine can be taken conditional on a subset of the visible units. We
derive that the corresponding conditional density function is given by a
reparameterization of the Riemann-Theta Boltzmann machine modelling the
original probability density function. Therefore the conditional densities can
be directly inferred from the Riemann-Theta Boltzmann machine.Comment: 7 pages, 3 figures, in proceedings of the 19th International Workshop
on Advanced Computing and Analysis Techniques in Physics Research (ACAT 2019
Automatic Loop Kernel Analysis and Performance Modeling With Kerncraft
Analytic performance models are essential for understanding the performance
characteristics of loop kernels, which consume a major part of CPU cycles in
computational science. Starting from a validated performance model one can
infer the relevant hardware bottlenecks and promising optimization
opportunities. Unfortunately, analytic performance modeling is often tedious
even for experienced developers since it requires in-depth knowledge about the
hardware and how it interacts with the software. We present the "Kerncraft"
tool, which eases the construction of analytic performance models for streaming
kernels and stencil loop nests. Starting from the loop source code, the problem
size, and a description of the underlying hardware, Kerncraft can ideally
predict the single-core performance and scaling behavior of loops on multicore
processors using the Roofline or the Execution-Cache-Memory (ECM) model. We
describe the operating principles of Kerncraft with its capabilities and
limitations, and we show how it may be used to quickly gain insights by
accelerated analytic modeling.Comment: 11 pages, 4 figures, 8 listing
On the enumeration of closures and environments with an application to random generation
Environments and closures are two of the main ingredients of evaluation in
lambda-calculus. A closure is a pair consisting of a lambda-term and an
environment, whereas an environment is a list of lambda-terms assigned to free
variables. In this paper we investigate some dynamic aspects of evaluation in
lambda-calculus considering the quantitative, combinatorial properties of
environments and closures. Focusing on two classes of environments and
closures, namely the so-called plain and closed ones, we consider the problem
of their asymptotic counting and effective random generation. We provide an
asymptotic approximation of the number of both plain environments and closures
of size . Using the associated generating functions, we construct effective
samplers for both classes of combinatorial structures. Finally, we discuss the
related problem of asymptotic counting and random generation of closed
environemnts and closures
- …