28,071 research outputs found
Coadjoint Orbits of the Generalised Sl(2) Sl(3) Kdv Hierarchies
In this paper we develop two coadjoint orbit constructions for the phase
spaces of the generalised and KdV hierachies. This involves the
construction of two group actions in terms of Yang Baxter operators, and an
Hamiltonian reduction of the coadjoint orbits. The Poisson brackets are
reproduced by the Kirillov construction. From this construction we obtain a
`natural' gauge fixing proceedure for the generalised hierarchies.Comment: 37 page
Uncertainty-Aware Principal Component Analysis
We present a technique to perform dimensionality reduction on data that is
subject to uncertainty. Our method is a generalization of traditional principal
component analysis (PCA) to multivariate probability distributions. In
comparison to non-linear methods, linear dimensionality reduction techniques
have the advantage that the characteristics of such probability distributions
remain intact after projection. We derive a representation of the PCA sample
covariance matrix that respects potential uncertainty in each of the inputs,
building the mathematical foundation of our new method: uncertainty-aware PCA.
In addition to the accuracy and performance gained by our approach over
sampling-based strategies, our formulation allows us to perform sensitivity
analysis with regard to the uncertainty in the data. For this, we propose
factor traces as a novel visualization that enables to better understand the
influence of uncertainty on the chosen principal components. We provide
multiple examples of our technique using real-world datasets. As a special
case, we show how to propagate multivariate normal distributions through PCA in
closed form. Furthermore, we discuss extensions and limitations of our
approach
Structure emerges faster during cultural transmission in children than in adults
How does children’s limited processing capacity affect cultural transmission of complex information? We show that over the course of iterated reproduction of two-dimensional random dot patterns transmission accuracy increased to a similar extent in 5- to 8-year-old children and adults whereas algorithmic complexity decreased faster in children. Thus, children require more structure to render complex inputs learnable. In line with the Less-Is-More hypothesis, we interpret this as evidence that children’s processing limitations affecting working memory capacity and executive control constrain the ability to represent and generate complexity, which, in turn, facilitates emergence of structure. This underscores the importance of investigating the role of children in the transmission of complex cultural traits
Computing the interleaving distance is NP-hard
We show that computing the interleaving distance between two multi-graded
persistence modules is NP-hard. More precisely, we show that deciding whether
two modules are -interleaved is NP-complete, already for bigraded, interval
decomposable modules. Our proof is based on previous work showing that a
constrained matrix invertibility problem can be reduced to the interleaving
distance computation of a special type of persistence modules. We show that
this matrix invertibility problem is NP-complete. We also give a slight
improvement of the above reduction, showing that also the approximation of the
interleaving distance is NP-hard for any approximation factor smaller than .
Additionally, we obtain corresponding hardness results for the case that the
modules are indecomposable, and in the setting of one-sided stability.
Furthermore, we show that checking for injections (resp. surjections) between
persistence modules is NP-hard. In conjunction with earlier results from
computational algebra this gives a complete characterization of the
computational complexity of one-sided stability. Lastly, we show that it is in
general NP-hard to approximate distances induced by noise systems within a
factor of 2.Comment: 25 pages. Several expository improvements and minor corrections. Also
added a section on noise system
Distributed-memory large deformation diffeomorphic 3D image registration
We present a parallel distributed-memory algorithm for large deformation
diffeomorphic registration of volumetric images that produces large isochoric
deformations (locally volume preserving). Image registration is a key
technology in medical image analysis. Our algorithm uses a partial differential
equation constrained optimal control formulation. Finding the optimal
deformation map requires the solution of a highly nonlinear problem that
involves pseudo-differential operators, biharmonic operators, and pure
advection operators both forward and back- ward in time. A key issue is the
time to solution, which poses the demand for efficient optimization methods as
well as an effective utilization of high performance computing resources. To
address this problem we use a preconditioned, inexact, Gauss-Newton- Krylov
solver. Our algorithm integrates several components: a spectral discretization
in space, a semi-Lagrangian formulation in time, analytic adjoints, different
regularization functionals (including volume-preserving ones), a spectral
preconditioner, a highly optimized distributed Fast Fourier Transform, and a
cubic interpolation scheme for the semi-Lagrangian time-stepping. We
demonstrate the scalability of our algorithm on images with resolution of up to
on the "Maverick" and "Stampede" systems at the Texas Advanced
Computing Center (TACC). The critical problem in the medical imaging
application domain is strong scaling, that is, solving registration problems of
a moderate size of ---a typical resolution for medical images. We are
able to solve the registration problem for images of this size in less than
five seconds on 64 x86 nodes of TACC's "Maverick" system.Comment: accepted for publication at SC16 in Salt Lake City, Utah, USA;
November 201
Over-Sampling for Accurate Masking Threshold Calculation in Wavelet Packet Audio Coders
Many existing audio coders use a critically sampled discrete wavelet transform (DWT) for the decomposition of audio signals. While the aliasing present in the wavelet coefficients is cancelled in the decoder, these coders normally perform calculation of the simultaneous masking threshold directly on these aliased coefficients. This paper uses over-sampling in the wavelet packet decomposition in order to provide alias-free coefficients for accurate simultaneous masking threshold calculation. The proposed technique is compared with masking threshold calculation based upon the FFT and critically-sampled wavelet coefficients, and the results show that a bit rate saving of up to 16 kbit/s can be achieved using over-sampling
- …