Pub Date : 2023-09-25DOI: 10.5614/itbj.ict.res.appl.2023.17.2.8
Wervyan Shalannanda, Fajri Anugerah P. Kornel, Naufal Rafi Hibatullah, Fahmi Fahmi, Erwin Sutanto, Muhammad Yazid, Muhammad Aziz, Muhammad Imran Hamid
In recent years, the Internet of Things (IoT) trend has been adopted very quickly. The rapid growth of IoT has increased the need for physical access control systems (ACS) for IoT devices, especially for IoT devices containing confidential data or other potential security risks. This research focused on many-to-many ACS, a type of ACS in which many resource-owners and resource-users are involved in the same system. This type of system is advantageous in that the user can conveniently access resources from different resource-owners using the same system. However, such a system may create a situation where parties involved in the system have their data leaked because of the large number of parties involved in the system. Therefore, ‘isolation’ of the parties involved is needed. This research simulated the use of smart cards to access electric vehicle (EV) charging stations that implement an isolated many-to-many authentication scheme. Two ESP8266 MCUs, one RC522 RFID reader, and an LED represented an EV charging station. Each institute used a Raspberry Pi Zero W as the web and database server. This research also used VPN and HTTPS protocols to isolate each institute’s assets. Every component of the system was successfully implemented and tested functionally.
{"title":"Smart Card-based Access Control System using Isolated Many-to-Many Authentication Scheme for Electric Vehicle Charging Stations","authors":"Wervyan Shalannanda, Fajri Anugerah P. Kornel, Naufal Rafi Hibatullah, Fahmi Fahmi, Erwin Sutanto, Muhammad Yazid, Muhammad Aziz, Muhammad Imran Hamid","doi":"10.5614/itbj.ict.res.appl.2023.17.2.8","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.8","url":null,"abstract":"In recent years, the Internet of Things (IoT) trend has been adopted very quickly. The rapid growth of IoT has increased the need for physical access control systems (ACS) for IoT devices, especially for IoT devices containing confidential data or other potential security risks. This research focused on many-to-many ACS, a type of ACS in which many resource-owners and resource-users are involved in the same system. This type of system is advantageous in that the user can conveniently access resources from different resource-owners using the same system. However, such a system may create a situation where parties involved in the system have their data leaked because of the large number of parties involved in the system. Therefore, ‘isolation’ of the parties involved is needed. This research simulated the use of smart cards to access electric vehicle (EV) charging stations that implement an isolated many-to-many authentication scheme. Two ESP8266 MCUs, one RC522 RFID reader, and an LED represented an EV charging station. Each institute used a Raspberry Pi Zero W as the web and database server. This research also used VPN and HTTPS protocols to isolate each institute’s assets. Every component of the system was successfully implemented and tested functionally.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135816745","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 : 2023-09-13DOI: 10.5614/itbj.ict.res.appl.2023.17.2.7
Nasy`an Taufiq Al Ghifari, Gusti Ayu Putri Saptawati, Masayu Leylia Khodra, Benhard Sitohang
Dynamic heterogeneous graphs can represent real-world networks. Predicting links in these graphs is more complicated than in static graphs. Until now, research interest of link prediction has focused on static heterogeneous graphs or dynamically homogeneous graphs. A link prediction technique combining temporal RNN and hierarchical attention has recently emerged, called DyHATR. This method is claimed to be able to work on dynamic heterogeneous graphs by testing them on four publicly available data sets (Twitter, Math-Overflow, Ecomm, and Alibaba). However, after further analysis, it turned out that the four data sets did not meet the criteria of dynamic heterogeneous graphs. In the present work, we evaluated the performance of DyHATR on dynamic heterogeneous graphs. We conducted experiments with DyHATR based on the Yelp data set represented as a dynamic heterogeneous graph consisting of homogeneous subgraphs. The results show that DyHATR can be applied to identify link prediction on dynamic heterogeneous graphs by simultaneously capturing heterogeneous information and evolutionary patterns, and then considering them to carry out link predicition. Compared to the baseline method, the accuracy achieved by DyHATR is competitive, although the results can still be improved.
{"title":"The Evaluation of DyHATR Performance for Dynamic Heterogeneous Graphs","authors":"Nasy`an Taufiq Al Ghifari, Gusti Ayu Putri Saptawati, Masayu Leylia Khodra, Benhard Sitohang","doi":"10.5614/itbj.ict.res.appl.2023.17.2.7","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.7","url":null,"abstract":"Dynamic heterogeneous graphs can represent real-world networks. Predicting links in these graphs is more complicated than in static graphs. Until now, research interest of link prediction has focused on static heterogeneous graphs or dynamically homogeneous graphs. A link prediction technique combining temporal RNN and hierarchical attention has recently emerged, called DyHATR. This method is claimed to be able to work on dynamic heterogeneous graphs by testing them on four publicly available data sets (Twitter, Math-Overflow, Ecomm, and Alibaba). However, after further analysis, it turned out that the four data sets did not meet the criteria of dynamic heterogeneous graphs. In the present work, we evaluated the performance of DyHATR on dynamic heterogeneous graphs. We conducted experiments with DyHATR based on the Yelp data set represented as a dynamic heterogeneous graph consisting of homogeneous subgraphs. The results show that DyHATR can be applied to identify link prediction on dynamic heterogeneous graphs by simultaneously capturing heterogeneous information and evolutionary patterns, and then considering them to carry out link predicition. Compared to the baseline method, the accuracy achieved by DyHATR is competitive, although the results can still be improved.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135741077","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 : 2023-09-01DOI: 10.5614/itbj.ict.res.appl.2023.17.2.6
Ajitha Santhakumari, R. Shilpa, Hudhaifa Mohammed Abdulwahab
The outbreak of Covid-19 has caused a global health crisis, presenting numerous challenges to the healthcare system with its severe respiratory symptoms and variable presentation. Early and accurate diagnosis of the virus is critical in controlling its spread and reducing the burden on healthcare facilities. To address this issue and relieve the strain on the healthcare system, this paper proposes a machine learning-based approach for Covid-19 diagnosis. Four algorithms were used for analyzing early Covid-19 detection, i.e., logistic regression, random forest, decision tree, and naive Bayes, using a data set of basic symptoms such as fever, shortness of breath, etc. for predicting positive and negative Covid-19 cases. Furthermore, development of a web portal that provides information on global vaccine distribution and the most widely used vaccines by country along with Covid-19 predictions. Our evaluation results demonstrate that the decision tree model outperformed the other models, achieving an accuracy of 97.69%. This study provides a practical solution to the ongoing Covid-19 crisis through an improved diagnosis method and access to vaccination information.
{"title":"Machine Learning-based Early Detection and Prognosis of the Covid-19 Pandemic","authors":"Ajitha Santhakumari, R. Shilpa, Hudhaifa Mohammed Abdulwahab","doi":"10.5614/itbj.ict.res.appl.2023.17.2.6","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.6","url":null,"abstract":"The outbreak of Covid-19 has caused a global health crisis, presenting numerous challenges to the healthcare system with its severe respiratory symptoms and variable presentation. Early and accurate diagnosis of the virus is critical in controlling its spread and reducing the burden on healthcare facilities. To address this issue and relieve the strain on the healthcare system, this paper proposes a machine learning-based approach for Covid-19 diagnosis. Four algorithms were used for analyzing early Covid-19 detection, i.e., logistic regression, random forest, decision tree, and naive Bayes, using a data set of basic symptoms such as fever, shortness of breath, etc. for predicting positive and negative Covid-19 cases. Furthermore, development of a web portal that provides information on global vaccine distribution and the most widely used vaccines by country along with Covid-19 predictions. Our evaluation results demonstrate that the decision tree model outperformed the other models, achieving an accuracy of 97.69%. This study provides a practical solution to the ongoing Covid-19 crisis through an improved diagnosis method and access to vaccination information.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47520571","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 : 2023-08-31DOI: 10.5614/itbj.ict.res.appl.2023.17.2.4
K. Aditya Shastry, B.A. Manjunatha, T.G. Mohan Kumar, D.U. Karthik
The rate of advancement in the field of artificial intelligence (AI) has drastically increased over the past twenty years or so. From AI models that can classify every object in an image to realistic chatbots, the signs of progress can be found in all fields. This work focused on tackling a relatively new problem in the current scenario-generative capabilities of AI. While the classification and prediction models have matured and entered the mass market across the globe, generation through AI is still in its initial stages. Generative tasks consist of an AI model learning the features of a given input and using these learned values to generate completely new output values that were not originally part of the input dataset. The most common input type given to generative models are images. The most popular architectures for generative models are autoencoders and generative adversarial networks (GANs). Our study aimed to use GANs to generate realistic images from a purely semantic representation of a scene. While our model can be used on any kind of scene, we used the Indian Driving Dataset to train our model. Through this work, we could arrive at answers to the following questions: (1) the scope of GANs in interpreting and understanding textures and variables in complex scenes; (2) the application of such a model in the field of gaming and virtual reality; (3) the possible impact of generating realistic deep fakes on society.
{"title":"Generative Adversarial Networks Based Scene Generation on Indian Driving Dataset","authors":"K. Aditya Shastry, B.A. Manjunatha, T.G. Mohan Kumar, D.U. Karthik","doi":"10.5614/itbj.ict.res.appl.2023.17.2.4","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.4","url":null,"abstract":"The rate of advancement in the field of artificial intelligence (AI) has drastically increased over the past twenty years or so. From AI models that can classify every object in an image to realistic chatbots, the signs of progress can be found in all fields. This work focused on tackling a relatively new problem in the current scenario-generative capabilities of AI. While the classification and prediction models have matured and entered the mass market across the globe, generation through AI is still in its initial stages. Generative tasks consist of an AI model learning the features of a given input and using these learned values to generate completely new output values that were not originally part of the input dataset. The most common input type given to generative models are images. The most popular architectures for generative models are autoencoders and generative adversarial networks (GANs). Our study aimed to use GANs to generate realistic images from a purely semantic representation of a scene. While our model can be used on any kind of scene, we used the Indian Driving Dataset to train our model. Through this work, we could arrive at answers to the following questions: (1) the scope of GANs in interpreting and understanding textures and variables in complex scenes; (2) the application of such a model in the field of gaming and virtual reality; (3) the possible impact of generating realistic deep fakes on society.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136036317","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 : 2023-08-31DOI: 10.5614/itbj.ict.res.appl.2023.17.2.1
Vinícius Henrique Geraldo Correa, Rodrigo Aparecido da Silva Braga, Dean Bicudo Karolak, Fernanda Rodrigues Silva
In this paper, a 180-nm CMOS ring oscillator design, made with halo-implanted transistors and operating in the weak inversion region, is proposed, based on an undergraduate integrated circuit design course methodology for building logic gates and comparing simulated results with reviewed literature data. Halo-implanted channel transistors have a steeper and less distorted voltage characteristic curve compared to uniformly doped channel ones, which makes them a more appropriate option when designing asynchronous digital integrated circuits aimed at low bias and low power. Three gate models were created using weak inversion and pull-up and pull-down networks made with halo-implanted transistors. The results of the study and simulation of the three inverter digital gate topologies showed that the NOT inverter model, as expected, had a higher frequency than the NAND and NOR inverter models. The ring oscillators made with the NOT inverter came up with an 8.25-MHz switching frequency as well as a dynamic power close to 270 nW. A comparison with other ring oscillators from previous studies is also shown.
{"title":"A Subthreshold Biased CMOS Ring Oscillator Model Design in 180-nm Process","authors":"Vinícius Henrique Geraldo Correa, Rodrigo Aparecido da Silva Braga, Dean Bicudo Karolak, Fernanda Rodrigues Silva","doi":"10.5614/itbj.ict.res.appl.2023.17.2.1","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.1","url":null,"abstract":"In this paper, a 180-nm CMOS ring oscillator design, made with halo-implanted transistors and operating in the weak inversion region, is proposed, based on an undergraduate integrated circuit design course methodology for building logic gates and comparing simulated results with reviewed literature data. Halo-implanted channel transistors have a steeper and less distorted voltage characteristic curve compared to uniformly doped channel ones, which makes them a more appropriate option when designing asynchronous digital integrated circuits aimed at low bias and low power. Three gate models were created using weak inversion and pull-up and pull-down networks made with halo-implanted transistors. The results of the study and simulation of the three inverter digital gate topologies showed that the NOT inverter model, as expected, had a higher frequency than the NAND and NOR inverter models. The ring oscillators made with the NOT inverter came up with an 8.25-MHz switching frequency as well as a dynamic power close to 270 nW. A comparison with other ring oscillators from previous studies is also shown.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136036823","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 : 2023-08-31DOI: 10.5614/itbj.ict.res.appl.2023.17.2.3
Li-Hua Li, Radius Tanone
Corn leaf diseases such as blight spot, gray leaf spot, and common rust still lurk in corn fields. This problem must be solved to help corn farmers. The ConvMixer model, consisting of a patch embedding layer, is a new model with a simple structure. When training a model with ConvMixer, improvisation is an important part that needs to be further explored to achieve better accuracy. By using advanced data augmentation techniques such as MixUp and CutMix, the robustness of ConvMixer model can be well achieved for corn leaf diseases classification. We describe experimental evidence in this article using precision, recall, accuracy score, and F1 score as performance metrics. As a result, it turned out that the training model with the data set without extension on the ConvMixer model achieved an accuracy of 0.9812, but this could still be improved. In fact, when we used the MixUp and CutMix augmentation, the training model results increased significantly to 0.9925 and 0.9932, respectively.
{"title":"Improving Robustness Using MixUp and CutMix Augmentation for Corn Leaf Diseases Classification based on ConvMixer Architecture","authors":"Li-Hua Li, Radius Tanone","doi":"10.5614/itbj.ict.res.appl.2023.17.2.3","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.3","url":null,"abstract":"Corn leaf diseases such as blight spot, gray leaf spot, and common rust still lurk in corn fields. This problem must be solved to help corn farmers. The ConvMixer model, consisting of a patch embedding layer, is a new model with a simple structure. When training a model with ConvMixer, improvisation is an important part that needs to be further explored to achieve better accuracy. By using advanced data augmentation techniques such as MixUp and CutMix, the robustness of ConvMixer model can be well achieved for corn leaf diseases classification. We describe experimental evidence in this article using precision, recall, accuracy score, and F1 score as performance metrics. As a result, it turned out that the training model with the data set without extension on the ConvMixer model achieved an accuracy of 0.9812, but this could still be improved. In fact, when we used the MixUp and CutMix augmentation, the training model results increased significantly to 0.9925 and 0.9932, respectively.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136036316","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 : 2023-08-31DOI: 10.5614/itbj.ict.res.appl.2023.17.2.2
Rajeshwari B S, C.B. Yogeesha, M. Vaishnavi, Yashita P. Jain, B.V. Ramyashree, Arpith Kumar
In the world of computer technology, sorting is an operation on a data set that involves ordering it in an increasing or decreasing fashion according to some linear relationship among the data items. With the rise in the generation of big data, the concept of big numbers has come into existence. When the number of records to be sorted is limited to thousands, traditional sorting approaches can be used; in such cases, complexities in their execution time can be ignored. However, in the case of big data, where processing times for billions or trillions of records are very long, time complexity is very significant. Therefore, an optimized sorting technique with efficient time complexity is very much required. Hence, in this paper an optimized sorting technique is proposed, named Optimized Hybrid Two-in-One Novel Sorting Technique (OHTO, a mixed approach of the Insertion Sort technique and the Bubble Sort technique. The proposed sorting technique uses the procedure of both Bubble Sort and Insertion Sort, resulting in fewer comparisons, fewer data movements, fewer data insertions, and less time complexity for any given input data set compared to existing sorting techniques.
{"title":"Enhanced Relative Comparison of Traditional Sorting Approaches towards Optimization of New Hybrid Two-in-One (OHTO) Novel Sorting Technique","authors":"Rajeshwari B S, C.B. Yogeesha, M. Vaishnavi, Yashita P. Jain, B.V. Ramyashree, Arpith Kumar","doi":"10.5614/itbj.ict.res.appl.2023.17.2.2","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.2.2","url":null,"abstract":"In the world of computer technology, sorting is an operation on a data set that involves ordering it in an increasing or decreasing fashion according to some linear relationship among the data items. With the rise in the generation of big data, the concept of big numbers has come into existence. When the number of records to be sorted is limited to thousands, traditional sorting approaches can be used; in such cases, complexities in their execution time can be ignored. However, in the case of big data, where processing times for billions or trillions of records are very long, time complexity is very significant. Therefore, an optimized sorting technique with efficient time complexity is very much required. Hence, in this paper an optimized sorting technique is proposed, named Optimized Hybrid Two-in-One Novel Sorting Technique (OHTO, a mixed approach of the Insertion Sort technique and the Bubble Sort technique. The proposed sorting technique uses the procedure of both Bubble Sort and Insertion Sort, resulting in fewer comparisons, fewer data movements, fewer data insertions, and less time complexity for any given input data set compared to existing sorting techniques.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136036820","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 : 2023-06-16DOI: 10.5614/itbj.ict.res.appl.2023.17.1.8
Hartuti Mistialustina, Chairunnisa Chairunnisa, A. Munir
Window methods that are frequently used in the design of finite impulse response filters are also applicable to antenna array designs. This paper explores the application of a Kaiser function in a power-weighted antenna array design, focusing on the determination of the Kaiser function’s β parameter. The determination, which includes the calculation, optimization, and validation of the β parameter, was carried out based on a specific configuration of a linear antenna array design. The observation of this exploration emphasized the suppression of the sidelobe level (SLL) and the width of main lobe (WML) performance. By changing the β parameter, the Kaiser function is capable of approximating different window methods, since it plays an important role in defining the set of weighting coefficients for a specifically targeted SLL. Kaiser function application in power-weighted antenna array designs with a linear arrangement indicates the need of β parameter optimization because of the disagreement between the obtained SLL and the targeted SLL. The optimized β parameter produced a smaller SLL error for even and odd numbers of elements. From the validation, the average SLL error percentage for a targeted SLL of 25 dB, 35 dB, and 45 dB was 6%, 4.31%, 6.10%, respectively.
{"title":"Analytical Approach to Parameter Determination in Kaiser Function for Power-weighted Antenna Array Design","authors":"Hartuti Mistialustina, Chairunnisa Chairunnisa, A. Munir","doi":"10.5614/itbj.ict.res.appl.2023.17.1.8","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.1.8","url":null,"abstract":"Window methods that are frequently used in the design of finite impulse response filters are also applicable to antenna array designs. This paper explores the application of a Kaiser function in a power-weighted antenna array design, focusing on the determination of the Kaiser function’s β parameter. The determination, which includes the calculation, optimization, and validation of the β parameter, was carried out based on a specific configuration of a linear antenna array design. The observation of this exploration emphasized the suppression of the sidelobe level (SLL) and the width of main lobe (WML) performance. By changing the β parameter, the Kaiser function is capable of approximating different window methods, since it plays an important role in defining the set of weighting coefficients for a specifically targeted SLL. Kaiser function application in power-weighted antenna array designs with a linear arrangement indicates the need of β parameter optimization because of the disagreement between the obtained SLL and the targeted SLL. The optimized β parameter produced a smaller SLL error for even and odd numbers of elements. From the validation, the average SLL error percentage for a targeted SLL of 25 dB, 35 dB, and 45 dB was 6%, 4.31%, 6.10%, respectively.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45902744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Indonesian government provided various social assistance programs to local governments during Covid-19. One of the difficulties for the local governments in determining candidates for social aid is ensuring that the number of candidates is in balance with the available quota. Therefore, the local governments must select the most eligible candidates. This study proposes a priority model that can provide recommendations for candidates who meet the criteria for social assistance. The six parameters used in this study were: number of dependents, occupation, income, age, Covid status, and citizen status. The model operates in two stages, namely classification followed by ranking. The classification stage is conducted using a decision tree, while the ranking stage is performed conducted using the Analytical Hierarchy Process (AHP) algorithm. The decision tree separates two classes, namely, eligible and non-eligible. In addition, the classification process is also used to determine the dominant attributes and played a role in the modeling. The proposed model generates a list of the most eligible candidates based on our research. These are sorted by weight from greatest to most eligible using five dominant parameters: number of dependents, income, age, Covid status, and citizen status.
{"title":"The Utility of Decision Tree and Analytics Hierarchy Process in Prioritizing of Social Aid Distribution due to Covid-19 Pandemic in Indonesia","authors":"S. Diwandari, Enny Itje Sela, Briyan Efflin Syahputra, Nathaniela Aptanta Parama, Anindita Septiarini","doi":"10.5614/itbj.ict.res.appl.2023.17.1.6","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.1.6","url":null,"abstract":"The Indonesian government provided various social assistance programs to local governments during Covid-19. One of the difficulties for the local governments in determining candidates for social aid is ensuring that the number of candidates is in balance with the available quota. Therefore, the local governments must select the most eligible candidates. This study proposes a priority model that can provide recommendations for candidates who meet the criteria for social assistance. The six parameters used in this study were: number of dependents, occupation, income, age, Covid status, and citizen status. The model operates in two stages, namely classification followed by ranking. The classification stage is conducted using a decision tree, while the ranking stage is performed conducted using the Analytical Hierarchy Process (AHP) algorithm. The decision tree separates two classes, namely, eligible and non-eligible. In addition, the classification process is also used to determine the dominant attributes and played a role in the modeling. The proposed model generates a list of the most eligible candidates based on our research. These are sorted by weight from greatest to most eligible using five dominant parameters: number of dependents, income, age, Covid status, and citizen status.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45040825","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 : 2023-04-28DOI: 10.5614/itbj.ict.res.appl.2023.17.1.5
N. Weerawarna, U. Manawadu, P. R. D. De Silva
The robot ‘Lometh’ is an information-presenting robot that naturally interacts with people in a supermarket environment. In recent years, considerable effort has been devoted to the implementation of robotic interfaces to identify effective behaviors of communication robots focusing only on the social and physical factors of the addresser and the hearer. As attention focus and attention target shifting of people differs based on the human visual focus and the spatiality, this study considered four interactive regions, considering the visual focus of attention as well as the interpersonal space between robot and human. The collected primary data revealed that 56% attention shifts occurred in near peripheral field of view regions and 44% attention shifts in far peripheral field of view regions. Using correspondence analysis, we identified that the bodily behaviors of the robot showed the highest success rate in the left near peripheral field of view region. The verbal behaviors of the robot captured human attention best in the right near peripheral field of view region. In this experiment of finding a socially acceptable way to accomplish the attention attracting goals of a communication robot, we observed that the robots’ affective behaviors were successful in shifting human attention towards itself in both left and right far- peripheral field of view regions, so we concluded that for far field of view regions, designing similar interaction interventions can be expected to be successful.
{"title":"Sociable Robot ‘Lometh’: Exploring Interactive Regions of a Product-Promoting Robot in a Supermarket","authors":"N. Weerawarna, U. Manawadu, P. R. D. De Silva","doi":"10.5614/itbj.ict.res.appl.2023.17.1.5","DOIUrl":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.1.5","url":null,"abstract":"The robot ‘Lometh’ is an information-presenting robot that naturally interacts with people in a supermarket environment. In recent years, considerable effort has been devoted to the implementation of robotic interfaces to identify effective behaviors of communication robots focusing only on the social and physical factors of the addresser and the hearer. As attention focus and attention target shifting of people differs based on the human visual focus and the spatiality, this study considered four interactive regions, considering the visual focus of attention as well as the interpersonal space between robot and human. The collected primary data revealed that 56% attention shifts occurred in near peripheral field of view regions and 44% attention shifts in far peripheral field of view regions. Using correspondence analysis, we identified that the bodily behaviors of the robot showed the highest success rate in the left near peripheral field of view region. The verbal behaviors of the robot captured human attention best in the right near peripheral field of view region. In this experiment of finding a socially acceptable way to accomplish the attention attracting goals of a communication robot, we observed that the robots’ affective behaviors were successful in shifting human attention towards itself in both left and right far- peripheral field of view regions, so we concluded that for far field of view regions, designing similar interaction interventions can be expected to be successful.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49071442","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
扫码关注我们
求助内容：
应助结果提醒方式：