Abstract—The objective of this research is to design and develop a tool to evaluate tourists' satisfaction with the attractions recommendation system in Bangkok, Thailand. We have four main stages for the tourist attraction recommendation system. The first stage is to fill imputed missing values with association rules and multiple imputations. The second stage is constructing the tourist attractions recommendation model by ranking the tourist attractions with a ranking method and similarity measurements based on a personal recommender system with cosine algorithm. The third stage is to design and develop the personal recommender website. And the last stage is to evaluate the personal recommender system with four measurements: accuracy, precision, f-measure, and g-mean. The experiment results from a sampling of thirty people found that the tourist attraction recommendation system can: 1) make a positive recommendation 340 times, but 105 times will not meet the needs, and 2) make a negative recommendation 708 times, but 77 times will meet the needs. The results show that the tourist attractions recommendation system has satisfactory performance and reliability with high accuracy, precision, and f-measure, and g-mean values of 85.20%, 76.40%, 78.89%, and 84.26%, respectively. In addition, it was found that the users’ satisfaction towards the system was at a high level with a value of 4.60. This means that the proposed tourist attractions recommendation system can be used to recommend personal preferences as well.
{"title":"The Tourist Attractions Recommender System for Bangkok Thailand","authors":"Pasapitch Chujai, Jatsada Singthongchai, Surakirat Yasaga, Netirak Suratthara, Khatthaliya Buranakutti","doi":"10.7763/ijcte.2020.v12.1258","DOIUrl":"https://doi.org/10.7763/ijcte.2020.v12.1258","url":null,"abstract":"Abstract—The objective of this research is to design and develop a tool to evaluate tourists' satisfaction with the attractions recommendation system in Bangkok, Thailand. We have four main stages for the tourist attraction recommendation system. The first stage is to fill imputed missing values with association rules and multiple imputations. The second stage is constructing the tourist attractions recommendation model by ranking the tourist attractions with a ranking method and similarity measurements based on a personal recommender system with cosine algorithm. The third stage is to design and develop the personal recommender website. And the last stage is to evaluate the personal recommender system with four measurements: accuracy, precision, f-measure, and g-mean. The experiment results from a sampling of thirty people found that the tourist attraction recommendation system can: 1) make a positive recommendation 340 times, but 105 times will not meet the needs, and 2) make a negative recommendation 708 times, but 77 times will meet the needs. The results show that the tourist attractions recommendation system has satisfactory performance and reliability with high accuracy, precision, and f-measure, and g-mean values of 85.20%, 76.40%, 78.89%, and 84.26%, respectively. In addition, it was found that the users’ satisfaction towards the system was at a high level with a value of 4.60. This means that the proposed tourist attractions recommendation system can be used to recommend personal preferences as well.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129987976","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}
Pub Date : 2019-09-18DOI: 10.7763/ijcte.2020.v12.1260
A. Sah, I. Hwang, Ardian Rianto, Andrew Fernando Pakpahan, A. T. Liem
Demands for Peer-to-peer (P2P) applications are rapidly growing to become the most popular bandwidth consumers in the world. Among the various P2P applications, Gnutella is the most popular unstructured P2P networks allowing the sharing of files at a very high rate. TWDM-PON has been regarded as the promising solution to meet the higher bandwidth demands next-generation passive optical network (NG-PON2). It provides flexibility to support multiple services to multiple organization on the same fiber. SDN (software-defined networking) is the emerging technology that decouples the control and data plane and centralized the network intelligence at one place. As a result, the operators get programmability, automation and network control to manage a network that freely adapts the changes needed to the business. In this paper, a new Gnutella application for SDN over TWDM-PON architecture is proposed that the OLT and ONU are capable of handling the Gnutella traffic generated by Gnutella applications, and the Gnutella Engine Manager is controlled by SD-controller. The proposed mechanism is able to reduce the huge bandwidth waste caused by flooding controlling messages, guarantee the success of query and also localize the Gnutella inter and intra traffic between PON which improve the quality of services (QoS) in terms of the mean packet delay, jitter, system throughput and packet dropping.
{"title":"Gnutella-Based P2P Applications for SDN over TWDM-PON Architecture","authors":"A. Sah, I. Hwang, Ardian Rianto, Andrew Fernando Pakpahan, A. T. Liem","doi":"10.7763/ijcte.2020.v12.1260","DOIUrl":"https://doi.org/10.7763/ijcte.2020.v12.1260","url":null,"abstract":"Demands for Peer-to-peer (P2P) applications are rapidly growing to become the most popular bandwidth consumers in the world. Among the various P2P applications, Gnutella is the most popular unstructured P2P networks allowing the sharing of files at a very high rate. TWDM-PON has been regarded as the promising solution to meet the higher bandwidth demands next-generation passive optical network (NG-PON2). It provides flexibility to support multiple services to multiple organization on the same fiber. SDN (software-defined networking) is the emerging technology that decouples the control and data plane and centralized the network intelligence at one place. As a result, the operators get programmability, automation and network control to manage a network that freely adapts the changes needed to the business. In this paper, a new Gnutella application for SDN over TWDM-PON architecture is proposed that the OLT and ONU are capable of handling the Gnutella traffic generated by Gnutella applications, and the Gnutella Engine Manager is controlled by SD-controller. The proposed mechanism is able to reduce the huge bandwidth waste caused by flooding controlling messages, guarantee the success of query and also localize the Gnutella inter and intra traffic between PON which improve the quality of services (QoS) in terms of the mean packet delay, jitter, system throughput and packet dropping.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124881770","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}
Pub Date : 2019-08-01DOI: 10.7763/ijcte.2019.v11.1246
I. Masudin, Risma F. Sa’diyah, D. M. Utama, D. Restuputri, F. Jie
The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in meeting customer demand according to their respective locations. One variant of the Vehicle Routing Problem (VRP) is the Capacitated Vehicle Routing Problem (CVRP), namely VRP with vehicle capacity constraints. Problems with Capacitated Vehicle Routing Problems (CVRP), can be solved by using the nearest neighbour and Tabu Search Algorithm. The step to complete the Tabu Search Algorithm begins with the determination of the initial solution using Nearest Neighbour, determining alternative solutions with exchange, namely to move two points in the solution, evaluate alternative solutions with Tabu list, choose the best solution and set the optimum solution, update tabu list, then if the discharge criteria are met then the process stops and if not, then returns to the determination of alternative solutions. Based on the results of calculations using the Tabu Search Algorithm, the traveling distance is less about 10.01% than the nearest neighbor.
{"title":"Capacitated Vehicle Routing Problems: Nearest Neighbour vs. Tabu Search","authors":"I. Masudin, Risma F. Sa’diyah, D. M. Utama, D. Restuputri, F. Jie","doi":"10.7763/ijcte.2019.v11.1246","DOIUrl":"https://doi.org/10.7763/ijcte.2019.v11.1246","url":null,"abstract":"The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in meeting customer demand according to their respective locations. One variant of the Vehicle Routing Problem (VRP) is the Capacitated Vehicle Routing Problem (CVRP), namely VRP with vehicle capacity constraints. Problems with Capacitated Vehicle Routing Problems (CVRP), can be solved by using the nearest neighbour and Tabu Search Algorithm. The step to complete the Tabu Search Algorithm begins with the determination of the initial solution using Nearest Neighbour, determining alternative solutions with exchange, namely to move two points in the solution, evaluate alternative solutions with Tabu list, choose the best solution and set the optimum solution, update tabu list, then if the discharge criteria are met then the process stops and if not, then returns to the determination of alternative solutions. Based on the results of calculations using the Tabu Search Algorithm, the traveling distance is less about 10.01% than the nearest neighbor.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374691","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}
Pub Date : 2019-05-05DOI: 10.7763/ijcte.2019.v11.1251
Ahmed H Janabi, Michael Opoku Agyeman
Due to the growing number of Chip-Multiprocessors, the researchers have proposed new designs and architectures. So, there is a constant need to know the most accurate simulators used in this scope, which should be used to identify their outcomes. Computer System Architecture (CSA) simulators are usually used to validate the designs, architectures that new discovered and developments. This paper is to provide an overview and insight into the most critical simulations used in Computer System Architecture and possible standards that distinguish simulators from the other. The essential aspects and parameters that determine these simulators are accuracy, speed, performance, flexibility, and functionality as well. Cycle-Accurate, Event-Driven and Full Systems Simulators of CSA, this taxonomy of simulators that w discusses in this paper.
{"title":"An Overview of Cycle-Accurate, Event-Driven and Full Systems Simulators for Chip-Multiprocessors","authors":"Ahmed H Janabi, Michael Opoku Agyeman","doi":"10.7763/ijcte.2019.v11.1251","DOIUrl":"https://doi.org/10.7763/ijcte.2019.v11.1251","url":null,"abstract":"Due to the growing number of Chip-Multiprocessors, the researchers have proposed new designs and architectures. So, there is a constant need to know the most accurate simulators used in this scope, which should be used to identify their outcomes. Computer System Architecture (CSA) simulators are usually used to validate the designs, architectures that new discovered and developments. This paper is to provide an overview and insight into the most critical simulations used in Computer System Architecture and possible standards that distinguish simulators from the other. The essential aspects and parameters that determine these simulators are accuracy, speed, performance, flexibility, and functionality as well. Cycle-Accurate, Event-Driven and Full Systems Simulators of CSA, this taxonomy of simulators that w discusses in this paper.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762532","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}
Pub Date : 2017-08-01DOI: 10.7763/IJCTE.2017.V9.1158
Hsin-Yen Yen, Ching Li
{"title":"An Application of Open Government Data: An Evidence on Physical Activity Environment and Non-communicable Diseases","authors":"Hsin-Yen Yen, Ching Li","doi":"10.7763/IJCTE.2017.V9.1158","DOIUrl":"https://doi.org/10.7763/IJCTE.2017.V9.1158","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130351126","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}
Pub Date : 2017-08-01DOI: 10.7763/IJCTE.2017.V9.1148
A. Suzianti, Rizky Puti Minanga, Felisa Fitriani
{"title":"Analysis of User Experience (UX) on Health-Tracker Mobile Apps","authors":"A. Suzianti, Rizky Puti Minanga, Felisa Fitriani","doi":"10.7763/IJCTE.2017.V9.1148","DOIUrl":"https://doi.org/10.7763/IJCTE.2017.V9.1148","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220270","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}
Pub Date : 2017-06-01DOI: 10.7763/IJCTE.2017.V9.1138
Mengyang Liu, L. Po, Hongyuan Fu
{"title":"Cuffless Blood Pressure Estimation Based on Photoplethysmography Signal and Its Second Derivative","authors":"Mengyang Liu, L. Po, Hongyuan Fu","doi":"10.7763/IJCTE.2017.V9.1138","DOIUrl":"https://doi.org/10.7763/IJCTE.2017.V9.1138","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132932623","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}
Pub Date : 2017-02-01DOI: 10.7763/IJCTE.2017.V9.1114
Chowdhury Mozammel Mozammel, Junbin Gao, R. Islam
{"title":"An efficient algorithm for stereo correspondence matching","authors":"Chowdhury Mozammel Mozammel, Junbin Gao, R. Islam","doi":"10.7763/IJCTE.2017.V9.1114","DOIUrl":"https://doi.org/10.7763/IJCTE.2017.V9.1114","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114723231","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}
Pub Date : 2016-12-01DOI: 10.7763/IJCTE.2016.V8.1089
Mohammed Bougaa, S. Bornhofen, H. Kadima, A. Rivière
{"title":"3D Interaction in Virtual Environments for Systems Engineering","authors":"Mohammed Bougaa, S. Bornhofen, H. Kadima, A. Rivière","doi":"10.7763/IJCTE.2016.V8.1089","DOIUrl":"https://doi.org/10.7763/IJCTE.2016.V8.1089","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122657101","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}
Pub Date : 2016-12-01DOI: 10.7763/IJCTE.2016.V8.1095
Wenhua Tian, Ying Zhang, Yinfeng Li, Huili Zhang
Although airspace congestion is becoming more and more serious with the increase of the air traffic flow, there have been still no mature and effective methods and models developed for measuring the uncertainty of the air traffic flow, so that the air traffic prediction is lack of accuracy. Thus, in this paper we extract the numerical characteristics of the random variables during the flight process, and then establish the probability density functions and en-route sector demand prediction model based on the probability distributions. Through comparing the actual operation data and the prediction data of the aircraft, the variation of the sector traffic flow demand and its probability can be obtained based on the model proposed in the paper. The model in this paper remedies the insufficiency of the traditional flow prediction methods which merely provide static prediction results, and thus can be a useful decision support tool for the air traffic flow managers to dynamically know about the sector traffic demand and its accuracy in the future.
{"title":"Probabilistic Demand Prediction Model for En-Route Sector","authors":"Wenhua Tian, Ying Zhang, Yinfeng Li, Huili Zhang","doi":"10.7763/IJCTE.2016.V8.1095","DOIUrl":"https://doi.org/10.7763/IJCTE.2016.V8.1095","url":null,"abstract":"Although airspace congestion is becoming more and more serious with the increase of the air traffic flow, there have been still no mature and effective methods and models developed for measuring the uncertainty of the air traffic flow, so that the air traffic prediction is lack of accuracy. Thus, in this paper we extract the numerical characteristics of the random variables during the flight process, and then establish the probability density functions and en-route sector demand prediction model based on the probability distributions. Through comparing the actual operation data and the prediction data of the aircraft, the variation of the sector traffic flow demand and its probability can be obtained based on the model proposed in the paper. The model in this paper remedies the insufficiency of the traditional flow prediction methods which merely provide static prediction results, and thus can be a useful decision support tool for the air traffic flow managers to dynamically know about the sector traffic demand and its accuracy in the future.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124173484","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
扫码关注我们
求助内容：
应助结果提醒方式：