Development of the mechanism of intellectual management of “student-lecturer” relations in the space of virtual education with the use of neural networks

Research objective. The paper deals with the solution of the problem of regulation of lecturer and student relations using neural networks for bimodal electronic universities. First, the approaches of other authors to this topic are explored.

It is known that in bimodal electronic universities, students are trained both in the traditional order and outside the classroom (in distance form). Studies show that for traditional universities there are different approaches with the use of expert systems, genetic algorithms to solve this

Development of the mechanism of intellectual management of “student-lecturer” relations  in the space of virtual education with the use of neural networks problem. However, the problem is not solved using neural networks, as well as for students who have an off-campus. The relationship between lecturers and students in universities is regulated by the schedule of lessons.

Materials and methods. Schedule of lessons is available in various combinations. The combination of the schedule of lessons is determined once in the beginning of each semester for traditional education, but these combinations are constantly changing in the distance learning environment. These changes are due to the requirement of independence of time and space for distance learning environments. This indicates the relevance of the problem and the compatibility of the use of neural networks to solve the problem. In the presented paper, to solve the problem, the schedule of classes is considered as a matrix. As you know, it is easier to process matrix elements when it is in the form of numbers. To this end, the subjects to be taught in the group are numbered according to the lecturers who will teach them. Then the schedule of lessons is compiled in an arbitrary combination of matrices 3×5 in accordance with the weekly schedule of lessons.

Methods of research. The solution process is implemented in the MATLAB environment. To simplify the solution process, the matched matrix is converted to a single row matrix using the RESHAPE command. Then, all combinations of a single row matrix are obtained by applying the PERMS function. As a result, we obtain 15!×15 – dimensional matrix. This matrix is used as the target matrix of the neural network.

After that, the weekly schedule of each lecturer’s training is also compiled as a matrix of 3×5, called the “lecturer employment matrix” and is marked as M (I) according to the numbers of the lecturers. Elements of “lecturer employment matrices” can get the value “0” or “İ”. The value of the matrix element is “0”, indicates that the lecturer is busy, and “İ” is free. At the next stage, the “employment matrix” for each lecturer turns into a linear matrix 1×15. Then an input matrix is constructed that combines the elements of the “employment matrix” of lecturers with each element of the target matrix. The weight coefficients for neurons are defined as the difference from the target matrix of the input matrix.

Results of the study. Thus, the problem is introduced into a two-dimensional linear equation. Then, the neural network model is selected, tuned and trained in accordance with the conditions of the problem.

Conclusion. In the end, the network is tested with input prices that correspond to the interests of the user. The schedule of lessons according to the received results is represented. At the end of the paper, the method side for the distance learning process is useful.

1. The Open University. [Internet] Available from: http://www.tec.open.ac.uk/systems/st.html

2. Requirements for scheduling at the university. What you need to know? [Internet] Available from: http://www.pulsar.ru/news/1629/

3. Mammadova M.H., Gasimov H.A. E-university: conceptual, technological and architectural approaches. Problems of information technology. [Internet]. 2017; 2: 56–68 Available from: http://jpit.az/az/journals/189 DOI: 10.25045/jpit.v08.12.06 (In Azerbaijani)

4. Rizun Nina. The Use of Decomposition Methods in the Solution of a Multicriterion Problem of Automation of Schedule Creation in Institutes of Higher Education. Eastern-European Journal of Enterprise Technologies, 2013.

5. The IBM global campus [Internet] Available from: http://ike.engr.washington.edu/igc/

6. Yenbamrung, petamaporn. The emerging electronic university: distance education for the twenty-first century. 16th World conference of the international council for distance education. Bangkok: icde, 1992: 317–321.

7. Dvoryankin A. M., Chalyshev V. S. O Review of the methods of compiling the schedule of universities. Izvestiya Volgogradskogo Gosudarstvennogo Tekhnicheskogo Universiteta = News of the Volgograd State Technical University. 2011; 9: 110–113. (In Russ.)

8. Bezginov A. N. , Tregubov S. Y. ulti-criteria approach to the assessment of class schedules based on fuzzy logic. Problemy upravleniya = Control problems. 2011; 2: 52–59 (In Russ.)

9. Burnasov P.V. Mathematical formulation of the task of scheduling classes. Vestnik IrGTU = Bulletin of ISTU. [Internet]. 2014; 4 (87). Available from: https://cyberleninka.ru/article/n/matematicheskaya-postanovka-zadachi-sostavleniya-raspisaniya-zanyatiy (cited: 27.09.2018). (In Russ.)

