In the card game of poker, players attempt to disguise cues to the quality of their hand, either by concealment (e.g., adopting the well-known, expressionless “poker face”) or by deception. Recent work, however, demonstrates that motor actions can sometimes betray intentions. The same action can have different movement dynamics depending on the underlying intention (Becchio, Sartori, & Castiell...

Spherical harmonics (SH) and mascon solutions are the two most common types of solutions for Gravity Recovery and Climate Experiment (GRACE) mass flux observations. However, SH signals are degraded by measurement and leakage errors. Mascon solutions (the Jet Propulsion Laboratory (JPL) release, herein) exhibit weakened signals at submascon resolutions. Both solutions require a scale factor exam...

We show that distributed source coding of multi-view images in camera sensor networks (CSNs) using adaptive modules can come close to the Slepian-Wolf bound. In a systematic scenario with limited node abilities, work by Slepian and Wolf suggest that it is possible to encode statistically dependent signals in a distributed manner to the same rate as with a system where the signals are jointly en...

A new finite blocklength converse for the SlepianWolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength pointto-point coding problems from [3] is employed. However, a direct application of this framework dem...

Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.

A receiver wants to compute a function f of two correlated sources X and Y and side information Z. What is the minimum number of bits that needs to be communicated by each transmitter? In this paper, we derive inner and outer bounds to the rate region of this problem which coincide in the cases where f is partially invertible and where the sources are independent given the side information. Fro...

In this correspondence, we describe the achievable rate region for reliably recovering deterministic functions of correlated sources which have a finite alphabet. The method of proof is almost the same as that used to prove the Slepian-Wolf theorem.

In this correspondence, we describe the achievable rate region for reliably recovering deterministic functions of correlated sources which have a finite alphabet. The method of proof is almost the same as that used to prove the Slepian-Wolf theorem.