Pub Date : 2019-01-01DOI: 10.3966/160792642019012001011
C. Chou, Sheng-Tzong Cheng, Yi Tsen Chiang
This work proposed a hierarchical tour-sites recommendation mechanism based on tourist group which is context, location, and time awareness. This mechanism includes two parts, Inter-site and Intra-site. We adopted the Artificial Fish Swarm Algorithm (AFSA) to build this two parts tour-sites recommendation mechanism. In the Inter-site recommendation, we combined Co-occurrence concept to predict the interest of tourists. We formulate the problem of choosing the paths among the vehicles in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. This mechanism determined on reducing the average waiting time of tourist and balancing the congestion degree of sites in a city and presents a recommendation mechanism for vehicle-sharing. Moreover, it took the demand of tourists into consideration. The experimental results showed that the mechanism we proposed improve the tourism experience for tourist groups.
本文提出了一种基于游客群体语境、地点和时间意识的分级旅游景点推荐机制。该机制包括站点间机制和站点内机制两部分。我们采用人工鱼群算法(Artificial Fish Swarm Algorithm, AFSA)构建了这个由两部分组成的旅游站点推荐机制。在站点间推荐中，我们结合Co-occurrence的概念来预测游客的兴趣。利用非合作博弈理论，提出了同一区域内车辆的路径选择问题，并求出了该博弈的解，即纳什均衡。该机制以减少游客的平均等待时间和平衡城市站点的拥堵程度为目标，提出了一种车辆共享的推荐机制。此外，它考虑到游客的需求。实验结果表明，本文提出的机制改善了旅游团的旅游体验。
{"title":"Tour-sites Recommendation Mechanism for Navigation System","authors":"C. Chou, Sheng-Tzong Cheng, Yi Tsen Chiang","doi":"10.3966/160792642019012001011","DOIUrl":"https://doi.org/10.3966/160792642019012001011","url":null,"abstract":"This work proposed a hierarchical tour-sites recommendation mechanism based on tourist group which is context, location, and time awareness. This mechanism includes two parts, Inter-site and Intra-site. We adopted the Artificial Fish Swarm Algorithm (AFSA) to build this two parts tour-sites recommendation mechanism. In the Inter-site recommendation, we combined Co-occurrence concept to predict the interest of tourists. We formulate the problem of choosing the paths among the vehicles in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. This mechanism determined on reducing the average waiting time of tourist and balancing the congestion degree of sites in a city and presents a recommendation mechanism for vehicle-sharing. Moreover, it took the demand of tourists into consideration. The experimental results showed that the mechanism we proposed improve the tourism experience for tourist groups.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"20 1","pages":"123-133"},"PeriodicalIF":1.6,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70039686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.3966/160792642018121907019
Pang-Wei Tsai, W. Fong, Wu-Hsien Chang, Chu-Sing Yang
Software-defined Networking (SDN) is considered a new solution in network provision for applying flexible functionalities. The characteristics of SDN include separated control and data planes, centralized management, having the global view of the network, fast adjustment, and adaptation. However, the centralized management brings resilience issues in the control plane of SDN, such as operation dependability, component survival, and behavior recovery. This paper introduces a resilience design for SDN to prevent network behavior loss when the active controller fails. The aim of this paper is to develop a way to improve the resilience of SDN control message processing during the controller switching procedure. The proposed design has been practiced on RYU controller for verification and evaluation. The initial performance tests show that our work is able to increase the reliability of the controller at the expense of lower performance.
{"title":"Using adaptive message replication on improving control resilience of SDN","authors":"Pang-Wei Tsai, W. Fong, Wu-Hsien Chang, Chu-Sing Yang","doi":"10.3966/160792642018121907019","DOIUrl":"https://doi.org/10.3966/160792642018121907019","url":null,"abstract":"Software-defined Networking (SDN) is considered a new solution in network provision for applying flexible functionalities. The characteristics of SDN include separated control and data planes, centralized management, having the global view of the network, fast adjustment, and adaptation. However, the centralized management brings resilience issues in the control plane of SDN, such as operation dependability, component survival, and behavior recovery. This paper introduces a resilience design for SDN to prevent network behavior loss when the active controller fails. The aim of this paper is to develop a way to improve the resilience of SDN control message processing during the controller switching procedure. The proposed design has been practiced on RYU controller for verification and evaluation. The initial performance tests show that our work is able to increase the reliability of the controller at the expense of lower performance.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"2163-2175"},"PeriodicalIF":1.6,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43586982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.3966/160792642018111906009
Jeng-Shyang Pan, Lingping Kong, Tien-Wen Sung, Pei-wei Tsai, V. Snás̃el
Energy hole refers to the critical issue near the sinks for data collecting, this problem effects the lifetime of wireless sensor network to a great extent. Frequently data forwarding from distributed sensors to the sink will speed up the energy consumption of the sensors near the sink. This circumstance shortens the lifetime of the sensor network. In this paper, an α-fraction first strategy was proposed to build a hierarchical model of wireless sensor networks that concerning the energy consumption. The model mixes the so-called relay nodes into the network for transmitting and collecting data from the other sensor nodes. We studied the Farthest First traversal and Harel methods, then combined the proposed α-fraction first strategy with the two methods respectively. Three algorithms of FF+Fr(α), HD+Fr(α), and HL+Fr(α) were designed for determining the relay nodes in sensor networks. The algorithms can be used to construct a two-tier sensor network with fewer relay nodes than the results of the Farthest First traversal and Harel methods. The proposed strategy also could be used with any other algorithms that regarding for choosing one of many options. The simulation results show that our proposed algorithms perform well. Thus, the network lifetime can be prolonged.
{"title":"α-Fraction First Strategy for Hierarchical Model in Wireless Sensor Networks","authors":"Jeng-Shyang Pan, Lingping Kong, Tien-Wen Sung, Pei-wei Tsai, V. Snás̃el","doi":"10.3966/160792642018111906009","DOIUrl":"https://doi.org/10.3966/160792642018111906009","url":null,"abstract":"Energy hole refers to the critical issue near the sinks for data collecting, this problem effects the lifetime of wireless sensor network to a great extent. Frequently data forwarding from distributed sensors to the sink will speed up the energy consumption of the sensors near the sink. This circumstance shortens the lifetime of the sensor network. In this paper, an α-fraction first strategy was proposed to build a hierarchical model of wireless sensor networks that concerning the energy consumption. The model mixes the so-called relay nodes into the network for transmitting and collecting data from the other sensor nodes. We studied the Farthest First traversal and Harel methods, then combined the proposed α-fraction first strategy with the two methods respectively. Three algorithms of FF+Fr(α), HD+Fr(α), and HL+Fr(α) were designed for determining the relay nodes in sensor networks. The algorithms can be used to construct a two-tier sensor network with fewer relay nodes than the results of the Farthest First traversal and Harel methods. The proposed strategy also could be used with any other algorithms that regarding for choosing one of many options. The simulation results show that our proposed algorithms perform well. Thus, the network lifetime can be prolonged.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1717-1726"},"PeriodicalIF":1.6,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43855498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.3966/160792642018111906020
Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang
In this paper, we explore two key problems in time series motif discovery: releasing the constraints of trivial matching between subsequences with different lengths and improving the time and space efficiency. The purpose of avoiding trivial matching is to avoid too much repetition between subsequences in calculating their similarities. We describe a limited-length enhanced suffix array based framework (LiSAM) to resolve the two problems. Experimental results on Electrocardiogram signals indicate the accuracy of LiSAM on finding motifs with different lengths.
{"title":"Limited-length Suffix-array-based Method for Variable-length Motif Discovery in Time Series","authors":"Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang","doi":"10.3966/160792642018111906020","DOIUrl":"https://doi.org/10.3966/160792642018111906020","url":null,"abstract":"In this paper, we explore two key problems in time series motif discovery: releasing the constraints of trivial matching between subsequences with different lengths and improving the time and space efficiency. The purpose of avoiding trivial matching is to avoid too much repetition between subsequences in calculating their similarities. We describe a limited-length enhanced suffix array based framework (LiSAM) to resolve the two problems. Experimental results on Electrocardiogram signals indicate the accuracy of LiSAM on finding motifs with different lengths.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1841-1851"},"PeriodicalIF":1.6,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43651552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.6138/JIT.2018.19.6.20161003
Zhao Liu, Jingxian Liu, Feng Zhou, R. W. Liu, N. Xiong
The development of intelligent shipping route planning systems is important for maritime traffic networks, and has attracted considerable attention in the field of marine traffic engineering. In practical applications, the traditional experience-based planning scheme has been widely used due to its simplicity and easy implementations. However, the traditional manual procedure is experience-dependent and time-consuming, which may easily lead to unstable shipping route planning in different waters. The purpose of this study automatically and robustly determines that the optimal shipping route is based on artificial intelligence approaches. It is general that Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are almost the most popular methods in route planning. These two heuristic-based optimization techniques benefit from their specific advantages when solving different optimization problems. In this paper, we proposed a hybrid heuristic scheme by integrating GA and PSO to improve the accuracy and robustness of shipping route planning in restricted waters. The experimental results about both synthetic and real-world problems have demonstrated that our proposed hybrid approach outperforms the existing schemes in terms of both accuracy and robustness, and the approach is helpful for optimizing maritime traffic network for the links of terminals.
{"title":"A Robust GA/PSO-Hybrid Algorithm in Intelligent Shipping Route Planning Systems for Maritime Traffic Networks","authors":"Zhao Liu, Jingxian Liu, Feng Zhou, R. W. Liu, N. Xiong","doi":"10.6138/JIT.2018.19.6.20161003","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.6.20161003","url":null,"abstract":"The development of intelligent shipping route planning systems is important for maritime traffic networks, and has attracted considerable attention in the field of marine traffic engineering. In practical applications, the traditional experience-based planning scheme has been widely used due to its simplicity and easy implementations. However, the traditional manual procedure is experience-dependent and time-consuming, which may easily lead to unstable shipping route planning in different waters. The purpose of this study automatically and robustly determines that the optimal shipping route is based on artificial intelligence approaches. It is general that Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are almost the most popular methods in route planning. These two heuristic-based optimization techniques benefit from their specific advantages when solving different optimization problems. In this paper, we proposed a hybrid heuristic scheme by integrating GA and PSO to improve the accuracy and robustness of shipping route planning in restricted waters. The experimental results about both synthetic and real-world problems have demonstrated that our proposed hybrid approach outperforms the existing schemes in terms of both accuracy and robustness, and the approach is helpful for optimizing maritime traffic network for the links of terminals.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1635-1644"},"PeriodicalIF":1.6,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45643784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.3966/160792642018091905012
E. Guardo, A. D. Stefano, A. L. Corte, Marco Sapienza, Marialisa Scatá
The challenge of analyzing and processing a huge amount of data is becoming increasingly important in this fourth industrial revolution era. In this scenario, Cloud Computing and Internet of Things (IoT) allow to build up an interconnected network of smart things. These two paradigms do not allow solving the Computing problems yet. Fog Computing aims at moving the processing abilities closer to the end users, avoiding an excessive exploitation of Cloud resources, further reducing computational loads. In this work, we propose a Fog-based IoT framework, which exploits the two-tier Fog and their resources, reducing the transmitted data to the Cloud, improving the computational load balancing and reducing the waiting times. The proposed Fog Computing approach is applied to the emerging area of precision agriculture, including all the techniques of agricultural land management. Furthermore, based on this framework, we have simulated and highlighted how the two-tier Fog Computing approach is able to reduce significantly the amount of transmitted data to the Cloud. We also propose and describe an application prototype, based on the previous framework, able to manage and monitor farmland, with a strong impact on both the business and environmental performance.
{"title":"A Fog Computing-based IoT Framework for Precision Agriculture","authors":"E. Guardo, A. D. Stefano, A. L. Corte, Marco Sapienza, Marialisa Scatá","doi":"10.3966/160792642018091905012","DOIUrl":"https://doi.org/10.3966/160792642018091905012","url":null,"abstract":"The challenge of analyzing and processing a huge amount of data is becoming increasingly important in this fourth industrial revolution era. In this scenario, Cloud Computing and Internet of Things (IoT) allow to build up an interconnected network of smart things. These two paradigms do not allow solving the Computing problems yet. Fog Computing aims at moving the processing abilities closer to the end users, avoiding an excessive exploitation of Cloud resources, further reducing computational loads. In this work, we propose a Fog-based IoT framework, which exploits the two-tier Fog and their resources, reducing the transmitted data to the Cloud, improving the computational load balancing and reducing the waiting times. The proposed Fog Computing approach is applied to the emerging area of precision agriculture, including all the techniques of agricultural land management. Furthermore, based on this framework, we have simulated and highlighted how the two-tier Fog Computing approach is able to reduce significantly the amount of transmitted data to the Cloud. We also propose and describe an application prototype, based on the previous framework, able to manage and monitor farmland, with a strong impact on both the business and environmental performance.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1401-1411"},"PeriodicalIF":1.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44794003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.3966/160792642018091905007
Yu Xue, Jiongming Jiang, Tinghuai Ma, Jingfa Liu, Wei Pang
The Artificial Bee Colony (ABC) algorithm is an optimization algorithm inspired by the foraging behavior of bee swarms. Similar to some evolutionary algorithms, there is a main limitation in ABC, i.e., in many problems, ABC is good at exploration but poor at exploitation. Thus, in order to overcome this limitation and improve the performance of ABC when dealing with various kinds of optimization problems, we proposed a self-adaptive artificial bee colony algorithm with symmetry initialization (SABC-SI). In our SABC-SI algorithm, a novel population initialization method based on half space and symmetry is designed, and such method can increase the diversity of initial solutions. Besides, a self- adaptive search mechanism and several new Candidate Solution Generating Strategies (CSGSes) have also been developed. Consequently, the evolutionary strategies can be selected dynamically according to their search performance. Moreover, the selection operator is improved by eliminating some of the poor solutions and making good use of the two best solutions in both the current and previous generations. The novel algorithm was tested on 25 different benchmark functions. The experimental results show that SABC-SI outperforms several state-of-the-art algorithms, which indicates that it has great potential to be applied to a wide range of optimization problems.
{"title":"A Self-adaptive Artificial Bee Colony Algorithm with Symmetry Initialization","authors":"Yu Xue, Jiongming Jiang, Tinghuai Ma, Jingfa Liu, Wei Pang","doi":"10.3966/160792642018091905007","DOIUrl":"https://doi.org/10.3966/160792642018091905007","url":null,"abstract":"The Artificial Bee Colony (ABC) algorithm is an optimization algorithm inspired by the foraging behavior of bee swarms. Similar to some evolutionary algorithms, there is a main limitation in ABC, i.e., in many problems, ABC is good at exploration but poor at exploitation. Thus, in order to overcome this limitation and improve the performance of ABC when dealing with various kinds of optimization problems, we proposed a self-adaptive artificial bee colony algorithm with symmetry initialization (SABC-SI). In our SABC-SI algorithm, a novel population initialization method based on half space and symmetry is designed, and such method can increase the diversity of initial solutions. Besides, a self- adaptive search mechanism and several new Candidate Solution Generating Strategies (CSGSes) have also been developed. Consequently, the evolutionary strategies can be selected dynamically according to their search performance. Moreover, the selection operator is improved by eliminating some of the poor solutions and making good use of the two best solutions in both the current and previous generations. The novel algorithm was tested on 25 different benchmark functions. The experimental results show that SABC-SI outperforms several state-of-the-art algorithms, which indicates that it has great potential to be applied to a wide range of optimization problems.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1347-1362"},"PeriodicalIF":1.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45698294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.6138/JIT.2018.19.5.20160625
Qusai Y. Shambour, Salam Fraihat, Mou'ath Hourani
Mobile technologies have become the most rapidly growing and adopted technology in recent years. Currently, many higher education institutions are using mobile technologies, due to their portability and accessibility, to support a variety of activities in the education process. Course advising is an important part of the education process and it plays an essential role in students’ academic success. However, course advising is a challenging task due to the intensive human effort required from advisors; the unavailability of committed advisors due to other academic commitments; the advisors lack of knowledge; the time-consuming nature of this task; and the unavailability of related information on academic curriculum to the advisors. Nevertheless, such problems make the use of an automated course advising system desirable and helpful. This paper presents the design and implementation of a mobile application for university course advising, called m-advisor, that can be used to reduce the time and effort for both the students and advisors during the course advising process at the beginning of each academic semester. The evaluation results of the m-advisor application revealed that informative advices for students can be given on which appropriate courses, that can fit their needs in accordance with the requirements of the student’s academic program, to register in the upcoming semester.
{"title":"The Implementation of Mobile Technologies in Higher Education: A Mobile Application for University Course Advising","authors":"Qusai Y. Shambour, Salam Fraihat, Mou'ath Hourani","doi":"10.6138/JIT.2018.19.5.20160625","DOIUrl":"https://doi.org/10.6138/JIT.2018.19.5.20160625","url":null,"abstract":"Mobile technologies have become the most rapidly growing and adopted technology in recent years. Currently, many higher education institutions are using mobile technologies, due to their portability and accessibility, to support a variety of activities in the education process. Course advising is an important part of the education process and it plays an essential role in students’ academic success. However, course advising is a challenging task due to the intensive human effort required from advisors; the unavailability of committed advisors due to other academic commitments; the advisors lack of knowledge; the time-consuming nature of this task; and the unavailability of related information on academic curriculum to the advisors. Nevertheless, such problems make the use of an automated course advising system desirable and helpful. This paper presents the design and implementation of a mobile application for university course advising, called m-advisor, that can be used to reduce the time and effort for both the students and advisors during the course advising process at the beginning of each academic semester. The evaluation results of the m-advisor application revealed that informative advices for students can be given on which appropriate courses, that can fit their needs in accordance with the requirements of the student’s academic program, to register in the upcoming semester.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1327-1337"},"PeriodicalIF":1.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48685648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.3966/160792642018091905001
Pei-Yu Cheng, Yen-Ning Su, Yu-Cheng Chien, Ting-Ting Wu, Yueh-Min Huang
Screen-based reading with e-books, which leverages technology in order to create pertinent learning experiences for all students, has become more acceptable to digital natives. Notably, before e-books are widely adopted in academic learning, the visual burden of students during reading activities should be considered. This investigation thus examines how reading-related factors affect visual fatigue incurred when reading both e-books and paper-based books through an experiment conducted on 24 elementary school students. The results showed that the different reading materials have no significant difference in terms of affecting students’ levels of visual fatigue; that is, reading material seems inconsequential with regard to changes in the degree of visual fatigue. Furthermore, another result found that long duration reading led visual to more burden, which also mean that long periods of reading without proper rest should be avoided. As this study of the foundation of visual fatigue reveals, the findings can be as references beneficial for integrating e-books into instruction and providing suggestions for the use of e-books in education. Therefore, we suggest that future studies should consider visual fatigue as important factors in e-book learning activity to promote their more potential benefits with regard to student learning.
{"title":"An Investigation of Visual Fatigue in Elementary School Students Resulting from Reading e-books","authors":"Pei-Yu Cheng, Yen-Ning Su, Yu-Cheng Chien, Ting-Ting Wu, Yueh-Min Huang","doi":"10.3966/160792642018091905001","DOIUrl":"https://doi.org/10.3966/160792642018091905001","url":null,"abstract":"Screen-based reading with e-books, which leverages technology in order to create pertinent learning experiences for all students, has become more acceptable to digital natives. Notably, before e-books are widely adopted in academic learning, the visual burden of students during reading activities should be considered. This investigation thus examines how reading-related factors affect visual fatigue incurred when reading both e-books and paper-based books through an experiment conducted on 24 elementary school students. The results showed that the different reading materials have no significant difference in terms of affecting students’ levels of visual fatigue; that is, reading material seems inconsequential with regard to changes in the degree of visual fatigue. Furthermore, another result found that long duration reading led visual to more burden, which also mean that long periods of reading without proper rest should be avoided. As this study of the foundation of visual fatigue reveals, the findings can be as references beneficial for integrating e-books into instruction and providing suggestions for the use of e-books in education. Therefore, we suggest that future studies should consider visual fatigue as important factors in e-book learning activity to promote their more potential benefits with regard to student learning.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1285-1292"},"PeriodicalIF":1.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45452834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.3966/160792642018091905030
Shin-Jie Lee, X. Lin, Wu-Chen Su, Hsi-Min Chen
Considerable effort has gone into the discovery of API usage patterns or examples. However, how to enable programmers to search for discovered API usage examples using natural language queries is still a significant research problem. This paper presents an approach, referred to as Codepus, to facilitate the discovery of API usage examples based on mining comments in open source code while permitting searches using natural language queries. The approach includes two key features: API usage patterns as well as multiple keywords and tf-idf values are discovered by mining open source comments and code snippets; and a matchmaking function is devised for searching for API usage examples using natural language queries by aggregating scores related to semantic similarity, correctness, and the number of APIs. In a practical application, the proposed approach discovered 43,721 API usage patterns with 641,591 API usage examples from 15,814 open source projects. Experiment results revealed the following: (1) Codepus reduced the browsing time required for locating API usage examples by 46.5%, compared to the time required when using a web search engine. (2) The precision of Codepus is 91% when using eleven real-world frequently asked questions, which is superior to those of Gists and Open Hub.
{"title":"A Comment-Driven Approach to API Usage Patterns Discovery and Search","authors":"Shin-Jie Lee, X. Lin, Wu-Chen Su, Hsi-Min Chen","doi":"10.3966/160792642018091905030","DOIUrl":"https://doi.org/10.3966/160792642018091905030","url":null,"abstract":"Considerable effort has gone into the discovery of API usage patterns or examples. However, how to enable programmers to search for discovered API usage examples using natural language queries is still a significant research problem. This paper presents an approach, referred to as Codepus, to facilitate the discovery of API usage examples based on mining comments in open source code while permitting searches using natural language queries. The approach includes two key features: API usage patterns as well as multiple keywords and tf-idf values are discovered by mining open source comments and code snippets; and a matchmaking function is devised for searching for API usage examples using natural language queries by aggregating scores related to semantic similarity, correctness, and the number of APIs. In a practical application, the proposed approach discovered 43,721 API usage patterns with 641,591 API usage examples from 15,814 open source projects. Experiment results revealed the following: (1) Codepus reduced the browsing time required for locating API usage examples by 46.5%, compared to the time required when using a web search engine. (2) The precision of Codepus is 91% when using eleven real-world frequently asked questions, which is superior to those of Gists and Open Hub.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1587-1601"},"PeriodicalIF":1.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44850071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：