منابع مشابه
Effects of link annotations on search performance in layered and unlayered hierarchically organized information spaces
The effects of link annotations on user search performance in hypertext environments having deep (layered) and shallow link structures were investigated in this study. Four environments were tested—layered-annotated, layered-unannotated, shallow-annotated, and shallow-unannotated. A single document was divided into 48 sections, and layered and unlayered versions were created. Additional version...
متن کاملActively Mining Search Logs for Diverse Tags
Social tagging has become a very important mechanism for organizing information on the Web. Usually, people tag a web page manually, just as what they do on a social bookmarking web site. In this paper, we will demonstrate a brand-new perspective tagging web pages automatically by mining search logs. In order to keep diversity, we first classify web queries into different categories and then ex...
متن کاملDo aphids actively search for ant partners?
The aphid-ant mutualistic relationships are not necessarily obligate for neither partners but evidence is that such interactions provide them strong advantages in terms of global fitness. While it is largely assumed that ants actively search for their mutualistic partners namely using volatile cues; whether winged aphids (i.e., aphids' most mobile form) are able to select ant-frequented areas h...
متن کاملChronologically organized structure in autobiographical memory search
Each of us has a rich set of autobiographical memories that provides us with a coherent story of our lives. These memories are known to be highly structured both thematically and temporally. However, it is not known how we naturally tend to explore the mental timeline of our memories. Here we developed a novel cued retrieval paradigm in order to investigate the temporal element of memory search...
متن کاملSearch problems in vector spaces
We consider the following q-analog of the basic combinatorial search problem: let q be a prime power and GF(q) the finite field of q elements. Let V denote an n-dimensional vector space over GF(q) and let v be an unknown 1-dimensional subspace of V . We will be interested in determining the minimum number of queries that is needed to find v provided all queries are subspaces of V and the answer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2015
ISSN: 1534-7362
DOI: 10.1167/15.12.1369