Proceedings of International Conference on Applied Innovation in IT
2016/03/10, Volume 4, Issue 1, pp.31-34

Optimization of the Modular Educational Program Structure


Alexandr Ivanchenko, Anastasia Kolomiets, Dmitriy Grinchenkov, Nguyen Van Ngon


Abstract: Optimized structure of the educational program consisting of a set of the interconnected educational objects is offered by means of problem solution of optimum partition of the acyclic weighed graph. The condition of acyclicity preservation for subgraphs is formulated and the quantitative assessment of decision options is executed. The original algorithm of search of quasioptimum partition using the genetic algorithm scheme with coding chromosomes by permutation is offered. Object-oriented realization of algorithm in language C++ is described and results of numerical experiments are presented.

Keywords: e-learning, educational program, educational object, computer testing, acyclic weighed graph, number partition, graph partition, random permutation, genetic algorithm, object-oriented approach

DOI: 10.13142/KT10004.06

Download: PDF

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
  2. Ivanchenko A. N., Nguyen Van Ngon. Simulation modeling of the process study of the modular curriculum // University News. North-Caucasian Region. Technical Sciences Series. 2015; 3: 28-33
  3. Ivanchenko A. N., Nguyen Van Ngon. Modelling of e-learning using temporal and random graphs // University News. North-Caucasian Region. Technical Sciences Series. 2016; 1: 15-19
  4. D.L. Kreher and D.R. Stinson, Combinatorial Algorithms: Generation, Enumeration and Search, CRC press LTC , Boca Raton, Florida, 1998. 340p.
  5. W. Kocay and D.L. Kreher, Graphs, Algorithms, and Optimization, Chapman \& Hall/CRC Press, Boca Raton, Florida, 2005.
  6. CME342/AA220/CS238 - Parallel Methods in Numerical Analysis. Graph Partitioning Algorithms. Stanford University. Stanford, California. URL: http://web.stanford.edu/class/cs238/lect_notes/lecture12-13-05.pdf
  7. Gladkov L.A. The bioinspired methods in optimization / L.A. Gladkov, V. V. Kureychik, V. M. Kureychik, P. V. Sorokoletov. – M.: FIZMATLIT, 2009. - 384 pages.
  8. Kureychik, V. V. Theory of evolutionary calculations / V. V. Kureychik, V. M. Kureychik, S. I. Rodzin. – M.: Fizmatlit, 2012. – 260 p.
  9. Rutkovskaya D. Neural networks, genetic algorithms and indistinct systems / D. Rutkovskaya, M. Pilinsky, L. Rutkovsky. – M.: The hotline – Telecom, 2013. – 384 pages.
  10. Karpenko A.P. Modern algorithms of search optimization. The algorithms inspired by the nature: manual / A.P. The Karpenka – M.: MGTU publishing house of N.E Bauman, 2014. – 446 p.
  11. Nicolai M. Josuttis. The C++ Standard library: A Tutorial and reference (2nd edition) / Nicolai M. Josuttis // Publisher Addison-Wesley Professional. - 2012. - 1128 p.
  12. Musser D.A., Stepanov A.A. Generic Programming / David A. Musser, Alexander A. Stepanov // Proceeding of International Symposium on Symbolic and Algebraic Computation, vol. 358 of Lecture Notes in Computer Science, pp. 13–25, Rome, Italy, 1988.
  13. Stepanov A.A., Mac-Jones P. Beginnings of programming: Transl. from English / A.A. Stepanov, P. Mac-Jones//M.: LLC I.D. Williams, 2011. – 272 pages.
  14. Petrochenkov A. Practical Aspects of Genetic Algorithms’ Implementation in Life Cycle Management of Electrotechnical Equipment. Proc. of the 3rd International Conference on Applied Innovations in IT, (ICAIIT), March 2015. URL: http://icaiit.org/proceedings/ 3rd_ICAIIT/1.pdf
  15. Grinchenkov D.V., Kushchy D. N. Methodological, technological and legal aspects of use of electronic educational resources. // University News. North-Caucasian Region. Technical Sciences Series. 2013. No. 2 (171). Page 118-123.


    HOME

       - Call for Papers
       - Paper Submission
       - For authors
       - Important Dates
       - Conference Committee
       - Editorial Board
       - Reviewers
       - Last Proceedings


    PROCEEDINGS

       - Volume 12, Issue 1 (ICAIIT 2024)        - Volume 11, Issue 2 (ICAIIT 2023)
       - Volume 11, Issue 1 (ICAIIT 2023)
       - Volume 10, Issue 1 (ICAIIT 2022)
       - Volume 9, Issue 1 (ICAIIT 2021)
       - Volume 8, Issue 1 (ICAIIT 2020)
       - Volume 7, Issue 1 (ICAIIT 2019)
       - Volume 7, Issue 2 (ICAIIT 2019)
       - Volume 6, Issue 1 (ICAIIT 2018)
       - Volume 5, Issue 1 (ICAIIT 2017)
       - Volume 4, Issue 1 (ICAIIT 2016)
       - Volume 3, Issue 1 (ICAIIT 2015)
       - Volume 2, Issue 1 (ICAIIT 2014)
       - Volume 1, Issue 1 (ICAIIT 2013)


    PAST CONFERENCES

       ICAIIT 2024
         - Photos
         - Reports

       ICAIIT 2023
         - Photos
         - Reports

       ICAIIT 2021
         - Photos
         - Reports

       ICAIIT 2020
         - Photos
         - Reports

       ICAIIT 2019
         - Photos
         - Reports

       ICAIIT 2018
         - Photos
         - Reports

    ETHICS IN PUBLICATIONS

    ACCOMODATION

    CONTACT US

 

DOI: http://dx.doi.org/10.25673/115729


        

         Proceedings of the International Conference on Applied Innovations in IT by Anhalt University of Applied Sciences is licensed under CC BY-SA 4.0


                                                   This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License


           ISSN 2199-8876
           Publisher: Edition Hochschule Anhalt
           Location: Anhalt University of Applied Sciences
           Email: leiterin.hsb@hs-anhalt.de
           Phone: +49 (0) 3496 67 5611
           Address: Building 01 - Red Building, Top floor, Room 425, Bernburger Str. 55, D-06366 Köthen, Germany

        site traffic counter

Creative Commons License
Except where otherwise noted, all works and proceedings on this site is licensed under Creative Commons Attribution-ShareAlike 4.0 International License.