A common computational process in cueing and conjunction search tasks

The question of whether Posner’s beam is the same as Treisman’s glue is addressed to construct a computational model that integrates both target and cue information. The cueing and conjunction search tasks are conducted to analyze a common process that may be underlying the tasks. The dynamic interaction between target and cue information produces attentional benefit- and cost-based in the cueing task. Furthermore, the search order for target candidates in a conjunction search task is determined through the integration of target and cue information, which is basically the same as in the cueing task. Our simulations suggest that consistency (or validity) is considered as a computational process that may be commonly involved in the both tasks.