UNIV. NEWS. NORTH-CAUCAS. REG. TECHNICAL SCIENCES SERIES. 2016; 1: 15-19
http://dx.doi.org/10.17213/0321-2653-2016-1-15-19
MODELLING OF E-LEARNING USING TEMPORAL AND RANDOM GRAPHS
Ivanchenko Alexander Nikolaevich – Candidate of Technical Sciences, professor, department «Software Computer Engineering», Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: ian2008.52@mail.ru
Nguyen Van Ngon – post-graduate student, department «Software Computer Engineering», Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: ngon_npi@mail.ru
Shayda Alexsey Yurevich – lecturer, department «Software Computer Engineering», Platov South-Russian State Polytechnic University (NPI), Novocherkassk, Russia. E-mail: alexsey_@mail.ru
Abstract
The graph model of the educational program, consisting of learning objects, related by the precedence relation-repetition and the conditions of admission to the next learning object based on the certification results for the previous object. Used temporal graphs that allows to take into account topology changes, due to both the «reduction» of a graph as a result of successful mastery of educational facilities, and local extension due to the need of re-testing due to "combustion" points over time. Developed a heuristic algorithm to choose the next learning object, the effectiveness of which is demonstrated on simulation model. An original algorithm of generating random graphs in the multilevel parallel form, which is used for verification of simulation models.
Keywords: e-learning; curriculum; learning object; modeling; temporal graph; presence function; latency function; random graph.
Full text: [in elibrary.ru]
References
1. Thanassis Hadzilacos, Dimitris Kalles, Dionysis Karaiskakis, Maria Pouliopoulou.Using Graphs in Developing Educational Material // Proceedings of the 2nd International Workshop on Building Technology Enhanced Learning Solutions for Communities of Practice. TEL-CoPs'07. Sissi, Lassithi Crete. Greece, 18 September, 2007. URL: http://ceur-ws.org/Vol-308/paper04.pdf (accessed 20.11.2015).
2. Remco van der Hofstad. Random Graphs and Complex Networks. Vol. I. Department of Mathematics and Computer Science Eindhoven University of Technology. 2015. p. 336.
3. Ivanchenko A. N., Nguen Van Ngon. Imitacionnoe modelirovanie processa osvoenija modul'noj obrazovatel'noj programmy [Simulation modeling of the process study of the modular curriculum]. Izv. vuzov. Sev.-Kavk. Region. Tehn. Nauki, 2015, no. 3, pp. 28-33.
4. Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro. Time-Varying Graphs and Dynamic Networks // Proc. 10th International conference on Ad Hoc and Wireless Networks (ADHOC-NOW 2011) July 18-20, 2011, Paderborn, Germany. URL:http://arxiv.org/pdf/1012.0009.pdf (accessed 20.11.2015).
5. Kolchin V.F. Sluchajnye grafy [Random Graphs]. Moscow, Fizmatlit Publ., 2004, 256 p.
6. Rajgorodskij A.M. Modeli sluchajnyh grafov [Models of random graphs]. Moscow, MCNMO, 2011, 136 p.
7. Pospelov D.A. Vvedenie v teoriju vychislitel'nyh sistem [Introduction to Computing Systems]. Moscow, Sov. radio, 1972, 280 p.
8. Kurganskaja G.S. Model' predstavlenija znanij i sistema differencirovannogo obuchenija cherez Internet na ego osnove [The model of knowledge representation and a system of differentiated instruction through the Internet based on it]. Izv. Cheljabinskogo nauchnogo centra UrO RAN, 2000, no. 2, pp. 84-88.