Loading...

National Institute of Mental Health Data Archive (NDA) Sign In
NDA

Enter the email address associated with your existing NDA Account and click Continue Linking Process.

If you do not have an existing NDA account, click Go Back.

Warning Notice This is a U.S. Government computer system, which may be accessed and used only for authorized Government business by authorized personnel. Unauthorized access or use of this computer system may subject violators to criminal, civil, and/or administrative action. All information on this computer system may be intercepted, recorded, read, copied, and disclosed by and to authorized personnel for official purposes, including criminal investigations. Such information includes sensitive data encrypted to comply with confidentiality and privacy requirements. Access or use of this computer system by any person, whether authorized or unauthorized, constitutes consent to these terms. There is no right of privacy in this system.
National Institute of Mental Health Data Archive (NDA) Sign In
NDA

Success! An email is on its way!

Please check your email to complete the linking process. The link you receive is only valid for 30 minutes.

Check your spam or junk folder if you do not receive the email in the next few minutes.

Warning Notice This is a U.S. Government computer system, which may be accessed and used only for authorized Government business by authorized personnel. Unauthorized access or use of this computer system may subject violators to criminal, civil, and/or administrative action. All information on this computer system may be intercepted, recorded, read, copied, and disclosed by and to authorized personnel for official purposes, including criminal investigations. Such information includes sensitive data encrypted to comply with confidentiality and privacy requirements. Access or use of this computer system by any person, whether authorized or unauthorized, constitutes consent to these terms. There is no right of privacy in this system.
Create or Link an Existing NDA Account

Warning Notice

This is a U.S. Government computer system, which may be accessed and used only for authorized Government business by authorized personnel. Unauthorized access or use of this computer system may subject violators to criminal, civil, and/or administrative action. All information on this computer system may be intercepted, recorded, read, copied, and disclosed by and to authorized personnel for official purposes, including criminal investigations. Such information includes sensitive data encrypted to comply with confidentiality and privacy requirements. Access or use of this computer system by any person, whether authorized or unauthorized, constitutes consent to these terms. There is no right of privacy in this system.

NIMH Data Archive (NDA) Sign In or Create An Account
Update Password

You have logged in with a temporary password. Please update your password. Passwords must contain 8 or more characters and must contain at least 3 of the following types of characters:

  • Uppercase
  • Lowercase
  • Numbers
  • Special Characters limited to: %,_,!,@,#,$,-,%,&,+,=,),(,*,^,:,;
Update Password

Subscribe to our mailing list

Mailing List(s)
Email Format

You are now leaving the NIMH Data Archive (NDA) web site to go to:

Click on the address above if the page does not change within 10 seconds.

Disclaimer

NDA is not responsible for the content of this external site and does not monitor other web sites for accuracy.

Accept Terms
Data Access Terms - Decline Terms

Are you sure you want to cancel? This will decline terms and you will not be authorized for access.

NIMH Data Archive
NDA ABCD CCF OAI NIAAADA AMP SCZ HEAL NBB

Object Scene Memory Task

198 Shared Subjects

