Page 1/
Scientific Study on Diagram Visualization
This is a scientific study conducted by the University of Kent, the University of Brighton and Edinburgh Napier University.
Important:
You can participate in this study only once. Multiple HITs by the same worker will not be permitted. Once accepting the HIT, continue
on through all the pages. If you fail to complete the HIT after starting you will not be allowed to accept another HIT and will not be paid.
This HIT is split up into pages and each page takes up to 1 minute to complete. The whole HIT takes about 30 minutes with a maximum of 45 minutes permitted.
Read the instructions carefully and answer the question before proceeding to the next page. HITs that are not completed carefully will be
rejected and you will not be paid. 100% of a number of attention checking questions must be answered correctly for you to be awarded the HIT.
You should maintain concentration on the HIT and answer questions without delay, unless a question explicitly allows you to take a break, in which case you can have a rest before continuing.
Do not use the back button on your browser: you cannot access the previous pages, and if you click on it, you might be unable to submit the HIT.
The next 4 pages are for training. You will need to read these pages carefully to answer the later questions correctly.
The correct answers and other details related to this study will be available at www.eulerdiagrams.org/cardinality/ after 1 December 2016.
Are you ready to start the HIT?
(you cannot return to this page afterwards)
Answer
(you cannot return to this page afterwards)
Answer
(you cannot return to this page afterwards)
Answer
(you cannot return to this page afterwards)
Answer
(you cannot return to this page afterwards)
Page 6/
Problem 1
(you cannot return to this page afterwards)
Page 7/
Problem 2
(you cannot return to this page afterwards)
Page 8/
Problem 3
(you cannot return to this page afterwards)
Page 9/
Problem 4
(you cannot return to this page afterwards)
Page 10/
Problem 5
(you cannot return to this page afterwards)
Page 11/
Problem 6
(you cannot return to this page afterwards)
Page 12/
Problem 7
(you cannot return to this page afterwards)
Page 13/
Problem 8
(you cannot return to this page afterwards)
Page 14/
Problem 9
(you cannot return to this page afterwards)
Page 15/
Problem 10
(you cannot return to this page afterwards)
Page 16/
Problem 11
(you cannot return to this page afterwards)
Page 17/
Problem 12
(you cannot return to this page afterwards)
Page 18/
Problem 13
(you cannot return to this page afterwards)
Page 19/
Problem 14
(you cannot return to this page afterwards)
Page 20/
Problem 15
(you cannot return to this page afterwards)
Page 21/
Problem 16
(you cannot return to this page afterwards)
Page 22/
Problem 17
(you cannot return to this page afterwards)
Page 23/
Problem 18
(you cannot return to this page afterwards)
Page 24/
Problem 19
(you cannot return to this page afterwards)
Page 25/
Problem 20
(you cannot return to this page afterwards)
Page 26/
Problem 21
(you cannot return to this page afterwards)
Page 27/
Problem 22
(you cannot return to this page afterwards)
Page 28/
Problem 23
(you cannot return to this page afterwards)
Page 29/
Problem 24
(you cannot return to this page afterwards)
Page 30/
Problem 25
(you cannot return to this page afterwards)
Page 31/
Problem 26
(you cannot return to this page afterwards)
Page 32/
Problem 27
(you cannot return to this page afterwards)
Page 33/
Problem 28
(you cannot return to this page afterwards)
Page 34/
Problem 29
(you cannot return to this page afterwards)
Page 35/
Problem 30
(you cannot return to this page afterwards)
Page 36/
Problem 31
(you cannot return to this page afterwards)
Page 37/
Problem 32
(you cannot return to this page afterwards)
Page 38/
Problem 33
(you cannot return to this page afterwards)
Page 39/
Problem 34
(you cannot return to this page afterwards)