Abstract Designing efficient and flexible approaches for placement of Virtual Network Function (VNF) chains is the main success of Network Function Virtualization (NFV). However, most current work considers the constant bandwidth and flow processing requirements while deploying the VNFs in the network. The constant (immutable) flow processing and bandwidth requirements become critical limitations in an NFV-enabled network with highly dynamic traffic flow. Therefore, bandwidth requirements and available resources of the Point-of-Presence (PoP) in the network change constantly. We present an adaptive model for placing VNF chains to overcome this limitation. At the same time, the proposed model minimizes the number of changes (i.e., re-allocation of VNFs) in the network. The experimental evaluation shows that the adaptive model can deliver stable network services. Moreover, it reduces the significant number of changes in the network and ensures flow performance.
{"title":"APVNFC: Adaptive Placement of Virtual Network Function Chains","authors":"B. K. Umrao, Dharmendar Kumar Yadav","doi":"10.2478/cait-2023-0003","DOIUrl":"https://doi.org/10.2478/cait-2023-0003","url":null,"abstract":"Abstract Designing efficient and flexible approaches for placement of Virtual Network Function (VNF) chains is the main success of Network Function Virtualization (NFV). However, most current work considers the constant bandwidth and flow processing requirements while deploying the VNFs in the network. The constant (immutable) flow processing and bandwidth requirements become critical limitations in an NFV-enabled network with highly dynamic traffic flow. Therefore, bandwidth requirements and available resources of the Point-of-Presence (PoP) in the network change constantly. We present an adaptive model for placing VNF chains to overcome this limitation. At the same time, the proposed model minimizes the number of changes (i.e., re-allocation of VNFs) in the network. The experimental evaluation shows that the adaptive model can deliver stable network services. Moreover, it reduces the significant number of changes in the network and ensures flow performance.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42371369","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}
Abstract Every country must have an accurate and efficient forecasting model to avoid and manage the epidemic. This paper suggests an upgrade to one of the evolutionary algorithms inspired by nature, the Barnacle Mating Optimizer (BMO). First, the exploration phase of the original BMO is enhanced by enforcing and replacing the sperm cast equation through Levy flight. Then, the Least Square Support Vector Machine (LSSVM) is partnered with the improved BMO (IBMO). This hybrid approach, IBMO-LSSVM, has been deployed effectively for time-series forecasting to enhance the RBF kernel-based LSSVM model since vaccination started against COVID-19 in Malaysia. In comparison to other well-known algorithms, our outcomes are superior. In addition, the IBMO is assessed on 19 conventional benchmarks and the IEEE Congress of Evolutionary Computation Benchmark Test Functions (CECC06, 2019 Competition). In most cases, IBMO outputs are better than comparison algorithms. However, in other circumstances, the outcomes are comparable.
{"title":"Improved Barnacle Mating Optimizer-Based Least Square Support Vector Machine to Predict COVID-19 Confirmed Cases with Total Vaccination","authors":"Marzia Ahmed, M. Sulaiman, A. Mohamad","doi":"10.2478/cait-2023-0007","DOIUrl":"https://doi.org/10.2478/cait-2023-0007","url":null,"abstract":"Abstract Every country must have an accurate and efficient forecasting model to avoid and manage the epidemic. This paper suggests an upgrade to one of the evolutionary algorithms inspired by nature, the Barnacle Mating Optimizer (BMO). First, the exploration phase of the original BMO is enhanced by enforcing and replacing the sperm cast equation through Levy flight. Then, the Least Square Support Vector Machine (LSSVM) is partnered with the improved BMO (IBMO). This hybrid approach, IBMO-LSSVM, has been deployed effectively for time-series forecasting to enhance the RBF kernel-based LSSVM model since vaccination started against COVID-19 in Malaysia. In comparison to other well-known algorithms, our outcomes are superior. In addition, the IBMO is assessed on 19 conventional benchmarks and the IEEE Congress of Evolutionary Computation Benchmark Test Functions (CECC06, 2019 Competition). In most cases, IBMO outputs are better than comparison algorithms. However, in other circumstances, the outcomes are comparable.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45161764","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}
Abstract From recent past, shoplifting has become a serious concern for business in both small/big shops and stores. It customarily involves the buyer concealing store items inside clothes/bags and then leaving the store without payment. Unfortunately, no cost-effective solution is available to overcome this problem. We, therefore intend to build an expert monitoring system to automatically recognize shoplifting events in megastores/shops by recognizing object-stealing actions of humans. The method proposed utilizes a deep convolutional-based InceptionV3 architecture to mine the prominent features from video clips. These features are used to custom Long Short Term Memory (LSTM) network to discriminate human stealing actions in video sequences. Optimizing recurrent learning classifier using different modeling parameters such as sequence length and batch size is a genuine contribution of this work. The experiments demonstrate that the system proposed has achieved an accuracy of 89.36% on the synthesized dataset, which comparatively outperforms other existing methods.
{"title":"Optimized Parameter Tuning in a Recurrent Learning Process for Shoplifting Activity Classification","authors":"Mohd. Aquib Ansari, D. Singh","doi":"10.2478/cait-2023-0008","DOIUrl":"https://doi.org/10.2478/cait-2023-0008","url":null,"abstract":"Abstract From recent past, shoplifting has become a serious concern for business in both small/big shops and stores. It customarily involves the buyer concealing store items inside clothes/bags and then leaving the store without payment. Unfortunately, no cost-effective solution is available to overcome this problem. We, therefore intend to build an expert monitoring system to automatically recognize shoplifting events in megastores/shops by recognizing object-stealing actions of humans. The method proposed utilizes a deep convolutional-based InceptionV3 architecture to mine the prominent features from video clips. These features are used to custom Long Short Term Memory (LSTM) network to discriminate human stealing actions in video sequences. Optimizing recurrent learning classifier using different modeling parameters such as sequence length and batch size is a genuine contribution of this work. The experiments demonstrate that the system proposed has achieved an accuracy of 89.36% on the synthesized dataset, which comparatively outperforms other existing methods.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47513298","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}
I. Hababeh, Issa M. Khalil, R. Al-Sayyed, Mahmoud Moshref, Samer Nofal, Ali Rodan
Abstract Clock synchronization in the Mac layer plays a vital role in wireless sensor network communication that maintains time-based channel sharing and offers a uniform timeframe among different network nodes. Most wireless sensor networks are distributed where no common clock exists among them. Therefore, joint actions are realized by exchanging messages, with time stamps using local sensor clocks. These clocks can easily drift seconds and cause functional problems to the applications that depend on time synchronization. Time synchronization is a major and challenging factor in wireless sensor networks that needs to be studied and explored. In this paper, we propose integrated time synchronization protocols that serve wireless sensor network applications under normal, secured, and unreliable environments. The proposed protocols are discussed and evaluated based on their accuracy, cost, hierarchy, reliability, and security. Simulation results show that the proposed time synchronization protocols outperform the state-of-the-art techniques in achieving a minimum synchronization time.
{"title":"Competent Time Synchronization Mac Protocols to Attain High Performance of Wireless Sensor Networks for Secure Communication","authors":"I. Hababeh, Issa M. Khalil, R. Al-Sayyed, Mahmoud Moshref, Samer Nofal, Ali Rodan","doi":"10.2478/cait-2023-0004","DOIUrl":"https://doi.org/10.2478/cait-2023-0004","url":null,"abstract":"Abstract Clock synchronization in the Mac layer plays a vital role in wireless sensor network communication that maintains time-based channel sharing and offers a uniform timeframe among different network nodes. Most wireless sensor networks are distributed where no common clock exists among them. Therefore, joint actions are realized by exchanging messages, with time stamps using local sensor clocks. These clocks can easily drift seconds and cause functional problems to the applications that depend on time synchronization. Time synchronization is a major and challenging factor in wireless sensor networks that needs to be studied and explored. In this paper, we propose integrated time synchronization protocols that serve wireless sensor network applications under normal, secured, and unreliable environments. The proposed protocols are discussed and evaluated based on their accuracy, cost, hierarchy, reliability, and security. Simulation results show that the proposed time synchronization protocols outperform the state-of-the-art techniques in achieving a minimum synchronization time.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43637514","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}
Abstract In recent days, resource allocation is considered to be a complex task in cloud systems. The heuristics models will allocate the resources efficiently in different machines. Then, the fitness function estimation plays a vital role in cloud load balancing, which is mainly used to minimize power consumption. The optimization technique is one of the most suitable options for solving load-balancing problems. This work mainly focuses on analyzing the impacts of using the Genetic Algorithm and Ant Colony Optimization (GAACO) technique for obtaining the optimal solution to efficiently balance the loads across the cloud systems. In addition to that, the GA and ACO are the kinds of object heuristic algorithms being proposed in the work to increase the number of servers that are operated with better energy efficiency. In this work, the main contribution of the GAACO algorithm is to reduce energy consumption, makespan time, response time, and degree of imbalance.
{"title":"An Energy-Aware QoS Load Balance Scheduling Using Hybrid GAACO Algorithm for Cloud","authors":"Arivumathi Ilankumaran, S. Narayanan","doi":"10.2478/cait-2023-0009","DOIUrl":"https://doi.org/10.2478/cait-2023-0009","url":null,"abstract":"Abstract In recent days, resource allocation is considered to be a complex task in cloud systems. The heuristics models will allocate the resources efficiently in different machines. Then, the fitness function estimation plays a vital role in cloud load balancing, which is mainly used to minimize power consumption. The optimization technique is one of the most suitable options for solving load-balancing problems. This work mainly focuses on analyzing the impacts of using the Genetic Algorithm and Ant Colony Optimization (GAACO) technique for obtaining the optimal solution to efficiently balance the loads across the cloud systems. In addition to that, the GA and ACO are the kinds of object heuristic algorithms being proposed in the work to increase the number of servers that are operated with better energy efficiency. In this work, the main contribution of the GAACO algorithm is to reduce energy consumption, makespan time, response time, and degree of imbalance.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49293564","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}
Abstract The Fog computing concept has been introduced to aid in the data processing of Internet of things applications using Cloud computing. Due to the profitable benefits of this combination, several papers have lately been published proposing the deployment of Blockchain alongside Fog computing in a variety of fields. A comprehensive evaluation and synthesis of the literature on Blockchain-Fog computing integration applications that have emerged in recent years is required. Although there have been several articles on the integration of Blockchain with Fog computing, the applications connected with this combination are still fragmented and require further exploration. Hence, in this paper, the applications of Blockchain-Fog computing integration are identified using a systematic literature review technique and tailored search criteria generated from the study objectives. This article found and evaluated 144 relevant papers. The findings of this article can be used as a resource for future Fog computing research and designs.
{"title":"Blockchain-Fog Computing Integration Applications: A Systematic Review","authors":"Y. Alzoubi, A. Aljaafreh","doi":"10.2478/cait-2023-0001","DOIUrl":"https://doi.org/10.2478/cait-2023-0001","url":null,"abstract":"Abstract The Fog computing concept has been introduced to aid in the data processing of Internet of things applications using Cloud computing. Due to the profitable benefits of this combination, several papers have lately been published proposing the deployment of Blockchain alongside Fog computing in a variety of fields. A comprehensive evaluation and synthesis of the literature on Blockchain-Fog computing integration applications that have emerged in recent years is required. Although there have been several articles on the integration of Blockchain with Fog computing, the applications connected with this combination are still fragmented and require further exploration. Hence, in this paper, the applications of Blockchain-Fog computing integration are identified using a systematic literature review technique and tailored search criteria generated from the study objectives. This article found and evaluated 144 relevant papers. The findings of this article can be used as a resource for future Fog computing research and designs.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42595598","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}
A. S. Yadav, Avjeet Singh, Ankit Vidyarthi, R. K. Barik, D. S. Kushwaha
Abstract MANET is an autonomous wireless network without any centralized authority, consisting of a dynamic topology with a multi-hop scenario. Clustering provides centralized authority within MANET and makes the network stable up to some extent. Security is one of the most challenging aspects, directly proportional to load and overhead over the network. The model being proposed uses a cluster-based technique and modified secure routing protocol, which minimizes the network’s load and overhead, improving the network’s security and performance. Two major factors are used as contribution level and stability factor for the choice of cluster head, which minimizes the method of re-selection for cluster head. The node addition using authentication and the Modified Secure Routing Protocol increases the security of the network. The Modified Secure Routing Protocol, based on limited and efficient use of the certificates with encryption and decryption of packets, minimizes the overhead and load over the network. Hence, it provides more efficiency and security.
{"title":"Performance of Optimized Security Overhead Using Clustering Technique Based on Fuzzy Logic for Mobile ad hoc Network","authors":"A. S. Yadav, Avjeet Singh, Ankit Vidyarthi, R. K. Barik, D. S. Kushwaha","doi":"10.2478/cait-2023-0005","DOIUrl":"https://doi.org/10.2478/cait-2023-0005","url":null,"abstract":"Abstract MANET is an autonomous wireless network without any centralized authority, consisting of a dynamic topology with a multi-hop scenario. Clustering provides centralized authority within MANET and makes the network stable up to some extent. Security is one of the most challenging aspects, directly proportional to load and overhead over the network. The model being proposed uses a cluster-based technique and modified secure routing protocol, which minimizes the network’s load and overhead, improving the network’s security and performance. Two major factors are used as contribution level and stability factor for the choice of cluster head, which minimizes the method of re-selection for cluster head. The node addition using authentication and the Modified Secure Routing Protocol increases the security of the network. The Modified Secure Routing Protocol, based on limited and efficient use of the certificates with encryption and decryption of packets, minimizes the overhead and load over the network. Hence, it provides more efficiency and security.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49406412","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}
Omar S. Gómez, Raúl H. Rosero, Juan C Estrada-Gutiérrez, M. Jiménez-Rodríguez
Abstract Nowadays the interoperability of web applications is carried out by the use of data exchange formats such as XML and JavaScript Object Notation (JSON). Due to its simplicity, JSON objects are the most common way for sending information over the HTTP protocol. With the aim of adding a security mechanism to JSON objects, in this work we propose an encryption approach for cipher JSON objects through the use of chaotic synchronization. Synchronization ability between two chaotic systems offers the possibility of securing information between two points. Our approach includes mechanisms for diffusing and confusing JSON objects (plaintext), which yields a proper ciphertext. Our approach can be applied as an alternative to the existing securing JSON approaches such as JSON Web Encryption (JWE).
{"title":"An Approach for Securing JSON Objects through Chaotic Synchronization","authors":"Omar S. Gómez, Raúl H. Rosero, Juan C Estrada-Gutiérrez, M. Jiménez-Rodríguez","doi":"10.2478/cait-2022-0037","DOIUrl":"https://doi.org/10.2478/cait-2022-0037","url":null,"abstract":"Abstract Nowadays the interoperability of web applications is carried out by the use of data exchange formats such as XML and JavaScript Object Notation (JSON). Due to its simplicity, JSON objects are the most common way for sending information over the HTTP protocol. With the aim of adding a security mechanism to JSON objects, in this work we propose an encryption approach for cipher JSON objects through the use of chaotic synchronization. Synchronization ability between two chaotic systems offers the possibility of securing information between two points. Our approach includes mechanisms for diffusing and confusing JSON objects (plaintext), which yields a proper ciphertext. Our approach can be applied as an alternative to the existing securing JSON approaches such as JSON Web Encryption (JWE).","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44092719","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}
Abstract The automated induction of inflection rules is an important research area for computational linguistics. In this paper, we present a novel morphological rule induction model called B-Morpher that can be used for both inflection analysis and morphological analysis. The core element of the engine is a modified Bayes classifier in which class categories correspond to general string transformation rules. Beside the core classification module, the engine contains a neural network module and verification unit to improve classification accuracy. For the evaluation, beside the large Hungarian dataset the tests include smaller non-Hungarian datasets from the SIGMORPHON shared task pools. Our evaluation shows that the efficiency of B-Morpher is comparable with the best results, and it outperforms the state-of-theart base models for some languages. The proposed system can be characterized by not only high accuracy, but also short training time and small knowledge base size.
{"title":"B-Morpher: Automated Learning of Morphological Language Characteristics for Inflection and Morphological Analysis","authors":"L. Kovács, G. Szabó","doi":"10.2478/cait-2022-0042","DOIUrl":"https://doi.org/10.2478/cait-2022-0042","url":null,"abstract":"Abstract The automated induction of inflection rules is an important research area for computational linguistics. In this paper, we present a novel morphological rule induction model called B-Morpher that can be used for both inflection analysis and morphological analysis. The core element of the engine is a modified Bayes classifier in which class categories correspond to general string transformation rules. Beside the core classification module, the engine contains a neural network module and verification unit to improve classification accuracy. For the evaluation, beside the large Hungarian dataset the tests include smaller non-Hungarian datasets from the SIGMORPHON shared task pools. Our evaluation shows that the efficiency of B-Morpher is comparable with the best results, and it outperforms the state-of-theart base models for some languages. The proposed system can be characterized by not only high accuracy, but also short training time and small knowledge base size.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48734682","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}
Abstract One of the challenges in Attribute-Based Access Control (ABAC) implementation is acquiring sufficient metadata against entities and attributes. Intelligent mining and extracting ABAC policies and attributes make ABAC implementation more feasible and cost-effective. This research paper focuses on attribute extraction from an existing enterprise relational database management system – RDBMS. The proposed approach tends to first classify entities according to some aspects of RDBMS systems. By reverse engineering, some metadata elements and ranking values are calculated for each part. Then entities and attributes are assigned a final rank that helps to decide what attribute subset is a candidate to be an optimal input for ABAC implementation. The proposed approach has been tested and implemented against an existing enterprise RDBMS, and the results are then evaluated. The approach enables the choice to trade-off between accuracy and overhead. The results score an accuracy of up to 80% with no overhead or 88% of accuracy with 65% overhead.
{"title":"A New Attribute-Based Access Control Model for RDBMS","authors":"J. Al-Saraireh, Majid Hassan","doi":"10.2478/cait-2022-0036","DOIUrl":"https://doi.org/10.2478/cait-2022-0036","url":null,"abstract":"Abstract One of the challenges in Attribute-Based Access Control (ABAC) implementation is acquiring sufficient metadata against entities and attributes. Intelligent mining and extracting ABAC policies and attributes make ABAC implementation more feasible and cost-effective. This research paper focuses on attribute extraction from an existing enterprise relational database management system – RDBMS. The proposed approach tends to first classify entities according to some aspects of RDBMS systems. By reverse engineering, some metadata elements and ranking values are calculated for each part. Then entities and attributes are assigned a final rank that helps to decide what attribute subset is a candidate to be an optimal input for ABAC implementation. The proposed approach has been tested and implemented against an existing enterprise RDBMS, and the results are then evaluated. The approach enables the choice to trade-off between accuracy and overhead. The results score an accuracy of up to 80% with no overhead or 88% of accuracy with 65% overhead.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43562175","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
扫码关注我们
求助内容：
应助结果提醒方式：