首页 > 最新文献

2021 IEEE World AI IoT Congress (AIIoT)最新文献

英文 中文
Hybrid Ant Swarm-Based Data Clustering 基于混合蚁群的数据聚类
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454238
Md. Ali Azam, Abir Hossen, Md Hafizur Rahman
Biologically inspired computing techniques are very effective and useful in many areas of research including data clustering. Ant clustering algorithm is a nature-inspired clustering technique which is extensively studied for over two decades. In this study, we extend the ant clustering algorithm (ACA) to a hybrid ant clustering algorithm (hACA). Specifically, we include a genetic algorithm in standard ACA to extend the hybrid algorithm for better performance. We also introduced novel pick up and drop off rules to speed up the clustering performance. We study the performance of the hACA algorithm and compare with standard ACA as a benchmark.
生物学启发的计算技术在包括数据聚类在内的许多研究领域都非常有效和有用。蚂蚁聚类算法是一种受自然启发的聚类技术,已经被广泛研究了二十多年。在本研究中,我们将蚂蚁聚类算法(ACA)扩展为混合蚂蚁聚类算法(hACA)。具体来说,我们在标准ACA中加入了一个遗传算法来扩展混合算法以获得更好的性能。我们还引入了新的拾取和丢弃规则来加快集群性能。我们研究了hACA算法的性能,并与标准ACA作为基准进行了比较。
{"title":"Hybrid Ant Swarm-Based Data Clustering","authors":"Md. Ali Azam, Abir Hossen, Md Hafizur Rahman","doi":"10.1109/AIIoT52608.2021.9454238","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454238","url":null,"abstract":"Biologically inspired computing techniques are very effective and useful in many areas of research including data clustering. Ant clustering algorithm is a nature-inspired clustering technique which is extensively studied for over two decades. In this study, we extend the ant clustering algorithm (ACA) to a hybrid ant clustering algorithm (hACA). Specifically, we include a genetic algorithm in standard ACA to extend the hybrid algorithm for better performance. We also introduced novel pick up and drop off rules to speed up the clustering performance. We study the performance of the hACA algorithm and compare with standard ACA as a benchmark.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126824872","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}
引用次数: 1
Controller Design and Robustness Analysis for Multi-phase Wireless Power Transfer System Using H-infinity Mixed Sensitivity Approach 基于h -∞混合灵敏度方法的多相无线输电系统控制器设计及鲁棒性分析
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454225
Vishnu Mohan, D. Czarkowski
A controller for multi-phase wireless power transfer system is designed using H-infinity mixed sensitivity approach to improve the dynamic performance of the system. Robustness analysis is conducted for the combined system to check if the system is stable for different coupling coefficients. Experimental verification of the wireless power transfer system with the controller is performed on a 1.5 kW setup.
为了提高系统的动态性能,采用h -∞混合灵敏度方法设计了多相无线电力传输系统的控制器。对组合系统进行鲁棒性分析,检验在不同耦合系数下系统是否稳定。在一个1.5 kW的装置上对该控制器的无线电力传输系统进行了实验验证。
{"title":"Controller Design and Robustness Analysis for Multi-phase Wireless Power Transfer System Using H-infinity Mixed Sensitivity Approach","authors":"Vishnu Mohan, D. Czarkowski","doi":"10.1109/AIIoT52608.2021.9454225","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454225","url":null,"abstract":"A controller for multi-phase wireless power transfer system is designed using H-infinity mixed sensitivity approach to improve the dynamic performance of the system. Robustness analysis is conducted for the combined system to check if the system is stable for different coupling coefficients. Experimental verification of the wireless power transfer system with the controller is performed on a 1.5 kW setup.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131450317","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}
引用次数: 0
Early Prediction of Electronics Engineering Licensure Examination Performance using Random Forest 基于随机森林的电子工程执照考试成绩早期预测
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454213
R. R. Maaliw
Graduate's success on licensure examinations has a significant impact on various facets of a higher educational institution. Using a comprehensive data mining process, this research compared the accuracy of multiple classification algorithms to determine predictors of students' professional certification performance. The Random Forest model achieved the best cross-validated accuracy score of 92.70% based on the evaluation data. A model inspection method of permutation feature importance was used to uncover information from 500 graduates of Southern Luzon State University's electronics engineering program from 2014 to 2019. Among the 33 variables examined, the verbal reasoning or reading comprehension ability of students unveils a clear attribution with their licensure test results along with ratings from different courses in mathematics, professional, and electrical circuits. Thus, the data-driven information can be used to develop programs, initiatives, and techniques to improve success on the electronics engineering licensure examinations.
毕业生在执照考试中的成功对高等教育机构的各个方面都有重大影响。本研究采用全面的数据挖掘过程,比较了多种分类算法的准确性,以确定学生专业认证绩效的预测因子。基于评价数据,随机森林模型的交叉验证准确率得分最高,为92.70%。采用排列特征重要性的模型检验方法,对2014年至2019年南吕宋州立大学电子工程专业500名毕业生的信息进行了分析。在测试的33个变量中,学生的语言推理或阅读理解能力与他们的执照考试成绩以及数学、专业和电路等不同课程的评分有明显的关系。因此,数据驱动的信息可用于开发程序,倡议和技术,以提高在电子工程执照考试中的成功。
{"title":"Early Prediction of Electronics Engineering Licensure Examination Performance using Random Forest","authors":"R. R. Maaliw","doi":"10.1109/AIIoT52608.2021.9454213","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454213","url":null,"abstract":"Graduate's success on licensure examinations has a significant impact on various facets of a higher educational institution. Using a comprehensive data mining process, this research compared the accuracy of multiple classification algorithms to determine predictors of students' professional certification performance. The Random Forest model achieved the best cross-validated accuracy score of 92.70% based on the evaluation data. A model inspection method of permutation feature importance was used to uncover information from 500 graduates of Southern Luzon State University's electronics engineering program from 2014 to 2019. Among the 33 variables examined, the verbal reasoning or reading comprehension ability of students unveils a clear attribution with their licensure test results along with ratings from different courses in mathematics, professional, and electrical circuits. Thus, the data-driven information can be used to develop programs, initiatives, and techniques to improve success on the electronics engineering licensure examinations.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121309441","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}
引用次数: 4
Forecasting Vaccination Drive In India for Herd Immunity using SIR and Prophet Model 利用SIR和先知模型预测印度群体免疫接种活动
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454186
Narayana Darapaneni, Shyamal Dhua, Nikita Khare, K. Ayush, K. N., Supriya Ghodke, Abhishek Rajput, Saswat P Beurik, A. Paduri
This paper aims to study the COVID-19 vaccination drive in India to forecast the time, it will take vaccinate the minimum number of population for achieving herd immunity. As per the government data on 25th March, 2021, a total of 5,55,04,440 doses have been administered as first dose and 85,02,968 as the second dose, which is just a mere fraction of the total population of India which stands at 1.3 billion. As the number of cases are rising, considering the situation, it is important to expedite the drive and follow strict restrictions to achieve herd immunity. A simulation of the SIR model has been created to identify the effective reproduction number (Re), and then through time series analysis using Prophet model, the conclusion has been drawn for the number of days it will take to vaccinate enough population to achieve herd immunity. As an initial step, we will be fitting the data available for COVID-19 for India in the SIR model which is a set of three Ordinary Differential Equations (ODE). The results from the ODEs will be used to determining the initial Re which will be matched with the data set. Once confirming the Re value present in data set, the same will be passed to the data-driven forecasting time series model to get insights and draw conclusions which will help authorities to help in planning the drive and implement necessary actions to avoid further growth of COVID-19 cases.
本文旨在研究印度的COVID-19疫苗接种运动,预测接种疫苗达到群体免疫所需的最小人数的时间。根据2021年3月25日的政府数据,总共接种了5,55,04,440剂第一剂和85,02,968剂第二剂,这只是印度总人口13亿的一小部分。鉴于病例数不断上升,考虑到目前的情况,必须加快行动并遵循严格的限制,以实现群体免疫。通过SIR模型的模拟,确定了有效繁殖数(Re),然后通过Prophet模型的时间序列分析,得出了接种足够数量的疫苗以实现群体免疫所需的天数。作为第一步,我们将把印度COVID-19的现有数据拟合到SIR模型中,该模型由三个常微分方程(ODE)组成。ode的结果将用于确定与数据集匹配的初始Re。一旦确认数据集中存在的Re值,该值将传递给数据驱动的预测时间序列模型,以获得见解并得出结论,这将有助于当局帮助规划驱动并实施必要的行动,以避免COVID-19病例的进一步增长。
{"title":"Forecasting Vaccination Drive In India for Herd Immunity using SIR and Prophet Model","authors":"Narayana Darapaneni, Shyamal Dhua, Nikita Khare, K. Ayush, K. N., Supriya Ghodke, Abhishek Rajput, Saswat P Beurik, A. Paduri","doi":"10.1109/AIIoT52608.2021.9454186","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454186","url":null,"abstract":"This paper aims to study the COVID-19 vaccination drive in India to forecast the time, it will take vaccinate the minimum number of population for achieving herd immunity. As per the government data on 25th March, 2021, a total of 5,55,04,440 doses have been administered as first dose and 85,02,968 as the second dose, which is just a mere fraction of the total population of India which stands at 1.3 billion. As the number of cases are rising, considering the situation, it is important to expedite the drive and follow strict restrictions to achieve herd immunity. A simulation of the SIR model has been created to identify the effective reproduction number (Re), and then through time series analysis using Prophet model, the conclusion has been drawn for the number of days it will take to vaccinate enough population to achieve herd immunity. As an initial step, we will be fitting the data available for COVID-19 for India in the SIR model which is a set of three Ordinary Differential Equations (ODE). The results from the ODEs will be used to determining the initial Re which will be matched with the data set. Once confirming the Re value present in data set, the same will be passed to the data-driven forecasting time series model to get insights and draw conclusions which will help authorities to help in planning the drive and implement necessary actions to avoid further growth of COVID-19 cases.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130778734","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}
引用次数: 1
Batching Anonymous and Non-Anonymous Membership Proofs for Blockchain Applications 区块链应用程序的批处理匿名和非匿名成员证明
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454223
Shihui Fu, Guiwen Luo, Guang Gong
Membership proof is a very useful building block for checking if an entity is in a list. This tool is widely used in many scenarios. For instance in blockchain where checking membership of an unspent coin in a huge set is necessary, or in the scenario where certain privacy-preserving property on the list or on the entity is required. When it comes to multi-user applications, the naive way that verifies the membership relations one by one is very inefficient. In this work, we utilize subvector commitment schemes and non-interactive proofs of knowledge of elliptic curve discrete logarithms to present two batched membership proofs for multiple users, i.e., batched non-anonymous membership proofs and batched anonymous membership proofs, which offer plausible anonymity assurance respectively on the organization group list and on the users when combined within the blockchain applications. The non-anonymous membership proof scheme requires a trusted setup, but its proof size is only one bilinear group element and is independent of both the size of list and the number of users. The anonymous membership proof scheme requires no trusted setup, and its proof size is linear in the size of organization group and is independent of the number of users. Their security relies respectively on the CubeDH and the discrete logarithm assumptions. Finally, as a use-case application scenario, we extend Mesh which is a blockchain based supply chain management solution to Mesh+ which supports batched anonymous membership proofs.
成员证明是检查实体是否在列表中非常有用的构建块。该工具在许多场景中被广泛使用。例如,在区块链中,需要检查庞大集合中未使用的硬币的成员资格,或者在需要列表或实体上的某些隐私保护属性的情况下。当涉及到多用户应用程序时,逐个验证成员关系的简单方法效率非常低。在这项工作中,我们利用子向量承诺方案和椭圆曲线离散对数的非交互式知识证明,为多个用户提供了两个批处理成员证明,即批处理非匿名成员证明和批处理匿名成员证明,它们在区块链应用程序中组合时,分别在组织组列表和用户上提供了可信的匿名保证。非匿名成员证明方案需要一个可信的设置,但其证明大小仅为一个双线性组元素,并且与列表大小和用户数量无关。匿名成员证明方案不需要信任设置,其证明大小与组织组的大小成线性关系,与用户数量无关。它们的安全性分别依赖于立方体和离散对数假设。最后,作为一个用例应用场景,我们将基于区块链的供应链管理解决方案Mesh扩展到支持批量匿名成员资格证明的Mesh+。
{"title":"Batching Anonymous and Non-Anonymous Membership Proofs for Blockchain Applications","authors":"Shihui Fu, Guiwen Luo, Guang Gong","doi":"10.1109/AIIoT52608.2021.9454223","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454223","url":null,"abstract":"Membership proof is a very useful building block for checking if an entity is in a list. This tool is widely used in many scenarios. For instance in blockchain where checking membership of an unspent coin in a huge set is necessary, or in the scenario where certain privacy-preserving property on the list or on the entity is required. When it comes to multi-user applications, the naive way that verifies the membership relations one by one is very inefficient. In this work, we utilize subvector commitment schemes and non-interactive proofs of knowledge of elliptic curve discrete logarithms to present two batched membership proofs for multiple users, i.e., batched non-anonymous membership proofs and batched anonymous membership proofs, which offer plausible anonymity assurance respectively on the organization group list and on the users when combined within the blockchain applications. The non-anonymous membership proof scheme requires a trusted setup, but its proof size is only one bilinear group element and is independent of both the size of list and the number of users. The anonymous membership proof scheme requires no trusted setup, and its proof size is linear in the size of organization group and is independent of the number of users. Their security relies respectively on the CubeDH and the discrete logarithm assumptions. Finally, as a use-case application scenario, we extend Mesh which is a blockchain based supply chain management solution to Mesh+ which supports batched anonymous membership proofs.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131002119","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}
引用次数: 0
Robustness Analysis of Cyber-Physical systems based on Discrete Timed Cyber-Physical Models 基于离散时间网络物理模型的网络物理系统鲁棒性分析
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454249
Fu-Shiung Hsieh
The widespread use of IoT endows Cyber-Physical Systems (CPS) with the capability to supervise, monitor and control of manufacturing systems. However, study on the impact of unexpected events such as resource failures on the operations of CPS is less explored. The goal of this study is to propose a systematic framework to analyze CPS and pave the way for the development of an effective strategy to handle unexpected events. In this paper, we will focus on analysis of a class of resource failures events in CPS. To analyze the effects of resource failures on CPS, a network model is constructed based on the timed Petri net models to represent the cyber-world model of CPS. An optimization problem is formulated to check the feasibility to meet the original deadline. The influence of resource failures on CPS is analyzed by solving the optimization problem based on a network constructed based on the cyber-world model of CPS. The proposed method is illustrated by an example.
物联网的广泛使用赋予了网络物理系统(CPS)监督、监控和控制制造系统的能力。然而,资源失效等突发事件对CPS运行的影响研究较少。本研究的目的是提出一个系统的框架来分析CPS,并为制定有效的策略来处理意外事件铺平道路。在本文中,我们将重点分析CPS中的一类资源故障事件。为了分析资源失效对CPS的影响,建立了基于时间Petri网模型的网络模型来表示CPS的网络世界模型。制定了优化问题,以检验满足原期限的可行性。通过求解基于CPS网络世界模型构建的网络优化问题,分析了资源失效对CPS的影响。通过一个算例说明了所提出的方法。
{"title":"Robustness Analysis of Cyber-Physical systems based on Discrete Timed Cyber-Physical Models","authors":"Fu-Shiung Hsieh","doi":"10.1109/AIIoT52608.2021.9454249","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454249","url":null,"abstract":"The widespread use of IoT endows Cyber-Physical Systems (CPS) with the capability to supervise, monitor and control of manufacturing systems. However, study on the impact of unexpected events such as resource failures on the operations of CPS is less explored. The goal of this study is to propose a systematic framework to analyze CPS and pave the way for the development of an effective strategy to handle unexpected events. In this paper, we will focus on analysis of a class of resource failures events in CPS. To analyze the effects of resource failures on CPS, a network model is constructed based on the timed Petri net models to represent the cyber-world model of CPS. An optimization problem is formulated to check the feasibility to meet the original deadline. The influence of resource failures on CPS is analyzed by solving the optimization problem based on a network constructed based on the cyber-world model of CPS. The proposed method is illustrated by an example.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133340271","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}
引用次数: 3
Cataract Detection Using Convolutional Neural Network with VGG-19 Model 基于VGG-19模型的卷积神经网络白内障检测
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454244
Md. Sajjad Mahmud Khan, Mahiuddin Ahmed, Raseduz Zaman Rasel, Mohammad Monirujjaman Khan
Cataract is one of the prevalent causes of visual impairment and blindness worldwide. There is around 50% of overall blindness. Therefore, an early detection and prevention of cataract may reduce the visual impairment and the blindness. The advancement of Artificial Intelligence (AI) in the field of ophthalmology such as glaucoma, macular degeneration, diabetic retinopathy, corneal conditions, age related eye diseases is quite fruitful unlike cataract. Most of the existing approaches on cataract detection are based on traditional machine learning methods. On the other hand, the manual extraction of retinal features is a time-consuming process and requires an expert ophthalmologist. So, we proposed a model VGG19 which is a convolutional neural network model to detect the cataract by using color fundus images.
白内障是世界范围内视力损害和失明的主要原因之一。大约有50%的人失明。因此,早期发现和预防白内障可以减少视力损害和失明。与白内障不同,人工智能(AI)在青光眼、黄斑变性、糖尿病视网膜病变、角膜状况、年龄相关眼病等眼科领域的进展相当丰硕。现有的白内障检测方法大多是基于传统的机器学习方法。另一方面,人工提取视网膜特征是一个耗时的过程,需要专业的眼科医生。为此,我们提出了一种基于卷积神经网络的彩色眼底图像白内障检测模型VGG19。
{"title":"Cataract Detection Using Convolutional Neural Network with VGG-19 Model","authors":"Md. Sajjad Mahmud Khan, Mahiuddin Ahmed, Raseduz Zaman Rasel, Mohammad Monirujjaman Khan","doi":"10.1109/AIIoT52608.2021.9454244","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454244","url":null,"abstract":"Cataract is one of the prevalent causes of visual impairment and blindness worldwide. There is around 50% of overall blindness. Therefore, an early detection and prevention of cataract may reduce the visual impairment and the blindness. The advancement of Artificial Intelligence (AI) in the field of ophthalmology such as glaucoma, macular degeneration, diabetic retinopathy, corneal conditions, age related eye diseases is quite fruitful unlike cataract. Most of the existing approaches on cataract detection are based on traditional machine learning methods. On the other hand, the manual extraction of retinal features is a time-consuming process and requires an expert ophthalmologist. So, we proposed a model VGG19 which is a convolutional neural network model to detect the cataract by using color fundus images.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484922","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}
引用次数: 26
Automatic Detection of Vehicle Congestion by Using Roadside Unit 使用路边装置自动侦测车辆挤塞
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454197
Z. Abbood, M. Ilyas, Ç. Aydin, Mahmoud Shuker Mahmoud, Nida Abdulredha
The presence of Roadside Units (RSUs) helps network loads to be expanded to the other nodes that have already been far away from frequent node exposure. We proposed in this work utilizing the mobile node to operate as a roadside unit and operate data packet routing such as roadside units does. The main problem of utilizing the huge number of roadside units is the spending of huge time for data provision by a reduction in performance. Also, in this paper, we attempt using the various number of mobile nodes such as roadside units that are different from traditional roadside units such as the past is fixed and the second is active as a movement previous. The proposed method was executing by utilizing ad hoc on demand distance vector (AODV) routing is a path protocol for mobile ad-hoc networks (MANETs) and other wireless ad-hoc networks, this protocol designed for usage of ad-hoc mobile networks. Also, it's an active protocol, the routes are made only when they are needed, common routing tables, one entry single destination, and supplement numbers in conformity with determine whether routing information is up-to-date and to forestall routing loops. In this paper, mobile vehicles move randomly on highways, so in the event of a collision is too high, it is assumed that the vehicle will stop, and the collision site will be subject to accommodate more than one vehicle. Where vehicles are driven at high speed. Due to the driver's ignorance of the accident area, they can enter it, and thus the problem is magnified. The results achieved shows that numerous mobile nodes as a roadside unit may enhance the communication according to the computation of the average time delay and the link duration of the connection and reconnecting each node. Therefore, the results may reduce the delay time and maintain the connection for a longer period, as shown in the fourth simulation model.
路边单元(rsu)的存在有助于将网络负载扩展到已经远离频繁节点暴露的其他节点。在这项工作中,我们建议利用移动节点作为路边单元运行,并像路边单元一样运行数据包路由。使用大量路边单元的主要问题是由于性能降低而花费大量时间来提供数据。此外,在本文中,我们尝试使用不同数量的移动节点,如路边单元,这与传统的路边单元不同,如过去是固定的,第二是作为运动前的活动节点。所提出的方法是利用自组织按需距离矢量(AODV)路由执行,它是一种用于移动自组织网络(manet)和其他无线自组织网络的路径协议,该协议设计用于自组织移动网络。同时,它是一种活动协议,只在需要时才进行路由,通用路由表、一项单目的地和补充号符合确定路由信息是否最新和防止路由循环的规定。在本文中,移动车辆在高速公路上是随机移动的,因此在碰撞高度过高的情况下,假设车辆将停止,并且碰撞地点将受制于容纳多辆车辆。车辆高速行驶的地方。由于驾驶员对事故区域的无知,他们可以进入事故区域,从而放大了问题。研究结果表明,通过计算每个节点连接和重新连接的平均时延和链路持续时间,多个移动节点作为一个路边单元可以增强通信。因此,结果可能会减少延迟时间,使连接保持更长时间,如第四个仿真模型所示。
{"title":"Automatic Detection of Vehicle Congestion by Using Roadside Unit","authors":"Z. Abbood, M. Ilyas, Ç. Aydin, Mahmoud Shuker Mahmoud, Nida Abdulredha","doi":"10.1109/AIIoT52608.2021.9454197","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454197","url":null,"abstract":"The presence of Roadside Units (RSUs) helps network loads to be expanded to the other nodes that have already been far away from frequent node exposure. We proposed in this work utilizing the mobile node to operate as a roadside unit and operate data packet routing such as roadside units does. The main problem of utilizing the huge number of roadside units is the spending of huge time for data provision by a reduction in performance. Also, in this paper, we attempt using the various number of mobile nodes such as roadside units that are different from traditional roadside units such as the past is fixed and the second is active as a movement previous. The proposed method was executing by utilizing ad hoc on demand distance vector (AODV) routing is a path protocol for mobile ad-hoc networks (MANETs) and other wireless ad-hoc networks, this protocol designed for usage of ad-hoc mobile networks. Also, it's an active protocol, the routes are made only when they are needed, common routing tables, one entry single destination, and supplement numbers in conformity with determine whether routing information is up-to-date and to forestall routing loops. In this paper, mobile vehicles move randomly on highways, so in the event of a collision is too high, it is assumed that the vehicle will stop, and the collision site will be subject to accommodate more than one vehicle. Where vehicles are driven at high speed. Due to the driver's ignorance of the accident area, they can enter it, and thus the problem is magnified. The results achieved shows that numerous mobile nodes as a roadside unit may enhance the communication according to the computation of the average time delay and the link duration of the connection and reconnecting each node. Therefore, the results may reduce the delay time and maintain the connection for a longer period, as shown in the fourth simulation model.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114536279","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}
引用次数: 0
Intelligent Mirai Malware Detection in IoT Devices 物联网设备中的智能Mirai恶意软件检测
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454215
Tarun Ganesh Palla, Shahab Tayeb
The advancement in recent IoT devices has led to catastrophic attacks on the devices by breaching user's privacy and exhausting the resources in organizations, which costs users and organizations time and money. One such malware which has been extremely harmful is Mirai, which has created worldwide recognition by impacting the digital world. There are several ways to mitigate Mirai, but Machine Learning-based approach has proved to be accurate and reliable in averting the malware. In this paper, a novel approach to detecting Mirai using Machine Learning Algorithm is proposed and implemented in Matlab 2018b. To evaluate the proposed approach, Mirai and Benign datasets are considered and training is performed on the dataset using Artificial Neural Network, which provides consistent results of Accuracy, Precision, Recall and F-1 score which are found to be considered accurate and reliable as the best performance was achieved with an accuracy of 92.9% and False Negative rate of 0.3, which is efficient in detecting the Mirai and is similar to the Anomaly-based Malware Detection in terms of Metrics.
最近物联网设备的进步导致了对设备的灾难性攻击,侵犯了用户的隐私,耗尽了组织中的资源,这给用户和组织带来了时间和金钱上的损失。其中一个非常有害的恶意软件是Mirai,它通过影响数字世界而获得了全世界的认可。有几种方法可以缓解Mirai,但事实证明,基于机器学习的方法在避免恶意软件方面是准确可靠的。本文提出了一种利用机器学习算法检测Mirai的新方法,并在Matlab 2018b中实现。为了评估所提出的方法,考虑了Mirai和Benign数据集,并使用人工神经网络对数据集进行了训练,该方法提供了一致的准确性、精密度、召回率和F-1分数,这些结果被认为是准确可靠的,因为达到了最佳性能,准确率为92.9%,假阴性率为0.3,这在检测Mirai方面是有效的,并且在指标方面与基于异常的恶意软件检测相似。
{"title":"Intelligent Mirai Malware Detection in IoT Devices","authors":"Tarun Ganesh Palla, Shahab Tayeb","doi":"10.1109/AIIoT52608.2021.9454215","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454215","url":null,"abstract":"The advancement in recent IoT devices has led to catastrophic attacks on the devices by breaching user's privacy and exhausting the resources in organizations, which costs users and organizations time and money. One such malware which has been extremely harmful is Mirai, which has created worldwide recognition by impacting the digital world. There are several ways to mitigate Mirai, but Machine Learning-based approach has proved to be accurate and reliable in averting the malware. In this paper, a novel approach to detecting Mirai using Machine Learning Algorithm is proposed and implemented in Matlab 2018b. To evaluate the proposed approach, Mirai and Benign datasets are considered and training is performed on the dataset using Artificial Neural Network, which provides consistent results of Accuracy, Precision, Recall and F-1 score which are found to be considered accurate and reliable as the best performance was achieved with an accuracy of 92.9% and False Negative rate of 0.3, which is efficient in detecting the Mirai and is similar to the Anomaly-based Malware Detection in terms of Metrics.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"71 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116287289","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}
引用次数: 6
HACS: Access Control for Streaming Data Across Heterogeneous Communication Models 跨异构通信模型的流数据访问控制
Pub Date : 2021-05-10 DOI: 10.1109/AIIoT52608.2021.9454185
Atul Anand Gopalakrishnan, Ashish Christopher Victor, Deepika Karanji, Umashankar Sivakumar, Seema Nambiar, Subramaniam Kalambur
Streaming Big Data pipelines frequently use multiple platforms connected to each other for performing analytics with different communication models. Existing techniques like Access Control Lists (ACLs) or Role-Based Access Control (RBAC) are unable to address access control at the granularity of an individual tuple. Moreover, ACLs and RBAC fail to impose uniform access control over heterogeneous streaming platforms. In this paper, we present a unified mechanism to insert access control policies into data streams at the point of ingestion and enforce it across multiple platforms that use different communication models like publish-subscribe and point to point. We exemplify our solution through implementation with Apache Kafka and Apache Storm. We further illustrate the enforcement of access control in join queries involving streams with different access control rules.
流式大数据管道经常使用多个相互连接的平台,以不同的通信模型执行分析。诸如访问控制列表(acl)或基于角色的访问控制(RBAC)等现有技术无法在单个元组的粒度上解决访问控制问题。此外,acl和RBAC无法对异构流平台施加统一的访问控制。在本文中,我们提出了一种统一的机制,将访问控制策略插入到数据流的摄取点,并在使用不同通信模型(如发布-订阅和点对点)的多个平台上强制执行。我们通过Apache Kafka和Apache Storm实现了我们的解决方案。我们进一步说明在涉及具有不同访问控制规则的流的连接查询中实施访问控制。
{"title":"HACS: Access Control for Streaming Data Across Heterogeneous Communication Models","authors":"Atul Anand Gopalakrishnan, Ashish Christopher Victor, Deepika Karanji, Umashankar Sivakumar, Seema Nambiar, Subramaniam Kalambur","doi":"10.1109/AIIoT52608.2021.9454185","DOIUrl":"https://doi.org/10.1109/AIIoT52608.2021.9454185","url":null,"abstract":"Streaming Big Data pipelines frequently use multiple platforms connected to each other for performing analytics with different communication models. Existing techniques like Access Control Lists (ACLs) or Role-Based Access Control (RBAC) are unable to address access control at the granularity of an individual tuple. Moreover, ACLs and RBAC fail to impose uniform access control over heterogeneous streaming platforms. In this paper, we present a unified mechanism to insert access control policies into data streams at the point of ingestion and enforce it across multiple platforms that use different communication models like publish-subscribe and point to point. We exemplify our solution through implementation with Apache Kafka and Apache Storm. We further illustrate the enforcement of access control in join queries involving streams with different access control rules.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370357","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}
引用次数: 0
期刊
2021 IEEE World AI IoT Congress (AIIoT)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1