N/A
Clinical Assessments
Task Based
02/02/2018
osm01
02/02/2018
View Change History
01
Definition
Submission Template
Query Element Name Data Type Size Required Description Value Range Notes Aliases
subjectkey GUID Required The NDAR Global Unique Identifier (GUID) for research subject NDAR*
src_subject_id String 20 Required Subject ID how it's defined in lab/project
interview_date Date Required Date on which the interview/genetic test/sampling/imaging/biospecimen was completed. MM/DD/YYYY
interview_age Integer Required Age in months at the time of the interview/test/sampling/imaging. 0::1440 Age is rounded to chronological month. If the research participant is 15-days-old at time of interview, the appropriate value would be 0 months. If the participant is 16-days-old, the value would be 1 month.
sex String 20 Required Sex of subject at birth M;F; O; NR M = Male; F = Female; O=Other; NR = Not reported gender
Query objscene_run1_1 Integer Recommended memory for object for run 1 trial 1 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_2 Integer Recommended memory for object for run 1 trial 2 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_3 Integer Recommended memory for object for run 1 trial 3 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_4 Integer Recommended memory for object for run 1 trial 4 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_5 Integer Recommended memory for object for run 1 trial 5 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_6 Integer Recommended memory for object for run 1 trial 6 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_7 Integer Recommended memory for object for run 1 trial 7 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_8 Integer Recommended memory for object for run 1 trial 8 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_9 Integer Recommended memory for object for run 1 trial 9 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_10 Integer Recommended memory for object for run 1 trial 10 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_11 Integer Recommended memory for object for run 1 trial 11 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_12 Integer Recommended memory for object for run 1 trial 12 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_13 Integer Recommended memory for object for run 1 trial 13 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_14 Integer Recommended memory for object for run 1 trial 14 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_15 Integer Recommended memory for object for run 1 trial 15 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_16 Integer Recommended memory for object for run 1 trial 16 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_17 Integer Recommended memory for object for run 1 trial 17 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_18 Integer Recommended memory for object for run 1 trial 18 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_19 Integer Recommended memory for object for run 1 trial 19 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_20 Integer Recommended memory for object for run 1 trial 20 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_21 Integer Recommended memory for object for run 1 trial 21 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_22 Integer Recommended memory for object for run 1 trial 22 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_23 Integer Recommended memory for object for run 1 trial 23 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_24 Integer Recommended memory for object for run 1 trial 24 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_25 Integer Recommended memory for object for run 1 trial 25 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_26 Integer Recommended memory for object for run 1 trial 26 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_27 Integer Recommended memory for object for run 1 trial 27 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_28 Integer Recommended memory for object for run 1 trial 28 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_29 Integer Recommended memory for object for run 1 trial 29 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_30 Integer Recommended memory for object for run 1 trial 30 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_31 Integer Recommended memory for object for run 1 trial 31 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_32 Integer Recommended memory for object for run 1 trial 32 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_33 Integer Recommended memory for object for run 1 trial 33 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_34 Integer Recommended memory for object for run 1 trial 34 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_35 Integer Recommended memory for object for run 1 trial 35 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_36 Integer Recommended memory for object for run 1 trial 36 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_37 Integer Recommended memory for object for run 1 trial 37 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_38 Integer Recommended memory for object for run 1 trial 38 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_39 Integer Recommended memory for object for run 1 trial 39 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_40 Integer Recommended memory for object for run 1 trial 40 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_41 Integer Recommended memory for object for run 1 trial 41 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_42 Integer Recommended memory for object for run 1 trial 42 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_43 Integer Recommended memory for object for run 1 trial 43 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_44 Integer Recommended memory for object for run 1 trial 44 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_45 Integer Recommended memory for object for run 1 trial 45 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_46 Integer Recommended memory for object for run 1 trial 46 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_47 Integer Recommended memory for object for run 1 trial 47 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_48 Integer Recommended memory for object for run 1 trial 48 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_49 Integer Recommended memory for object for run 1 trial 49 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_50 Integer Recommended memory for object for run 1 trial 50 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_51 Integer Recommended memory for object for run 1 trial 51 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_52 Integer Recommended memory for object for run 1 trial 52 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_53 Integer Recommended memory for object for run 1 trial 53 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_54 Integer Recommended memory for object for run 1 trial 54 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_55 Integer Recommended memory for object for run 1 trial 55 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_56 Integer Recommended memory for object for run 1 trial 56 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_57 Integer Recommended memory for object for run 1 trial 57 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_58 Integer Recommended memory for object for run 1 trial 58 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_59 Integer Recommended memory for object for run 1 trial 59 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_60 Integer Recommended memory for object for run 1 trial 60 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_61 Integer Recommended memory for object for run 1 trial 61 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_62 Integer Recommended memory for object for run 1 trial 62 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_63 Integer Recommended memory for object for run 1 trial 63 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run1_64 Integer Recommended memory for object for run 1 trial 64 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_1 Integer Recommended memory for object for run 2 trial 1 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_2 Integer Recommended memory for object for run 2 trial 2 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_3 Integer Recommended memory for object for run 2 trial 3 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_4 Integer Recommended memory for object for run 2 trial 4 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_5 Integer Recommended memory for object for run 2 trial 5 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_6 Integer Recommended memory for object for run 2 trial 6 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_7 Integer Recommended memory for object for run 2 trial 7 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_8 Integer Recommended memory for object for run 2 trial 8 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_9 Integer Recommended memory for object for run 2 trial 9 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_10 Integer Recommended memory for object for run 2 trial 10 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_11 Integer Recommended memory for object for run 2 trial 11 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_12 Integer Recommended memory for object for run 2 trial 12 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_13 Integer Recommended memory for object for run 2 trial 13 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_14 Integer Recommended memory for object for run 2 trial 14 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_15 Integer Recommended memory for object for run 2 trial 15 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_16 Integer Recommended memory for object for run 2 trial 16 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_17 Integer Recommended memory for object for run 2 trial 17 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_18 Integer Recommended memory for object for run 2 trial 18 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_19 Integer Recommended memory for object for run 2 trial 19 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_20 Integer Recommended memory for object for run 2 trial 20 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_21 Integer Recommended memory for object for run 2 trial 21 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_22 Integer Recommended memory for object for run 2 trial 22 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_23 Integer Recommended memory for object for run 2 trial 23 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_24 Integer Recommended memory for object for run 2 trial 24 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_25 Integer Recommended memory for object for run 2 trial 25 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_26 Integer Recommended memory for object for run 2 trial 26 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_27 Integer Recommended memory for object for run 2 trial 27 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_28 Integer Recommended memory for object for run 2 trial 28 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_29 Integer Recommended memory for object for run 2 trial 29 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_30 Integer Recommended memory for object for run 2 trial 30 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_31 Integer Recommended memory for object for run 2 trial 31 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_32 Integer Recommended memory for object for run 2 trial 32 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_33 Integer Recommended memory for object for run 2 trial 33 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_34 Integer Recommended memory for object for run 2 trial 34 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_35 Integer Recommended memory for object for run 2 trial 35 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_36 Integer Recommended memory for object for run 2 trial 36 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_37 Integer Recommended memory for object for run 2 trial 37 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_38 Integer Recommended memory for object for run 2 trial 38 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_39 Integer Recommended memory for object for run 2 trial 39 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_40 Integer Recommended memory for object for run 2 trial 40 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_41 Integer Recommended memory for object for run 2 trial 41 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_42 Integer Recommended memory for object for run 2 trial 42 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_43 Integer Recommended memory for object for run 2 trial 43 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_44 Integer Recommended memory for object for run 2 trial 44 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_45 Integer Recommended memory for object for run 2 trial 45 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_46 Integer Recommended memory for object for run 2 trial 46 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_47 Integer Recommended memory for object for run 2 trial 47 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_48 Integer Recommended memory for object for run 2 trial 48 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_49 Integer Recommended memory for object for run 2 trial 49 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_50 Integer Recommended memory for object for run 2 trial 50 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_51 Integer Recommended memory for object for run 2 trial 51 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_52 Integer Recommended memory for object for run 2 trial 52 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_53 Integer Recommended memory for object for run 2 trial 53 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_54 Integer Recommended memory for object for run 2 trial 54 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_55 Integer Recommended memory for object for run 2 trial 55 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_56 Integer Recommended memory for object for run 2 trial 56 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_57 Integer Recommended memory for object for run 2 trial 57 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_58 Integer Recommended memory for object for run 2 trial 58 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_59 Integer Recommended memory for object for run 2 trial 59 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_60 Integer Recommended memory for object for run 2 trial 60 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_61 Integer Recommended memory for object for run 2 trial 61 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_62 Integer Recommended memory for object for run 2 trial 62 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_63 Integer Recommended memory for object for run 2 trial 63 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run2_64 Integer Recommended memory for object for run 2 trial 64 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_1 Integer Recommended memory for object for run 3 trial 1 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_2 Integer Recommended memory for object for run 3 trial 2 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_3 Integer Recommended memory for object for run 3 trial 3 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_4 Integer Recommended memory for object for run 3 trial 4 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_5 Integer Recommended memory for object for run 3 trial 5 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_6 Integer Recommended memory for object for run 3 trial 6 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_7 Integer Recommended memory for object for run 3 trial 7 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_8 Integer Recommended memory for object for run 3 trial 8 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_9 Integer Recommended memory for object for run 3 trial 9 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_10 Integer Recommended memory for object for run 3 trial 10 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_11 Integer Recommended memory for object for run 3 trial 11 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_12 Integer Recommended memory for object for run 3 trial 12 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_13 Integer Recommended memory for object for run 3 trial 13 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_14 Integer Recommended memory for object for run 3 trial 14 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_15 Integer Recommended memory for object for run 3 trial 15 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_16 Integer Recommended memory for object for run 3 trial 16 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_17 Integer Recommended memory for object for run 3 trial 17 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_18 Integer Recommended memory for object for run 3 trial 18 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_19 Integer Recommended memory for object for run 3 trial 19 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_20 Integer Recommended memory for object for run 3 trial 20 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_21 Integer Recommended memory for object for run 3 trial 21 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_22 Integer Recommended memory for object for run 3 trial 22 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_23 Integer Recommended memory for object for run 3 trial 23 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_24 Integer Recommended memory for object for run 3 trial 24 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_25 Integer Recommended memory for object for run 3 trial 25 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_26 Integer Recommended memory for object for run 3 trial 26 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_27 Integer Recommended memory for object for run 3 trial 27 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_28 Integer Recommended memory for object for run 3 trial 28 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_29 Integer Recommended memory for object for run 3 trial 29 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_30 Integer Recommended memory for object for run 3 trial 30 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_31 Integer Recommended memory for object for run 3 trial 31 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_32 Integer Recommended memory for object for run 3 trial 32 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_33 Integer Recommended memory for object for run 3 trial 33 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_34 Integer Recommended memory for object for run 3 trial 34 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_35 Integer Recommended memory for object for run 3 trial 35 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_36 Integer Recommended memory for object for run 3 trial 36 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_37 Integer Recommended memory for object for run 3 trial 37 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_38 Integer Recommended memory for object for run 3 trial 38 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_39 Integer Recommended memory for object for run 3 trial 39 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_40 Integer Recommended memory for object for run 3 trial 40 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_41 Integer Recommended memory for object for run 3 trial 41 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_42 Integer Recommended memory for object for run 3 trial 42 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_43 Integer Recommended memory for object for run 3 trial 43 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_44 Integer Recommended memory for object for run 3 trial 44 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_45 Integer Recommended memory for object for run 3 trial 45 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_46 Integer Recommended memory for object for run 3 trial 46 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_47 Integer Recommended memory for object for run 3 trial 47 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_48 Integer Recommended memory for object for run 3 trial 48 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_49 Integer Recommended memory for object for run 3 trial 49 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_50 Integer Recommended memory for object for run 3 trial 50 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_51 Integer Recommended memory for object for run 3 trial 51 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_52 Integer Recommended memory for object for run 3 trial 52 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_53 Integer Recommended memory for object for run 3 trial 53 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_54 Integer Recommended memory for object for run 3 trial 54 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_55 Integer Recommended memory for object for run 3 trial 55 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_56 Integer Recommended memory for object for run 3 trial 56 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_57 Integer Recommended memory for object for run 3 trial 57 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_58 Integer Recommended memory for object for run 3 trial 58 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_59 Integer Recommended memory for object for run 3 trial 59 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_60 Integer Recommended memory for object for run 3 trial 60 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_61 Integer Recommended memory for object for run 3 trial 61 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_62 Integer Recommended memory for object for run 3 trial 62 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_63 Integer Recommended memory for object for run 3 trial 63 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query objscene_run3_64 Integer Recommended memory for object for run 3 trial 64 0 :: 5 0 = Missed trial; 1=new; 2=city; 3=park; 4 = farm; 5=Don't Know scene
Query object_hit_rate Float Recommended Hit rate for objects 0 :: 1
Query object_false_alarm_rate Float Recommended False alarm rate for objects 0 :: 1
Query object_scene_correct Float Recommended rate for object-scene correct associations 0 :: 1
Query source_accuracy Float Recommended Quotient of hits with correct source / hits with any source
Query recognition Integer Recommended Difference of Hit Rate and False Alarm Rate 0::1
Query response_time1 Float Recommended Average response time for correct source responses Milliseconds
Query response_time2 Float Recommended Average response time for incorrect source responses Milliseconds
Query response_time3 Float Recommended Average response time for miss responses Milliseconds
Data Structure

