22,105 research outputs found
Arnold's Diffusion: from the a priori unstable to the a priori stable case
We expose some selected topics concerning the instability of the action
variables in a priori unstable Hamiltonian systems, and outline a new strategy
that may allow to apply these methods to a priori stable systems
Pulse Shaping, Localization and the Approximate Eigenstructure of LTV Channels
In this article we show the relation between the theory of pulse shaping for
WSSUS channels and the notion of approximate eigenstructure for time-varying
channels. We consider pulse shaping for a general signaling scheme, called
Weyl-Heisenberg signaling, which includes OFDM with cyclic prefix and
OFDM/OQAM. The pulse design problem in the view of optimal WSSUS--averaged SINR
is an interplay between localization and "orthogonality". The localization
problem itself can be expressed in terms of eigenvalues of localization
operators and is intimately connected to the concept of approximate
eigenstructure of LTV channel operators. In fact, on the L_2-level both are
equivalent as we will show. The concept of "orthogonality" in turn can be
related to notion of tight frames. The right balance between these two sides is
still an open problem. However, several statements on achievable values of
certain localization measures and fundamental limits on SINR can already be
made as will be shown in the paper.Comment: 6 pages, 2 figures, invited pape
Learning what matters - Sampling interesting patterns
In the field of exploratory data mining, local structure in data can be
described by patterns and discovered by mining algorithms. Although many
solutions have been proposed to address the redundancy problems in pattern
mining, most of them either provide succinct pattern sets or take the interests
of the user into account-but not both. Consequently, the analyst has to invest
substantial effort in identifying those patterns that are relevant to her
specific interests and goals. To address this problem, we propose a novel
approach that combines pattern sampling with interactive data mining. In
particular, we introduce the LetSIP algorithm, which builds upon recent
advances in 1) weighted sampling in SAT and 2) learning to rank in interactive
pattern mining. Specifically, it exploits user feedback to directly learn the
parameters of the sampling distribution that represents the user's interests.
We compare the performance of the proposed algorithm to the state-of-the-art in
interactive pattern mining by emulating the interests of a user. The resulting
system allows efficient and interleaved learning and sampling, thus
user-specific anytime data exploration. Finally, LetSIP demonstrates favourable
trade-offs concerning both quality-diversity and exploitation-exploration when
compared to existing methods.Comment: PAKDD 2017, extended versio
- …