378,663 research outputs found
Semiclassical States for Constrained Systems
The notion of semi-classical states is first sharpened by clarifying two
issues that appear to have been overlooked in the literature. Systems with
linear and quadratic constraints are then considered and the group averaging
procedure is applied to kinematical coherent states to obtain physical
semi-classical states. In the specific examples considered, the technique turns
out to be surprisingly efficient, suggesting that it may well be possible to
use kinematical structures to analyze the semi-classical behavior of physical
states of an interesting class of constrained systems.Comment: 27 pages, 3 figures. V2 discussion expanded. Final version to be
published in PR
A scalable parallel Monte Carlo algorithm for atomistic simulations of precipitation in alloys
We present an extension of the semi-grandcanonical (SGC) ensemble that we
refer to as the variance-constrained semi-grandcanonical (VC-SGC) ensemble. It
allows for transmutation Monte Carlo simulations of multicomponent systems in
multiphase regions of the phase diagram and lends itself to scalable
simulations on massively parallel platforms. By combining transmutation moves
with molecular dynamics steps structural relaxations and thermal vibrations in
realistic alloys can be taken into account. In this way, we construct a robust
and efficient simulation technique that is ideally suited for large-scale
simulations of precipitation in multicomponent systems in the presence of
structural disorder. To illustrate the algorithm introduced in this work, we
study the precipitation of Cu in nanocrystalline Fe.Comment: 12 pages; 10 figure
RSGM: Real-time Raster-Respecting Semi-Global Matching for Power-Constrained Systems
Stereo depth estimation is used for many computer vision applications. Though
many popular methods strive solely for depth quality, for real-time mobile
applications (e.g. prosthetic glasses or micro-UAVs), speed and power
efficiency are equally, if not more, important. Many real-world systems rely on
Semi-Global Matching (SGM) to achieve a good accuracy vs. speed balance, but
power efficiency is hard to achieve with conventional hardware, making the use
of embedded devices such as FPGAs attractive for low-power applications.
However, the full SGM algorithm is ill-suited to deployment on FPGAs, and so
most FPGA variants of it are partial, at the expense of accuracy. In a non-FPGA
context, the accuracy of SGM has been improved by More Global Matching (MGM),
which also helps tackle the streaking artifacts that afflict SGM. In this
paper, we propose a novel, resource-efficient method that is inspired by MGM's
techniques for improving depth quality, but which can be implemented to run in
real time on a low-power FPGA. Through evaluation on multiple datasets (KITTI
and Middlebury), we show that in comparison to other real-time capable stereo
approaches, we can achieve a state-of-the-art balance between accuracy, power
efficiency and speed, making our approach highly desirable for use in real-time
systems with limited power.Comment: Accepted in FPT 2018 as Oral presentation, 8 pages, 6 figures, 4
table
Multicast Multigroup Beamforming for Per-antenna Power Constrained Large-scale Arrays
Large in the number of transmit elements, multi-antenna arrays with
per-element limitations are in the focus of the present work. In this context,
physical layer multigroup multicasting under per-antenna power constrains, is
investigated herein. To address this complex optimization problem
low-complexity alternatives to semi-definite relaxation are proposed. The goal
is to optimize the per-antenna power constrained transmitter in a maximum
fairness sense, which is formulated as a non-convex quadratically constrained
quadratic problem. Therefore, the recently developed tool of feasible point
pursuit and successive convex approximation is extended to account for
practical per-antenna power constraints. Interestingly, the novel iterative
method exhibits not only superior performance in terms of approaching the
relaxed upper bound but also a significant complexity reduction, as the
dimensions of the optimization variables increase. Consequently, multicast
multigroup beamforming for large-scale array transmitters with per-antenna
dedicated amplifiers is rendered computationally efficient and accurate. A
preliminary performance evaluation in large-scale systems for which the
semi-definite relaxation constantly yields non rank-1 solutions is presented.Comment: submitted to IEEE SPAWC 2015. arXiv admin note: substantial text
overlap with arXiv:1406.755
Gauge Conditions for the Constrained-WZNW--Toda Reductions
There is a constrained-WZNW--Toda theory for any simple Lie algebra equipped
with an integral gradation. It is explained how the different approaches to
these dynamical systems are related by gauge transformations. Combining Gauss
decompositions in relevent gauges, we unify formulae already derived, and
explictly determine the holomorphic expansion of the conformally reduced WZNW
solutions - whose restriction gives the solutions of the Toda equations. The
same takes place also for semi-integral gradations. Most of our conclusions are
also applicable to the affine Toda theories.Comment: 12 pages, no figure
Group projection method in statistical systems
We discuss an application of group theoretical methods to the formulation of
the thermodynamics of systems constrained by the conservation laws described by
a semi--simple compact Lie group. A general projection method that allows to
construct a partition function for a given irreducible representation of the
Lie group is outlined. Applications of the method in Lattice Gauge Theory (LGT)
for non--zero baryon number and in the phenomenological description of particle
production in ultrarelativistic heavy ion collisions are also indicated.Comment: Invited talk presented at the XXIV International Colloquium on Group
Theoritical Methods in Physic
- …