{"title":"Fairness Enhanced Dynamic Routing Protocol in Software-Defined Networking","authors":"Nguyen Viet Ha, Tran Anh Tuan, T. T. T. Nguyen","doi":"10.1109/NICS56915.2022.10013394","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013394","url":null,"abstract":"Software Defined Networking (SDN) with flexible control has a high potential and applicability in modern networks. SDN has outstanding advantages in actively and centrally controlling network functions such as dynamic-routing, load balancing, and preventing congestion for data flows to ensure the stability, fairness, and quality of the network system. For stability, response speed and fairness are required in modern networks. This paper proposes a new routing protocol called Fairness Enhanced Dynamic Routing Protocol (SDN-FERDP) to reduce the network congestion and optimize the load balancing of the network. The emulation result on Mininet shows that SDN-FERDP can effectively reduce network congestion and better balance the load of the network compared to the OSPF in the traditional network (simply refer to as OSPF) and Modified OSPF in the SDN network (refer to as SDN-OSPF).","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115116194","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}
Dody Ichwana Putra, Harry Bintang Pratama, Tomoki Nakashima, Y. Nagao, M. Kurosaki, H. Ochi
{"title":"Multi-Task Learning with Convolutional Neural Network Approach for Packet Collision Avoidance in 802.11 WLAN","authors":"Dody Ichwana Putra, Harry Bintang Pratama, Tomoki Nakashima, Y. Nagao, M. Kurosaki, H. Ochi","doi":"10.1109/NICS56915.2022.10013420","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013420","url":null,"abstract":"Packet collision can degrade wireless network performance. The IEEE 802.11 Wireless Local Area Network (WLAN) uses the Clear Channel Assessment (CCA) mechanism to monitor channel availability to avoid interference of the presence signal. CCA successfully detects 802.11 signals if it obtains the packet preamble information or detects the threshold ambient power on the channel to determine the channel state. This paper proposes multi-task learning (MTL) with convolutional neural network (CNN) approach to detect WLAN packet formats and modulation types without preamble part information as a supplement to enhance CCA sensitivity. The main advantages of this method over single-task training are high classification accuracy and rapid learning with a lightweight neural network model. Shared knowledge of representation layers, such as model weights or gradients, improves the efficiency of training data and reduces redundancy. WLAN signals generated by the Matlab waveform simulator are used to verify the accuracy of the proposed method, which is then implemented on a real-time SDR-based hardware testbed. Although different time offsets affect the classifications, the proposed method proves superior in classifying the packet format and modulation of WLAN signals with an accuracy of 98.93% and 88.53% at SNR = 24 dB, respectively. The proposed method improves channel utilization and throughput of the WLAN network, as demonstrated by an NS-3 simulation.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115282543","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}
{"title":"Generating Test Paths to Detect XSS Vulnerabilities of Web Applications","authors":"H. Nguyen, Thanh-Nhan Luong, Ninh-Thuan Truong","doi":"10.1109/NICS56915.2022.10013397","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013397","url":null,"abstract":"Web technologies have developed rapidly because web applications are currently leading the trends in software development. In the face of emerging security issues, preventing software security vulnerabilities is a great concern for developers, vendors, and customers. In fact, the cross-site scripting (XSS) attack is a very popular type of attack that causes security vulnerabilities in web systems. However, when testing to detect XSS attacks for web applications, optimizing the test paths still has some problems with the time or space of the test paths. Therefore, in this paper, we propose a method to solve this problem. Our approach uses Q-learning in generating automated test paths to test XSS vulnerabilities for web applications. The proposed method consists of generating the graph of the web application, setting the weight for the graph, building the memory matrix, and generating test paths. We have experimented proposed approach with the online learning website system. The experimental results show a significant reduction in the number of test paths and this helps to reduce the test case space and test time to detect XSS vulnerabilities of web applications.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123215320","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}
{"title":"Page Object Detection in Vietnamese Document Images with Novel Approach","authors":"Luc T. Le, Trong-Thuan Nguyen, Khang Nguyen","doi":"10.1109/NICS56915.2022.10013374","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013374","url":null,"abstract":"We witnessed the rising popularity of Vietnamese documents on online platforms. Digitized Vietnamese documents (e.g., administrative text, scientific papers, textbooks, etc.) are available online. As a result, we need algorithms that can understand documents. Vietnamese is one of the most difficult languages with the Latin alphabet with additional accent symbols and derivative characters. Moreover, we still struggle with challenges arising from external and internal factors. This requires a good enough detector model as the foundation for extracting information tasks. In this research, we address page object detection in Vietnamese document images. We explore the performance of the UIT-DODV-Ext dataset, the largest Vietnamese document image dataset that includes scientific papers and textbooks. Additionally, we leverage the state-of-the-art object detector and then propose CasGRoIENet to improve the performance of the UIT-DODV-Ext dataset. CasGRoIENet achieves 75.9% mAP which is 2.3% higher than state-of-the-art results.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125613844","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}
T. Nguyen, Quang Tuong Lam, D. Do, Huu Thuc Cai, Hoang Suong Nguyen, Thanh Hung Vo, Duc Dung Nguyen
{"title":"A Linguistic-based Transfer Learning Approach for Low-resource Bahnar Text-to-Speech","authors":"T. Nguyen, Quang Tuong Lam, D. Do, Huu Thuc Cai, Hoang Suong Nguyen, Thanh Hung Vo, Duc Dung Nguyen","doi":"10.1109/NICS56915.2022.10013451","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013451","url":null,"abstract":"The Text-to-Speech (TTS) model often requires a large number of recorded utterances in standard quality for a high-fidelity synthesized speech. For low-resource languages, lacking data becomes a big challenge. In this work, we address this problem in the Bahnar Kriem language, a rare language used by Bahnar people living in Binh Dinh county, Vietnam. We propose the linguistic approach to process a poor-quality dataset of 720 utterances of Bahnar Kriem language, along with some preprocessing steps. We also analyze the Bahnar Kriem language and figure out a mixture between Bahnar and Vietnamese due to the historical development between the two races. Therefore, we propose the transfer learning approach to integrate the Vietnamese pronunciation into the Bahnar TTS synthesizer. The experiments show significant improvement in the performance of the TTS model for a low-resource language. Our model can also generate long Bahnar sentences with a short inference time. The subjective and objective evaluations suggest promising results and some potential improvements based on our approach. We also provide audio samples generated from our model1.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725271","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}
Khang Nguyen, Luu Ngo, Kiet Huynh, Nguyen Thanh Nam
{"title":"Empirical Study One-stage Object Detection methods for RoboCup Small Size League","authors":"Khang Nguyen, Luu Ngo, Kiet Huynh, Nguyen Thanh Nam","doi":"10.1109/NICS56915.2022.10013320","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013320","url":null,"abstract":"Small Size League (SSL) is a division of the traditional RoboCup, founded to promote research in robots and AI. A fast and accurate real-time object detection model is essential for RoboCup SSL soccer robots, serving the design and development of competitive strategies. Specific state-of-the-art object detection methods have reported inference speed up to 94 FPS on the SSL open-source benchmark dataset, but only at intermediate accuracy. Considering the advancement in deep learning methods for feature extraction and object detection, in this paper, we conducted surveys and experiments on one-stage object detection methods provided in the MMDetection framework on the dataset for RoboCup SSL. YOLOX-tiny model achieved 58.60% AP, which is significantly higher than baseline methods, while maintaining an acceptable inference speed of 37 Frames Per Second (FPS). Other state-of-the-art one-stage methods have achieved very high performance, up to 74,10% Average Precision (AP). However, certain methods did not meet the minimum inference speed requirement of real-time object detection.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123355635","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}
{"title":"Integrating Semantic Information into Sketchy Reading Module of Retro-Reader for Vietnamese Machine Reading Comprehension","authors":"Hang Le, Viet-Duc Ho, Duc-Vu Nguyen, N. Nguyen","doi":"10.1109/NICS56915.2022.10013390","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013390","url":null,"abstract":"Machine Reading Comprehension has become one of the most advanced and popular research topics in the fields of Natural Language Processing in recent years. The classification of answerability questions is a relatively significant sub-task in machine reading comprehension; however, there haven't been many studies. Retro-Reader is one of the studies that has solved this problem effectively. However, the encoders of most traditional machine reading comprehension models in general and Retro-Reader, in particular, have not been able to exploit the contextual semantic information of the context completely. Inspired by SemBERT, we use semantic role labels from the Semantic Role Labeling (SRL) task to add semantics to pre-trained language models such as mBERT, XLM-R, PhoBERT. This experiment was conducted to compare the influence of semantics on the classification of answerability for the Vietnamese machine reading comprehension. Additionally, we hope this experiment will enhance the encoder for the Retro-Reader model's Sketchy Reading Module. The improved Retro-Reader model's encoder with semantics was first applied to the Vietnamese Machine Reading Comprehension task and obtained positive results.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121562641","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}
Trang Hong Son, Hoang Xuan Long, Nguyen Huynh-Tuong, Tran Van Lang
{"title":"An Approach for the Teamwork Scheduling Problem with Job-person Constraint","authors":"Trang Hong Son, Hoang Xuan Long, Nguyen Huynh-Tuong, Tran Van Lang","doi":"10.1109/NICS56915.2022.10013369","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013369","url":null,"abstract":"This paper deals with the teamwork scheduling problem with job-person constraint. This problem has been posed by combining the three constraints: the jobs can split into some sub-jobs which should not be less than a threshold called splitmin’ the jobs/sub-jobs are only assigned to team members' available time windows, and the sub-jobs of the same job are assigned to only one team member. The goal aims to determine a feasible schedule with minimal completion time for all jobs. The MILP model is given to achieve the optimal goal of this problem. The proposed heuristics to determine effective solutions are the Assignment algorithm based on the FCFS rule, the Assignment algorithm based on the SPT/LPT rule, and the Simulated Annealing algorithm. The experimental results show that the Simulated Annealing algorithm achieves the best solution quality, but the time to determine the solution is longer than other algorithms.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124317323","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}
Phuc Nguyen, Nguyen Tran, Shahaboddin Shamshirband, T. Tran, T. Quan
{"title":"Comprehensible Alarm Message Generation for Natural Disaster","authors":"Phuc Nguyen, Nguyen Tran, Shahaboddin Shamshirband, T. Tran, T. Quan","doi":"10.1109/NICS56915.2022.10013384","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013384","url":null,"abstract":"Nowadays, people are confronted with destructive natural disasters (such as earthquakes, hurricanes, floods, and wildfires) of increasing frequency and damage, which consists of an intensive amount of ecological, social, and economical losses. Existing research works on the role of disaster observation mainly focus on developing a system that can only detect and postassess disaster damages. However, one of the key drawbacks of these systems is that post-assessment does not have much effect in alleviating the damage of natural disasters. Secondly, the most immediate need of people in the sphere of disaster influence is receiving an intelligible message from news broadcasters. Therefore, it is necessary for a holistic system to better manage and assess during natural disasters. In this work, we conduct an adequate analysis on available data resources, feasible approaches, and finally, we propose our technique for better disaster monitoring and generating a comprehensible alarm message utilizing disaster assessment methods.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132030647","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}
Hoang-Thuy-Tien Vo, Thi-Nhu-Quynh Nguyen, Tuan Van Huynh
{"title":"Classification I-EEG Signals Using Ensemble Algorithms","authors":"Hoang-Thuy-Tien Vo, Thi-Nhu-Quynh Nguyen, Tuan Van Huynh","doi":"10.1109/NICS56915.2022.10013378","DOIUrl":"https://doi.org/10.1109/NICS56915.2022.10013378","url":null,"abstract":"The study was research in the bioinformatics field. The imagined signals are classified as the Support Vector Machine, K-Nearest Neighbor, and Ensemble Classifiers. A 5-channel device recorded the data, including four labels (thinking backward, thinking forward, thinking turn the left, and thinking turn the right). The data is optimized using z-score and maxmin normalization techniques and compared with data without normalization. The Stratified-Repeated cross-validation method was applied to split into training and testing data instead of the traditional data division technique. A key factor determining classifier performance is feature extraction. The time-frequency domain characteristics recommended by the Discrete Wavelet Transform method are five. The research examined 17 models (6 sub-model of Support Vector Machine and K-Nearest Neighbor classifiers, five Ensemble Classifiers). A model in the proposed Stratified-Repeated cross-validation Subspace Ensemble classifier with a classification result of 89.25%.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346396","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}