Keeping bugs in check: The mucus layer as a critical component in maintaining intestinal homeostasis

In the mammalian gastrointestinal tract the close vicinity of abundant immune effector cells and trillions of commensal microbes requires sophisticated barrier and regulatory mechanisms to maintain vital host-microbial interactions and tissue homeostasis. During co-evolution of the host and its intestinal microbiota a protective multilayered barrier system was established to segregate the luminal microbes from the intestinal mucosa with its potent immune effector cells, limit bacterial translocation into host tissues to prevent tissue damage, while ensuring the vital functions of the intestinal mucosa and the luminal gut microbiota. In the present review we will focus on the different layers of protection in the intestinal tract that allow the successful mutualism between the microbiota and the potent effector cells of the intestinal innate and adaptive immune system. In particular, we will review some of the recent findings on the vital functions of the mucus layer and its site-specific adaptations to the changing quantities and complexities of the microbiota along the (gastro-) intestinal tract. Understanding the regulatory pathways that control the establishment of the mucus layer, but also its degradation during intestinal inflammation may be critical for designing novel strategies aimed at maintaining local tissue homeostasis and supporting remission from relapsing intestinal inflammation in patients with inflammatory bowel diseases.

Untainted puncturing for irregular low-density parity-check codes

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.

User-independent accelerometer-based gesture recognition for mobile devices

Many mobile devices embed nowadays inertial sensors. This enables new forms of human-computer interaction through the use of gestures (movements performed with the mobile device) as a way of communication. This paper presents an accelerometer-based gesture recognition system for mobile devices which is able to recognize a collection of 10 different hand gestures. The system was conceived to be light and to operate in a user -independent manner in real time. The recognition system was implemented in a smart phone and evaluated through a collection of user tests, which showed a recognition accuracy similar to other state-of-the art techniques and a lower computational complexity. The system was also used to build a human -robot interface that enables controlling a wheeled robot with the gestures made with the mobile phone.

Efficient information reconciliation for Continuous-Variable QKD using Non-Binary Low-Density Parity-Check Codes

We present here an information reconciliation method and demonstrate for the first time that it can achieve efficiencies close to 0.98. This method is based on the belief propagation decoding of non-binary LDPC codes over finite (Galois) fields. In particular, for convenience and faster decoding we only consider power-of-two Galois fields.

The Voice in the Whirlwind: Lessons for Job -- Randomness and Natural Evil

The innocent Job suffers, friends are no help, and then Job screams at Yahweh, demanding justice. The first surprise is that Yehweh responds to Job, does not criticize him but tells him he is ignorant, and then gives him a science lesson. The content of that lesson is the second surprise.

A recipe for randomness

Despite many diverse theories that address closely related themes—e.g., probability theory, algorithmic complexity, cryptoanalysis, and pseudorandom number generation—a near-void remains in constructive methods certified to yield the desired “random” output. Herein, we provide explicit techniques to produce broad sets of both highly irregular finite and normal infinite sequences, based on constructions and properties derived from approximate entropy (ApEn), a computable formulation of sequential irregularity. Furthermore, for infinite sequences, we considerably refine normality, by providing methods for constructing diverse classes of normal numbers, classified by the extent to which initial segments deviate from maximal irregularity.

Randomness and degrees of irregularity.

The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to delineate nonrandom sequences in terms of closeness to randomness--e.g., to evaluate the efficacy of therapy in medicine. We address both these issues from a computable framework via a quantification of regularity. ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points. An infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case. In the infinite sequence setting, we indicate how the "foundational" definition of independence in probability theory, and the definition of normality in number theory, reduce to limit theorems without rates of convergence, from which we utilize ApEn to address rates of convergence (of a deficit from maximal randomness), refining the aforementioned concepts in a computationally essential manner. Representative applications among many are indicated to assess (i) random number generation output; (ii) well-shuffled arrangements; and (iii) (the quality of) bootstrap replicates.