Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. Wyner and other researchers proposed various forms of coset codes for efficient binning, yet ...

This paper presents polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton’s region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user DM-BCs whose capacity regions are known. To accomplish this task, first we construct polar codes for the superposition and binning s...

Fluorescence lifetime imaging ophthalmoscopy (FLIO) is a new technique for measuring the in vivo autofluorescence intensity decays generated by endogenous fluorophores in the ocular fundus. Here, we present a software package called FLIM eXplorer (FLIMX) for analyzing FLIO data. Specifically, we introduce a new adaptive binning approach as an optimal tradeoff between the spatial resolution and ...

Mixed communities of organisms are found in many environments -- from the human gut to marine ecosystems and can have profound impact on health environment. Metagenomics studies genomic material such through high-throughput sequencing that yields DNA subsequences for subsequent analysis. A fundamental problem standard workflow, called binning, is discover clusters, subsequences, associated with...

Sphere unfolding relationships are revisited with a specific focus on the analysis of segmented digital images of microstructures. Since the features of such images are most easily quantified by counting pixels, the required equations are re-derived in terms of the histogram of areas (instead of diameters or radii) as inputs and it is shown that a substitution can be made that simplifies the ca...

We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolute loss of the best expert. For the case when the master must produce binary predictions, the Binomial Weighting algorithm is known to be optimal when the number of experts is large. It has remained an open problem how to design...

We consider Pearson’s chi-square X2, the likelihood ratio G2, and Zelterman’s D2 as goodness-of-fit statistics for high energy physics problems in several dimensions, where the data are sparse. There is a fundamental obstacle in the “ultrasparse” case where all bins have at most one entry (ni = 0, 1 ∀i). A condition for avoiding this regime is derived; the allowed number of bins k rises faster ...