In this paper we will discuss how the planning and assessment of a first year programming course was changed and the preliminary findings of the influence it had on students' grades. The main teaching method was lecturing followed by practical lessons for students. Also, recording of lectures were available on-line for the students. The assessment was rather traditional with some tasks and assignment during the semester and a final written exam. The organisation of the teaching and assessment was changed with a help of a digital exam assessment system.
{"title":"Rethinking teaching and assessing in a programming course a case study","authors":"Ásrún Matthíasdóttir, Hallgrímur Arnalds","doi":"10.1145/2812428.2812470","DOIUrl":"https://doi.org/10.1145/2812428.2812470","url":null,"abstract":"In this paper we will discuss how the planning and assessment of a first year programming course was changed and the preliminary findings of the influence it had on students' grades. The main teaching method was lecturing followed by practical lessons for students. Also, recording of lectures were available on-line for the students. The assessment was rather traditional with some tasks and assignment during the semester and a final written exam. The organisation of the teaching and assessment was changed with a help of a digital exam assessment system.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The process of gesturing in Human Robot Interaction has a complex character and can't be pre-programmed explicitly. Nowadays, teaching robots is a well established concept ranging from demonstration by variants of teleoperation to imitation by external observations. We propose an innovative approach for imitation learning of robots by integrating Microsoft Kinect motion-sensing device and PID Controller with direct feedback from an originally developed sensor for angular displacement mounted in the robot joint. The robot learns by external observations of the teacher poses by Kinect sensor. By analytic approach for inverse kinematics, joint angles that satisfy the desired pose over time are calculated and transmitted to PID controller. The angular displacement measured in joint space is used to observe the performance of the system as an approximation for the deviation of end-effectors from the desired trajectory.
{"title":"Imitation learning of robots by integrating Microsoft kinect and PID controller with a sensor for angular displacement in a robot joint","authors":"Rositsa Botsova, A. Lekova, I. Chavdarov","doi":"10.1145/2812428.2812455","DOIUrl":"https://doi.org/10.1145/2812428.2812455","url":null,"abstract":"The process of gesturing in Human Robot Interaction has a complex character and can't be pre-programmed explicitly. Nowadays, teaching robots is a well established concept ranging from demonstration by variants of teleoperation to imitation by external observations. We propose an innovative approach for imitation learning of robots by integrating Microsoft Kinect motion-sensing device and PID Controller with direct feedback from an originally developed sensor for angular displacement mounted in the robot joint. The robot learns by external observations of the teacher poses by Kinect sensor. By analytic approach for inverse kinematics, joint angles that satisfy the desired pose over time are calculated and transmitted to PID controller. The angular displacement measured in joint space is used to observe the performance of the system as an approximation for the deviation of end-effectors from the desired trajectory.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128696773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Our aim was to motivate and support more active student-teacher collaboration by using the students' mobile devices in class activities. We designed a mobile application called QTvity that can be used by the lecturer to prepare questions related to the lecture contents. During the lectures, the application allows the lecturer to interactively display each question on the students' mobile devices and to designate the time period in which the students can submit their answers. The answers are then projected on the screen and discussed by the lecturer and students. Our experience of using QTvity indicates that the majority of students accept it as a motivating challenge, especially when their participation is stimulated with additional scoring that can improve their final grades. Among many benefits of such lectures compared to traditional ones we found out that the students not only pay more attention to the topics discussed during the lectures, but also tend to use their devices less for other distracting purposes (e.g. browsing social networks and writing messages to their friends). While both students and lecturers reported about improved student-teacher interaction, students appreciated also better peer-to-peer communication in the learning process. Analysis of students' feed-back revealed some subtle issues that contribute to better understanding of students' behaviour and indicate directions for further improvements of the system.
{"title":"QTvity: advancing students' engagement during lectures by using mobile devices","authors":"B. Cestnik, M. Bohanec, T. Urbancic","doi":"10.1145/2812428.2812467","DOIUrl":"https://doi.org/10.1145/2812428.2812467","url":null,"abstract":"Our aim was to motivate and support more active student-teacher collaboration by using the students' mobile devices in class activities. We designed a mobile application called QTvity that can be used by the lecturer to prepare questions related to the lecture contents. During the lectures, the application allows the lecturer to interactively display each question on the students' mobile devices and to designate the time period in which the students can submit their answers. The answers are then projected on the screen and discussed by the lecturer and students. Our experience of using QTvity indicates that the majority of students accept it as a motivating challenge, especially when their participation is stimulated with additional scoring that can improve their final grades. Among many benefits of such lectures compared to traditional ones we found out that the students not only pay more attention to the topics discussed during the lectures, but also tend to use their devices less for other distracting purposes (e.g. browsing social networks and writing messages to their friends). While both students and lecturers reported about improved student-teacher interaction, students appreciated also better peer-to-peer communication in the learning process. Analysis of students' feed-back revealed some subtle issues that contribute to better understanding of students' behaviour and indicate directions for further improvements of the system.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128513699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, Educational Data Mining and Learning Analytics are used in order to find out what impacts Programming 1 success most, since increase in the passing rate has been detected. The research is conducted on the dataset compounded of two parts: the first part is extracted from the Learning Management System (LMS) Moodle logs, while the second part is related to prior knowledge and students' preparation for the study. Classification methods are used to detect connections between prior knowledge and Moodle course activity in relation to final grades.
{"title":"Mining student data to assess the impact of moodle activities and prior knowledge on programming course success","authors":"Sabina Sisovic, M. Matetić, Marija Brkic Bakaric","doi":"10.1145/2812428.2812459","DOIUrl":"https://doi.org/10.1145/2812428.2812459","url":null,"abstract":"In this paper, Educational Data Mining and Learning Analytics are used in order to find out what impacts Programming 1 success most, since increase in the passing rate has been detected. The research is conducted on the dataset compounded of two parts: the first part is extracted from the Learning Management System (LMS) Moodle logs, while the second part is related to prior knowledge and students' preparation for the study. Classification methods are used to detect connections between prior knowledge and Moodle course activity in relation to final grades.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127802888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a graph-based algorithmic technique for malware detection. More precisely, we utilize the system-call dependency graphs (or, for short, ScD graphs), obtained by capturing taint analysis traces and a set of various similarity metrics in order to detect whether an unknown test sample is a malicious or a benign one. For the sake of generalization, we decide to empower our model against strong mutations by applying our detection technique on a weighted directed graph resulting from ScD graph after grouping disjoint subsets of its vertices. Additionally, we propose the Δ-Similarity metric, which is based on the Euclidean distance operating on the in-degree and out-degree of ScD's nodes along with their corresponding weights, distinguishing thus graph-representations of malware and benign software. Finally, we evaluate the potentials of our detection model and show that its performance makes it competing to other detection models.
{"title":"A graph-based model for malicious code detection exploiting dependencies of system-call groups","authors":"Stavros D. Nikolopoulos, Iosif Polenakis","doi":"10.1145/2812428.2812432","DOIUrl":"https://doi.org/10.1145/2812428.2812432","url":null,"abstract":"In this paper, we propose a graph-based algorithmic technique for malware detection. More precisely, we utilize the system-call dependency graphs (or, for short, ScD graphs), obtained by capturing taint analysis traces and a set of various similarity metrics in order to detect whether an unknown test sample is a malicious or a benign one. For the sake of generalization, we decide to empower our model against strong mutations by applying our detection technique on a weighted directed graph resulting from ScD graph after grouping disjoint subsets of its vertices. Additionally, we propose the Δ-Similarity metric, which is based on the Euclidean distance operating on the in-degree and out-degree of ScD's nodes along with their corresponding weights, distinguishing thus graph-representations of malware and benign software. Finally, we evaluate the potentials of our detection model and show that its performance makes it competing to other detection models.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper a set of functions for a compliance check language implemented in a limit software system is described. It is intended generally for the financial industry but it can also be used for any other field requiring similar automatic observation of limits on the allowed operations. The basic system organization as well as the compliance check language constructs are described and clarified.
{"title":"Compliance check software system","authors":"Ventsislav Nikolov","doi":"10.1145/2812428.2812445","DOIUrl":"https://doi.org/10.1145/2812428.2812445","url":null,"abstract":"In this paper a set of functions for a compliance check language implemented in a limit software system is described. It is intended generally for the financial industry but it can also be used for any other field requiring similar automatic observation of limits on the allowed operations. The basic system organization as well as the compliance check language constructs are described and clarified.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132223631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper examines standard methods for work- and production flow modelling, and find that in some regards they are fundamentally being naïve and erroneous. They simplify and "flatten" too much of the reality that they represent and allow much more than they can afford when it comes to using them for organizational re-design. The problem is exacerbated when computational handling is considered. In this paper we illustrate the shortcoming with two industrial case studies, which we have approached ethnographically and through workshops.
{"title":"Better workflow modelling of production processes: re-engineering enterprise, resource and material planning in computational logistics","authors":"S. Kristoffersen","doi":"10.1145/2812428.2812440","DOIUrl":"https://doi.org/10.1145/2812428.2812440","url":null,"abstract":"This paper examines standard methods for work- and production flow modelling, and find that in some regards they are fundamentally being naïve and erroneous. They simplify and \"flatten\" too much of the reality that they represent and allow much more than they can afford when it comes to using them for organizational re-design. The problem is exacerbated when computational handling is considered. In this paper we illustrate the shortcoming with two industrial case studies, which we have approached ethnographically and through workshops.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134541482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Antti Knutas, Arash Hajikhani, Juho Salminen, J. Ikonen, J. Porras
There is an increasing number of scientific articles being published, which makes tracking the state of the art more time-consuming. There are software tools available to help with systematic mapping studies in a field of science, but most of these tools are closed source and involve several manual time-consuming steps that could be automated further. We present an open solution as a cloud-based design for bibliographic analysis that makes the research method available for a wider audience.
{"title":"Cloud-based bibliometric analysis service for systematic mapping studies","authors":"Antti Knutas, Arash Hajikhani, Juho Salminen, J. Ikonen, J. Porras","doi":"10.1145/2812428.2812442","DOIUrl":"https://doi.org/10.1145/2812428.2812442","url":null,"abstract":"There is an increasing number of scientific articles being published, which makes tracking the state of the art more time-consuming. There are software tools available to help with systematic mapping studies in a field of science, but most of these tools are closed source and involve several manual time-consuming steps that could be automated further. We present an open solution as a cloud-based design for bibliographic analysis that makes the research method available for a wider audience.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In knowledge intensive organizations mentoring has emerged as an efficient practice for the development of these personnel. In this scenario, software development has evolved in the previous years due to the impact of globalization. Global Software Development (GSD) emerged to cover specific aspects of distributed software development in global settings. Taking this into account, personnel development practices in GSD must be a focus of interest for both practitioners and academics alike. This paper presents an exploratory study conducted by means of a Delphi technique on the significance of mentoring practices in GSD teams. Results highlight the importance of mentoring for cultural, team working and behavioural issues and give less importance to technical issues related to software development.
{"title":"Mitigating issues in global software developments by means of mentoring","authors":"Cristina Casado-Lumbreras, Ricardo Colomo Palacios","doi":"10.1145/2812428.2812460","DOIUrl":"https://doi.org/10.1145/2812428.2812460","url":null,"abstract":"In knowledge intensive organizations mentoring has emerged as an efficient practice for the development of these personnel. In this scenario, software development has evolved in the previous years due to the impact of globalization. Global Software Development (GSD) emerged to cover specific aspects of distributed software development in global settings. Taking this into account, personnel development practices in GSD must be a focus of interest for both practitioners and academics alike. This paper presents an exploratory study conducted by means of a Delphi technique on the significance of mentoring practices in GSD teams. Results highlight the importance of mentoring for cultural, team working and behavioural issues and give less importance to technical issues related to software development.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128751537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstra, taking care of current and future changing traffic loads on the highways. To use the maximal road capacity car drivers will be routed not only via the shortest individual route but also via routes with a small variation in traveling time. The algorithm has been tested in real life and simulation studies using a historic dataset of tracked cars.
{"title":"Dynamic routing using maximal road capacity","authors":"L. Rothkrantz","doi":"10.1145/2812428.2812450","DOIUrl":"https://doi.org/10.1145/2812428.2812450","url":null,"abstract":"Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstra, taking care of current and future changing traffic loads on the highways. To use the maximal road capacity car drivers will be routed not only via the shortest individual route but also via routes with a small variation in traveling time. The algorithm has been tested in real life and simulation studies using a historic dataset of tracked cars.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116647954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：