Cervical esophageal web associated with a patch of heterotopic gastric mucosa

Cervical esophageal webs are a relatively common finding on esophograms. We report a web resulting from the squamocolumnar junction produced by heterotopic gastric mucosa. The clinical significance of this lesion is discussed and the importance of differentiating it from Barrett's esophagus is stressed.     

Deconstructing gamification: evaluating the effectiveness of continuous measurement,virtual rewards,and social comparison for promoting physical activity

Game design elements are often implemented in persuasive systems aimed to promote physical activity, a process called “gamification.” Gamification is believed to motivate users to become more active, and is commonly implemented in commercial products. However, relatively few studies rigorously evaluated the effectiveness of gamification, and they yielded contradicting findings. We set out to evaluate the effectiveness of virtual rewards and social comparison—two game elements prevalent in persuasive systems. We developed a research prototype, called “StepByStep,” aimed to promote routine walking. We created different versions of StepByStep, implemented as an application on Android-based mobile devices, and compared their effectiveness in two field studies. Study 1 showed that a quantified version of the application—offering continuous measurement of walking time, a daily goal, and real-time feedback on progress toward this goal—facilitated reflection on activity and significantly increased walking time over baseline level. Study 2 showed that gamified versions offering virtual rewards and social comparison were only as effective as the quantified version. Thus, we advise designers to facilitate reflection on meaningful aspects of physical activity by developing novel ubiquitous measures. Furthermore, our findings highlight the importance of systematic comparisons between quantified and gamified elements for better understanding their motivational affordances.     

Derandomized graph products

Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to 1 to approximating clique within a factor ofn (for some ). This reduction was further studied by Blum, who gave it the namerandomized graph products. We show that this reduction can be made deterministic (derandomized), using random walks on expander graphs. The main technical contribution of this paper is in proving a lower bound for the probability that all steps of a random walk stay within a specified set of vertices of a graph. (Previous work was mainly concerned with upper bounds for this probability.) This lower bound extends also to the case where different sets of vertices are specified for different time steps of the walk.     

Simulating BPP using a general weak random source

We show how to simulate BPP and approximation algorithms in polynomial time using the output from a -source. A -source is a weak random source that is asked only once forR bits, and must output anR-bit string according to some distribution that places probability no more than 2^–R on any particular string. We also give an application to the unapproximability of MAX CLIQUE.This paper appeared in preliminary form in theProceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 79–89. Most of this research was done while the author was at U.C. Berkeley, and supported by an AT&T Graduate Fellowship, NSF PYI Grant No. CCR-8896202, and NSF Grant No. IRI-8902813. Part of this research was done while the author was at MIT, supported by an NSF Postdoctoral Fellowship, NSF Grant No. 92-12184 CCR, and DARPA Grant No. N00014-92-J-1799. Part of this research was done at UT Austin, where the author was supported by NSF NYI Grant No. CCR-9457799.     

Deterministic extractors for small-space sources

We give polynomial-time, deterministic randomness extractors for sources generated in small space, where we model space s sources on ${\{0,1\}}^n$ as sources generated by width $2^s$ branching programs. Specifically, there is a constant $\eta >0$ such that for any $\zeta >n^{?\eta }$, our algorithm extracts $m=(\delta ?\zeta )n$ bits that are exponentially close to uniform (in variation distance) from space s sources with min-entropy δn, where $s=\Omega ({\zeta }^{3}n)$. Previously, nothing was known for $\delta ?1/2$, even for space 0. Our results are obtained by a reduction to the class of total-entropy independent sources. This model generalizes both the well-studied models of independent sources and symbol-fixing sources. These sources consist of a set of r independent smaller sources over ${\{0,1\}}^{?}$, where the total min-entropy over all the smaller sources is k. We give deterministic extractors for such sources when k is as small as $\mathsf{polylog}(r)$, for small enough ?.     

Algorithms for the coalitional manipulation problem

We investigate the problem of coalitional manipulation in elections, which is known to be hard in a variety of voting rules. We put forward efficient algorithms for the problem in Borda, Maximin and Plurality with Runoff, and analyze their windows of error. Specifically, given an instance on which an algorithm fails, we bound the additional power the manipulators need in order to succeed. We finally discuss the implications of our results with respect to the popular approach of employing computational hardness to preclude manipulation.