Web-based course support systems: an essential tool for supporting flexible learning environment

In Higher Education web-based course support systems are essential for supporting flexible learning environments. They provide tools to enable the interaction between student and tutor to reinforce transfer of theory to understanding particularly in an academic environment, therefore this paper will examine issues associated with the use of curriculum and learning resources within Web-based course support systems and the effectiveness of the resulting flexible learning environments This paper is a general discussion about flexible learning and in this case how it was applied to one of the courses at undergraduate level one. The first section will introduce what is flexible learning and the importance of flexible learning in Higher Education followed by the description of the course and why the flexible learning concepts is important in such a course and finally, how the flexibility was useful for this particular instance.

Structured reflection breaks embedded in an online course – effects on learning experience, time on task and performance

The purpose of this article is to gain an insight into the effects of practicing short, frequent,and structured reflection breaks interspersed with the learning material in a computer-based course. To that end, the study sets up a standardized control trial with two groups of secondary school pupils. The study shows that while performance is not affected by these embedded “reflection rituals,” they significantly impact time on task and perceived learning. The study also suggests that the exposure to such built-in opportunities for reflection modifies the engagement with the content and fosters the claimed readiness for application of a similar reflective approach to learning in other occasions.

A Competence-Based Course Authoring Concept for Learning Platforms with Legacy Assignment Tools

This paper is concerned with several of the most important aspects of Competence-Based Learning (CBL): course authoring, assignments, and categorization of learning content. The latter is part of the so-called Bologna Process (BP) and can effectively be supported by integrating knowledge resources like, e.g., standardized skill and competence taxonomies into the target implementation approach, aiming at making effective use of an open integration architecture while fostering the interoperability of hybrid knowledge-based e-learning solutions. Modern scenarios ask for interoperable software solutions to seamlessly integrate existing e-learning infrastructures and legacy tools with innovative technologies while being cognitively efficient to handle. In this way, prospective users are enabled to use them without learning overheads. At the same time, methods of Learning Design (LD) in combination with CBL are getting more and more important for production and maintenance of easy to facilitate solutions. We present our approach of developing a competence-based course-authoring and assignment support software. It is bridging the gaps between contemporary Learning Management Systems (LMS) and established legacy learning infrastructures by embedding existing resources via Learning Tools Interoperability (LTI). Furthermore, the underlying conceptual architecture for this integration approach will be explained. In addition, a competence management structure based on knowledge technologies supporting standardized skill and competence taxonomies will be introduced. The overall goal is to develop a software solution which will not only flawlessly merge into a legacy platform and several other learning environments, but also remain intuitively usable. As a proof of concept, the so-called platform independent conceptual architecture model will be validated by a concrete use case scenario.

An Extended Implementation of the Great Deluge Algorithm for Course Timetabling

Course Scheduling consists of assigning lecture events to a limited set of specific timeslots and rooms. The objective is to satisfy as many soft constraints as possible, while maintaining a feasible solution timetable. The most successful techniques to date require a compute-intensive examination of the solution neighbourhood to direct searches to an optimum solution. Although they may require fewer neighbourhood moves than more exhaustive techniques to gain comparable results, they can take considerably longer to achieve success. This paper introduces an extended version of the Great Deluge Algorithm for the Course Timetabling problem which, while avoiding the problem of getting trapped in local optima, uses simple Neighbourhood search heuristics to obtain solutions in a relatively short amount of time. The paper presents results based on a standard set of benchmark datasets, beating over half of the currently published best results with in some cases up to 60% of an improvement.