ComputersPub Date : 2024-02-03DOI: 10.3390/computers13020045
A. Ożadowicz
{"title":"Generic IoT for Smart Buildings and Field-Level Automation—Challenges, Threats, Approaches, and Solutions","authors":"A. Ożadowicz","doi":"10.3390/computers13020045","DOIUrl":"https://doi.org/10.3390/computers13020045","url":null,"abstract":"Smart home and building systems are popular solutions that support maintaining comfort and safety and improve energy efficiency in buildings. However, dynamically developing distributed network technologies, in particular the Internet of Things (IoT), are increasingly entering the above-mentioned application areas of building automation, offering new functional possibilities. The result of these processes is the emergence of many different solutions that combine field-level and information and communications technology (ICT) networks in various configurations and architectures. New paradigms are also emerging, such as edge and fog computing, providing support for local monitoring and control networks in the implementation of advanced functions and algorithms, including machine learning and artificial intelligence mechanisms. This paper collects state-of-the-art information in these areas, providing a systematic review of the literature and case studies with an analysis of selected development trends. The author systematized this information in the context of the potential development of building automation systems. Based on the conclusions of this analysis and discussion, a framework for the development of the Generic IoT paradigm in smart home and building applications has been proposed, along with a strengths, weaknesses, opportunities, and threats (SWOT) analysis of its usability. Future works are proposed as well.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139868515","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}
ComputersPub Date : 2024-02-03DOI: 10.3390/computers13020045
A. Ożadowicz
{"title":"Generic IoT for Smart Buildings and Field-Level Automation—Challenges, Threats, Approaches, and Solutions","authors":"A. Ożadowicz","doi":"10.3390/computers13020045","DOIUrl":"https://doi.org/10.3390/computers13020045","url":null,"abstract":"Smart home and building systems are popular solutions that support maintaining comfort and safety and improve energy efficiency in buildings. However, dynamically developing distributed network technologies, in particular the Internet of Things (IoT), are increasingly entering the above-mentioned application areas of building automation, offering new functional possibilities. The result of these processes is the emergence of many different solutions that combine field-level and information and communications technology (ICT) networks in various configurations and architectures. New paradigms are also emerging, such as edge and fog computing, providing support for local monitoring and control networks in the implementation of advanced functions and algorithms, including machine learning and artificial intelligence mechanisms. This paper collects state-of-the-art information in these areas, providing a systematic review of the literature and case studies with an analysis of selected development trends. The author systematized this information in the context of the potential development of building automation systems. Based on the conclusions of this analysis and discussion, a framework for the development of the Generic IoT paradigm in smart home and building applications has been proposed, along with a strengths, weaknesses, opportunities, and threats (SWOT) analysis of its usability. Future works are proposed as well.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"10 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139808628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interference Management Based on Meta-Heuristic Algorithms in 5G Device-to-Device Communications","authors":"Mohamed Kamel Benbraika, Okba Kraa, Yassine Himeur, Khaled Telli, Shadi Atalla, W. Mansoor","doi":"10.3390/computers13020044","DOIUrl":"https://doi.org/10.3390/computers13020044","url":null,"abstract":"Device-to-Device (D2D) communication is an emerging technology that is vital for the future of cellular networks, including 5G and beyond. Its potential lies in enhancing system throughput, offloading the network core, and improving spectral efficiency. Therefore, optimizing resource and power allocation to reduce co-channel interference is crucial for harnessing these benefits. In this paper, we conduct a comparative study of meta-heuristic algorithms, employing Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Bee Life Algorithm (BLA), and a novel combination of matching techniques with BLA for joint channel and power allocation optimization. The simulation results highlight the effectiveness of bio-inspired algorithms in addressing these challenges. Moreover, the proposed amalgamation of the matching algorithm with BLA outperforms other meta-heuristic algorithms, namely, PSO, BLA, and GA, in terms of throughput, convergence speed, and achieving practical solutions.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"238 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139819174","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}
ComputersPub Date : 2024-02-01DOI: 10.3390/computers13020043
Lorenzo Porcelli, Michele Mastroianni, M. Ficco, F. Palmieri
{"title":"A User-Centered Privacy Policy Management System for Automatic Consent on Cookie Banners","authors":"Lorenzo Porcelli, Michele Mastroianni, M. Ficco, F. Palmieri","doi":"10.3390/computers13020043","DOIUrl":"https://doi.org/10.3390/computers13020043","url":null,"abstract":"Despite growing concerns about privacy and an evolution in laws protecting users’ rights, there remains a gap between how industries manage data and how users can express their preferences. This imbalance often favors industries, forcing users to repeatedly define their privacy preferences each time they access a new website. This process contributes to the privacy paradox. We propose a user support tool named the User Privacy Preference Management System (UPPMS) that eliminates the need for users to handle intricate banners or deceptive patterns. We have set up a process to guide even a non-expert user in creating a standardized personal privacy policy, which is automatically applied to every visited website by interacting with cookie banners. The process of generating actions to apply the user’s policy leverages customized Large Language Models. Experiments demonstrate the feasibility of analyzing HTML code to understand and automatically interact with cookie banners, even implementing complex policies. Our proposal aims to address the privacy paradox related to cookie banners by reducing information overload and decision fatigue for users. It also simplifies user navigation by eliminating the need to repeatedly declare preferences in intricate cookie banners on every visited website, while protecting users from deceptive patterns.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"54 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139828654","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}
ComputersPub Date : 2024-02-01DOI: 10.3390/computers13020043
Lorenzo Porcelli, Michele Mastroianni, M. Ficco, F. Palmieri
{"title":"A User-Centered Privacy Policy Management System for Automatic Consent on Cookie Banners","authors":"Lorenzo Porcelli, Michele Mastroianni, M. Ficco, F. Palmieri","doi":"10.3390/computers13020043","DOIUrl":"https://doi.org/10.3390/computers13020043","url":null,"abstract":"Despite growing concerns about privacy and an evolution in laws protecting users’ rights, there remains a gap between how industries manage data and how users can express their preferences. This imbalance often favors industries, forcing users to repeatedly define their privacy preferences each time they access a new website. This process contributes to the privacy paradox. We propose a user support tool named the User Privacy Preference Management System (UPPMS) that eliminates the need for users to handle intricate banners or deceptive patterns. We have set up a process to guide even a non-expert user in creating a standardized personal privacy policy, which is automatically applied to every visited website by interacting with cookie banners. The process of generating actions to apply the user’s policy leverages customized Large Language Models. Experiments demonstrate the feasibility of analyzing HTML code to understand and automatically interact with cookie banners, even implementing complex policies. Our proposal aims to address the privacy paradox related to cookie banners by reducing information overload and decision fatigue for users. It also simplifies user navigation by eliminating the need to repeatedly declare preferences in intricate cookie banners on every visited website, while protecting users from deceptive patterns.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"5 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139888328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interference Management Based on Meta-Heuristic Algorithms in 5G Device-to-Device Communications","authors":"Mohamed Kamel Benbraika, Okba Kraa, Yassine Himeur, Khaled Telli, Shadi Atalla, W. Mansoor","doi":"10.3390/computers13020044","DOIUrl":"https://doi.org/10.3390/computers13020044","url":null,"abstract":"Device-to-Device (D2D) communication is an emerging technology that is vital for the future of cellular networks, including 5G and beyond. Its potential lies in enhancing system throughput, offloading the network core, and improving spectral efficiency. Therefore, optimizing resource and power allocation to reduce co-channel interference is crucial for harnessing these benefits. In this paper, we conduct a comparative study of meta-heuristic algorithms, employing Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Bee Life Algorithm (BLA), and a novel combination of matching techniques with BLA for joint channel and power allocation optimization. The simulation results highlight the effectiveness of bio-inspired algorithms in addressing these challenges. Moreover, the proposed amalgamation of the matching algorithm with BLA outperforms other meta-heuristic algorithms, namely, PSO, BLA, and GA, in terms of throughput, convergence speed, and achieving practical solutions.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139879149","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}
ComputersPub Date : 2024-01-11DOI: 10.3390/computers13010022
Tamás Aladics, Péter Hegedűs, Rudolf Ferenc
{"title":"A Comparative Study of Commit Representations for JIT Vulnerability Prediction","authors":"Tamás Aladics, Péter Hegedűs, Rudolf Ferenc","doi":"10.3390/computers13010022","DOIUrl":"https://doi.org/10.3390/computers13010022","url":null,"abstract":"With the evolution of software systems, their size and complexity are rising rapidly. Identifying vulnerabilities as early as possible is crucial for ensuring high software quality and security. Just-in-time (JIT) vulnerability prediction, which aims to find vulnerabilities at the time of commit, has increasingly become a focus of attention. In our work, we present a comparative study to provide insights into the current state of JIT vulnerability prediction by examining three candidate models: CC2Vec, DeepJIT, and Code Change Tree. These unique approaches aptly represent the various techniques used in the field, allowing us to offer a thorough description of the current limitations and strengths of JIT vulnerability prediction. Our focus was on the predictive power of the models, their usability in terms of false positive (FP) rates, and the granularity of the source code analysis they are capable of handling. For training and evaluation, we used two recently published datasets containing vulnerability-inducing commits: ProjectKB and Defectors. Our results highlight the trade-offs between predictive accuracy and operational flexibility and also provide guidance on the use of ML-based automation for developers, especially considering false positive rates in commit-based vulnerability prediction. These findings can serve as crucial insights for future research and practical applications in software security.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"56 21","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139533322","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}
ComputersPub Date : 2024-01-05DOI: 10.3390/computers13010017
Dimitris Zeginis, Konstantinos Tarabanis
{"title":"An Event-Centric Knowledge Graph Approach for Public Administration as an Enabler for Data Analytics","authors":"Dimitris Zeginis, Konstantinos Tarabanis","doi":"10.3390/computers13010017","DOIUrl":"https://doi.org/10.3390/computers13010017","url":null,"abstract":"In a continuously evolving environment, organizations, including public administrations, need to quickly adapt to change and make decisions in real-time. This requires having a real-time understanding of their context that can be achieved by adopting an event-native mindset in data management which focuses on the dynamics of change compared to the state-based traditional approaches. In this context, this paper proposes the adoption of an event-centric knowledge graph approach for the holistic data management of all data repositories in public administration. Towards this direction, the paper proposes an event-centric knowledge graph model for the domain of public administration that captures these dynamics considering events as first-class entities for knowledge representation. The development of the model is based on a state-of-the-art analysis of existing event-centric knowledge graph models that led to the identification of core concepts related to event representation, on a state-of-the-art analysis of existing public administration models that identified the core entities of the domain, and on a theoretical analysis of concepts related to events, public services, and effective public administration in order to outline the context and identify the domain-specific needs for event modeling. Further, the paper applies the model in the context of Greek public administration in order to validate it and showcase the possibilities that arise. The results show that the adoption of event-centric knowledge graph approaches for data management in public administration can facilitate data analytics, continuous integration, and the provision of a 360-degree-view of end-users. We anticipate that the proposed approach will also facilitate real-time decision-making, continuous intelligence, and ubiquitous AI.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"54 13","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139382194","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}
ComputersPub Date : 2024-01-04DOI: 10.3390/computers13010016
P. P. Garrido Abenza, Manuel P. Malumbres, P. Piñol, O. López-Granado
{"title":"A Multi-Channel Packet Scheduling Approach to Improving Video Delivery Performance in Vehicular Networks","authors":"P. P. Garrido Abenza, Manuel P. Malumbres, P. Piñol, O. López-Granado","doi":"10.3390/computers13010016","DOIUrl":"https://doi.org/10.3390/computers13010016","url":null,"abstract":"When working with the Wireless Access in Vehicular Environment (WAVE) protocol stack, the multi-channel operation mechanism of the IEEE 1609.4 protocol may impact the overall network performance, especially when using video streaming applications. In general, packets delivered from the application layer during a Control Channel (CCH) time slot have to wait for transmission until the next Service Channel (SCH) time slot arrives. The accumulation of packets at the beginning of the latter time slot may introduce additional delays and higher contention when all the network nodes try, at the same time, to obtain access to the shared channel in order to send the delayed packets as soon as possible. In this work, we have analyzed these performance issues and proposed a new method, which we call SkipCCH, that helps the MAC layer to overcome the high contention produced by the packet transmission bursts at the beginning of every SCH slot. This high contention implies an increase in the number of packet losses, which directly impacts the overall network performance. With our proposal, streaming video in vehicular networks will provide a better quality of reconstructed video at the receiver side under the same network conditions. Furthermore, this method has particularly proven its benefits when working with Quality of Service (QoS) techniques, not only by increasing the received video quality but also because it avoids starvation of the lower-priority traffic.","PeriodicalId":503381,"journal":{"name":"Computers","volume":"66 9","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139387127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Correction: Nayak et al. Brain Tumour Classification Using Noble Deep Learning Approach with Parametric Optimization through Metaheuristics Approaches. Computers 2022, 11, 10","authors":"Dillip Ranjan Nayak, Neelamadhab Padhy, P. Mallick, Dilip Kumar Bagal, Sachin Kumar","doi":"10.3390/computers13010015","DOIUrl":"https://doi.org/10.3390/computers13010015","url":null,"abstract":"Figure 1 was reproduced without the correct copyright permissions from the copyright holder (Medical Sciences) [...]","PeriodicalId":503381,"journal":{"name":"Computers","volume":"79 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139388195","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}