Pub Date : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.121-126
M. Misbahuddin, M. Iqbal, Giri Wahyu Wiriasto, L. Ahmad, S. Akbar, M. Irwan
Outdoor positioning is one of the important applications in the Internet of things (IoT). The usage of GPS is unsuitable for low-power IoT devices. Alternatively, it can use the LoRa devices. This research aims to find a better method as the fingerprint algorithm for determining the outdoor position using RSS LoRa. The methods used as the fingerprint algorithm were two artificial neural network models, i.e. backpropagation (BP) with four types of training methods and learning vector quantization (LVQ) with two types of training methods. The experiment results show the performance of LVQ1 better than those of LVQ2. Besides, the LVQ1 was also better than the BP method. However, both BP and LVQ2 have a performance that is almost similar to about 70 %. Both of the artificial neural network models, BP and LVQ, can be used as a fingerprint algorithm to determine quite accurate the outdoor object position.
{"title":"Kinerja jaringan saraf berbasis backpropagation dan LVQ sebagai algoritme fingerprint RSS LoRa untuk penentuan posisi pada ruang terbuka","authors":"M. Misbahuddin, M. Iqbal, Giri Wahyu Wiriasto, L. Ahmad, S. Akbar, M. Irwan","doi":"10.14710/JTSISKOM.8.2.2020.121-126","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.121-126","url":null,"abstract":"Outdoor positioning is one of the important applications in the Internet of things (IoT). The usage of GPS is unsuitable for low-power IoT devices. Alternatively, it can use the LoRa devices. This research aims to find a better method as the fingerprint algorithm for determining the outdoor position using RSS LoRa. The methods used as the fingerprint algorithm were two artificial neural network models, i.e. backpropagation (BP) with four types of training methods and learning vector quantization (LVQ) with two types of training methods. The experiment results show the performance of LVQ1 better than those of LVQ2. Besides, the LVQ1 was also better than the BP method. However, both BP and LVQ2 have a performance that is almost similar to about 70 %. Both of the artificial neural network models, BP and LVQ, can be used as a fingerprint algorithm to determine quite accurate the outdoor object position.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"55 2","pages":"121-126"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209278","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 : 2020-04-30DOI: 10.14710/jtsiskom.8.2.2020.133-139
Syahroni Hidayat, R. Rismayati, M. Tajuddin, Ni Luh Putu Merawati
One of the strategic plans of the developing universities in obtaining new students is forming a partnership with surrounding high schools. However, partnerships made does not always behave as expected. This paper presented the segmentation technique to the previous new student admission dataset using the integration of recency, frequency, and monetary (RFM) analysis and fuzzy c-means (FCM) algorithm to evaluate the loyalty of the entire school that has bound the partnership with the institution. The dataset is converted using the RFM approach before processed with the FCM algorithm. The result reveals that the schools can be segmented, respectively, as high potential (SP), potential (P), low potential (CP), and very low potential (KP) categories with PCI value 0.86. From the analysis of SP, P, and CP, only 71 % of 52 school partners categorized as loyal partners.
{"title":"Segmentation of university customers loyalty based on RFM analysis using fuzzy c-means clustering","authors":"Syahroni Hidayat, R. Rismayati, M. Tajuddin, Ni Luh Putu Merawati","doi":"10.14710/jtsiskom.8.2.2020.133-139","DOIUrl":"https://doi.org/10.14710/jtsiskom.8.2.2020.133-139","url":null,"abstract":"One of the strategic plans of the developing universities in obtaining new students is forming a partnership with surrounding high schools. However, partnerships made does not always behave as expected. This paper presented the segmentation technique to the previous new student admission dataset using the integration of recency, frequency, and monetary (RFM) analysis and fuzzy c-means (FCM) algorithm to evaluate the loyalty of the entire school that has bound the partnership with the institution. The dataset is converted using the RFM approach before processed with the FCM algorithm. The result reveals that the schools can be segmented, respectively, as high potential (SP), potential (P), low potential (CP), and very low potential (KP) categories with PCI value 0.86. From the analysis of SP, P, and CP, only 71 % of 52 school partners categorized as loyal partners.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"8 1","pages":"133-139"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43427075","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 : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.157-163
Mulki Indana Zulfa, Ari Fadli, Arief Wisnu Wardhana
Utilization of an in-memory database as a cache can overcome relational database latency problems in a web application, especially when using a lot of join queries. This study aims to model the academic relational data into Redis compatible data and analyze the performance of join queries usage to accelerate access to relational data managed by RDBMS. This study used academic data to calculate student GPA that is modeled in the RDBMS and Redis in-memory database (IMDB). The use of Redis as an in-memory database can significantly increase Mysql database system performance up to 3.3 times faster to display student data using join query and to shorten the time needed to display GPA data to 52 microseconds from 61 milliseconds.
{"title":"Strategi caching aplikasi berbasis in-memory menggunakan Redis server untuk mempercepat akses data relasional","authors":"Mulki Indana Zulfa, Ari Fadli, Arief Wisnu Wardhana","doi":"10.14710/JTSISKOM.8.2.2020.157-163","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.157-163","url":null,"abstract":"Utilization of an in-memory database as a cache can overcome relational database latency problems in a web application, especially when using a lot of join queries. This study aims to model the academic relational data into Redis compatible data and analyze the performance of join queries usage to accelerate access to relational data managed by RDBMS. This study used academic data to calculate student GPA that is modeled in the RDBMS and Redis in-memory database (IMDB). The use of Redis as an in-memory database can significantly increase Mysql database system performance up to 3.3 times faster to display student data using join query and to shorten the time needed to display GPA data to 52 microseconds from 61 milliseconds.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"60 14","pages":"157-163"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209233","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 : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.121-126
M. Misbahuddin, M. Iqbal, Giri Wahyu Wiriasto, L. Ahmad, S. Akbar, M. Irwan
Outdoor positioning is one of the important applications in the Internet of things (IoT). The usage of GPS is unsuitable for low-power IoT devices. Alternatively, it can use the LoRa devices. This research aims to find a better method as the fingerprint algorithm for determining the outdoor position using RSS LoRa. The methods used as the fingerprint algorithm were two artificial neural network models, i.e. backpropagation (BP) with four types of training methods and learning vector quantization (LVQ) with two types of training methods. The experiment results show the performance of LVQ1 better than those of LVQ2. Besides, the LVQ1 was also better than the BP method. However, both BP and LVQ2 have a performance that is almost similar to about 70 %. Both of the artificial neural network models, BP and LVQ, can be used as a fingerprint algorithm to determine quite accurate the outdoor object position.
{"title":"Kinerja jaringan saraf berbasis backpropagation dan LVQ sebagai algoritme fingerprint RSS LoRa untuk penentuan posisi pada ruang terbuka","authors":"M. Misbahuddin, M. Iqbal, Giri Wahyu Wiriasto, L. Ahmad, S. Akbar, M. Irwan","doi":"10.14710/JTSISKOM.8.2.2020.121-126","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.121-126","url":null,"abstract":"Outdoor positioning is one of the important applications in the Internet of things (IoT). The usage of GPS is unsuitable for low-power IoT devices. Alternatively, it can use the LoRa devices. This research aims to find a better method as the fingerprint algorithm for determining the outdoor position using RSS LoRa. The methods used as the fingerprint algorithm were two artificial neural network models, i.e. backpropagation (BP) with four types of training methods and learning vector quantization (LVQ) with two types of training methods. The experiment results show the performance of LVQ1 better than those of LVQ2. Besides, the LVQ1 was also better than the BP method. However, both BP and LVQ2 have a performance that is almost similar to about 70 %. Both of the artificial neural network models, BP and LVQ, can be used as a fingerprint algorithm to determine quite accurate the outdoor object position.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"4 1","pages":"121-126"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209099","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 : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.157-163
Mulki Indana Zulfa, Ari Fadli, Arief Wisnu Wardhana
Utilization of an in-memory database as a cache can overcome relational database latency problems in a web application, especially when using a lot of join queries. This study aims to model the academic relational data into Redis compatible data and analyze the performance of join queries usage to accelerate access to relational data managed by RDBMS. This study used academic data to calculate student GPA that is modeled in the RDBMS and Redis in-memory database (IMDB). The use of Redis as an in-memory database can significantly increase Mysql database system performance up to 3.3 times faster to display student data using join query and to shorten the time needed to display GPA data to 52 microseconds from 61 milliseconds.
{"title":"Strategi caching aplikasi berbasis in-memory menggunakan Redis server untuk mempercepat akses data relasional","authors":"Mulki Indana Zulfa, Ari Fadli, Arief Wisnu Wardhana","doi":"10.14710/JTSISKOM.8.2.2020.157-163","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.157-163","url":null,"abstract":"Utilization of an in-memory database as a cache can overcome relational database latency problems in a web application, especially when using a lot of join queries. This study aims to model the academic relational data into Redis compatible data and analyze the performance of join queries usage to accelerate access to relational data managed by RDBMS. This study used academic data to calculate student GPA that is modeled in the RDBMS and Redis in-memory database (IMDB). The use of Redis as an in-memory database can significantly increase Mysql database system performance up to 3.3 times faster to display student data using join query and to shorten the time needed to display GPA data to 52 microseconds from 61 milliseconds.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"11 12","pages":"157-163"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209189","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 : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.106-112
Adri Priadana, Ari Murdiyanto
The quality of farmed shrimps has several criteria, one of which is shrimp size. The shrimp selection was carried out by the contractor at the harvest time by grouping the shrimp based on their size. This study aims to apply digital image processing for shrimp clustering based on size using the connected component analysis (CCA) and density-based spatial clustering of applications with noise (DBSCAN) methods. Shrimp group images were taken with a digital camera at a light intensity of 1200-3200 lux. The clustering results were compared with clustering from direct observation by two experts, each of which obtained an accuracy of 79.81 % and 72.99 % so that the average accuracy of the method was 76.4 %.
{"title":"Klasterisasi udang berdasarkan ukuran berbasis pemrosesan citra digital menggunakan metode CCA dan DBSCAN","authors":"Adri Priadana, Ari Murdiyanto","doi":"10.14710/JTSISKOM.8.2.2020.106-112","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.106-112","url":null,"abstract":"The quality of farmed shrimps has several criteria, one of which is shrimp size. The shrimp selection was carried out by the contractor at the harvest time by grouping the shrimp based on their size. This study aims to apply digital image processing for shrimp clustering based on size using the connected component analysis (CCA) and density-based spatial clustering of applications with noise (DBSCAN) methods. Shrimp group images were taken with a digital camera at a light intensity of 1200-3200 lux. The clustering results were compared with clustering from direct observation by two experts, each of which obtained an accuracy of 79.81 % and 72.99 % so that the average accuracy of the method was 76.4 %.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"60 20","pages":"106-112"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209229","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 : 2020-04-30DOI: 10.14710/JTSISKOM.8.2.2020.106-112
Adri Priadana, Ari Murdiyanto
The quality of farmed shrimps has several criteria, one of which is shrimp size. The shrimp selection was carried out by the contractor at the harvest time by grouping the shrimp based on their size. This study aims to apply digital image processing for shrimp clustering based on size using the connected component analysis (CCA) and density-based spatial clustering of applications with noise (DBSCAN) methods. Shrimp group images were taken with a digital camera at a light intensity of 1200-3200 lux. The clustering results were compared with clustering from direct observation by two experts, each of which obtained an accuracy of 79.81 % and 72.99 % so that the average accuracy of the method was 76.4 %.
{"title":"Klasterisasi udang berdasarkan ukuran berbasis pemrosesan citra digital menggunakan metode CCA dan DBSCAN","authors":"Adri Priadana, Ari Murdiyanto","doi":"10.14710/JTSISKOM.8.2.2020.106-112","DOIUrl":"https://doi.org/10.14710/JTSISKOM.8.2.2020.106-112","url":null,"abstract":"The quality of farmed shrimps has several criteria, one of which is shrimp size. The shrimp selection was carried out by the contractor at the harvest time by grouping the shrimp based on their size. This study aims to apply digital image processing for shrimp clustering based on size using the connected component analysis (CCA) and density-based spatial clustering of applications with noise (DBSCAN) methods. Shrimp group images were taken with a digital camera at a light intensity of 1200-3200 lux. The clustering results were compared with clustering from direct observation by two experts, each of which obtained an accuracy of 79.81 % and 72.99 % so that the average accuracy of the method was 76.4 %.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"63 11","pages":"106-112"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209133","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 : 2020-04-24DOI: 10.14710/JTSISKOM.2020.13619
Merinda Lestandy, Lailis Syafa’ah, Amrul Faruq
Blood donation is the process of taking blood from someone used for blood transfusions. Blood type, sex, age, blood pressure, and hemoglobin are blood donor criteria that must be met and processed manually to classify blood donor eligibility. The manual process resulted in an irregular blood supply because blood donor candidates did not meet the criteria. This study implements machine learning algorithms includes kNN, naïve Bayes, and neural network methods to determine the eligibility of blood donors. This study used 600 training data divided into two classes, namely potential and non-potential donors. The test results show that the accuracy of the neural network is 84.3 %, higher than kNN and naïve Bayes, respectively of 75 % and 84.17 %. It indicates that the neural network method outperforms comparing with kNN and naïve Bayes.
{"title":"Classification of potential blood donors using machine learning algorithms approach","authors":"Merinda Lestandy, Lailis Syafa’ah, Amrul Faruq","doi":"10.14710/JTSISKOM.2020.13619","DOIUrl":"https://doi.org/10.14710/JTSISKOM.2020.13619","url":null,"abstract":"Blood donation is the process of taking blood from someone used for blood transfusions. Blood type, sex, age, blood pressure, and hemoglobin are blood donor criteria that must be met and processed manually to classify blood donor eligibility. The manual process resulted in an irregular blood supply because blood donor candidates did not meet the criteria. This study implements machine learning algorithms includes kNN, naïve Bayes, and neural network methods to determine the eligibility of blood donors. This study used 600 training data divided into two classes, namely potential and non-potential donors. The test results show that the accuracy of the neural network is 84.3 %, higher than kNN and naïve Bayes, respectively of 75 % and 84.17 %. It indicates that the neural network method outperforms comparing with kNN and naïve Bayes.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"127 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141210279","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 : 2020-04-23DOI: 10.14710/jtsiskom.2020.13643
Ali Rizal Chaidir, Gamma Aditya Rahardi, Khairul Anam
Line following and lane tracking are robotic navigation techniques that use lines as a guide. The techniques can be applied to mobile robots in the industry. This research applied the Braitenberg controller and image processing to control and obtain line information around the mobile robot. The robot was implemented using Arduino Uno as a controller. A webcam was connected to a computer that performs image processing using canny edge detection and sends the data to the robot controller via serial communication. The robot can navigate on the side of the line, and the success rate of the system is 100 % at a turn of 135 ° and 80 % at a turn of 90 °.
{"title":"Mobile robot navigation based on line landmarks using the Braitenberg controller and image processing","authors":"Ali Rizal Chaidir, Gamma Aditya Rahardi, Khairul Anam","doi":"10.14710/jtsiskom.2020.13643","DOIUrl":"https://doi.org/10.14710/jtsiskom.2020.13643","url":null,"abstract":"Line following and lane tracking are robotic navigation techniques that use lines as a guide. The techniques can be applied to mobile robots in the industry. This research applied the Braitenberg controller and image processing to control and obtain line information around the mobile robot. The robot was implemented using Arduino Uno as a controller. A webcam was connected to a computer that performs image processing using canny edge detection and sends the data to the robot controller via serial communication. The robot can navigate on the side of the line, and the success rate of the system is 100 % at a turn of 135 ° and 80 % at a turn of 90 °.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"123 30","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141210316","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 : 2020-04-19DOI: 10.14710/jtsiskom.2020.13468
Laurentinus Laurentinus, H. Pradana, Dwi Yuny Sylfania, F. P. Juniawan
Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.
{"title":"Performance comparison of RSA and AES to SMS messages compression using Huffman algorithm","authors":"Laurentinus Laurentinus, H. Pradana, Dwi Yuny Sylfania, F. P. Juniawan","doi":"10.14710/jtsiskom.2020.13468","DOIUrl":"https://doi.org/10.14710/jtsiskom.2020.13468","url":null,"abstract":"Improved security of short message services (SMS) can be obtained using cryptographic methods, both symmetric and asymmetric, but must remain efficient. This paper aims to study the performance and efficiency of the symmetric crypto of AES-128 and asymmetric crypto of RSA with message compression in securing SMS messages. The ciphertext of RSA and AES were compressed using the Huffman algorithm. The average AES encryption time for each character is faster than RSA, which is 5.8 and 24.7 ms/character for AES and AES+Huffman encryption and 8.7 and 45.8 ms/character for RSA and RSA+Huffman, from messages with 15, 30, 60 and 90 characters. AES decryption time is also faster, which is 27.2 ms/character compared to 47.6 ms/character in RSA. Huffman compression produces an average efficiency of 24.8 % for the RSA algorithm, better than 17.35 % of AES efficiency for plaintext of 1, 16, 45, and 88 characters.","PeriodicalId":56231,"journal":{"name":"Jurnal Teknologi dan Sistem Komputer","volume":"2 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141211379","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
扫码关注我们
求助内容：
应助结果提醒方式：