This page displays the data structure defined for the measure identified in the title and structure short name. The table below displays a list of data elements in this structure (also called variables) and the following information:

  • Element Name: This is the standard element name
  • Data Type: Which type of data this element is, e.g. String, Float, File location.
  • Size: If applicable, the character limit of this element
  • Required: This column displays whether the element is Required for valid submissions, Recommended for valid submissions, Conditional on other elements, or Optional
  • Description: A basic description
  • Value Range: Which values can appear validly in this element (case sensitive for strings)
  • Notes: Expanded description or notes on coding of values
  • Aliases: A list of currently supported Aliases (alternate element names)
  • For valid elements with shared data, on the far left is a Filter button you can use to view a summary of shared data for that element and apply a query filter to your Cart based on selected value ranges

At the top of this page you can also:

  • Use the search bar to filter the elements displayed. This will not filter on the Size of Required columns
  • Download a copy of this definition in CSV format
  • Download a blank CSV submission template prepopulated with the correct structure header rows ready to fill with subject records and upload

Please email the The NDA Help Desk with any questions.

Additional Information
Training Privacy Policy Disclaimer Contact Us
External Resources
Accessibility FOIA OIG HHS Vulnerability Disclosure
NIH Logo HHS Logo USA Gov Logo
fbaa4270a4b3596390e979cd28fd0f33565fe06d