Pub Date : 2024-10-24DOI: 10.1109/ICJECE.2024.3429273
Alaor Cervati Neto;Alexandre L. M. Levada;Michel Ferreira Cardia Haddad
The t-distributed stochastic neighbor embedding (t-SNE) consists of a powerful algorithm for visualizing high-dimensional data in a lower dimensional space. It is extensively employed in machine learning (ML) and data analysis, including unsupervised metric learning. In this article, we propose improvements concerning two main aspects of the t-SNE. First, the incorporation of class labels is adopted to increase its suitability for supervised classification. Second, stochastic and geodesic distances are used as dissimilarity measures to avoid the dependence of the standard Euclidean distance, which is particularly sensitive to outliers. Computational experiments with several real-world datasets indicate that the proposed methodological approach is capable of improving classification accuracy compared with established methods. The results indicate a superior performance compared with the regular t-SNE and linear discriminant analysis (LDA), and a dependence on fewer parameters in comparison with the state-of-the-art supervised uniform manifold approximation and projection (UMAP) algorithm.
{"title":"Supervised t-SNE for Metric Learning With Stochastic and Geodesic Distances","authors":"Alaor Cervati Neto;Alexandre L. M. Levada;Michel Ferreira Cardia Haddad","doi":"10.1109/ICJECE.2024.3429273","DOIUrl":"https://doi.org/10.1109/ICJECE.2024.3429273","url":null,"abstract":"The t-distributed stochastic neighbor embedding (t-SNE) consists of a powerful algorithm for visualizing high-dimensional data in a lower dimensional space. It is extensively employed in machine learning (ML) and data analysis, including unsupervised metric learning. In this article, we propose improvements concerning two main aspects of the t-SNE. First, the incorporation of class labels is adopted to increase its suitability for supervised classification. Second, stochastic and geodesic distances are used as dissimilarity measures to avoid the dependence of the standard Euclidean distance, which is particularly sensitive to outliers. Computational experiments with several real-world datasets indicate that the proposed methodological approach is capable of improving classification accuracy compared with established methods. The results indicate a superior performance compared with the regular t-SNE and linear discriminant analysis (LDA), and a dependence on fewer parameters in comparison with the state-of-the-art supervised uniform manifold approximation and projection (UMAP) algorithm.","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"47 4","pages":"199-205"},"PeriodicalIF":2.1,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10734850","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-04DOI: 10.1109/ICJECE.2024.3409156
Wafaa Anani;Abdelkader Ouda
Abstract-The escalating demand for secure communication in the Internet of Things (IoT), particularly in energy-sensitive devices such as smart meters, highlights a critical challenge: achieving robust security without excessive energy consumption. While various solutions have been proposed to minimize energy use, many fail to address the unique constraints of the IoT devices effectively. This article introduces an innovative approach by proposing a secure, lightweight wireless meter-bus (wM-Bus) protocol, specifically designed for the stringent resource constraints of the IoT environments. By incorporating the noise protocol framework (NPF), our protocol significantly reduces computational and power requirements without compromising security integrity. Through a methodical implementation that spanned five distinct phases, including a comparative analysis with the conventional transport layer security (TLS), our findings are compelling. The NPF, particularly with its NX and XX patterns, dramatically surpasses TLS in performance, extending operational lifetimes to approximately 9 and 7.88 years, respectively, in contrast to the 3.81 years offered by TLS. These results not only demonstrate the superior efficiency of the NPF in the IoT settings but also highlight its potential in striking an optimal balance between security and operational longevity.
{"title":"A Secure Lightweight Wireless M-Bus Protocol for IoT: Leveraging the Noise Protocol Framework","authors":"Wafaa Anani;Abdelkader Ouda","doi":"10.1109/ICJECE.2024.3409156","DOIUrl":"https://doi.org/10.1109/ICJECE.2024.3409156","url":null,"abstract":"Abstract-The escalating demand for secure communication in the Internet of Things (IoT), particularly in energy-sensitive devices such as smart meters, highlights a critical challenge: achieving robust security without excessive energy consumption. While various solutions have been proposed to minimize energy use, many fail to address the unique constraints of the IoT devices effectively. This article introduces an innovative approach by proposing a secure, lightweight wireless meter-bus (wM-Bus) protocol, specifically designed for the stringent resource constraints of the IoT environments. By incorporating the noise protocol framework (NPF), our protocol significantly reduces computational and power requirements without compromising security integrity. Through a methodical implementation that spanned five distinct phases, including a comparative analysis with the conventional transport layer security (TLS), our findings are compelling. The NPF, particularly with its NX and XX patterns, dramatically surpasses TLS in performance, extending operational lifetimes to approximately 9 and 7.88 years, respectively, in contrast to the 3.81 years offered by TLS. These results not only demonstrate the superior efficiency of the NPF in the IoT settings but also highlight its potential in striking an optimal balance between security and operational longevity.","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"47 4","pages":"175-186"},"PeriodicalIF":2.1,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810467","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 diffusion of electric vehicles (EVs) is recently gaining great attention in the road transport and automotive sectors as an attempt to bring in an emission-free world. EVs are considered a key to future clean transportation systems. However, these vehicles still suffer from limited battery capacity and range anxiety. Therefore, EVs manufacturers are focusing on reducing energy consumption and CO2 emissions. In addition, research in the context of intelligent transportation systems embedding information and communication technologies are focusing on the optimization of the energy consumption as a valuable solution to foster the wide diffusion of EVs. In this article, we propose a simulation platform for eco-routing services based on estimating EV energy consumption to provide the most energy-efficient routes for the EV while traveling. We provide an energy map that can be used for eco-routing through a real-time data collection of the EV energy consumption. The energy map was established in the traffic simulator Simulation of Urban MObility (SUMO) to show the efficiency of the proposed eco-routing strategy compared to the other strategies based on establishing the fastest routes. This map will be exploited as good support, in the future, for advanced research on the EV concept.
{"title":"Energy-Efficient Route Navigation (Eco-Routing) for Electric Vehicles in SUMO","authors":"Insaf Sagaama;Amine Kchiche;Wassim Trojet;Farouk Kamoun","doi":"10.1109/ICJECE.2024.3425515","DOIUrl":"https://doi.org/10.1109/ICJECE.2024.3425515","url":null,"abstract":"The diffusion of electric vehicles (EVs) is recently gaining great attention in the road transport and automotive sectors as an attempt to bring in an emission-free world. EVs are considered a key to future clean transportation systems. However, these vehicles still suffer from limited battery capacity and range anxiety. Therefore, EVs manufacturers are focusing on reducing energy consumption and CO2 emissions. In addition, research in the context of intelligent transportation systems embedding information and communication technologies are focusing on the optimization of the energy consumption as a valuable solution to foster the wide diffusion of EVs. In this article, we propose a simulation platform for eco-routing services based on estimating EV energy consumption to provide the most energy-efficient routes for the EV while traveling. We provide an energy map that can be used for eco-routing through a real-time data collection of the EV energy consumption. The energy map was established in the traffic simulator Simulation of Urban MObility (SUMO) to show the efficiency of the proposed eco-routing strategy compared to the other strategies based on establishing the fastest routes. This map will be exploited as good support, in the future, for advanced research on the EV concept.","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"47 4","pages":"187-198"},"PeriodicalIF":2.1,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810466","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 : 2024-09-23DOI: 10.1109/ICJECE.2024.3451965
Haojie Peng;Weihua Li;Sifan Dai;Ruihai Chen
With recent advances in airborne weapons, modern air combats tend to be accomplished in the beyond-visual-range (BVR) phase. Multiaircraft cooperation is also required to adapt to the complexities of modern air combats. The scale of the traditional rule-based expert system will become incredible in this case. In view of this, a mixed-reward multiagent proximal policy optimization (MRMAPPO) method is proposed in this article that is used to help train cooperative BVR air combat tactics via adversarial self-play. First, a two-on-two BVR air combat simulation platform is established, and the combat game is modeled as a Markov game. Second, centralized training with decentralized execution architecture is established. Multiple actors are involved in the architecture, each corresponding to a policy that generates a specified kind of command, e.g., the maneuvering and firing command. Moreover, in order to accelerate training as well as enhance the stability of the training process, four optimization mechanisms are introduced. The experimental section discusses how the effectiveness of the MRMAPPO is verified with comparative and ablation experiments, along with several air combat tactics that emerge in the training process.
{"title":"Mixed-Reward Multiagent Proximal Policy Optimization Method for Two-on-Two Beyond-Visual-Range Air Combat","authors":"Haojie Peng;Weihua Li;Sifan Dai;Ruihai Chen","doi":"10.1109/ICJECE.2024.3451965","DOIUrl":"https://doi.org/10.1109/ICJECE.2024.3451965","url":null,"abstract":"With recent advances in airborne weapons, modern air combats tend to be accomplished in the beyond-visual-range (BVR) phase. Multiaircraft cooperation is also required to adapt to the complexities of modern air combats. The scale of the traditional rule-based expert system will become incredible in this case. In view of this, a mixed-reward multiagent proximal policy optimization (MRMAPPO) method is proposed in this article that is used to help train cooperative BVR air combat tactics via adversarial self-play. First, a two-on-two BVR air combat simulation platform is established, and the combat game is modeled as a Markov game. Second, centralized training with decentralized execution architecture is established. Multiple actors are involved in the architecture, each corresponding to a policy that generates a specified kind of command, e.g., the maneuvering and firing command. Moreover, in order to accelerate training as well as enhance the stability of the training process, four optimization mechanisms are introduced. The experimental section discusses how the effectiveness of the MRMAPPO is verified with comparative and ablation experiments, along with several air combat tactics that emerge in the training process.","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"47 4","pages":"206-217"},"PeriodicalIF":2.1,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810469","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 : 2024-09-16DOI: 10.1109/ICJECE.2024.3446351
{"title":"IEEE Canadian Journal of Electrical and Computer Engineering","authors":"","doi":"10.1109/ICJECE.2024.3446351","DOIUrl":"https://doi.org/10.1109/ICJECE.2024.3446351","url":null,"abstract":"","PeriodicalId":100619,"journal":{"name":"IEEE Canadian Journal of Electrical and Computer Engineering","volume":"47 3","pages":"C2-C2"},"PeriodicalIF":2.1,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10680488","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-06DOI: 10.1109/ICJECE.2024.3396287
Abubakar Hamza;Sharif I. M. Sheikh;Hussein Attia
Tightly packed super-directive antenna arrays with complex excitation functions are of recent interest in space communication. In this article, Schelkunoff polynomials and genetic algorithms (GA) are used to formulate the super-directive array excitation functions. The proposed technique used to calculate the antenna properties considerably reduces solver time compared with professional simulators. A packed linear array with an antenna aperture of $2.85lambda$