10. Snityuk V.E., Sipko E.N. On the peculiarities of the formation of the objective function and limitations in the task of scheduling classes. Matematichnі mashini і sistemi = Math Machines and Systems. 2014; 3: 88–95. (In Russ.)

11. Vishnyakova I.N., Razumov S.Y. Simulation and automation of scheduling studies of universities. Nauka i progress transporta. Vestnik Dnepropetrovskogo natsional’nogo universiteta zheleznodorozhnogo transporta. = Science and transport progress. Bulletin of the Dnipropetrovsk National University of Railway Transport. [Internet]. 2007; 17. Available from: https://cyberleninka.ru/article/n/modelirovanie-i-avtomatizatsiya-sostavleniya-raspisaniya-uchebnyh-zanyatiy-vuzov (cited: 27.09.2018). (In Russ.)

12. Erunov V. P., Morkovin I. I. Formation of the optimal schedule of studies in high school. Bulletin of OSU. [Internet]. 2001; 3. Available from: http://vestnik.osu.ru/2001_3/7.pdf (cited: 27.09.2018). (In Russ.)

13. Artificial neural network. [Internet]. Available from: https://ru.wikipedia.org/wiki/iskusstvennaya_neyronnaya_set’ (In Russ.)

14. Klevanskiy N.N. Formation of the schedule of employment of higher educational institutions. Obrazovatel’nyye resursy i tekhnologii = Educational resources and technologies. [Internet]. 2015; 1 (9). Available from: https://cyberleninka.ru/article/n/formirovanie-raspisaniya-zanyatiy-vysshih-uchebnyh-zavedeniy (cited: 27.09.2018). (In Russ.)

15. Bezuglyy M. A., Sekirin A. I. Methods of increasing the efficiency of scheduling in the conditions of an educational institution. Mezhdunarodnaya nauchno-tekhnicheskaya konferentsiya studentov, aspirantov i molodykh uchenykh. Komp’yuternaya i programmnaya inzheneriya – 2015. = International Scientific and Technical Conference of Students, Postgraduates and Young Scientists. Computer and Software Engineering – 2015. Donetsk: Donetsk National Technical University, 2015. [Internet]. Available from: http://masters.donntu.org/2016/fknt/bezuglyi/library/6.htm (In Russ.)

16. Saitov N.Z. Problems of scheduling classes in universities in the organization of the educational process based on credit technologies. Universum: Tekhnicheskiye nauki = Universum: Technical Sciences. [Internet]. 2016; 2 (24). Available from: http://7universum.com/ru/tech/archive/item/2969. (In Russ.)

17. Snityuk V.E., Sipko E.N. Penalty functions in the task of scheduling classes. Matematichnі mashini і sistemi = Mathematical Machines and Systems. 2015; 3. (In Russ.)

18. Astakhova I.F., Firas A.M. Scheduling training sessions based on a genetic algorithm. Vestnik VGU, seriya: sistemnyy analiz i informatsionnyye tekhnologii. = Bulletin of ASTU. Series: Management, Computer Engineering and Computer Science. 2013; 2: 93 – 99 (In Russ.)

19. Khasukhadzhiyev A.S., Sibikina I.V. The generalized algorithm of scheduling at the university with the new requirements of the federal state educational standards Vestnik AGTU. Seriya: Upravleniye, vychislitel’naya tekhnika i informatika. = Bulletin of ASTU. Series: Management, Computer Engineering and Computer Science. [Internet]. 2016; 3. Available from: https://cyberleninka.ru/article/n/obobschennyy-algoritm-sostavleniya-raspisaniya-v-vuze-s-uchetom-novyh-trebovaniy-federalnyh-gosudarstvennyh-obrazovatelnyh-standartov (cited: 27.09.2018). (In Russ.)

20. Beregovykh Y.V., Vasil’yev B.A., Volodin N.A. Algorithm for scheduling classes. Shtuchniy іntelekt. [Internet]. 2009; 2: 50-56. Available from: http://dspace.nbuv.gov.ua/handle/123456789/7897 (In Russ.)

21. Yandybayeva N.V. Genetic algorithm in the task of optimizing the university school timetable. Sovremennyye naukoyemkiye tekhnologii = Modern high technologies. [Internet]. 2009; 11: 97–98. Available from: http://www.top-technologies.ru/ru/article/view?id=25972 (cited: 27.08.2018). (In Russ.)