Abstract Wireless Sensor Networks (WSN) have drawn the attention of many researchers as well as general users in recent years. Since WSN has a wide range of applications, including environmental monitoring, medical applications, and surveillance, their usage is not limited. As energy is a major constraint in WSN, it is necessary to employ techniques that reduce energy consumption in order to extend the network’s lifetime. Clustering, data aggregation, duty cycling, load balancing, and efficient routing are some of the techniques used to reduce energy consumption. In this paper, we discuss in details about clustering, its properties, the existing clustering protocols. The clustering protocols that support data aggregation will also be discussed. The paper concludes with considering the impact of clustering and data aggregation in WSN.
{"title":"An Insight on Clustering Protocols in Wireless Sensor Networks","authors":"M. Raju, K. P. Lochanambal","doi":"10.2478/cait-2022-0017","DOIUrl":"https://doi.org/10.2478/cait-2022-0017","url":null,"abstract":"Abstract Wireless Sensor Networks (WSN) have drawn the attention of many researchers as well as general users in recent years. Since WSN has a wide range of applications, including environmental monitoring, medical applications, and surveillance, their usage is not limited. As energy is a major constraint in WSN, it is necessary to employ techniques that reduce energy consumption in order to extend the network’s lifetime. Clustering, data aggregation, duty cycling, load balancing, and efficient routing are some of the techniques used to reduce energy consumption. In this paper, we discuss in details about clustering, its properties, the existing clustering protocols. The clustering protocols that support data aggregation will also be discussed. The paper concludes with considering the impact of clustering and data aggregation in WSN.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45368926","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 Intensive research is currently being carried out to develop and create quantum computers and their software. This work is devoted to study of the influence of the environment on the quantum system of qubits. Quantum error correction is a set of methods for protecting quantum information and quantum state from unwanted interactions of the environment (decoherence) and other forms and types of noise. The article discusses the solution to the problem of research and development of corrective codes for rectifying several types of quantum errors that occur during computational processes in quantum algorithms and models of quantum computing devices. The aim of the work is to study existing methods for correcting various types of quantum errors and to create a corrective code for quantum error rectification. The scientific novelty is expressed in the exclusion of one of the shortcomings of the quantum computing process.
{"title":"Development of a Scheme for Correcting Arbitrary Errors and Averaging Noise in Quantum Computing","authors":"S. Gushanskiy, M. Polenov, V. Potapov","doi":"10.2478/cait-2022-0014","DOIUrl":"https://doi.org/10.2478/cait-2022-0014","url":null,"abstract":"Abstract Intensive research is currently being carried out to develop and create quantum computers and their software. This work is devoted to study of the influence of the environment on the quantum system of qubits. Quantum error correction is a set of methods for protecting quantum information and quantum state from unwanted interactions of the environment (decoherence) and other forms and types of noise. The article discusses the solution to the problem of research and development of corrective codes for rectifying several types of quantum errors that occur during computational processes in quantum algorithms and models of quantum computing devices. The aim of the work is to study existing methods for correcting various types of quantum errors and to create a corrective code for quantum error rectification. The scientific novelty is expressed in the exclusion of one of the shortcomings of the quantum computing process.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48924631","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 Honeyword system is a successful password cracking detection system. Simply the honeywords are (False passwords) that are accompanied to the sugarword (Real password). Honeyword system aims to improve the security of hashed passwords by facilitating the detection of password cracking. The password database will have many honeywords for every user in the system. If the adversary uses a honeyword for login, a silent alert will indicate that the password database might be compromised. All previous studies present a few remarks on honeyword generation methods for max two preceding methods only. So, the need for one that lists all preceding researches with their weaknesses is shown. This work presents all generation methods then lists the strengths and weaknesses of 26 ones. In addition, it puts 32 remarks that highlight their strengths and weaknesses points. This research has proved that every honeyword generation method has many weaknesses points.
{"title":"A Scrutiny of Honeyword Generation Methods: Remarks on Strengths and Weaknesses Points","authors":"Yasser A. Yasser, A. Sadiq, Wasim Alhamdani","doi":"10.2478/cait-2022-0013","DOIUrl":"https://doi.org/10.2478/cait-2022-0013","url":null,"abstract":"Abstract Honeyword system is a successful password cracking detection system. Simply the honeywords are (False passwords) that are accompanied to the sugarword (Real password). Honeyword system aims to improve the security of hashed passwords by facilitating the detection of password cracking. The password database will have many honeywords for every user in the system. If the adversary uses a honeyword for login, a silent alert will indicate that the password database might be compromised. All previous studies present a few remarks on honeyword generation methods for max two preceding methods only. So, the need for one that lists all preceding researches with their weaknesses is shown. This work presents all generation methods then lists the strengths and weaknesses of 26 ones. In addition, it puts 32 remarks that highlight their strengths and weaknesses points. This research has proved that every honeyword generation method has many weaknesses points.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45192389","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 an advanced and dynamic cyber threat environment, organizations need to yield more proactive methods to handle their cyber defenses. Cyber threat data known as Cyber Threat Intelligence (CTI) of previous incidents plays an important role by helping security analysts understand recent cyber threats and their mitigations. The mass of CTI is exponentially increasing, most of the content is textual which makes it difficult to analyze. The current CTI visualization tools do not provide effective visualizations. To address this issue, an exploratory data analysis of CTI reports is performed to dig-out and visualize interesting patterns of cyber threats which help security analysts to proactively mitigate vulnerabilities and timely predict cyber threats in their networks.
{"title":"Visualizing Interesting Patterns in Cyber Threat Intelligence Using Machine Learning Techniques","authors":"Sarwat Ejaz, Umara Noor, Zahid Rashid","doi":"10.2478/cait-2022-0019","DOIUrl":"https://doi.org/10.2478/cait-2022-0019","url":null,"abstract":"Abstract In an advanced and dynamic cyber threat environment, organizations need to yield more proactive methods to handle their cyber defenses. Cyber threat data known as Cyber Threat Intelligence (CTI) of previous incidents plays an important role by helping security analysts understand recent cyber threats and their mitigations. The mass of CTI is exponentially increasing, most of the content is textual which makes it difficult to analyze. The current CTI visualization tools do not provide effective visualizations. To address this issue, an exploratory data analysis of CTI reports is performed to dig-out and visualize interesting patterns of cyber threats which help security analysts to proactively mitigate vulnerabilities and timely predict cyber threats in their networks.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45645482","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}
Supriadi Rustad, Ignatius Moses Setiadi de Rosal, P. Andono, Abdul Syukur, Purwanto
Abstract The existence of a trade-off between embedding capacity and imperceptibility is a challenge to improve the quality of steganographic images. This research proposes to cross diagonal embedding Pixel Value Differencing (PVD) and Modulus Function (MF) techniques using edge area patterns to improve embedding capacity and imperceptibility simultaneously. At the same time still, maintain a good quality of security. By implementing them into 14 public datasets, the proposed techniques are proven to increase both capacity and imperceptibility. The cross diagonal embedding PVD is responsible for increasing the embedding capacity reaching an average value of 3.18 bits per pixel (bpp), and at the same time, the implementation of edge area block patterns-based embedding is a solution of improving imperceptibility toward an average value of PSNR above 40 dB and that of SSIM above 0.98. Aside from its success in increasing the embedding capacity and the imperceptibility, the proposed techniques remain resistant to RS attacks.
{"title":"Optimization of Cross Diagonal Pixel Value Differencing and Modulus Function Steganography Using Edge Area Block Patterns","authors":"Supriadi Rustad, Ignatius Moses Setiadi de Rosal, P. Andono, Abdul Syukur, Purwanto","doi":"10.2478/cait-2022-0022","DOIUrl":"https://doi.org/10.2478/cait-2022-0022","url":null,"abstract":"Abstract The existence of a trade-off between embedding capacity and imperceptibility is a challenge to improve the quality of steganographic images. This research proposes to cross diagonal embedding Pixel Value Differencing (PVD) and Modulus Function (MF) techniques using edge area patterns to improve embedding capacity and imperceptibility simultaneously. At the same time still, maintain a good quality of security. By implementing them into 14 public datasets, the proposed techniques are proven to increase both capacity and imperceptibility. The cross diagonal embedding PVD is responsible for increasing the embedding capacity reaching an average value of 3.18 bits per pixel (bpp), and at the same time, the implementation of edge area block patterns-based embedding is a solution of improving imperceptibility toward an average value of PSNR above 40 dB and that of SSIM above 0.98. Aside from its success in increasing the embedding capacity and the imperceptibility, the proposed techniques remain resistant to RS attacks.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47286665","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 article describes a string recognition approach, engraved in the parsers generated by Tunnel Grammar Studio that use the tunnel parsing algorithm, of how a lexer and a parser can operate on the input during its recognition. Proposed is an addition of the augmented Backus-Naur form syntax that enables the formal language to be expressed with a parser grammar and optionally with an additional lexer grammar. The tokens outputted from the lexer are matched to the phrases in the parser grammar by their name and optionally by their lexeme, case sensitively or insensitively.
{"title":"Tunnel Parsing with the Token’s Lexeme","authors":"Nikolay Handzhiyski, E. Somova","doi":"10.2478/cait-2022-0021","DOIUrl":"https://doi.org/10.2478/cait-2022-0021","url":null,"abstract":"Abstract The article describes a string recognition approach, engraved in the parsers generated by Tunnel Grammar Studio that use the tunnel parsing algorithm, of how a lexer and a parser can operate on the input during its recognition. Proposed is an addition of the augmented Backus-Naur form syntax that enables the formal language to be expressed with a parser grammar and optionally with an additional lexer grammar. The tokens outputted from the lexer are matched to the phrases in the parser grammar by their name and optionally by their lexeme, case sensitively or insensitively.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43241686","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}
Nova Rijati, Diana Purwitasar, S. Sumpeno, M. Purnomo
Abstract The ability to identify the entrepreneurial potential of students enables higher education institutions to contribute to the economic and social development of a country. Current research trends regarding the detection of student entrepreneurial potential have the greatest challenge in the unequal ratio of datasets. This study proposes a rule-generation model in an imbalanced situation to classify student entrepreneurship based on the Theory of Planned Behavior (TPB). The result is a ruleset that is used for the early detection of student entrepreneurial potential. The proposed method consists of three main stages, namely preprocessing data to classify data based on TPB variables, generating a dataset by clustering and selecting attributes by sampling to balance the data, and finally generating a ruleset. Furthermore, the results of the detecting ruleset have been evaluated with actual data from the student tracer study as ground truth. The evaluation results show high accuracy so that the ruleset can be applied to the higher education environment in the future.
{"title":"A Rule-Generation Model for Class Imbalances to Detect Student Entrepreneurship Based on the Theory of Planned Behavior","authors":"Nova Rijati, Diana Purwitasar, S. Sumpeno, M. Purnomo","doi":"10.2478/cait-2022-0023","DOIUrl":"https://doi.org/10.2478/cait-2022-0023","url":null,"abstract":"Abstract The ability to identify the entrepreneurial potential of students enables higher education institutions to contribute to the economic and social development of a country. Current research trends regarding the detection of student entrepreneurial potential have the greatest challenge in the unequal ratio of datasets. This study proposes a rule-generation model in an imbalanced situation to classify student entrepreneurship based on the Theory of Planned Behavior (TPB). The result is a ruleset that is used for the early detection of student entrepreneurial potential. The proposed method consists of three main stages, namely preprocessing data to classify data based on TPB variables, generating a dataset by clustering and selecting attributes by sampling to balance the data, and finally generating a ruleset. Furthermore, the results of the detecting ruleset have been evaluated with actual data from the student tracer study as ground truth. The evaluation results show high accuracy so that the ruleset can be applied to the higher education environment in the future.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43302128","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 the present study, an extended classification of Internet users penetrating in computer networks and a definition of the motivation as a psychological and emotional state and main prerequisites for modelling of network intruder’s activity are suggested. A mathematical model as a quadratic function of malicious individual’s behavior and impact on the computer network based on three quantified factors, motivation, satisfaction and system protection is developed. Numerical simulation experiments of the unauthorized access and its effect onto the computer network are carried out. The obtained results are graphically illustrated and discussed.
{"title":"Modelling Activity of a Malicious User in Computer Networks","authors":"Andon Lazarov, P. Petrova","doi":"10.2478/cait-2022-0018","DOIUrl":"https://doi.org/10.2478/cait-2022-0018","url":null,"abstract":"Abstract In the present study, an extended classification of Internet users penetrating in computer networks and a definition of the motivation as a psychological and emotional state and main prerequisites for modelling of network intruder’s activity are suggested. A mathematical model as a quadratic function of malicious individual’s behavior and impact on the computer network based on three quantified factors, motivation, satisfaction and system protection is developed. Numerical simulation experiments of the unauthorized access and its effect onto the computer network are carried out. The obtained results are graphically illustrated and discussed.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47618475","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}
Orieb Abualghanam, Omar Y. Adwan, Mohammad A. Al Shariah, Mohammad Qatawneh
Abstract Learning Vector Quantization (LVQ) is one of the most widely used classification approaches. LVQ faces a problem as when the size of data grows large it becomes slower. In this paper, a modified version of LVQ, which is called PDLVQ is proposed to accelerate the traditional version. The proposed scheme aims to avoid unnecessary computations by applying an efficient Partial Distance (PD) computation strategy. Three different benchmark datasets are used in the experiments. The comparisons have been done between LVQ and PDLVQ in terms of runtime and in result, it turns out that PDLVQ shows better efficiency than LVQ. PDLVQ has achieved up to 37% efficiency in runtime compared to LVQ when the dimensions have increased. Also, the enhanced algorithm (PDLVQ) shows clear enhancement to decrease runtime when the size of dimensions, the number of clusters, or the size of data becomes increased compared with the traditional one which is LVQ.
{"title":"Enhancing the Speed of the Learning Vector Quantization (LVQ) Algorithm by Adding Partial Distance Computation","authors":"Orieb Abualghanam, Omar Y. Adwan, Mohammad A. Al Shariah, Mohammad Qatawneh","doi":"10.2478/cait-2022-0015","DOIUrl":"https://doi.org/10.2478/cait-2022-0015","url":null,"abstract":"Abstract Learning Vector Quantization (LVQ) is one of the most widely used classification approaches. LVQ faces a problem as when the size of data grows large it becomes slower. In this paper, a modified version of LVQ, which is called PDLVQ is proposed to accelerate the traditional version. The proposed scheme aims to avoid unnecessary computations by applying an efficient Partial Distance (PD) computation strategy. Three different benchmark datasets are used in the experiments. The comparisons have been done between LVQ and PDLVQ in terms of runtime and in result, it turns out that PDLVQ shows better efficiency than LVQ. PDLVQ has achieved up to 37% efficiency in runtime compared to LVQ when the dimensions have increased. Also, the enhanced algorithm (PDLVQ) shows clear enhancement to decrease runtime when the size of dimensions, the number of clusters, or the size of data becomes increased compared with the traditional one which is LVQ.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43521017","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 Predicting human mobility between locations plays an important role in a wide range of applications and services such as transportation, economics, sociology and other fields. Mobility prediction can be implemented through various machine learning algorithms that can predict the future trajectory of a user relying on the current trajectory and time, learning from historical sequences of locations previously visited by the user. But, it is not easy to capture complex patterns from the long historical sequences of locations. Inspired by the methods of the Convolutional Neural Network (CNN), we propose an augmented Union ConvAttention-LSTM (UCAL) model. The UCAL consists of the 1D CNN that allows capturing locations from historical trajectories and the augmented proposed model that contains an Attention technique with a Long Short-Term Memory (LSTM) in order to capture patterns from current trajectories. The experimental results prove the effectiveness of our proposed methodology that outperforms the existing models.
{"title":"An Augmented UCAL Model for Predicting Trajectory and Location","authors":"Nesrine Kadri, A. Ellouze, S. Turki, M. Ksantini","doi":"10.2478/cait-2022-0020","DOIUrl":"https://doi.org/10.2478/cait-2022-0020","url":null,"abstract":"Abstract Predicting human mobility between locations plays an important role in a wide range of applications and services such as transportation, economics, sociology and other fields. Mobility prediction can be implemented through various machine learning algorithms that can predict the future trajectory of a user relying on the current trajectory and time, learning from historical sequences of locations previously visited by the user. But, it is not easy to capture complex patterns from the long historical sequences of locations. Inspired by the methods of the Convolutional Neural Network (CNN), we propose an augmented Union ConvAttention-LSTM (UCAL) model. The UCAL consists of the 1D CNN that allows capturing locations from historical trajectories and the augmented proposed model that contains an Attention technique with a Long Short-Term Memory (LSTM) in order to capture patterns from current trajectories. The experimental results prove the effectiveness of our proposed methodology that outperforms the existing models.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45741148","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
扫码关注我们
求助内容：
应助结果提醒方式：