On Interactive Coding Schemes with Adaptive Termination

In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in an interactive protocol to jointly compute $f(x,y)$. The goal is to do this in an error-resilient way, such that even given some fraction of adversarial corruptions to the protocol, both parties still learn $f(x,y)$. Typically, the error resilient protocols constructed by interactive coding schemes are \emph{non-adaptive}, that is, the length of the protocol as well as the speaker in each round is fixed beforehand. The maximal error resilience obtainable by non-adaptive schemes is now well understood. In order to circumvent known barriers and achieve higher error resilience, the work of Agrawal, Gelles, and Sahai (ISIT 2016) introduced to interactive coding the notion of \emph{adaptive} schemes, where the length of the protocol or the speaker order are no longer necessarily fixed. In this paper, we study the power of \emph{adaptive termination} in the context of the error resilience of interactive coding schemes. In other words, what is the power of schemes where Alice and Bob are allowed to disengage from the protocol early? We study this question in two contexts, both for the task of \emph{message exchange}, where the goal is to learn the other party's input

A Noise Resilient Transformation for Streaming Algorithms

In a streaming algorithm, Bob receives an input $x \in \{0,1\}^n$ via a stream and must compute a function $f$ in low space. However, this function may be fragile to errors in the input stream. In this work, we investigate what happens when the input stream is corrupted. Our main result is an encoding of the incoming stream so that Bob is still able to compute any such function $f$ in low space when a constant fraction of the stream is corrupted. More precisely, we describe an encoding function $\mathsf{enc}(x)$ of length $\text{poly}(n)$ so that for any streaming algorithm $A$ that on input $x$ computes $f(x)$ in space $s$, there is an explicit streaming algorithm $B$ that computes $f(x)$ in space $s \cdot \text{polylog}(n)$ as long as there were not more than $\frac14 - \varepsilon$ fraction of (adversarial) errors in the input stream $\mathsf{enc}(x)$

The Optimal Error Resilience of Interactive Communication Over Binary Channels

In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in a non-adaptive (fixed order, fixed length) interactive protocol to jointly compute $f(x,y)$. The goal is to do this in an error-resilient way, such that even given some fraction of adversarial corruptions to the protocol, both parties still learn $f(x,y)$. In this work, we study the optimal error resilience of such a protocol in the face of adversarial bit flip or erasures. While the optimal error resilience of such a protocol over a large alphabet is well understood, the situation over the binary alphabet has remained open. In this work, we resolve this problem of determining the optimal error resilience over binary channels. In particular, we construct protocols achieving $\frac16$ error resilience over the binary bit flip channel and $\frac12$ error resilience over the binary erasure channel, for both of which matching upper bounds are known. We remark that the communication complexity of our binary bit flip protocol is polynomial in the size of the inputs, and the communication complexity of our binary erasure protocol is linear in the size of the minimal noiseless protocol computing $f$

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs

The main conceptual contribution of this paper is a unification of two leading paradigms for constructing succinct argument systems, namely Kilian\u27s protocol and the BMW (Biehl-Meyer-Wetzel) heuristic. We define the notion of a multi-extractable somewhere statistically binding (meSSB) hash family, an extension of the notion of somewhere statistically binding hash functions (Hubacek and Wichs, ITCS 2015), and construct it from LWE. We show that when instantiating Kilian\u27s protocol with a meSSB hash family, the first two messages are simply an instantiation of the BMW heuristic. Therefore, if we also instantiate it with a PCP for which the BMW heuristic is sound, e.g., a computational non-signaling PCP, then the first two messages of the Kilian protocol is a sound instantiation of the BMW heuristic. This leads us to two technical results. First, we show how to efficiently convert any succinct non-interactive argument (SNARG) for BatchNP into a SNARG for any language that has a computational non-signaling PCP. Put together with the recent and independent result of Choudhuri, Jain and Jin (Eprint 2021/808) which constructs a SNARG for BatchNP from LWE, we get a SNARG for any language that has a computational non-signaling PCP, including any language in P, but also any language in NTISP (non-deterministic bounded space), from LWE. Second, we introduce the notion of a somewhere statistically sound (SSS) interactive argument, which is a hybrid between a statistically sound proof and a computationally sound proof (a.k.a. an argument), and * prove that Kilian\u27s protocol, instantiated as above, is an SSS argument; * show that the soundness of SSS arguments can be proved in a straight-line manner, implying that they are also post-quantum sound if the underlying assumption is post-quantum secure; and * conjecture that constant-round SSS arguments can be soundly converted into non-interactive arguments via the Fiat-Shamir transformation

2008-2009 Master Class - James Markey (Trombone)

https://spiral.lynn.edu/conservatory_masterclasses/1099/thumbnail.jp

Detection, Occurrence and Fate of Emerging Contaminants in Agricultural Environments

A total of 43 papers published in 2014 were reviewed ranging from detailed descriptions of analytical methods, to fate and occurrence studies, to measuring and predicting biological effects for a wide variety of emerging contaminants likely to occur in agricultural environments. New methods and studies on veterinary pharmaceuticals, natural and synthetics steroids, and antibiotic resistance genes in agricultural environments continue to expand our knowledge base on the occurrence and potential impacts of these compounds. This review is divided into the following sections: Introduction, Analytical Methods, Occurrence and Fate, Antibiotic Resistance Genes, and Risk Assessment

Two-week isocaloric time-restricted feeding decreases liver inflammation without significant weight loss in obese mice with non-alcoholic fatty liver disease

Prolonged, isocaloric, time-restricted feeding (TRF) protocols can promote weight loss, improve metabolic dysregulation, and mitigate non-alcoholic fatty liver disease (NAFLD). In addition, 3-day, severe caloric restriction can improve liver metabolism and glucose homeostasis prior to significant weight loss. Thus, we hypothesized that short-term, isocaloric TRF would improve NAFLD and characteristics of metabolic syndrome in diet-induced obese male mice. After 26 weeks of ad libitum access to western diet, mice either continued feeding ad libitum or were provided with access to the same quantity of western diet for 8 h daily, over the course of two weeks. Remarkably, this short-term TRF protocol modestly decreased liver tissue inflammation in the absence of changes in body weight or epidydimal fat mass. There were no changes in hepatic lipid accumulation or other characteristics of NAFLD. We observed no changes in liver lipid metabolism-related gene expression, despite increased plasma free fatty acids and decreased plasma triglycerides in the TRF group. However, liver Grp78 and Txnip expression were decreased with TRF suggesting hepatic endoplasmic reticulum (ER) stress and activation of inflammatory pathways may have been diminished. We conclude that two-week, isocaloric TRF can potentially decrease liver inflammation, without significant weight loss or reductions in hepatic steatosis, in obese mice with NAFLD