Abstract
Many behavioral and cognitive researches as well as animal learning studies need to construct sequences of stimuli presentation to test subject’s performance. The major problem in sequences building is to meet “randomness” in stimuli succession with “ balance” among stimulus k inds and to prevent guessing trials and behavioral habits. Starting from series of Gellermann, who first dealt with the problem, the existing systems are limited in sequence length and in stimuli number, or they require special-purpose computer programs useful only under well-specified experimental designs. We h ave developed a simple C ++ algorithm g enerating long sequences of multiple presentations of n stimuli for two-choice discrimination tasks, accomplishing to three Gellermann’s criteria (constraints); moreover flexible enough to be employed with a variety of experimental protocols different from subject to subject in sequence length, i n stimuli number a nd in s timuli r atio. F inally, t he p resent a lgorithm c ould represent a suitable tool for quality control tests of biosensor applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gellermann, L.W. (1933) Chance ordere of alternating stimuli in visual discrimination experiments, Journal of Genetic Psychology 42, 207–208.
Krechevsky, I. (1932) Hypotheses in rats, Psychological Review 39, 516–532.
Levine, M. (1959) A model of hypothesis behavior in discrimination learning set, Psychological Review 66, 353–366.
Fellows, B.J. (1967) Chance stimulus sequences for discrimination tasks, Psychological Bulletin 67, 87–92.
Fragaszy, R.J. and Fragszy, D.M. (1978) A program to generate Gellermann (pseudorandom) series of binary states, Behavior Research Methods & Instrumentation 10, 83–88.
Castellan, N.J. jr. (1992) Shuffling arrays: Appearance may be deceiving, Behavior Research Methods, Instruments & Computers 24, 72–77.
Emerson, P.L and Tobias, R.D. (1995) Computer program for quasi-random stimulus sequences with equal transition frequencies, Behavior Research Methods, Instruments & Computers 27, 88–98.
Shon, H-S., Bricker, D.L., Simon J.R. and Hsieh, Y.-C. (1997) Optimal sequences of trials for balancing practice and repetition effects, Behavior Research Methods, Instruments & Computers 29, 574–581.
Cesaretti, G., Kusmic, C. and Musumeci, D. (1997) Binocular field in pigeons: behavioural measures of stimulus detection and coding, Archives Italiennes de Biologie 135, 131–143.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bandoni, G., Cesaretti, G., Kusmic, C., Musumeci, D. (2003). An Algorithm Generating Long Sequences of Stimuli in Behavioral Science: A Suitable Test for Biosensors. In: Barsanti, L., Evangelista, V., Gualtieri, P., Passarelli, V., Vestri, S. (eds) Molecular Electronics: Bio-sensors and Bio-computers. NATO Science Series, vol 96. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0141-0_16
Download citation
DOI: https://doi.org/10.1007/978-94-010-0141-0_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-1212-9
Online ISBN: 978-94-010-0141-0
eBook Packages: Springer Book Archive