Pub Date : 2023-12-24DOI: 10.3390/computers13010008
Simon Lohmann, Dietmar Tutsch
We present a hardware data structure specifically designed for FPGAs that enables the execution of the hard real-time database CRUD operations using a hybrid data structure that combines trees and rings. While the number of rows and columns has to be limited for hard real-time execution, the actual content can be of any size. Our structure restricts full navigational freedom to every but the leaf layer, thus keeping the memory overhead for the data stored in the leaves low. Although its nodes differ in function, all have exactly the same size and structure, reducing the number of cascaded decisions required in the database operations. This enables fast and efficient hardware implementation on FPGAs. In addition to the usual comparison with known data structures, we also analyze the tradeoff between the memory consumption of our approach and a simplified version that is doubly linked in all layers.
{"title":"The Doubly Linked Tree of Singly Linked Rings: Providing Hard Real-Time Database Operations on an FPGA","authors":"Simon Lohmann, Dietmar Tutsch","doi":"10.3390/computers13010008","DOIUrl":"https://doi.org/10.3390/computers13010008","url":null,"abstract":"We present a hardware data structure specifically designed for FPGAs that enables the execution of the hard real-time database CRUD operations using a hybrid data structure that combines trees and rings. While the number of rows and columns has to be limited for hard real-time execution, the actual content can be of any size. Our structure restricts full navigational freedom to every but the leaf layer, thus keeping the memory overhead for the data stored in the leaves low. Although its nodes differ in function, all have exactly the same size and structure, reducing the number of cascaded decisions required in the database operations. This enables fast and efficient hardware implementation on FPGAs. In addition to the usual comparison with known data structures, we also analyze the tradeoff between the memory consumption of our approach and a simplified version that is doubly linked in all layers.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"2000 13","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139160344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-23DOI: 10.3390/computers13010007
Yuan Zhang, M. Effati, Aaron Hao Tan, G. Nejat
Wearing masks in indoor and outdoor public places has been mandatory in a number of countries during the COVID-19 pandemic. Correctly wearing a face mask can reduce the transmission of the virus through respiratory droplets. In this paper, a novel two-step deep learning (DL) method based on our extended ResNet-50 is presented. It can detect and classify whether face masks are missing, are worn correctly or incorrectly, or the face is covered by other means (e.g., a hand or hair). Our DL method utilizes transfer learning with pretrained ResNet-50 weights to reduce training time and increase detection accuracy. Training and validation are achieved using the MaskedFace-Net, MAsked FAces (MAFA), and CelebA datasets. The trained model has been incorporated onto a socially assistive robot for robust and autonomous detection by a robot using lower-resolution images from the onboard camera. The results show a classification accuracy of 84.13% for the classification of no mask, correctly masked, and incorrectly masked faces in various real-world poses and occlusion scenarios using the robot.
{"title":"Robust Face Mask Detection by a Socially Assistive Robot Using Deep Learning","authors":"Yuan Zhang, M. Effati, Aaron Hao Tan, G. Nejat","doi":"10.3390/computers13010007","DOIUrl":"https://doi.org/10.3390/computers13010007","url":null,"abstract":"Wearing masks in indoor and outdoor public places has been mandatory in a number of countries during the COVID-19 pandemic. Correctly wearing a face mask can reduce the transmission of the virus through respiratory droplets. In this paper, a novel two-step deep learning (DL) method based on our extended ResNet-50 is presented. It can detect and classify whether face masks are missing, are worn correctly or incorrectly, or the face is covered by other means (e.g., a hand or hair). Our DL method utilizes transfer learning with pretrained ResNet-50 weights to reduce training time and increase detection accuracy. Training and validation are achieved using the MaskedFace-Net, MAsked FAces (MAFA), and CelebA datasets. The trained model has been incorporated onto a socially assistive robot for robust and autonomous detection by a robot using lower-resolution images from the onboard camera. The results show a classification accuracy of 84.13% for the classification of no mask, correctly masked, and incorrectly masked faces in various real-world poses and occlusion scenarios using the robot.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"20 6","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139162406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-23DOI: 10.3390/computers13010005
A. Faccia, Julie McDonald, Babu George
Transparency in financial reporting is crucial for maintaining trust in financial markets, yet fraudulent financial statements remain challenging to detect and prevent. This study introduces a novel approach to detecting financial statement fraud by applying sentiment analysis to analyse the textual data within financial reports. This research aims to identify patterns and anomalies that might indicate fraudulent activities by examining the language and sentiment expressed across multiple fiscal years. The study focuses on three companies known for financial statement fraud: Wirecard, Tesco, and Under Armour. Utilising Natural Language Processing (NLP) techniques, the research analyses polarity (positive or negative sentiment) and subjectivity (degree of personal opinion) within the financial statements, revealing intriguing patterns. Wirecard showed a consistent tone with a slight decrease in 2018, Tesco exhibited marked changes in the fraud year, and Under Armour presented subtler shifts during the fraud years. While the findings present promising trends, the study emphasises that sentiment analysis alone cannot definitively detect financial statement fraud. It provides insights into the tone and mood of the text but cannot reveal intentional deception or financial discrepancies. The results serve as supplementary information, enriching traditional financial analysis methods. This research contributes to the field by exploring the potential of sentiment analysis in financial fraud detection, offering a unique perspective that complements quantitative methods. It opens new avenues for investigation and underscores the need for an integrated, multidimensional approach to fraud detection.
财务报告的透明度对于维护金融市场的信任度至关重要，但欺诈性财务报表的检测和预防仍具有挑战性。本研究通过应用情感分析来分析财务报告中的文本数据，引入了一种检测财务报表欺诈的新方法。本研究旨在通过检查多个财政年度的语言和情感表达，识别可能表明欺诈活动的模式和异常现象。研究重点关注三家以财务报表欺诈著称的公司：Wirecard、Tesco 和 Under Armour。研究利用自然语言处理（NLP）技术，分析了财务报表中的极性（积极或消极情绪）和主观性（个人观点的程度），揭示了耐人寻味的模式。Wirecard 在 2018 年显示出一致的基调，但略有下降；Tesco 在欺诈年显示出明显的变化；Under Armour 在欺诈年显示出更微妙的变化。虽然研究结果呈现出可喜的趋势，但研究强调，仅靠情感分析并不能明确检测出财务报表欺诈。情感分析能让人深入了解文本的基调和情绪，但不能揭示蓄意欺骗或财务差异。研究结果可作为补充信息，丰富传统的财务分析方法。这项研究通过探索情感分析在财务欺诈检测中的潜力，为该领域做出了贡献，提供了一个补充定量方法的独特视角。它开辟了新的调查途径，强调了采用综合、多维方法进行欺诈检测的必要性。
{"title":"NLP Sentiment Analysis and Accounting Transparency: A New Era of Financial Record Keeping","authors":"A. Faccia, Julie McDonald, Babu George","doi":"10.3390/computers13010005","DOIUrl":"https://doi.org/10.3390/computers13010005","url":null,"abstract":"Transparency in financial reporting is crucial for maintaining trust in financial markets, yet fraudulent financial statements remain challenging to detect and prevent. This study introduces a novel approach to detecting financial statement fraud by applying sentiment analysis to analyse the textual data within financial reports. This research aims to identify patterns and anomalies that might indicate fraudulent activities by examining the language and sentiment expressed across multiple fiscal years. The study focuses on three companies known for financial statement fraud: Wirecard, Tesco, and Under Armour. Utilising Natural Language Processing (NLP) techniques, the research analyses polarity (positive or negative sentiment) and subjectivity (degree of personal opinion) within the financial statements, revealing intriguing patterns. Wirecard showed a consistent tone with a slight decrease in 2018, Tesco exhibited marked changes in the fraud year, and Under Armour presented subtler shifts during the fraud years. While the findings present promising trends, the study emphasises that sentiment analysis alone cannot definitively detect financial statement fraud. It provides insights into the tone and mood of the text but cannot reveal intentional deception or financial discrepancies. The results serve as supplementary information, enriching traditional financial analysis methods. This research contributes to the field by exploring the potential of sentiment analysis in financial fraud detection, offering a unique perspective that complements quantitative methods. It opens new avenues for investigation and underscores the need for an integrated, multidimensional approach to fraud detection.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"13 12","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139162092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-23DOI: 10.3390/computers13010006
Josiah E. Balota, A. Kor, O. Shobande
The domain of Multi-Network Latency Prediction for IoT and Wireless Sensor Networks (WSNs) confronts significant challenges. However, continuous research efforts and progress in areas such as machine learning, edge computing, security technologies, and hybrid modelling are actively influencing the closure of identified gaps. Effectively addressing the inherent complexities in this field will play a crucial role in unlocking the full potential of latency prediction systems within the dynamic and diverse landscape of the Internet of Things (IoT). Using linear interpolation and extrapolation algorithms, the study explores the use of multi-network real-time end-to-end latency data for precise prediction. This approach has significantly improved network performance through throughput and response time optimization. The findings indicate prediction accuracy, with the majority of experimental connection pairs achieving over 95% accuracy, and within a 70% to 95% accuracy range. This research provides tangible evidence that data packet and end-to-end latency time predictions for heterogeneous low-rate and low-power WSNs, facilitated by a localized database, can substantially enhance network performance, and minimize latency. Our proposed JosNet model simplifies and streamlines WSN prediction by employing linear interpolation and extrapolation techniques. The research findings also underscore the potential of this approach to revolutionize the management and control of data packets in WSNs, paving the way for more efficient and responsive wireless sensor networks.
{"title":"Multi-Network Latency Prediction for IoT and WSNs","authors":"Josiah E. Balota, A. Kor, O. Shobande","doi":"10.3390/computers13010006","DOIUrl":"https://doi.org/10.3390/computers13010006","url":null,"abstract":"The domain of Multi-Network Latency Prediction for IoT and Wireless Sensor Networks (WSNs) confronts significant challenges. However, continuous research efforts and progress in areas such as machine learning, edge computing, security technologies, and hybrid modelling are actively influencing the closure of identified gaps. Effectively addressing the inherent complexities in this field will play a crucial role in unlocking the full potential of latency prediction systems within the dynamic and diverse landscape of the Internet of Things (IoT). Using linear interpolation and extrapolation algorithms, the study explores the use of multi-network real-time end-to-end latency data for precise prediction. This approach has significantly improved network performance through throughput and response time optimization. The findings indicate prediction accuracy, with the majority of experimental connection pairs achieving over 95% accuracy, and within a 70% to 95% accuracy range. This research provides tangible evidence that data packet and end-to-end latency time predictions for heterogeneous low-rate and low-power WSNs, facilitated by a localized database, can substantially enhance network performance, and minimize latency. Our proposed JosNet model simplifies and streamlines WSN prediction by employing linear interpolation and extrapolation techniques. The research findings also underscore the potential of this approach to revolutionize the management and control of data packets in WSNs, paving the way for more efficient and responsive wireless sensor networks.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"32 20","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139162076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-22DOI: 10.3390/computers13010002
Christos Stavrogiannis, F. Sofos, Maria Sagri, D. Vavougios, T. Karakasidis
Data science and machine learning (ML) techniques are employed to shed light into the molecular mechanisms that affect fluid-transport properties at the nanoscale. Viscosity and thermal conductivity values of four basic monoatomic elements, namely, argon, krypton, nitrogen, and oxygen, are gathered from experimental and simulation data in the literature and constitute a primary database for further investigation. The data refers to a wide pressure–temperature (P-T) phase space, covering fluid states from gas to liquid and supercritical. The database is enriched with new simulation data extracted from our equilibrium molecular dynamics (MD) simulations. A machine learning (ML) framework with ensemble, classical, kernel-based, and stacked algorithmic techniques is also constructed to function in parallel with the MD model, trained by existing data and predicting the values of new phase space points. In terms of algorithmic performance, it is shown that the stacked and tree-based ML models have given the most accurate results for all elements and can be excellent choices for small to medium-sized datasets. In such a way, a twofold computational scheme is constructed, functioning as a computationally inexpensive route that achieves high accuracy, aiming to replace costly experiments and simulations, when feasible.
本研究采用数据科学和机器学习（ML）技术来揭示影响纳米尺度流体传输特性的分子机制。从文献中的实验和模拟数据中收集了四种基本单原子元素（即氩、氪、氮和氧）的粘度和热导率值，这些数据构成了进一步研究的主要数据库。这些数据涉及广泛的压力-温度（P-T）相空间，涵盖从气态到液态和超临界的流体状态。从我们的平衡分子动力学（MD）模拟中提取的新模拟数据丰富了该数据库。此外，还构建了一个机器学习（ML）框架，采用集合、经典、基于内核和堆叠算法技术，与 MD 模型并行运作，通过现有数据进行训练，并预测新相空间点的值。就算法性能而言，堆叠式和基于树的 ML 模型对所有元素都给出了最准确的结果，是中小型数据集的绝佳选择。通过这种方式，我们构建了一种双重计算方案，作为一种计算成本低廉的途径，实现了高精确度，目的是在可行的情况下取代成本高昂的实验和模拟。
{"title":"Twofold Machine-Learning and Molecular Dynamics: A Computational Framework","authors":"Christos Stavrogiannis, F. Sofos, Maria Sagri, D. Vavougios, T. Karakasidis","doi":"10.3390/computers13010002","DOIUrl":"https://doi.org/10.3390/computers13010002","url":null,"abstract":"Data science and machine learning (ML) techniques are employed to shed light into the molecular mechanisms that affect fluid-transport properties at the nanoscale. Viscosity and thermal conductivity values of four basic monoatomic elements, namely, argon, krypton, nitrogen, and oxygen, are gathered from experimental and simulation data in the literature and constitute a primary database for further investigation. The data refers to a wide pressure–temperature (P-T) phase space, covering fluid states from gas to liquid and supercritical. The database is enriched with new simulation data extracted from our equilibrium molecular dynamics (MD) simulations. A machine learning (ML) framework with ensemble, classical, kernel-based, and stacked algorithmic techniques is also constructed to function in parallel with the MD model, trained by existing data and predicting the values of new phase space points. In terms of algorithmic performance, it is shown that the stacked and tree-based ML models have given the most accurate results for all elements and can be excellent choices for small to medium-sized datasets. In such a way, a twofold computational scheme is constructed, functioning as a computationally inexpensive route that achieves high accuracy, aiming to replace costly experiments and simulations, when feasible.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"2 10","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138944699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-22DOI: 10.3390/computers13010004
Majed Imad, Antoine Grenier, Xiaolong Zhang, J. Nurmi, Elena Simon Lohan
Low Earth Orbit (LEO) constellations have ecently gained tremendous attention in the navigational field due to their arger constellation size, faster geometry variations, and higher signal power evels than Global Navigation Satellite Systems (GNSS), making them favourable for Position, Navigation, and Timing (PNT) purposes. Satellite signals are heavily attenuated from the atmospheric ayers, especially from the ionosphere. Ionospheric delays are, however, expected to be smaller in signals from LEO satellites than GNSS due to their ower orbital altitudes and higher carrier frequency. Nevertheless, unlike for GNSS, there are currently no standardized models for correcting the ionospheric errors in LEO signals. In this paper, we derive a new model called Interpolated and Averaged Memory Model (IAMM) starting from existing International GNSS Service (IGS) data and based on the observation that ionospheric effects epeat every 11 years. Our IAMM model can be used for ionospheric corrections for signals from any satellite constellation, including LEO. This model is constructed based on averaging multiple ionospheric data and eflecting the electron content inside the ionosphere. The IAMM model’s primary advantage is its ability to be used both online and offline without needing eal-time input parameters, thus making it easy to store in a device’s memory. We compare this model with two benchmark models, the Klobuchar and International Reference Ionosphere (IRI) models, by utilizing GNSS measurement data from 24 scenarios acquired in several European countries using both professional GNSS eceivers and Android smartphones. The model’s behaviour is also evaluated on LEO signals using simulated data (as measurement data based on LEO signals are still not available in the open-access community; we show a significant eduction in ionospheric delays in LEO signals compared to GNSS. Finally, we highlight the remaining open challenges toward viable ionospheric-delay models in an LEO-PNT context.
{"title":"Ionospheric Error Models for Satellite-Based Navigation—Paving the Road towards LEO-PNT Solutions","authors":"Majed Imad, Antoine Grenier, Xiaolong Zhang, J. Nurmi, Elena Simon Lohan","doi":"10.3390/computers13010004","DOIUrl":"https://doi.org/10.3390/computers13010004","url":null,"abstract":"Low Earth Orbit (LEO) constellations have ecently gained tremendous attention in the navigational field due to their arger constellation size, faster geometry variations, and higher signal power evels than Global Navigation Satellite Systems (GNSS), making them favourable for Position, Navigation, and Timing (PNT) purposes. Satellite signals are heavily attenuated from the atmospheric ayers, especially from the ionosphere. Ionospheric delays are, however, expected to be smaller in signals from LEO satellites than GNSS due to their ower orbital altitudes and higher carrier frequency. Nevertheless, unlike for GNSS, there are currently no standardized models for correcting the ionospheric errors in LEO signals. In this paper, we derive a new model called Interpolated and Averaged Memory Model (IAMM) starting from existing International GNSS Service (IGS) data and based on the observation that ionospheric effects epeat every 11 years. Our IAMM model can be used for ionospheric corrections for signals from any satellite constellation, including LEO. This model is constructed based on averaging multiple ionospheric data and eflecting the electron content inside the ionosphere. The IAMM model’s primary advantage is its ability to be used both online and offline without needing eal-time input parameters, thus making it easy to store in a device’s memory. We compare this model with two benchmark models, the Klobuchar and International Reference Ionosphere (IRI) models, by utilizing GNSS measurement data from 24 scenarios acquired in several European countries using both professional GNSS eceivers and Android smartphones. The model’s behaviour is also evaluated on LEO signals using simulated data (as measurement data based on LEO signals are still not available in the open-access community; we show a significant eduction in ionospheric delays in LEO signals compared to GNSS. Finally, we highlight the remaining open challenges toward viable ionospheric-delay models in an LEO-PNT context.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"114 16","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139163641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-22DOI: 10.3390/computers13010003
Alexey Nosov, Y. Kuznetsova, M. Stankevich, I. Smirnov, Oleg Grigoriev
Social media has become an almost unlimited resource for studying social processes. Seasonality is a phenomenon that significantly affects many physical and mental states. Modeling collective emotional seasonal changes is a challenging task for the technical, social, and humanities sciences. This is due to the laboriousness and complexity of obtaining a sufficient amount of data, processing and evaluating them, and presenting the results. At the same time, understanding the annual dynamics of collective sentiment provides us with important insights into collective behavior, especially in various crises or disasters. In our study, we propose a scheme for identifying and evaluating signs of the seasonal rise and fall of emotional tension based on social media texts. The analysis is based on Russian-language comments in VKontakte social network communities devoted to city news and the events of a small town in the Nizhny Novgorod region, Russia. Workflow steps include a statistical method for categorizing data, exploratory analysis to identify common patterns, data aggregation for modeling seasonal changes, the identification of typical data properties through clustering, and the formulation and validation of seasonality criteria. As a result of seasonality modeling, it is shown that the calendar seasonal model corresponds to the data, and the dynamics of emotional tension correlate with the seasons. The proposed methodology is useful for a wide range of social practice issues, such as monitoring public opinion or assessing irregular shifts in mass emotions.
{"title":"Modeling Seasonality of Emotional Tension in Social Media","authors":"Alexey Nosov, Y. Kuznetsova, M. Stankevich, I. Smirnov, Oleg Grigoriev","doi":"10.3390/computers13010003","DOIUrl":"https://doi.org/10.3390/computers13010003","url":null,"abstract":"Social media has become an almost unlimited resource for studying social processes. Seasonality is a phenomenon that significantly affects many physical and mental states. Modeling collective emotional seasonal changes is a challenging task for the technical, social, and humanities sciences. This is due to the laboriousness and complexity of obtaining a sufficient amount of data, processing and evaluating them, and presenting the results. At the same time, understanding the annual dynamics of collective sentiment provides us with important insights into collective behavior, especially in various crises or disasters. In our study, we propose a scheme for identifying and evaluating signs of the seasonal rise and fall of emotional tension based on social media texts. The analysis is based on Russian-language comments in VKontakte social network communities devoted to city news and the events of a small town in the Nizhny Novgorod region, Russia. Workflow steps include a statistical method for categorizing data, exploratory analysis to identify common patterns, data aggregation for modeling seasonal changes, the identification of typical data properties through clustering, and the formulation and validation of seasonality criteria. As a result of seasonality modeling, it is shown that the calendar seasonal model corresponds to the data, and the dynamics of emotional tension correlate with the seasons. The proposed methodology is useful for a wide range of social practice issues, such as monitoring public opinion or assessing irregular shifts in mass emotions.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"9 49","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138943911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-20DOI: 10.3390/computers13010001
Konstantinos Zioutos, H. Kondylakis, K. Stefanidis
Nowadays, in the pursuit of personalized health and well-being, dietary choices are critical. This paper introduces a novel recommendation system designed to provide users with personalized meal plans, consisting of breakfast, lunch, snack, and dinner, in alignment with their health history and preferences from other similar users. More specifically, our system exploits collaborative filtering first to identify other users with similar dietary preferences and uses this information to propose suitable recipes to individuals. The whole process is enhanced by analyzing the individual’s health history, including dietary restrictions, nutritional needs, and specific diet plans, such as low-carb or vegetarian. This ensures that the generated meal plans are not only aligned with the user’s taste but also contribute to the overall wellness of the user. A distinctive feature of our system is its dynamic adaptation feature, which enables users to make real-time adjustments to their meal plans based on their personal constraints and preferences, directly impacting future recommendations. We evaluate the usability of the system through a series of experiments on a large real-world data set of recipes, showing that our system is able to provide highly personalized, dynamic, and accurate recommendations.
{"title":"Healthy Personalized Recipe Recommendations for Weekly Meal Planning","authors":"Konstantinos Zioutos, H. Kondylakis, K. Stefanidis","doi":"10.3390/computers13010001","DOIUrl":"https://doi.org/10.3390/computers13010001","url":null,"abstract":"Nowadays, in the pursuit of personalized health and well-being, dietary choices are critical. This paper introduces a novel recommendation system designed to provide users with personalized meal plans, consisting of breakfast, lunch, snack, and dinner, in alignment with their health history and preferences from other similar users. More specifically, our system exploits collaborative filtering first to identify other users with similar dietary preferences and uses this information to propose suitable recipes to individuals. The whole process is enhanced by analyzing the individual’s health history, including dietary restrictions, nutritional needs, and specific diet plans, such as low-carb or vegetarian. This ensures that the generated meal plans are not only aligned with the user’s taste but also contribute to the overall wellness of the user. A distinctive feature of our system is its dynamic adaptation feature, which enables users to make real-time adjustments to their meal plans based on their personal constraints and preferences, directly impacting future recommendations. We evaluate the usability of the system through a series of experiments on a large real-world data set of recipes, showing that our system is able to provide highly personalized, dynamic, and accurate recommendations.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"14 2","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139168495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-18DOI: 10.3390/computers12120263
Nelson Cárdenas-Bolaño, Aura Polo, Carlos Robles-Algarín
This paper presents the implementation of an intelligent real-time single-channel electromyography (EMG) signal classifier based on open-source hardware. The article shows the experimental design, analysis, and implementation of a solution to identify four muscle movements from the forearm (extension, pronation, supination, and flexion), for future applications in transradial active prostheses. An EMG signal acquisition instrument was developed, with a 20–450 Hz bandwidth and 2 kHz sampling rate. The signals were stored in a Database, as a multidimensional array, using a desktop application. Numerical and graphic analysis approaches for discriminative capacity were proposed for feature analysis and four feature sets were used to feed the classifier. Artificial Neural Networks (ANN) were implemented for time-domain EMG pattern recognition (PR). The system obtained a classification accuracy of 98.44% and response times per signal of 8.522 ms. Results suggest these methods allow us to understand, intuitively, the behavior of user information.
{"title":"Implementation of an Intelligent EMG Signal Classifier Using Open-Source Hardware","authors":"Nelson Cárdenas-Bolaño, Aura Polo, Carlos Robles-Algarín","doi":"10.3390/computers12120263","DOIUrl":"https://doi.org/10.3390/computers12120263","url":null,"abstract":"This paper presents the implementation of an intelligent real-time single-channel electromyography (EMG) signal classifier based on open-source hardware. The article shows the experimental design, analysis, and implementation of a solution to identify four muscle movements from the forearm (extension, pronation, supination, and flexion), for future applications in transradial active prostheses. An EMG signal acquisition instrument was developed, with a 20–450 Hz bandwidth and 2 kHz sampling rate. The signals were stored in a Database, as a multidimensional array, using a desktop application. Numerical and graphic analysis approaches for discriminative capacity were proposed for feature analysis and four feature sets were used to feed the classifier. Artificial Neural Networks (ANN) were implemented for time-domain EMG pattern recognition (PR). The system obtained a classification accuracy of 98.44% and response times per signal of 8.522 ms. Results suggest these methods allow us to understand, intuitively, the behavior of user information.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"109 3","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139175010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-17DOI: 10.3390/computers12120262
Abdullah Ali Jawad Al-Abadi, M. Mohamed, Ahmed Fakhfakh
In recent years, the combination of wireless body sensor networks (WBSNs) and the Internet ofc Medical Things (IoMT) marked a transformative era in healthcare technology. This combination allowed for the smooth communication between medical devices that enabled the real-time monitoring of patient’s vital signs and health parameters. However, the increased connectivity also introduced security challenges, particularly as they related to the presence of attack nodes. This paper proposed a unique solution, an enhanced random forest classifier with a K-means clustering (ERF-KMC) algorithm, in response to these challenges. The proposed ERF-KMC algorithm combined the accuracy of the enhanced random forest classifier for achieving the best execution time (ERF-ABE) with the clustering capabilities of K-means. This model played a dual role. Initially, the security in IoMT networks was enhanced through the detection of attack messages using ERF-ABE, followed by the classification of attack types, specifically distinguishing between man-in-the-middle (MITM) and distributed denial of service (DDoS) using K-means. This approach facilitated the precise categorization of attacks, enabling the ERF-KMC algorithm to employ appropriate methods for blocking these attack messages effectively. Subsequently, this approach contributed to the improvement of network performance metrics that significantly deteriorated during the attack, including the packet loss rate (PLR), end-to-end delay (E2ED), and throughput. This was achieved through the detection of attack nodes and the subsequent prevention of their entry into the IoMT networks, thereby mitigating potential disruptions and enhancing the overall network efficiency. This study conducted simulations using the Python programming language to assess the performance of the ERF-KMC algorithm in the realm of IoMT, specifically focusing on network performance metrics. In comparison with other algorithms, the ERF-KMC algorithm demonstrated superior efficacy, showcasing its heightened capability in terms of optimizing IoMT network performance as compared to other common algorithms in network security, such as AdaBoost, CatBoost, and random forest. The importance of the ERF-KMC algorithm lies in its security for IoMT networks, as it provides a high-security approach for identifying and preventing MITM and DDoS attacks. Furthermore, improving the network performance metrics to ensure transmitted medical data are accurate and efficient is vital for real-time patient monitoring. This study takes the next step towards enhancing the reliability and security of IoMT systems and advancing the future of connected healthcare technologies.
{"title":"Enhanced Random Forest Classifier with K-Means Clustering (ERF-KMC) for Detecting and Preventing Distributed-Denial-of-Service and Man-in-the-Middle Attacks in Internet-of-Medical-Things Networks","authors":"Abdullah Ali Jawad Al-Abadi, M. Mohamed, Ahmed Fakhfakh","doi":"10.3390/computers12120262","DOIUrl":"https://doi.org/10.3390/computers12120262","url":null,"abstract":"In recent years, the combination of wireless body sensor networks (WBSNs) and the Internet ofc Medical Things (IoMT) marked a transformative era in healthcare technology. This combination allowed for the smooth communication between medical devices that enabled the real-time monitoring of patient’s vital signs and health parameters. However, the increased connectivity also introduced security challenges, particularly as they related to the presence of attack nodes. This paper proposed a unique solution, an enhanced random forest classifier with a K-means clustering (ERF-KMC) algorithm, in response to these challenges. The proposed ERF-KMC algorithm combined the accuracy of the enhanced random forest classifier for achieving the best execution time (ERF-ABE) with the clustering capabilities of K-means. This model played a dual role. Initially, the security in IoMT networks was enhanced through the detection of attack messages using ERF-ABE, followed by the classification of attack types, specifically distinguishing between man-in-the-middle (MITM) and distributed denial of service (DDoS) using K-means. This approach facilitated the precise categorization of attacks, enabling the ERF-KMC algorithm to employ appropriate methods for blocking these attack messages effectively. Subsequently, this approach contributed to the improvement of network performance metrics that significantly deteriorated during the attack, including the packet loss rate (PLR), end-to-end delay (E2ED), and throughput. This was achieved through the detection of attack nodes and the subsequent prevention of their entry into the IoMT networks, thereby mitigating potential disruptions and enhancing the overall network efficiency. This study conducted simulations using the Python programming language to assess the performance of the ERF-KMC algorithm in the realm of IoMT, specifically focusing on network performance metrics. In comparison with other algorithms, the ERF-KMC algorithm demonstrated superior efficacy, showcasing its heightened capability in terms of optimizing IoMT network performance as compared to other common algorithms in network security, such as AdaBoost, CatBoost, and random forest. The importance of the ERF-KMC algorithm lies in its security for IoMT networks, as it provides a high-security approach for identifying and preventing MITM and DDoS attacks. Furthermore, improving the network performance metrics to ensure transmitted medical data are accurate and efficient is vital for real-time patient monitoring. This study takes the next step towards enhancing the reliability and security of IoMT systems and advancing the future of connected healthcare technologies.","PeriodicalId":46292,"journal":{"name":"Computers","volume":"7 19","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138966512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：