How to obtain a lattice basis from a discrete projected space

International audienceEuclidean spaces of dimension n are characterized in discrete spaces by the choice of lattices. The goal of this paper is to provide a simple algorithm finding a lattice onto subspaces of lower dimensions onto which these discrete spaces are projected. This first obtained by depicting a tile in a space of dimension n -- 1 when starting from an hypercubic grid in dimension n. Iterating this process across dimensions gives the final result

Localizing the Latent Structure Canonical Uncertainty: Entropy Profiles for Hidden Markov Models

This report addresses state inference for hidden Markov models. These models rely on unobserved states, which often have a meaningful interpretation. This makes it necessary to develop diagnostic tools for quantification of state uncertainty. The entropy of the state sequence that explains an observed sequence for a given hidden Markov chain model can be considered as the canonical measure of state sequence uncertainty. This canonical measure of state sequence uncertainty is not reflected by the classic multivariate state profiles computed by the smoothing algorithm, which summarizes the possible state sequences. Here, we introduce a new type of profiles which have the following properties: (i) these profiles of conditional entropies are a decomposition of the canonical measure of state sequence uncertainty along the sequence and makes it possible to localize this uncertainty, (ii) these profiles are univariate and thus remain easily interpretable on tree structures. We show how to extend the smoothing algorithms for hidden Markov chain and tree models to compute these entropy profiles efficiently.Comment: Submitted to Journal of Machine Learning Research; No RR-7896 (2012

Information Literacy Needs Open Access or: Open Access is not Only for Researchers

The Open Access was initially (blandly) conceived in view not only of researchers but also of lay readers, then this perspective slowly faded out. The Information Literacy movement wants to teach citizens how to arrive at trustable information but the amount of paywalled knowledge is still big. So, their lines of development are somehow complementary: Information Literacy needs Open Access for the citizens to freely access high quality information while Open Access truly fulfils its scope when it is conceived and realized not only for the researchers (an aristocratic view which was the initial one) but for the whole society

Local Algorithms for Block Models with Side Information

There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed that local algorithms are suboptimal for finding a community with high connectivity in the sparse Erd\H{o}s-R\'enyi random graphs. For the symmetric planted partition problem (also named community detection for the block models) on sparse graphs, a simple observation is that local algorithms cannot have non-trivial performance. In this work we consider the effect of side information on local algorithms for community detection under the binary symmetric stochastic block model. In the block model with side information each of the $n$ vertices is labeled $+$ or $-$ independently and uniformly at random; each pair of vertices is connected independently with probability $a/n$ if both of them have the same label or $b/n$ otherwise. The goal is to estimate the underlying vertex labeling given 1) the graph structure and 2) side information in the form of a vertex labeling positively correlated with the true one. Assuming that the ratio between in and out degree $a/b$ is $\Theta(1)$ and the average degree $(a+b) / 2 = n^{o(1)}$, we characterize three different regimes under which a local algorithm, namely, belief propagation run on the local neighborhoods, maximizes the expected fraction of vertices labeled correctly. Thus, in contrast to the case of symmetric block models without side information, we show that local algorithms can achieve optimal performance for the block model with side information.Comment: Due to the limitation "The abstract field cannot be longer than 1,920 characters", the abstract here is shorter than that in the PDF fil

Remote monitoring of patients with implantable cardioverter-defibrillators: Can results from large clinical trials be transposed to clinical practice?

SummaryBackgroundRemote monitoring (RM) is increasingly used to follow up patients with implantable cardioverter-defibrillators (ICDs). Randomized control trials provide evidence for the benefit of this intervention, but data for RM in daily clinical practice with multiple-brands and unselected patients is lacking.AimsTo assess the effect of RM on patient management and clinical outcome for recipients of ICDs in daily practice.MethodsWe reviewed ICD recipients followed up at our institution in 2009 with RM or with traditional hospital only (HO) follow-up. We looked at the effect of RM on the number of scheduled ambulatory follow-ups and urgent unscheduled consultations, the time between onset of asymptomatic events to clinical intervention and the clinical effectiveness of all consultations. We also evaluated the proportion of RM notifications representing clinically relevant situations.ResultsWe included 355 patients retrospectively (RM: n=144, HO: n=211, 76.9% male, 60.3±15.2years old, 50.1% with ICDs for primary prevention and mean left ventricular ejection fraction 35.5±14.5%). Average follow-up was 13.5months. The RM group required less scheduled ambulatory follow-up consultations (1.8 vs. 2.1/patient/year; P<0.0001) and a far lower median time between the onset of asymptomatic events and clinical intervention (7 vs. 76days; P=0.016). Of the 784 scheduled ambulatory follow-up consultations carried out, only 152 (19.4%) resulted in therapeutic intervention or ICD reprogramming. We also found that the vast majority of RM notifications (61.9%) were of no clinical relevance.ConclusionRM allows early management of asymptomatic events and a reduction in scheduled ambulatory follow-up consultations in daily clinical practice, without compromising safety, endorsing RM as the new standard of care for ICD recipients

Sustainable development and African local government: can electronic training help build capacities?

A recent study carried out by European and African organizations into the potential for electronic distance training (EDT) on sustainability in African local governments concluded that EDT was both 'useful and feasible'. This article reflects on some of the theoretical and practical implications of that study. It focuses on the connection between learning and sustainability and how EDT programmes might be designed and promoted. The paper argues that, while resource issues and poor access to Information and Communication Technologies (ICTs) create considerable constraints and point to the need for policies to improve access, in general the most important factors for successful capacity building relate to the design of learning programmes that take account of the work contexts and skill and capability requirements of those targeted as learners. 'Useful' and 'feasible' depend on (i) how work-based and work-related learning processes are understood and (ii) the conditions to promote learning within African local government. Keywords: Africa; Electronic distance training; Local government; Sustainability; Workplace learnin