Abstract
For the distance learning systems, consideration was given to generation of individual tasks with limited performance time, and an algorithm was suggested to solve it. Such problem comes to that of integer stochastic programming with probabilistic constraints. Considered were the distributions of the random student’s time of response to the task such as the Van der Linden lognormal model and the discrete model based on empirical data. It was assumed that task complexities are estimated either by an expert or by using corresponding algorithms. For the case of continuous distribution, an algorithm was proposed based on the branch-and-bound principle. Results of the numerical experiments were presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Naumov, A.V., Dzhumurat, A.S., and Inozemtsev, A.O., CLASS.NET System of Remote Learning of Mathemal Disciplines, Vestn. Komp. Inform. Tekhnol., 2014, no. 10, pp. 36–40.
Universarium—Open System of Electronic Education, [Electronic Resource], Universarium, URL: http://universarium.org/ (data of access 21.08.2014).
Moodle—System of Course Control [Electronic Resource], Moodle, URL: http://moodle.org (date of access 21.08.2014).
Kibzun, A.I. and Inozemtsev, A.O., Using the Maximum Likelihood Method to Estimate Test Complexity Levels, Autom. Remote Control, 2014, vol. 75, no. 4, pp. 607–621.
Kibzun, A.I. and Panarin, S.I., Generation of Integral Rating by Statistical Processing of the Test Results, Autom. Remote Control, 2012, vol. 73, no. 6, pp. 1029–1045.
Meijer, R.R. and Sotaridona, L.S., Detection of Advance Item Knowledge Using Response Times in Computer Adaptive Testing, in Law School Admission Council Computerized Testing Report, 2006.
Van der Linden, W.J., Scrams, D.J., Schnipke, D.L., et al., Using Response-time Constraints to Control for Differential Speededness in Computerized Adaptive Testing, Appl. Psycholog. Meas., 1999, vol. 60, no. 3, pp. 195–210.
Naumov, A.V. and Inozemtsev, A.O., Algorithm to Generate Individual Tasks in the Remote Learning Systems, Vestn. Komp. Inform. Tekhnol., 2013, vol. 74, no. 6, pp. 35–42.
Kan, Yu.S. and Kibzun, A.I., Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami (Problems of Stochastic Programming with Probabilistic Criteria), Moscow: Fizmatlit, 2009.
Naumov, A.V. and Ivanov, S.V., On Stochastic Linear Programming Problems with the Quantile Criterion, Autom. Remote Control, 2011, vol. 72, no. 2, pp. 353–369.
Polyak, B.T., Vvedenie v optimizatsiyu, Moscow: Nauka, 1983. Translated into English under the title Introduction to Optimization, New York: Optimization Software, 1987.
Kibzun, A.I., Naumov, A.V., and Norkin, V.I., On Reducing a Quantile Optimization Problem with Discrete Distribution to a Mixed Integer Programming Problem, Autom. Remote Control, 2013, vol. 74, no. 6, pp. 951–967.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.V. Naumov, G.A. Mkhitaryan, 2016, published in Avtomatika i Telemekhanika, 2016, No. 9, pp. 124–135.
Rights and permissions
About this article
Cite this article
Naumov, A.V., Mkhitaryan, G.A. On the problem of probabilistic optimization of time-limited testing. Autom Remote Control 77, 1612–1621 (2016). https://doi.org/10.1134/S0005117916090083
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117916090083