表示帧之间关系的列表与图形的可用性

J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore
{"title":"表示帧之间关系的列表与图形的可用性","authors":"J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore","doi":"10.1109/ICSMC.1989.71418","DOIUrl":null,"url":null,"abstract":"An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"5 1","pages":"867-871 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The usability of lists versus graphs for representing the relationships between frames\",\"authors\":\"J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore\",\"doi\":\"10.1109/ICSMC.1989.71418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<<ETX>>\",\"PeriodicalId\":72691,\"journal\":{\"name\":\"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics\",\"volume\":\"5 1\",\"pages\":\"867-871 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSMC.1989.71418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSMC.1989.71418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在要求用户验证帧间关系陈述的任务中,通过列表或图形来比较用户的表现。结果显示,图表的响应时间优势取决于所执行的任务类型。对于只涉及验证给定帧存在或验证两个帧之间的直接关系的任务,使用列表和图表的响应时间大致相等。对于涉及验证帧之间间接关系的任务,或者验证特定帧在其他两个帧之间的导航路径中发生的任务,图要比列表快得多。优势的大小取决于在完成任务时必须处理的直接关系的数量;需要导航的直接关系越多,图表的优势就越大。这些结果表明,帧之间的关系应该以图表的形式呈现给用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The usability of lists versus graphs for representing the relationships between frames
An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Bioelectronic Zeitgebers: targeted neuromodulation to re-establish circadian rhythms. MorpheusNet: Resource efficient sleep stage classifier for embedded on-line systems. LoST: A Mental Health Dataset of Low Self-esteem in Reddit Posts. Language Model-Guided Classifier Adaptation for Brain-Computer Interfaces for Communication. Pattern Recognition in Vital Signs Using Spectrograms.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1