View: session overviewtalk overview
Title: "Open Community approaches to Education Publishing and Research - a look into the recent past.”
Abstract: "Open Education, Open Publishing and Open Research have been holding strong promises and received widespread public support. A look into the recent past shows however, that much of such promises have apparently not been realized. Instead, and much like the music, content, social network and software industries, it seems that after a relatively short time of liberty and freedom, the commercial forces have come back to play and taken full advantages to join the Open Hype Wave.”
Biography: Dr Andreas Meiszner is a seasoned portfolio worker who worked across a number of sectors and functions. In two of his most recent portfolios he has tutored, mentored and coached beyond 500 professional doctoral students (mid to seniors, aged 35 to 70), first with the University of Liverpool (UK), and since 2016 also with the DoctorateHub. 500+ students imply 500+ workplace-based problems from 500+ organizations from across the globe. This allowed Andreas to understand how to tackle problems at scale, be it the tame, the complex, or the wicked.
10:30 | Challenges faced by students in an Open Source Software Undergraduate Course ABSTRACT. The Open Source Software (OSS) development is gaining popularity from year to year, however, entering the OSS community still remains a challenging task. In this work, we describe challenges faced by a beginner OSS code-developer during the first contribution. Additionally, we analyze our experience and offer hints for potential newcomers. Whole work was done as the project of the Open Source Software undergraduate course at the Computer Department of Nazarbayev University. |
11:00 | Open Source Software as a Learning Tool for Computer Science Students PRESENTER: Assiya Khuzyakhmetova ABSTRACT. In this paper student experience of contributing to Open Source Software (OSS) is described. Contributions were done as a part of the OSS course taken at Nazarbayev University during Spring 2019 term. Two students described their experience: Assiya Kuzyakhmetova and Aidarbek Suleimenov. Their motivations to contribute to OSS, selected projects and the lists of activities were also mentioned in this paper. Assessment of this experience is also done in this publication. |
11:30 | A Survey of Learning Methods in Open Source Software PRESENTER: Aidarbek Suleimenov ABSTRACT. Open source software (OSS) is usually developed by heterogeneous groups of people, each with their own interests, motivations and abilities. Therefore, it is important to establish the best software development and contributing practices early in the life-time of the project. Such practices should foster contributors' involvement in the open-source project as quickly as possible. The sustainability of an OSS project is heavily based on the underlying community of contributors and on the knowledge and skills they bring to the project and they acquire and develop through their participation in the project and interaction with the project community. Therefore, identifying and investigating contributors' learning processes is an important research area in OSS. This survey paper presents an overview of open source learning methods in order to explore how community interaction impacts the development and application of OSS learning processes in other areas, especially in education. It is argued that collaboration with peers and consistent code contributions result in learning progress in OSS. Typical research in this area is based on case by case analysis, whereas this survey will try to highlight and combine the outcomes of several research contributions from the literature. |
12:00 | A Calculus of Chaos in Stochastic Compilation: Engineering in the Cause of Mathematics PRESENTER: Peter T. Breuer ABSTRACT. An unexpected result from an open project to develop a `chaotic' compiler for ANSI C is described here: an information entropy calculus for stochastically compiled programs. A stochastic compiler produces randomly different object codes every time it is applied to the same source code. The calculus quantifies the entropy introduced into the run-time program traces by the compiler, allowing the strategy for maximum entropy to be characterised and that the compiler implements it to be verified. The analysis aims to support the argument that, on a suitable run-time platform and via any polynomial time method, the programmer's intention is unreadable from the trace, as word length n tends to infinity. |