Abstract
Because of interoperability issues, intelligent tutoring systems are difficult to deploy in current educational platforms without additional work. This limitation is significant because tutoring systems require considerable time and resources for their implementation. In addition, because these tutors have a high educational value, it is desirable that they could be shared, used by many stakeholders, and easily loaded onto different platforms. This paper describes a new approach to implementing open-source and interoperable intelligent tutors through standardization. In contrast to other methods, our technique does not require using nonstandardized peripheral systems or databases, which would restrict the interoperability of learning objects. Thus, our approach has the advantage of yielding tutors that are fully conformant to e-learning standards and that are free of external resource dependencies. According to our method, atomic tutoring systems are grouped to create molecular tree structures that cover course modules. In addition, given the interoperability of our technique, tutors can also be combined to create courses that have distinct granularities, topics, and target students. The key to our method is the focus on assuring what defines a tutor in terms of behavior and functionalities (inner loops and outer loops). Our proof of concept was developed using SCORM standards. This paper presents the implementation details of our technique, including the theoretical concepts, technical specifications, and practical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.