Processing speed, executive function, and age differences in remembering and knowing.

A group of young (n = 52, M = 23.27 years) and old (n = 52, M = 68.62 years) adults studied two lists of semantically unrelated nouns. For one list a time of 2 s was allowed for encoding, and for the other, 5 s. A recognition test followed where participants classified their responses according to Gardiner's (1988) remember-know procedure. Age differences for remembering and knowing were minimal in the faster 2-s encoding condition. However, in the longer 5-s encoding condition, younger persons produced significantly more remember responses, and older adults a greater number of know responses. This dissociation suggests that in the longer encoding condition, younger adults utilized a greater level of elaborative rehearsal governed by executive processes, whereas older persons employed maintenance rehearsal involving short-term memory. Statistical control procedures, however, found that independent measures of processing speed accounted for age differences in remembering and knowing and that independent measures of executive control had little influence. The findings are discussed in the light of contrasting theoretical accounts of recollective experience in old age

The Use of Loglinear Models for Assessing Differential Item Functioning Across Manifest and Latent Examinee Groups

Loglinear latent class models are used to detect differential item functioning (DIF). These models are formulated in such a manner that the attribute to be assessed may be continuous, as in a Rasch model, or categorical, as in Latent Class Mastery models. Further, an item may exhibit DIF with respect to a manifest grouping variable, a latent grouping variable, or both. Likelihood-ratio tests for assessing the presence of various types of DIF are described, and these methods are illustrated through the analysis of a "real world" data set

Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization

Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable problems. This issue can sometimes (but possibly not always) be resolved by building special-purpose heuristic algorithms, tailored to the problem in question. Because of the continued difficulties in automating certain tasks that are natural for humans, there remains a strong motivation for AI researchers to investigate and apply new algorithms and techniques to hard AI problems. Recently a novel class of relevant algorithms that require quantum mechanical hardware have been proposed. These algorithms, referred to as quantum adiabatic algorithms, represent a new approach to designing both complete and heuristic solvers for NP-hard optimization problems. In this work we describe how to formulate image recognition, which is a canonical NP-hard AI problem, as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The QUBO format corresponds to the input format required for D-Wave superconducting adiabatic quantum computing (AQC) processors.Comment: 7 pages, 3 figure

Experimental determination of Ramsey numbers

Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order first appears and are extremely difficult to calculate due to their explosive rate of growth. Recently, an algorithm that can be implemented using adiabatic quantum evolution has been proposed that calculates the two-color Ramsey numbers $R(m,n)$. Here we present results of an experimental implementation of this algorithm and show that it correctly determines the Ramsey numbers R(3,3) and $R(m,2)$ for $4\leq m\leq 8$. The R(8,2) computation used 84 qubits of which 28 were computational qubits. This computation is the largest experimental implementation of a scientifically meaningful adiabatic evolution algorithm that has been done to date.Comment: manuscript: 5 pages; 1 table, 3 figures; Supplementary Information: 18 pages, 1 table, 13 figures; version to appear in Physical Review Letter