439,505 research outputs found
Mining Heterogeneous Multivariate Time-Series for Learning Meaningful Patterns: Application to Home Health Telecare
For the last years, time-series mining has become a challenging issue for
researchers. An important application lies in most monitoring purposes, which
require analyzing large sets of time-series for learning usual patterns. Any
deviation from this learned profile is then considered as an unexpected
situation. Moreover, complex applications may involve the temporal study of
several heterogeneous parameters. In that paper, we propose a method for mining
heterogeneous multivariate time-series for learning meaningful patterns. The
proposed approach allows for mixed time-series -- containing both pattern and
non-pattern data -- such as for imprecise matches, outliers, stretching and
global translating of patterns instances in time. We present the early results
of our approach in the context of monitoring the health status of a person at
home. The purpose is to build a behavioral profile of a person by analyzing the
time variations of several quantitative or qualitative parameters recorded
through a provision of sensors installed in the home
LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
This work presents a new code-based key encapsulation mechanism (KEM) called
LEDAkem. It is built on the Niederreiter cryptosystem and relies on
quasi-cyclic low-density parity-check codes as secret codes, providing high
decoding speeds and compact keypairs. LEDAkem uses ephemeral keys to foil known
statistical attacks, and takes advantage of a new decoding algorithm that
provides faster decoding than the classical bit-flipping decoder commonly
adopted in this kind of systems. The main attacks against LEDAkem are
investigated, taking into account quantum speedups. Some instances of LEDAkem
are designed to achieve different security levels against classical and quantum
computers. Some performance figures obtained through an efficient C99
implementation of LEDAkem are provided.Comment: 21 pages, 3 table
Generalizations of entanglement based on coherent states and convex sets
Unentangled pure states on a bipartite system are exactly the coherent states
with respect to the group of local transformations. What aspects of the study
of entanglement are applicable to generalized coherent states? Conversely, what
can be learned about entanglement from the well-studied theory of coherent
states? With these questions in mind, we characterize unentangled pure states
as extremal states when considered as linear functionals on the local Lie
algebra. As a result, a relativized notion of purity emerges, showing that
there is a close relationship between purity, coherence and (non-)entanglement.
To a large extent, these concepts can be defined and studied in the even more
general setting of convex cones of states. Based on the idea that entanglement
is relative, we suggest considering these notions in the context of partially
ordered families of Lie algebras or convex cones, such as those that arise
naturally for multipartite systems. The study of entanglement includes notions
of local operations and, for information-theoretic purposes, entanglement
measures and ways of scaling systems to enable asymptotic developments. We
propose ways in which these may be generalized to the Lie-algebraic setting,
and to a lesser extent to the convex-cones setting. One of our original
motivations for this program is to understand the role of entanglement-like
concepts in condensed matter. We discuss how our work provides tools for
analyzing the correlations involved in quantum phase transitions and other
aspects of condensed-matter systems.Comment: 37 page
Democratic Representations
Minimization of the (or maximum) norm subject to a constraint
that imposes consistency to an underdetermined system of linear equations finds
use in a large number of practical applications, including vector quantization,
approximate nearest neighbor search, peak-to-average power ratio (or "crest
factor") reduction in communication systems, and peak force minimization in
robotics and control. This paper analyzes the fundamental properties of signal
representations obtained by solving such a convex optimization problem. We
develop bounds on the maximum magnitude of such representations using the
uncertainty principle (UP) introduced by Lyubarskii and Vershynin, and study
the efficacy of -norm-based dynamic range reduction. Our
analysis shows that matrices satisfying the UP, such as randomly subsampled
Fourier or i.i.d. Gaussian matrices, enable the computation of what we call
democratic representations, whose entries all have small and similar magnitude,
as well as low dynamic range. To compute democratic representations at low
computational complexity, we present two new, efficient convex optimization
algorithms. We finally demonstrate the efficacy of democratic representations
for dynamic range reduction in a DVB-T2-based broadcast system.Comment: Submitted to a Journa
Semidefinite descriptions of the convex hull of rotation matrices
We study the convex hull of , thought of as the set of
orthogonal matrices with unit determinant, from the point of view of
semidefinite programming. We show that the convex hull of is doubly
spectrahedral, i.e. both it and its polar have a description as the
intersection of a cone of positive semidefinite matrices with an affine
subspace. Our spectrahedral representations are explicit, and are of minimum
size, in the sense that there are no smaller spectrahedral representations of
these convex bodies.Comment: 29 pages, 1 figur
- …