Pub Date : 2017-10-01DOI: 10.1109/ICSITECH.2017.8257110
David Kadi, Suyoto, A. Santoso
Southwest Sumba is a regency located on the island of Sumba and falls under the jurisdiction area of the province of East Nusa Tenggara. This regency is well-known for its wide variety of and interesting tourism objects, such as its nature, culture, and marine tourism. Nevertheless, one of the things that proved to be obstacles in promoting tourism objects to potential visitors is the lack of information about their very own existence. Therefore, any form of location-based information services is particularly needed to be developed so that this so-called information can be accessed in real time, direct routes to tourism objects, and one that can quickly provide information regarding tourism objects. In this research, location-based information services are developed in a form of a mobile app that combines Location Based Service (LBS) with Augmented Reality (AR). This application use markerless method planted in AR to track object of Point of Interest (POIs) for tourism objects. Furthermore, each POIs of tourism objects is tracked based on three different coordinate points for each location and can make it easier for tourists to obtain information regarding tourism objects.
{"title":"Mobile application development with augmented reality for promoting tourism objects in Southwest Sumba","authors":"David Kadi, Suyoto, A. Santoso","doi":"10.1109/ICSITECH.2017.8257110","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257110","url":null,"abstract":"Southwest Sumba is a regency located on the island of Sumba and falls under the jurisdiction area of the province of East Nusa Tenggara. This regency is well-known for its wide variety of and interesting tourism objects, such as its nature, culture, and marine tourism. Nevertheless, one of the things that proved to be obstacles in promoting tourism objects to potential visitors is the lack of information about their very own existence. Therefore, any form of location-based information services is particularly needed to be developed so that this so-called information can be accessed in real time, direct routes to tourism objects, and one that can quickly provide information regarding tourism objects. In this research, location-based information services are developed in a form of a mobile app that combines Location Based Service (LBS) with Augmented Reality (AR). This application use markerless method planted in AR to track object of Point of Interest (POIs) for tourism objects. Furthermore, each POIs of tourism objects is tracked based on three different coordinate points for each location and can make it easier for tourists to obtain information regarding tourism objects.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114447058","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-10-01DOI: 10.1109/ICSITECH.2017.8257143
M. Qusyairi, M. Abdurohman, Asep Mulyana
This paper proposes a seamless presence system using Bluetooth technology to reduce processing time of presence system in classroom. Presence systems that are widely used today are using RFID technology, where the user applying the queuing mechanism in operation. For a fairly number of participants, this situation is a wasting of time as well as reduces convenience for participants. The proposed system consists of two main parts: The S canner and Server. S canner used to detect and identify the presence of the student(s) while the server (which consist of OpenMTC Server and an Application Server) are responsible to verify the data received from the S canner as well as display on application. System could cover 7.99 meters of effective distance (in average) in hall room, and 4.86 meters of effective distance (in average) in normal classroom (the classroom that has 8m × 8m of size). Performance of the system including the success rate of scan inquiry is 76.32% (in average) while scan inquiry latency is 61.46 seconds.
{"title":"Seamless presence system in classroom","authors":"M. Qusyairi, M. Abdurohman, Asep Mulyana","doi":"10.1109/ICSITECH.2017.8257143","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257143","url":null,"abstract":"This paper proposes a seamless presence system using Bluetooth technology to reduce processing time of presence system in classroom. Presence systems that are widely used today are using RFID technology, where the user applying the queuing mechanism in operation. For a fairly number of participants, this situation is a wasting of time as well as reduces convenience for participants. The proposed system consists of two main parts: The S canner and Server. S canner used to detect and identify the presence of the student(s) while the server (which consist of OpenMTC Server and an Application Server) are responsible to verify the data received from the S canner as well as display on application. System could cover 7.99 meters of effective distance (in average) in hall room, and 4.86 meters of effective distance (in average) in normal classroom (the classroom that has 8m × 8m of size). Performance of the system including the success rate of scan inquiry is 76.32% (in average) while scan inquiry latency is 61.46 seconds.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114541072","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-10-01DOI: 10.1109/ICSITECH.2017.8257196
Novi Sofia Fitriasari, Khalifa Esha Iftitah, P Rizky Rachman Judhie
The rapid development of technology resulted in the extensive information distribution. It takes a system that can organize a set of information and simplify information search. The concept of retrieval system can simplify information search process. Current studies on information searching are dominated by documents in English, yet very few about documents in Indonesian. Therefore this study focuses on document search in Indonesian language using vector space method. The vector space method processes data already in the index to calculate the value of similarity with the user-provided query. The result is a list of ranked and relevant documents to the user-provided query. The performance results obtained by the system were the average value of precision 0.45, recall 0.96, and f-measure 0.54. The system produced a high recall value compared to precision in the document search process. This study shows that the vector space method is able to search and produce relevant documents.
{"title":"Indonesian document retrieval using vector space method","authors":"Novi Sofia Fitriasari, Khalifa Esha Iftitah, P Rizky Rachman Judhie","doi":"10.1109/ICSITECH.2017.8257196","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257196","url":null,"abstract":"The rapid development of technology resulted in the extensive information distribution. It takes a system that can organize a set of information and simplify information search. The concept of retrieval system can simplify information search process. Current studies on information searching are dominated by documents in English, yet very few about documents in Indonesian. Therefore this study focuses on document search in Indonesian language using vector space method. The vector space method processes data already in the index to calculate the value of similarity with the user-provided query. The result is a list of ranked and relevant documents to the user-provided query. The performance results obtained by the system were the average value of precision 0.45, recall 0.96, and f-measure 0.54. The system produced a high recall value compared to precision in the document search process. This study shows that the vector space method is able to search and produce relevant documents.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122249630","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-10-01DOI: 10.1109/ICSITECH.2017.8257183
Christin Panjaitan, Chung-An Shen, S. Ruan
This paper presents high performance kinect depth video compression with low computational cost. In the proposed scheme, down-sample is placed at the first part of pre-processing to reduce computational cost. Therefore, down-sampled image is refined in the middle of pre-processing part. At last stage of preprocessing, up-sample scheme is located in order to return into the original size then feed into H.264/AVC encoder. The proposed method can gain 3–4 dB and reduce computational time by 44 %–50 %.
{"title":"Utilisation of down and upsample in pre-processing to enhance quality of kinect depth compression","authors":"Christin Panjaitan, Chung-An Shen, S. Ruan","doi":"10.1109/ICSITECH.2017.8257183","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257183","url":null,"abstract":"This paper presents high performance kinect depth video compression with low computational cost. In the proposed scheme, down-sample is placed at the first part of pre-processing to reduce computational cost. Therefore, down-sampled image is refined in the middle of pre-processing part. At last stage of preprocessing, up-sample scheme is located in order to return into the original size then feed into H.264/AVC encoder. The proposed method can gain 3–4 dB and reduce computational time by 44 %–50 %.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125750964","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-10-01DOI: 10.1109/ICSITECH.2017.8257087
Erick Alfons Lisangan, Sean Coonery Sumarta
Route selection from the point of origin to destination today is not only considering the shortest distance but also traffic conditions, such as average speed and vehicle intensity. In this research, we propose method of the ant's location selection using Fuzzy Inference System in the Ant Colony System. The location selection not only consider the distance but also the probability of next location. The probability of next location is the output of fuzzy inference system with the input is the traffic conditions between current location and next location. The dataset is data of traffic condition in the area of Aarhus, Denmark. The results show that the route selection is not only based on the distance location but also the traffic condition between locations. The proposed method is expected to be the basis to develop the real-time location searching's application with input coming from sensors by considering the average execution less than one second in finding route.
{"title":"Route selection based on real time traffic condition using Ant Colony System and fuzzy inference system","authors":"Erick Alfons Lisangan, Sean Coonery Sumarta","doi":"10.1109/ICSITECH.2017.8257087","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257087","url":null,"abstract":"Route selection from the point of origin to destination today is not only considering the shortest distance but also traffic conditions, such as average speed and vehicle intensity. In this research, we propose method of the ant's location selection using Fuzzy Inference System in the Ant Colony System. The location selection not only consider the distance but also the probability of next location. The probability of next location is the output of fuzzy inference system with the input is the traffic conditions between current location and next location. The dataset is data of traffic condition in the area of Aarhus, Denmark. The results show that the route selection is not only based on the distance location but also the traffic condition between locations. The proposed method is expected to be the basis to develop the real-time location searching's application with input coming from sensors by considering the average execution less than one second in finding route.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750370","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-10-01DOI: 10.1109/ICSITECH.2017.8257187
Achmad Solichin, Erwin Wahyu Ramadhan
The security and privacy of the data transmitted is an important aspect of the exchange of information on the Internet network. Cryptography and Steganography are two of the most commonly used digital data security techniques. In this research, we proposed the combination of the cryptographic method with Data Encryption Standard (DES) algorithm and the steganographic method with Discrete Cosine Transform (DCT) to develop a digital data security application. The application can be used to secure document data in Word, Excel, Powerpoint or PDF format. Data encrypted with DES algorithm and further hidden in image cover using DCT algorithm. The results showed that the quality of the image that has been inserted (stego-image) is still in a good category with an average PSNR value of 46.9 dB. Also, the experiment results show that the average computational time of 0.75 millisecond/byte, an average size increase of 4.79 times and a success rate of 58%. This research can help solve the problem of data and information security that will be sent through a public network like the internet.
{"title":"Enhancing data security using DES-based cryptography and DCT-based steganography","authors":"Achmad Solichin, Erwin Wahyu Ramadhan","doi":"10.1109/ICSITECH.2017.8257187","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257187","url":null,"abstract":"The security and privacy of the data transmitted is an important aspect of the exchange of information on the Internet network. Cryptography and Steganography are two of the most commonly used digital data security techniques. In this research, we proposed the combination of the cryptographic method with Data Encryption Standard (DES) algorithm and the steganographic method with Discrete Cosine Transform (DCT) to develop a digital data security application. The application can be used to secure document data in Word, Excel, Powerpoint or PDF format. Data encrypted with DES algorithm and further hidden in image cover using DCT algorithm. The results showed that the quality of the image that has been inserted (stego-image) is still in a good category with an average PSNR value of 46.9 dB. Also, the experiment results show that the average computational time of 0.75 millisecond/byte, an average size increase of 4.79 times and a success rate of 58%. This research can help solve the problem of data and information security that will be sent through a public network like the internet.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745182","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-10-01DOI: 10.1109/ICSITECH.2017.8257097
Wahyudi, M. L. Khodra, A. Prihatmanto, C. Machbub
It is common to find graphs with millions of nodes and edges in social networks, computer network, and knowledge bases. A number of edges and nodes that make the computational complexity becomes large beside it the number of nodes and edges that are not important difficult for us to make the process of patterning graph. We propose a compression method to eliminate unimportant nodes and edges becomes a property of the important nodes. We developed an algorithm graph property compression (GPC) to compress the compression property on the yago knowledge-based. The results of research conducted on yago compression can reduce a 42.45 % node and 47.66% edge. It is effective to reduce the size of the graph primarily unimportant node and edge.
{"title":"Knowledge-based graph compression using graph property on Yago","authors":"Wahyudi, M. L. Khodra, A. Prihatmanto, C. Machbub","doi":"10.1109/ICSITECH.2017.8257097","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257097","url":null,"abstract":"It is common to find graphs with millions of nodes and edges in social networks, computer network, and knowledge bases. A number of edges and nodes that make the computational complexity becomes large beside it the number of nodes and edges that are not important difficult for us to make the process of patterning graph. We propose a compression method to eliminate unimportant nodes and edges becomes a property of the important nodes. We developed an algorithm graph property compression (GPC) to compress the compression property on the yago knowledge-based. The results of research conducted on yago compression can reduce a 42.45 % node and 47.66% edge. It is effective to reduce the size of the graph primarily unimportant node and edge.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130795571","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-10-01DOI: 10.1109/ICSITECH.2017.8257122
Leonardo Cahaya, Lely Hiryanto, Teny Handhayani
We proposed unsupervised learning, the Intelligent K-Medoids Algorithm to predict, the length of a study time of universitys students. This algorithm automatically clusters all students based on their 25 weighted scores from 25 different subject as the features. We tested the implementation of the algorithm using 240 students scores. These 240 students have graduated and their graduation time is considered for labeling the cluster. The result is 7 clusters with silhouette value of 0.2416. Each cluster is labeled according to the range of student graduation time. The range in each cluster exists due to the existence of students whose majority of scores are similar, but their graduation times are different. Academic leaving or extending the completion of thesis are the other factors contributing the range graduation time in each cluster. The prediction by k-folding 240 data to 5 subsets results average prediction accuracy of 99.58.
{"title":"Student graduation time prediction using intelligent K-Medoids Algorithm","authors":"Leonardo Cahaya, Lely Hiryanto, Teny Handhayani","doi":"10.1109/ICSITECH.2017.8257122","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257122","url":null,"abstract":"We proposed unsupervised learning, the Intelligent K-Medoids Algorithm to predict, the length of a study time of universitys students. This algorithm automatically clusters all students based on their 25 weighted scores from 25 different subject as the features. We tested the implementation of the algorithm using 240 students scores. These 240 students have graduated and their graduation time is considered for labeling the cluster. The result is 7 clusters with silhouette value of 0.2416. Each cluster is labeled according to the range of student graduation time. The range in each cluster exists due to the existence of students whose majority of scores are similar, but their graduation times are different. Academic leaving or extending the completion of thesis are the other factors contributing the range graduation time in each cluster. The prediction by k-folding 240 data to 5 subsets results average prediction accuracy of 99.58.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919777","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-10-01DOI: 10.1109/ICSITECH.2017.8257189
R. A. Sukamto, R. Megasari
Programming logic is often hard to understand for novice, but in the other side, programming is one of the most important subjects in computer science program. Analogy Mapping is a media which converts source code to analogies images using state machine in order to help students understanding programming logic easily. Therefore this paper reports our work about the effectivity of Analogy Mapping in learning process for basic programming subject students with different learning style.
{"title":"Analogy mapping for different learning style of learners in programming","authors":"R. A. Sukamto, R. Megasari","doi":"10.1109/ICSITECH.2017.8257189","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257189","url":null,"abstract":"Programming logic is often hard to understand for novice, but in the other side, programming is one of the most important subjects in computer science program. Analogy Mapping is a media which converts source code to analogies images using state machine in order to help students understanding programming logic easily. Therefore this paper reports our work about the effectivity of Analogy Mapping in learning process for basic programming subject students with different learning style.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022038","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-10-01DOI: 10.1109/ICSITECH.2017.8257151
Amang Sudarsono, Mike Yuliana, Haryadi Amran Darwito
Data sharing information regarding health status in the e-healthcare systems becomes one of private and very sensitive information that should be kept from exposure by illegal activities. However, since the information are exchanged across public networks (i.e., Internet and wireless networks), the information become vulnerable. Due to the participating users in the network can not be trusted, a secure data sharing process in the e-healthcare system would be mandatory. In this paper, we propose a secure data sharing in the e-healthcare system using Identity-Based Encryption (IBE) with signature to provide: (1) data sharing can be accessed by only authorized users based on unique public identity (ID) and kept its integrity from alteration during transmission simultaneously, and (2) data sharing are encrypted and authenticated such that the data can only be exchanged by authorized users. Meanwhile, experimental results are able to show the practicality of proposed system.
{"title":"A secure data sharing using identity-based encryption scheme for e-healthcare system","authors":"Amang Sudarsono, Mike Yuliana, Haryadi Amran Darwito","doi":"10.1109/ICSITECH.2017.8257151","DOIUrl":"https://doi.org/10.1109/ICSITECH.2017.8257151","url":null,"abstract":"Data sharing information regarding health status in the e-healthcare systems becomes one of private and very sensitive information that should be kept from exposure by illegal activities. However, since the information are exchanged across public networks (i.e., Internet and wireless networks), the information become vulnerable. Due to the participating users in the network can not be trusted, a secure data sharing process in the e-healthcare system would be mandatory. In this paper, we propose a secure data sharing in the e-healthcare system using Identity-Based Encryption (IBE) with signature to provide: (1) data sharing can be accessed by only authorized users based on unique public identity (ID) and kept its integrity from alteration during transmission simultaneously, and (2) data sharing are encrypted and authenticated such that the data can only be exchanged by authorized users. Meanwhile, experimental results are able to show the practicality of proposed system.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123146193","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
扫码关注我们
求助内容：
应助结果提醒方式：