We investigate methods for testing gene-disease outcome associations in situations where the genetic relationship potentially varies among subjects with differing environmental or clinical attributes. We propose a strategy which modestly increases multiple testing by evaluating weighted test statistics which focus (or enrich) association tests within subgroups and use a Monte-Carlo method, base...

Interaction potentials used in particle simulations are typically written as a sum of terms which depend on just a few relative particle positions. Traditional simulation methods move all particles at each time step, and may thus spend a lot of time updating interparticle forces. In this Letter we introduce adaptively restrained particle simulations (ARPS) to speed up particle simulations by ad...

A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. An adaptively secure scheme allows the adversary to specify the input x after seeing the garbled circuit. Applebaum et al. (CRYPTO ’13) showed that in any garbling scheme with adaptive simulation-based security, the size of the garbled input must exceed the output size...

Adaptive security captures the capability of an adversary to adaptively affect a system during the course of its computation based on partial information gathered. In this work, we explore the theoretical complexity of achieving adaptive security in two settings: 1. Adaptive UC-Secure Computation: We provide a roundefficient compiler that transforms any stand-alone semi-honest adaptively secure...

We give a simple and efficient algorithm for adaptively counting inversions in a sequence of n integers. Our algorithm runs in O(n+

This paper presents an adaptive and adaptable system and its evaluation. The system is based on a commercial spreadsheet application and provides adaptation opportunities for defining a user– and task–specific user interface (new menu entries and key shortcuts for subrouting names and parameters, changing default parameters). The development following a design–evaluation–redesign approach has s...

An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...