queue {qmvs}

Simulation of the queueing model of visual search

Description

queue simulates the response and response time on a single trial in an experiment using standard visual search paradigm.

Usage

queue(miat, mst, c, pr, L, misidd, misidt, arrival, serving, tposition,
      old=FALSE)

Arguments

miat

A positive number representing the scale parameter of the exponential distribution of interarrival times, i.e., the mean interarrival time.

mst

A positive number representing the scale parameter of the exponential distribution of service times, i.e., the mean service time.

c

A natural number representing the number of parallel servers of the system.

pr

Logical. If pr is TRUE, the function simulates data on target present trials; if pr is FALSE, it simulates data on target absent trials.

L

A natural number representing the number of stimuli that have been identified to terminate the queueing process.

misidd

Logical vector of length k. Here, FALSE means correct identification and TRUE misidentification of a distractor.

misidt

Logical. Here, FALSE means correct identification and TRUE misidentification of the target.

arrival

A vector of length set size. Elements must be exponentially distributed random numbers with rate 1.

serving

A vector of length set size. Elements must be exponentially distributed random numbers with rate 1.

tposition

A natural number representing the position of the target in the queue, in target present case less or equal to set size, in target absent case equal to set size +1.

old

Logical. If old is TRUE, the simulation is implemented by R code; if old is FALSE, it is implemented by C code. Only for comparison of speed. Default option is FALSE.

Value

A numeric vector of length 5 indicating the number of visual items processed, the mean processing time of a single item, the maximum of processing time of a single item, the system response time and the response.

Author(s)

Yiq Li, [e-mail],https://www.xing.com/profile/Yiqi_Li3, Martin Schlather,[e-mail],https://www.wim.uni-mannheim.de/schlather/

References

Li, Yiqi (2020) Visual search as a queueing process. Doctoral dissertation, University of Mannheim.

Moore C. M.,and Wolfe J. M. (2001) Getting beyond the serial/parallel debate in visual search: A hybrid approach. In Shapiro, K.L. The Limits of Attention: Temporal Constraints on Human Information Processing. Oxford University Press doi:10.1093/acprof:oso/9780198505150.003.0009

See Also

sim, distance,

Examples

queue(miat = 30, mst = 200, c = 4, pr = TRUE, L = 12,
      misidd = rep(0L, 12), misidt = 0, arrival = rexp(12),
      serving = rexp(12), tposition = 7, old=FALSE)