-aware applications. In this paper, we address these three problems in turn. We first define context, identify categories of contextual information, and characterize context-aware application behavior. Though the full impact of context-aware computing requires understanding very subtle and high-level notions

the destination terminal. We develop performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading, focusing on the high signal-to-noise ratio (SNR) regime. Except for fixed decode-and-forward, all of our cooperative diversity

of perceptual organization and pattern recognition: The constraints toward regularization (Pragnanz) characterize not the complete object but the object's components. Representational power derives from an allowance of free combinations of the geons. A Principle of Componential Recovery can account

issues suggest: a trade's full price impact arrives only with a protracted lag; the impact is a positive and concave function of the trade size; large trades cause the spread to widen; trades occurring in the face of wide spreads have larger price impacts; and, information asymmetries are more

of complexity classes, this implies that BQP/qpoly ⊆ QMA/poly, which supersedes the previous result of Aaronson that BQP/qpoly ⊆ PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in power to untrusted quantum advice combined with trusted classical advice. Proving our main result

Abstract. This paper slightly improves a classical result by MSC 2010 : 49J45, 49K21, 49Q20, 28A75

increased significantly for income but little for consumption. We then develop a simple framework that allows us to analytically characterize how within-group income inequality affects consumption inequality in a world in which agents can trade a full set of contingent consumption claims, subject

equilibrium. Moreover, recursive diagonal transfer continuity also permits full characterization of symmetric, mixed strategy, and Bayesian Nash equilibria in games with general strategy spaces and payoffs. The approach and main result developed in the paper can also allow us to ascertain the existence

We settle a long standing open problem which has pursued a full characterization of completeness of (potentially randomized) finite functions for 2-party computation that is secure against active adversaries. Since the first such complete function was discovered [Kilian, FOCS 1988], the question

Abstract Noting that a full characterization of Nash-implementation is given using a canonical-mechanism and Maskin's theorem JEL classification: C72; D71; D82.