The effects of linguistic context on visual attention while learning novel verbs

The research reported here was supported by a Franklin Research Grant from the American Philosophical Society and by NIH award number K01DC013306.http://www.cascadilla.com/bucld41toc.htmlPublished versio

Food intake, conversion and swimming activity in the air-breathing catfish Heteropneustes fossilis

Pandian & Vivekanandan (1976) and Vivekanandan ([976), who considered feeding rate and conversion efficiency estimates as parameters for assessing metabolic rates and efficiencies. observed that the obligatory airbreathing fish Opiliocepha/us slriatus, reared in aquaria containing different depths of water, swam longer or shorter distance to exhange atmospheric air; such a design of experiment permitted them to measure food intake. growth and sustained active metabolism on a long term basis

Real-time processing of event descriptions for partially- and fully-completed events: Evidence from the visual world paradigm

The current study investigated non-culminating accomplishments through an experimental lens. We used a well-established paradigm for studying real-time language processing using eye-tracking, the visual world paradigm. Our study was modeled after Altmann and Kamide’s (2007) investigation of processing of aspectual information contained in a perfect verb form (e.g., has eaten). We compared English-speaking adults’ interpretations of sentences like ‘The girl has eaten a cookie’ and ‘The girl was eating a cookie’ in the context of one of two visual scenes. In the Full Completion condition, the scene depicted two referents that were compatible with the predicate: one was compatible with the expected end state of the event (e.g., an empty plate), the other with an unrealized version of the event (e.g., an uneaten cookie). In the Partial Completion condition, the scene depicted a referent that was compatible with a partially-completed version of the event (e.g., part of a cookie on a plate) and an unrealized interpretation (e.g., an uneaten cookie). For verb forms in the perfect (e.g., has eaten) but not in the progressive, we found a difference between conditions; listeners preferred to look at the fully-affected referent in the Full Completion condition as compared to the partially-affected referent in the Partial Completion condition. We take the results as suggestive in favor of a pragmatic rather than semantic account of non-culmination interpretations in English

Sub-specific differentiation in Nicotiana rustica

This article does not have an abstract

Using cultural probes to inform the design of assistive technologies

This paper discusses the practical implications of applying cultural probes to drive the design of assistive technologies. Specifically we describe a study in which a probe was deployed with home-based carers of people with dementia in order to capture critical data and gain insights of integrating the technologies into this sensitive and socially complex design space. To represent and utilise the insights gained from the cultural probes, we created narratives based on the probe data to enhance the design of assistive technologies.This work was supported by the Arts and Humanities Research Council (AH/K00266X/1) and RCUK through the Horizon Digital Economy Research grant (EP/G065802/1)

Quantum query algorithms are completely bounded forms

We prove a characterization of quantum query algorithms in terms of polynomials satisfying a certain (completely bounded) norm constraint. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query complexity, answering a question of Aaronson et al. (CCC’16). Using this characterization, we show that many polynomials of degree at least 4 are far from those coming from quantum query algorithms. Our proof is based on a fundamental result of Christensen and Sinclair (J. Funct. Anal., 1987) that generalizes the well-known Stinespring representation for quantum channels to multilinear forms. We also give a simple and short proof of one of the results of Aaronson et al. showing an equivalence between one-query quantum algorithms and bounded quadratic polynomials

Optimal Algorithms for Learning Quantum Phase States

We analyze the complexity of learning n-qubit quantum phase states. A degree-d phase state is defined as a superposition of all 2? basis vectors x with amplitudes proportional to (-1)^{f(x)}, where f is a degree-d Boolean polynomial over n variables. We show that the sample complexity of learning an unknown degree-d phase state is ?(n^d) if we allow separable measurements and ?(n^{d-1}) if we allow entangled measurements. Our learning algorithm based on separable measurements has runtime poly(n) (for constant d) and is well-suited for near-term demonstrations as it requires only single-qubit measurements in the Pauli X and Z bases. We show similar bounds on the sample complexity for learning generalized phase states with complex-valued amplitudes. We further consider learning phase states when f has sparsity-s, degree-d in its ?? representation (with sample complexity O(2^d sn)), f has Fourier-degree-t (with sample complexity O(2^{2t})), and learning quadratic phase states with ?-global depolarizing noise (with sample complexity O(n^{1+?})). These learning algorithms give us a procedure to learn the diagonal unitaries of the Clifford hierarchy and IQP circuits

Quantum Query Algorithms are Completely Bounded Forms

We prove a characterization of t-query quantum algorithms in terms of the unit ball of a space of degree-2t polynomials. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query complexity, answering a question of Aaronson et al. (CCC’16). Our proof is based on a fundamental result of Christensen and Sinclair (J. Funct. Anal., 1987) that generalizes the well-known Stinespring representation for quantum channels to multilinear forms. Using our characterization, we show that many polynomials of degree four are far from those coming from two-query quantum algorithms. We also give a simple and short proof of one of the results of Aaronson et al. showing an equivalence between one-query quantum algorithms and bounded quadratic polynomials