{"title":"Interpretable machine learning approach for predicting COVID-19 risk status of an individual","authors":"A. Onoja, M. Ejiwale, Ayesan Rewane","doi":"10.14738/TNC.92.9760","DOIUrl":"https://doi.org/10.14738/TNC.92.9760","url":null,"abstract":"This study aimed to ascertained using Statistical feature selection methods and interpretable Machine learning models, the best features that predict risk status (“Low”, “Medium”, “High”) to COVID-19 infection. This study utilizes a publicly available dataset obtained via; online web-based risk assessment calculator to ascertain the risk status of COVID-19 infection. 57 out of 59 features were first filtered for multicollinearity using the Pearson correlation coefficient and further shrunk to 55 features by the LASSO GLM approach. SMOTE resampling technique was used to incur the problem of imbalanced class distribution. The interpretable ML algorithms were implored during the classification phase. The best classifier predictions were saved as a new instance and perturbed using a single Decision tree classifier. To further build trust and explainability of the best model, the XGBoost classifier was used as a global surrogate model to train predictions of the best model. The XGBoost individual’s explanation was done using the SHAP explainable AI-framework. Random Forest classifier with a validation accuracy score of 96.35 % from 55 features reduced by feature selection emerged as the best classifier model. The decision tree classifier approximated the best classifier correctly with a prediction accuracy score of 92.23 % and Matthew’s correlation coefficient of 0.8960. The XGBoost classifier approximated the best classifier model with a prediction score of 99.7 %. This study identified COVID-19 positive, COVID-19 contacts, COVID-19 symptoms, Health workers, and Public transport count as the five most consistent features that predict an individual’s risk exposure to COVID-19.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126756095","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":"Novel Multifunction Filter using Current Feedback Amplifier","authors":"Nisha Walde, Prashant Kumar Mavi","doi":"10.14738/TNC.91.8122","DOIUrl":"https://doi.org/10.14738/TNC.91.8122","url":null,"abstract":"One configuration for realizing voltage- mode multifunction filters using current feedback amplifiers (CFOA) is presented. The proposed voltage -mode circuit exhibit simultaneously low pass and band pass filters. The proposed circuits offer the following features: No requirements for component matching conditions; low active and passive sensitivities; employing only grounded capacitors and the ability to obtain multifunction filters from the same circuit configuration.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130837485","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":"Nelder-Mead Algorithm in Solving Ordinary Differential Equations Whose Solutions Possess Singularities","authors":"A. Wusu, O. Olabanjo","doi":"10.14738/TNC.91.9772","DOIUrl":"https://doi.org/10.14738/TNC.91.9772","url":null,"abstract":"This research considers Initial Value Problems (IVPs) in Ordinary Differential Equations (ODEs) whose solutions possess singularities. Here, we represent the theoretical solution by a rational function as it is more convenient representing a function close to a singularity by a rational function. The process of transforming the IVP to a constrained optimization problem and application of Nelder-Mead algorithm in obtaining approximate solution is presented in this work. Accuracy and efficiency of this scheme is demonstrated on two numerical examples. The proposed approach produced better results compared with existing methods discussed in literature.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126261955","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}
André Rodrigue Tchamda, K Merlain Boris Djousse, Anselme Maffo Koumetio, M. Fonteh, F. B. Pelap, R. Tchitnga, M. Kom
{"title":"Low-cost Wireless Personal Weather Station for Rural Farmers","authors":"André Rodrigue Tchamda, K Merlain Boris Djousse, Anselme Maffo Koumetio, M. Fonteh, F. B. Pelap, R. Tchitnga, M. Kom","doi":"10.14738/TNC.91.9647","DOIUrl":"https://doi.org/10.14738/TNC.91.9647","url":null,"abstract":"This document presents the design of a prototype of a low-cost personal weather station suitable for farmers in rural areas who are or may not be engaged in rudimentary agriculture. This prototype measure several weather data: temperature, relative humidity, wind speed, wind direction, rainfall. For further data analysis, these are transmitted for recording to a remote server via wireless communication. The server offers data extraction possibilities in multiple file formats. A prototyping of the personal weather station is designed and commissioned. An extract of the results over two days is presented in the results section of this document","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"25 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124308612","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":"A Comparison of Fair Sharing Algorithms for Regulating Search as a Service API","authors":"S. Bagui, Evorell Fridge","doi":"10.14738/TNC.86.9633","DOIUrl":"https://doi.org/10.14738/TNC.86.9633","url":null,"abstract":"Providers of a Search as a Service (SaaS) environment must ensure that their users will not monopolize the service or use more than their fair share of resources. Fair sharing algorithms have long been used in computer networking to balance access to a router or switch, and some of these algorithms have also been applied to the control of queries submitted to search engine APIs. If a search query’s execution cost can be reliably estimated, fair sharing algorithms can be applied to the input of a SaaS API to ensure everyone has equitable access to the search engine. \u0000The novelty of this paper lies in presenting a Single-Server Max-Min Fair Deficit Round Robin algorithm, a modified version of the Multi-Server Max-Min Fair Deficit Round Robin algorithm. The Single-Server Max-Min Fair Deficit Round Robin algorithm is compared to three other fair sharing algorithms, token-bucket, Deficit Round Robin (DRR), and Peng and Plale’s [1] Modified Deficit Round Robin (MDRR) in terms of three different usage scenarios, balanced usage, unbalanced usage as well as an idle client usage, to determine which is the most suitable fair sharing algorithm for use in regulating traffic to a SaaS API. This research demonstrated that the Single-Server Max-Min Fair DRR algorithm provided the highest throughput of traffic to the search engine while also maintaining a fair balance of resources among clients by re-allocating unused throughput to clients with saturated queues so a max-min allocation was achieved.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127453962","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":"Characteristics of Nanopositioning Electroelastic Digital-to-Analog Converter for Communication Systems","authors":"S. Afonin","doi":"10.14738/TNC.86.9699","DOIUrl":"https://doi.org/10.14738/TNC.86.9699","url":null,"abstract":"The characteristics of the nanopositioning electroelastic digital-to-analog converter for communication systems are examined. In the static and dynamic regimes this characteristics are received. The static strain and control characteristics of the nanopositioning electroelastic digital-to-analog converter are obtained. The transfer function of the nanopositioning electroelastic digital-to-analog converter is received.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121666563","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":"Practical generation of common random strings for secure multiparty computations over the Internet","authors":"I. Vajda","doi":"10.14738/TNC.86.9447","DOIUrl":"https://doi.org/10.14738/TNC.86.9447","url":null,"abstract":"It is known that most of the interesting multiparty cryptographic tasks cannot be implemented securely without trusted setup in a general concurrent network environment like the Internet. We need an appropriate trusted third party to solve this problem. An important trusted setup is a public random string shared by the parties. We present a practical n-bit coin toss protocol for provably secure implementation of such setup. Our idea is inviting external peers into the execution of the protocol to establish an honest majority among the parties. We guarantee security in the presence of an unconditional, static, malicious adversary. Additionally, we present an original practical idea of using live public radio broadcast channels for the generation of common physical random source. ","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"252 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133390278","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}
Mamoon M. Saeed, R. Saeed, R. Mokhtar, H. Alhumyani, Elmustafa Syed Ali
{"title":"Preserving Privacy Location in 5G by Using Variable Pseudonym","authors":"Mamoon M. Saeed, R. Saeed, R. Mokhtar, H. Alhumyani, Elmustafa Syed Ali","doi":"10.14738/TNC.85.9571","DOIUrl":"https://doi.org/10.14738/TNC.85.9571","url":null,"abstract":"User privacy is one of the most issues addressed extensively in mobile communications evolutions, research literature, and standardization. Location privacy is a key parameter and crucial aspect for user privacy, where most of the tracking, Unsolicited advertising, malicious activities, and location-based terrorism attacks are depending on the location of the victims. For preserving location privacy, various methods in previous mobile networks use a pseudonym instead of permanent identity i.e. Cell Radio Network Temporary Identifiers (C-RNTI), However, these methods based on C-RNII have been proofed that faces many vulnerable due to the clear text used for C-RNII exchange. A man-in-the-middle attack can easily trace users and collect information. The main objective of this paper is to propose a new location privacy algorithm that can greatly enhance the capabilities of the 5G architecture. The proposed algorithm introduces a novel variable pseudonym (V-RNTI) as an identifier for the user radio channel. Also, it provides an enhanced pseudonyms allocation procedure for identification. A new procedure that enabling UE to use different values for V-RNTI changed frequently using agreed equations to generate the values of the identifier. The proposed scheme is compatible with 3GPP standards architecture, where minor modifications/upgrades are needed for UEs eNB. Specifically, we build our model of the 5G V-RNTI authentication protocol and perform an automated security verification tool analysis of the protocol model by using the ProVerif model checker. Our analysis results show that the proposed procedure is working without flaws.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124507406","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":"The Impact of Emerging Wireless Network System and Cybersecurity in A Global Community","authors":"B. Ele, O. J. Adinya, I. O. Obono","doi":"10.14738/TNC.85.9628","DOIUrl":"https://doi.org/10.14738/TNC.85.9628","url":null,"abstract":"Wireless network systems and cybersecurity threats are growing faster than their mitigation measures. World Economic Forum has identified wireless network security and cybersecurity threats as its top global risks for the past eight years. This paper aims to critically examine the impact of emerging wireless network systems and cybersecurity in a global community and suggest some best countermeasures against wireless and cybersecurity threats that have been of global concern. To achieve this, the study conducted an in-depth review of wireless network security and cybersecurity. This study has presented a robust wireless security mechanism and suggests appropriate countermeasure against wireless network and cybersecurity threats that is more cost-effective in mounting attacks in the service area, and simultaneously providing higher security than basic security mechanisms.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127804377","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":"Development of an Improved Network Security System using Firewall for Securing Organisational Data","authors":"B. Ele, E. E. Umoh, D. O. Egete","doi":"10.14738/TNC.85.9605","DOIUrl":"https://doi.org/10.14738/TNC.85.9605","url":null,"abstract":"It is eminent that the Internet is far from being secure. Insecure networks have caused organizations to lose lots of money as a result of data loss or data corruption, and even worse, some organizations have also lost their reputation hence reduce the client’s confidence. Therefore, this research focused on the development of an improved network security system using a firewall that can secure both the internal and external network of an organization. The system was developed using both packet filtering and proxy server architectures to prevent unauthorized connection or access to the organization server or resources thereby reducing the risk of attacks to the network and loss of organizational data. The system was implemented using PHP and python programming languages and the backend was developed using MySQL as the database server; HTML, CSS, and JavaScript for the frontend layout. The implementation of this firewall system includes a monitoring admin interface from where most activities within the private network can be monitored and also this system can prevent or deny the unauthorized request of services either by an intruder from an external network or personnel within the network. Based on the findings of this study, the developed system is recommended for any organization that depends on computer networks for the running of their daily activities.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127625648","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}