This paper deals with a searching problem of digital content items with mobile agents in the network, the topology of which is assumed to be unknown to the agents in the initial state. We previously proposed a scheme with the use of plural management nodes, to which the agents send their search progress individually. The entire search progress can be shared by all the agents with the use of communications among the management nodes. However, because it takes some time for the progress sharing through the plural management nodes, there often exists a time lag between the actual total search progress and its recognition by the agents. This makes plural agents search the same nodes redundantly, and degrades the total search efficiency. Accordingly, in this paper, we propose an improved content search scheme that manages the search progress by a single node, and discuss the efficiency of the scheme using computer simulations.
{"title":"An Efficient Content Search Progress Sharing among Mobile Network Agents","authors":"Y. Shiraki, S. Sugawara","doi":"10.1145/3395245.3396413","DOIUrl":"https://doi.org/10.1145/3395245.3396413","url":null,"abstract":"This paper deals with a searching problem of digital content items with mobile agents in the network, the topology of which is assumed to be unknown to the agents in the initial state. We previously proposed a scheme with the use of plural management nodes, to which the agents send their search progress individually. The entire search progress can be shared by all the agents with the use of communications among the management nodes. However, because it takes some time for the progress sharing through the plural management nodes, there often exists a time lag between the actual total search progress and its recognition by the agents. This makes plural agents search the same nodes redundantly, and degrades the total search efficiency. Accordingly, in this paper, we propose an improved content search scheme that manages the search progress by a single node, and discuss the efficiency of the scheme using computer simulations.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292617","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}
Kazuho Kanahara, K. Katayama, N. Funabiki, E. Tomita
A programming education is one of the most important fields in Information and Education Technology. Funabiki et al. have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS mainly provides two types of problems, namely the code writing problem and the fill-in-blank problem, to support students' self-studies at various learning levels. Particularly in the fill-in-blank problem (FIBP), the system requires an efficient algorithm to find a maximal clique of the compatibility graph in advance in order to obtain a maximal set of blank elements with unique answers. In this paper, we investigate the performance of a metaheuristic algorithm based on an iterated local search for solving the maximum weight clique problem (MWCP), which is an important generalization of the maximum clique problem, given as an extension of the compatibility graph in the FIBP. Computational results show that our metaheuristic algorithm is capable of finding satisfactory weighted cliques efficiently for well-known benchmark graphs and the performance of our algorithm is comparable to those of state-of-the-art metaheuristics for the MWCP.
{"title":"The Performance of a Metaheuristic Algorithm for Finding a Maximal Weight Clique in the Fill-in-Blank Problem","authors":"Kazuho Kanahara, K. Katayama, N. Funabiki, E. Tomita","doi":"10.1145/3395245.3396407","DOIUrl":"https://doi.org/10.1145/3395245.3396407","url":null,"abstract":"A programming education is one of the most important fields in Information and Education Technology. Funabiki et al. have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS mainly provides two types of problems, namely the code writing problem and the fill-in-blank problem, to support students' self-studies at various learning levels. Particularly in the fill-in-blank problem (FIBP), the system requires an efficient algorithm to find a maximal clique of the compatibility graph in advance in order to obtain a maximal set of blank elements with unique answers. In this paper, we investigate the performance of a metaheuristic algorithm based on an iterated local search for solving the maximum weight clique problem (MWCP), which is an important generalization of the maximum clique problem, given as an extension of the compatibility graph in the FIBP. Computational results show that our metaheuristic algorithm is capable of finding satisfactory weighted cliques efficiently for well-known benchmark graphs and the performance of our algorithm is comparable to those of state-of-the-art metaheuristics for the MWCP.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125650763","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}
M. Saha, N. Funabiki, Sumon Kumar Debnath, W. Kao, S. Tajima, T. Higashino
Nowadays, the wireless local-area network (WLAN) has been deployed everywhere as a common access medium to the Internet. In WLAN, the network configuration should be optimized according to traffic demands and network environments which will change dynamically. Therefore, we have studied the active AP configuration algorithm for the elastic WLAN system to achieve the elasticity of WLAN. However, this algorithm requires a long CPU time in the large search space when numerous APs are deployed in the field. In this paper, we propose a preprocessing stage for the AP configuration algorithm to reduce the CPU time by limiting the number of APs in advance. Both the exhaustive and heuristic approaches are adopted, where either one should be used depending on the network topology. Through extensive simulations using the WIMNET simulator, the effectiveness of the proposal is verified.
{"title":"A Proposal of Preprocessing Stage for Active Access-Point Configuration Algorithm in Elastic WLAN System","authors":"M. Saha, N. Funabiki, Sumon Kumar Debnath, W. Kao, S. Tajima, T. Higashino","doi":"10.1145/3395245.3396442","DOIUrl":"https://doi.org/10.1145/3395245.3396442","url":null,"abstract":"Nowadays, the wireless local-area network (WLAN) has been deployed everywhere as a common access medium to the Internet. In WLAN, the network configuration should be optimized according to traffic demands and network environments which will change dynamically. Therefore, we have studied the active AP configuration algorithm for the elastic WLAN system to achieve the elasticity of WLAN. However, this algorithm requires a long CPU time in the large search space when numerous APs are deployed in the field. In this paper, we propose a preprocessing stage for the AP configuration algorithm to reduce the CPU time by limiting the number of APs in advance. Both the exhaustive and heuristic approaches are adopted, where either one should be used depending on the network topology. Through extensive simulations using the WIMNET simulator, the effectiveness of the proposal is verified.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130070191","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}
Ferry Fadzlul Rahman, Siti Noorbaya, Fahni Haris, H. Johan
Health communication is one of the core compulsory subjects of midwifery. The character-based on the health communication learned model aims to find out the effectiveness of the character education-based on the health communication learned model with a specific target of improving student achievement. This study, the method was Pre-Experimental with Posttest Only Control Group Design with a sample of 70 students divided into 2 groups: 35 treatment group respondents and 35 control group respondents. The results showed the effectiveness of the health education learned models based on the character education in improving the learning's achievement, Results of Data Analysis used the independent sample t-test of 0.035 <0.05, there were significant differences between the learning outcomes of the experimental / treatment group and the control group. It could be concluded that the character-based on the health communication learned model given to the midwifery students could improve the student's learning achievement.
{"title":"Health Communication Model Based on Character Education to Improve University Student Achievement in Midwifery","authors":"Ferry Fadzlul Rahman, Siti Noorbaya, Fahni Haris, H. Johan","doi":"10.1145/3395245.3396429","DOIUrl":"https://doi.org/10.1145/3395245.3396429","url":null,"abstract":"Health communication is one of the core compulsory subjects of midwifery. The character-based on the health communication learned model aims to find out the effectiveness of the character education-based on the health communication learned model with a specific target of improving student achievement. This study, the method was Pre-Experimental with Posttest Only Control Group Design with a sample of 70 students divided into 2 groups: 35 treatment group respondents and 35 control group respondents. The results showed the effectiveness of the health education learned models based on the character education in improving the learning's achievement, Results of Data Analysis used the independent sample t-test of 0.035 <0.05, there were significant differences between the learning outcomes of the experimental / treatment group and the control group. It could be concluded that the character-based on the health communication learned model given to the midwifery students could improve the student's learning achievement.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590055","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}
Yi-Cheng Liu, Ting-Wei Chen, Yen-Ju Li, Yu-Cheng Fan
Universal high-pixel-density displays were introduced to consumers in 2012, including 8K and even 16K displays. Therefore, we propose a new method to design gate driver circuits and micro-scale device mass transfer-printing technologies in order to solve problems related to display border space and electron mobility. In this paper, the conceptual design is composed of mass transfer-printing technologies and a GOA driving circuit. We design a bidirectional low-leakage-current scan circuit that includes a crystalline substrate to provide higher performance and a smaller device (smaller than thin-film amorphous or polycrystalline silicon). We then use the mass transfer-printing technologies to transfer microscale chips onto the glass substrate. Next, we transfer our microscale chip onto the effective area of a panel, and the microscale chip provides gate drive signals for the display. The border becomes slimmer or even disappears. These types of displays are applied in large-screen video monitors, flexible displays, high-pixel-density displays, etc.Our chips were fabricated using the TSMC 180-nm CMOS process; a single chip can include 864 dual-side pins, and has lateral dimensions of 8286 μm × 21 μm.
{"title":"Method for Driving High-pixel-density Displays","authors":"Yi-Cheng Liu, Ting-Wei Chen, Yen-Ju Li, Yu-Cheng Fan","doi":"10.1145/3395245.3396440","DOIUrl":"https://doi.org/10.1145/3395245.3396440","url":null,"abstract":"Universal high-pixel-density displays were introduced to consumers in 2012, including 8K and even 16K displays. Therefore, we propose a new method to design gate driver circuits and micro-scale device mass transfer-printing technologies in order to solve problems related to display border space and electron mobility. In this paper, the conceptual design is composed of mass transfer-printing technologies and a GOA driving circuit. We design a bidirectional low-leakage-current scan circuit that includes a crystalline substrate to provide higher performance and a smaller device (smaller than thin-film amorphous or polycrystalline silicon). We then use the mass transfer-printing technologies to transfer microscale chips onto the glass substrate. Next, we transfer our microscale chip onto the effective area of a panel, and the microscale chip provides gate drive signals for the display. The border becomes slimmer or even disappears. These types of displays are applied in large-screen video monitors, flexible displays, high-pixel-density displays, etc.Our chips were fabricated using the TSMC 180-nm CMOS process; a single chip can include 864 dual-side pins, and has lateral dimensions of 8286 μm × 21 μm.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124283128","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}
Imane Khaouja, Ghita Mezzour, Kathleen M. Carley, I. Kassou
Newspapers report about new investments in the country, new firm's creation and national programs that aim to promote job creation. Using this information can help us predict and acknowledge about a part of job creation and better inform universities about developing sectors. However, most prior work focuses on predicting stock market movements using newspapers and overlooks job creation. In this paper, we want to investigate whether newspapers could predict the job market future needs in term of workforce. Therefore, we collect newspapers found online and job creation in 18 sectors. We use linear mixed models for longitudinal data and random forest to predict job creation in those sectors based on sector mentions in the newspapers articles. Our findings suggest that newspapers can contribute to our ability to understand the near future job creation by leveraging sector mentions in the newspapers for specific sectors. Moreover, our results show that we can approximately predict future job creation in the 18 sectors by predicting the number of job creation in those sectors.
{"title":"Can we use newspapers to predict job creation?","authors":"Imane Khaouja, Ghita Mezzour, Kathleen M. Carley, I. Kassou","doi":"10.1145/3395245.3396421","DOIUrl":"https://doi.org/10.1145/3395245.3396421","url":null,"abstract":"Newspapers report about new investments in the country, new firm's creation and national programs that aim to promote job creation. Using this information can help us predict and acknowledge about a part of job creation and better inform universities about developing sectors. However, most prior work focuses on predicting stock market movements using newspapers and overlooks job creation. In this paper, we want to investigate whether newspapers could predict the job market future needs in term of workforce. Therefore, we collect newspapers found online and job creation in 18 sectors. We use linear mixed models for longitudinal data and random forest to predict job creation in those sectors based on sector mentions in the newspapers articles. Our findings suggest that newspapers can contribute to our ability to understand the near future job creation by leveraging sector mentions in the newspapers for specific sectors. Moreover, our results show that we can approximately predict future job creation in the 18 sectors by predicting the number of job creation in those sectors.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124110531","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 recent years, with the rapid development of large-scale open online courses, low completion rate and high dropout rate have been important challenges for open online courses. Therefore, it is necessary to make effective prediction and timely intervention to ensure the completion of the course. Some of the traditional prediction models only use the features extracted manually from students' clickstream data, which is too subjective to guarantee the quality of features and affect the prediction accuracy. Others generate features automatically with finer granularity, but the problem of feature redundancy appears. In order to solve this problem, this paper proposes a comprehensive dropout prediction framework of MOOCs students. The framework can automatically extract features from clickstream data, and filter features with an integrated feature selection strategy based on clustering and weighted MaxDiff, and finally predict. Experiments show that the model can effectively improve the accuracy of prediction of dropout.
{"title":"A Dropout Prediction Framework Combined with Ensemble Feature Selection","authors":"Dan Ai, Tiancheng Zhang, Ge Yu, Xinying Shao","doi":"10.1145/3395245.3396432","DOIUrl":"https://doi.org/10.1145/3395245.3396432","url":null,"abstract":"In recent years, with the rapid development of large-scale open online courses, low completion rate and high dropout rate have been important challenges for open online courses. Therefore, it is necessary to make effective prediction and timely intervention to ensure the completion of the course. Some of the traditional prediction models only use the features extracted manually from students' clickstream data, which is too subjective to guarantee the quality of features and affect the prediction accuracy. Others generate features automatically with finer granularity, but the problem of feature redundancy appears. In order to solve this problem, this paper proposes a comprehensive dropout prediction framework of MOOCs students. The framework can automatically extract features from clickstream data, and filter features with an integrated feature selection strategy based on clustering and weighted MaxDiff, and finally predict. Experiments show that the model can effectively improve the accuracy of prediction of dropout.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130259899","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}
M. González-Moreno, Cristina Cuenca-Piqueras, J. Fernández-Prados
The main objective of this paper is to show a state of the art of "cyberbullying". Thus, we have extracted the documents from databases in Web of Science (the search results of "cyberbull*" were 2,227) and they were examined with the bibliographic analysis tool VOSviewer. The analyses carried out on the documents were, on the one hand, descriptive, on the evolution of the number of articles on cyberbullying and the areas of research. On the other hand, the co-occurrences of the keywords and co-authorship, highlighting the nationality and the leading authors in number of citations. The results show a growth in the interest of investigating cyberbullying, specifically between psychology and education. The keywords focus on victimization and adolescence, although youth and gender have recently been highlighted. Despite the most frequent authors come from the United States and Spain which form two clusters, the most cited authors are researchers from Belgium in the area of psychology and communication studies. Cyberbullying affects adolescents and young people in mainly school contexts; this makes education for critical and active digital citizenship to prevent this type of behaviour among peers
{"title":"Cyberbullying and Education: State of the Art and Bibliometric Analysis","authors":"M. González-Moreno, Cristina Cuenca-Piqueras, J. Fernández-Prados","doi":"10.1145/3395245.3396449","DOIUrl":"https://doi.org/10.1145/3395245.3396449","url":null,"abstract":"The main objective of this paper is to show a state of the art of \"cyberbullying\". Thus, we have extracted the documents from databases in Web of Science (the search results of \"cyberbull*\" were 2,227) and they were examined with the bibliographic analysis tool VOSviewer. The analyses carried out on the documents were, on the one hand, descriptive, on the evolution of the number of articles on cyberbullying and the areas of research. On the other hand, the co-occurrences of the keywords and co-authorship, highlighting the nationality and the leading authors in number of citations. The results show a growth in the interest of investigating cyberbullying, specifically between psychology and education. The keywords focus on victimization and adolescence, although youth and gender have recently been highlighted. Despite the most frequent authors come from the United States and Spain which form two clusters, the most cited authors are researchers from Belgium in the area of psychology and communication studies. Cyberbullying affects adolescents and young people in mainly school contexts; this makes education for critical and active digital citizenship to prevent this type of behaviour among peers","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131440698","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 arrival of big data era has led to imperative management changes in the field of education. A large number of chaotic and ineffectively used of education big data exists in the process of intelligent campus construction. By combining big data technology with educational administration to improve students' learning skill and strengthen the construction of high-quality style of study. For example, this paper takes the final grades of 582 students of mathematics in a university from grade 2006 to grade 2015. Firstly, to eliminate the different impact of different teachers on the test paper scoring standards, we standardize the scores of all students. Secondly, we code the scores of each student using the improved Frequent Pattern Growth algorithm to the correlation between the failed courses (for convenience, we will abbreviate the Frequent Pattern as FP.). Then we find out the correlation degree between the failing courses by the jackknife method. Finally, for improving the academic early warning system, we verify the feasibility of the improved FP Growth algorithm for early warning of failing courses using the data of mathematics students majoring in grade 2016.
{"title":"Research on Application of Frequent Pattern Growth Algorithm in Academic Early Warning","authors":"Jiehao Zhang, Cuiling You, Jiawen Huang, Shijing Li, Yongxian Wen","doi":"10.1145/3395245.3395247","DOIUrl":"https://doi.org/10.1145/3395245.3395247","url":null,"abstract":"The arrival of big data era has led to imperative management changes in the field of education. A large number of chaotic and ineffectively used of education big data exists in the process of intelligent campus construction. By combining big data technology with educational administration to improve students' learning skill and strengthen the construction of high-quality style of study. For example, this paper takes the final grades of 582 students of mathematics in a university from grade 2006 to grade 2015. Firstly, to eliminate the different impact of different teachers on the test paper scoring standards, we standardize the scores of all students. Secondly, we code the scores of each student using the improved Frequent Pattern Growth algorithm to the correlation between the failed courses (for convenience, we will abbreviate the Frequent Pattern as FP.). Then we find out the correlation degree between the failing courses by the jackknife method. Finally, for improving the academic early warning system, we verify the feasibility of the improved FP Growth algorithm for early warning of failing courses using the data of mathematics students majoring in grade 2016.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121856538","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}
Massive Open Online Courses (MOOCs) need providing sufficient accessible learning resources for carrying out the online and offline learning, so it is very necessary to build the online learning resources for online open courses of mechanical drawing base on the requirements of outcome-based educations. In this study, characteristics of mechanical drawing courses in Chinese colleges and advances in MOOC and OBE were introduced, then the recording process of teaching videos and advertising video were introduced. Moreover, the questions of different type, discussion class and group project were designed and uploaded to the Online open courses of mechanical drawing in Chinese XuetangX MOOC Platform. This online open class of mechanical drawing had started to run since March 2018 and it has been running four times successfully based on the XuetangX MOOC Platform.
大规模在线开放课程(Massive Open Online Courses, MOOCs)需要为开展线上线下学习提供充足的可访问学习资源，因此基于成果教育的要求构建机械制图在线开放课程的在线学习资源是非常必要的。本研究首先介绍了我国高校机械制图课程的特点以及MOOC和OBE的进展，然后介绍了教学视频和广告视频的录制过程。设计了不同类型的问题、讨论课和小组项目，并将其上传到中国学堂x MOOC平台的机械制图在线公开课中。机械制图在线公开课于2018年3月开课，基于学堂x MOOC平台，已成功举办四届。
{"title":"Construction of the Online Open Courses of Mechanical Drawing in Chinese Colleges Based on Chinese XuetangX MOOC Platform","authors":"Jian-feng Song, Yong-gang Dong, Wenwu Wang","doi":"10.1145/3395245.3395249","DOIUrl":"https://doi.org/10.1145/3395245.3395249","url":null,"abstract":"Massive Open Online Courses (MOOCs) need providing sufficient accessible learning resources for carrying out the online and offline learning, so it is very necessary to build the online learning resources for online open courses of mechanical drawing base on the requirements of outcome-based educations. In this study, characteristics of mechanical drawing courses in Chinese colleges and advances in MOOC and OBE were introduced, then the recording process of teaching videos and advertising video were introduced. Moreover, the questions of different type, discussion class and group project were designed and uploaded to the Online open courses of mechanical drawing in Chinese XuetangX MOOC Platform. This online open class of mechanical drawing had started to run since March 2018 and it has been running four times successfully based on the XuetangX MOOC Platform.","PeriodicalId":166308,"journal":{"name":"Proceedings of the 2020 8th International Conference on Information and Education Technology","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134206075","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
扫码关注我们
求助内容：
应助结果提醒方式：