Addressing retention and completion in MOOCs - a student-centric design approach

The recent development of massively open online courses (MOOCs) has led to a plethora of courses being offered to the general public, as students, but these have had extreme issues of retention and completion with MOOCs typically returning less than 10% of students completing the course. As part of the dCCDFLITE EU project, the authors developed a MOOC on entrepreneurship and innovation, highlighting distributed concurrent design (dCCD) and the Osterwalder Canvas as tools for student use. The course was designed to be student-centric, expecting that students would work through the learning materials independently and then form in groups, using CCD, to develop their business plans. However, the experience of this MOOC, presented statistically in this paper, was no different from the norm, which leads the authors to consider whether we require new pedagogical models for this type of online learning, and how we should measure success in such environments

Between coloring and list-coloring: μ-coloring

A new variation of the coloring problem, mu-coloring, is defined in this paper. A coloring of a graph G = (V,E) is a function f: V -> N such that f(v) is different from f(w) if v is adjacent to w. Given a graph G = (V,E) and a function mu: V -> N, G is mu-colorable if it admits a coloring f with f(v)<= mu(v) for each v in V. It is proved that mu-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. Besides, the notion of perfection is extended to mu-coloring, giving rise to a new characterization of cographs. Finally, a polynomial time algorithm to solve mu-coloring for cographs is shown.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; ArgentinaFil: Cecowski Palacio, Mariano. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentin

Between coloring and list-coloring: µ-coloring, Electron

A new variation of the coloring problem, µ-coloring, is defined in this paper. A coloring of a graph G = (V, E) is a function f: V → N such that f(v) � = f(w) if v is adjacent to w. Given a graph G = (V, E) and a function µ: V → N, G is µ-colorable if it admits a coloring f with f(v) ≤ µ(v) for each v ∈ V. It is proved that µ-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. Furthermore, the notion of perfection is extended to µ-coloring, giving rise to a new characterization of cographs. Finally, a polynomial time algorithm to solve µ-coloring for cographs is shown

The M2DC Project: Modular Microserver DataCentre

Cecowski M, Agosta G, Oleksiak A, et al. The M2DC Project: Modular Microserver DataCentre. In: 2016 Euromicro Conference on Digital System Design (DSD). Institute of Electrical and Electronics Engineers (IEEE); 2016

M2DC: Modular Microserver Datacentre with Heterogeneous Hardware

Oleksiak A, Kierzynka M, Piatek W, et al. M2DC: Modular Microserver Datacentre with Heterogeneous Hardware. Presented at the Energy-efficient Servers for Cloud and Edge Computing 2017 Workshop (ENeSCE 2017) - co-located with HiPEAC 2017, Stockholm, Sweden