Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional...Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.展开更多
Election allows the voter of a country to select the most suitable group of candidates to run the government.Election in Pakistan is simply paper-based method but some certain political and socio-economic issues turn ...Election allows the voter of a country to select the most suitable group of candidates to run the government.Election in Pakistan is simply paper-based method but some certain political and socio-economic issues turn that simple process in complicated and disputes once.Solutions of such problems are consisting of many methods including the e-voting system.The e-voting system facilitates the voters to cast their votes by electronic means with very easy and convenient way.This also allows maintaining the security and secrecy of the voter along with election process.Electronic voting reduces the human-involvement throughout the process from start to the end.Such system is not established yet in Pakistan.Hence,every election is disputed always.In this paper we proposed the framework of an e-voting system and simulation with the use of blockchain ledger technology.The proposed framework owns the capacity to deal with ballots in Pakistan.The novelty of the framework is that the e-voting system is linked to National Database and Registration Authority(NADRA)database which assures voter’s validation.The fundamental requirements were kept in consideration during the performance evaluation of the system.The results are processed and depicted specially with reference to the number of voters and voting stations,real time of vote casting,network bandwidth and controlling principles.The results support the decision makers and guide them in the foundation and customization of an e-voting system in Pakistan.展开更多
Voting is a general and indispensable method, and widely used to express a choice or preference, to elect a person, or to choose an opinion by ballot in education, enterprise, medicine, and government.?Until now, vari...Voting is a general and indispensable method, and widely used to express a choice or preference, to elect a person, or to choose an opinion by ballot in education, enterprise, medicine, and government.?Until now, various E-voting schemes are proposed in the world but they are different from each other. There is no system that can provide users with E-voting services anytime and anywhere such that one can use E-voting servers without even thinking about them.?Therefore, an E-voting system for general-purpose is demanded. To support any kinds of vote, we divide voting system into components, and make different assembly of those components for different kinds of voting.展开更多
E-voting (electronic voting) is a significant part of an E-election (electronic election), which refers to the use of computers or computerized voting equipment to cast ballots in an election. Due to the rapid growth ...E-voting (electronic voting) is a significant part of an E-election (electronic election), which refers to the use of computers or computerized voting equipment to cast ballots in an election. Due to the rapid growth of computer technologies and advances in cryptographic techniques, E-voting is now an applicable alternative for many non-governmental elections. However, security demands are paramount to electoral process in political arena. It was revealed that researchers show little interest in robustness of E-voting system compared to other E-voting requirements [1]. This paper shows that RSA (Ron Rivest, Adi Shamir and Leonard Adleman) cryptography algorithm can be incorporated into E-voting process as a whole. The RSA cryptography algorithm ensures that votes casted are secured, thus maintaining the privacy of votes. The performance of the cryptography algorithm is tested on a university E-voting system over a public network. The E-voting process is initiated by a server system that other computer nodes are connected to. The system is such that when the votes are cast on the nodes, the RSA technique encrypts the vote that is sent to the server system using both node and vote identity number. The system performs consistently and reliably which in return gives good level of confidence of votes count.展开更多
With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election processes.During pandemic situations,citizens tend to develop panic about ...With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election processes.During pandemic situations,citizens tend to develop panic about mass gatherings,which may influence the decrease in the number of votes.This urges a reliable,flexible,transparent,secure,and cost-effective voting system.The proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system,and it is carried out in three phases:the registration phase,vote casting phase and vote counting phase.A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting phases.Using smart contracts,third-party interventions are eliminated,and the transactions are secured in the blockchain network.Finally,to provide accurate voting results,the practical Byzantine fault tolerance(PBFT)consensus mechanism is adopted to ensure that the vote has not been modified or corrupted.Hence,the overall performance of the proposed system is significantly better than that of the existing system.Further performance was analyzed based on authentication delay,vote alteration,response time,and latency.展开更多
Advanced Metering Infrastructure(AMI)is the metering network of the smart grid that enables bidirectional communications between each consumer’s premises and the provider’s control center.The massive amount of data ...Advanced Metering Infrastructure(AMI)is the metering network of the smart grid that enables bidirectional communications between each consumer’s premises and the provider’s control center.The massive amount of data collected supports the real-time decision-making required for diverse applications.The communication infrastructure relies on different network types,including the Internet.This makes the infrastructure vulnerable to various attacks,which could compromise security or have devastating effects.However,traditional machine learning solutions cannot adapt to the increasing complexity and diversity of attacks.The objective of this paper is to develop an Anomaly Detection System(ADS)based on deep learning using the CIC-IDS2017 dataset.However,this dataset is highly imbalanced;thus,a two-step sampling technique:random under-sampling and the Synthetic Minority Oversampling Technique(SMOTE),is proposed to balance the dataset.The proposed system utilizes a multiple hidden layer Auto-encoder(AE)for feature extraction and dimensional reduction.In addition,an ensemble voting based on both Random Forest(RF)and Convolu-tional Neural Network(CNN)is developed to classify the multiclass attack cate-gories.The proposed system is evaluated and compared with six different state-of-the-art machine learning and deep learning algorithms:Random Forest(RF),Light Gradient Boosting Machine(LightGBM),eXtreme Gradient Boosting(XGboost),Convolutional Neural Network(CNN),Long Short-Term Memory(LSTM),and bidirectional LSTM(biLSTM).Experimental results show that the proposed model enhances the detection for each attack class compared with the other machine learning and deep learning models with overall accuracy(98.29%),precision(99%),recall(98%),F_(1) score(98%),and the UNDetection rate(UND)(8%).展开更多
Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle...Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.展开更多
Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most exi...Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.展开更多
Managing physical objects in the network’s periphery is made possible by the Internet of Things(IoT),revolutionizing human life.Open attacks and unauthorized access are possible with these IoT devices,which exchange ...Managing physical objects in the network’s periphery is made possible by the Internet of Things(IoT),revolutionizing human life.Open attacks and unauthorized access are possible with these IoT devices,which exchange data to enable remote access.These attacks are often detected using intrusion detection methodologies,although these systems’effectiveness and accuracy are subpar.This paper proposes a new voting classifier composed of an ensemble of machine learning models trained and optimized using metaheuristic optimization.The employed metaheuristic optimizer is a new version of the whale optimization algorithm(WOA),which is guided by the dipper throated optimizer(DTO)to improve the exploration process of the traditionalWOA optimizer.The proposed voting classifier categorizes the network intrusions robustly and efficiently.To assess the proposed approach,a dataset created from IoT devices is employed to record the efficiency of the proposed algorithm for binary attack categorization.The dataset records are balanced using the locality-sensitive hashing(LSH)and Synthetic Minority Oversampling Technique(SMOTE).The evaluation of the achieved results is performed in terms of statistical analysis and visual plots to prove the proposed approach’s effectiveness,stability,and significance.The achieved results confirmed the superiority of the proposed algorithm for the task of network intrusion detection.展开更多
基金National Natural Science Foundation of China Nos.61962054 and 62372353.
文摘Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.
文摘Election allows the voter of a country to select the most suitable group of candidates to run the government.Election in Pakistan is simply paper-based method but some certain political and socio-economic issues turn that simple process in complicated and disputes once.Solutions of such problems are consisting of many methods including the e-voting system.The e-voting system facilitates the voters to cast their votes by electronic means with very easy and convenient way.This also allows maintaining the security and secrecy of the voter along with election process.Electronic voting reduces the human-involvement throughout the process from start to the end.Such system is not established yet in Pakistan.Hence,every election is disputed always.In this paper we proposed the framework of an e-voting system and simulation with the use of blockchain ledger technology.The proposed framework owns the capacity to deal with ballots in Pakistan.The novelty of the framework is that the e-voting system is linked to National Database and Registration Authority(NADRA)database which assures voter’s validation.The fundamental requirements were kept in consideration during the performance evaluation of the system.The results are processed and depicted specially with reference to the number of voters and voting stations,real time of vote casting,network bandwidth and controlling principles.The results support the decision makers and guide them in the foundation and customization of an e-voting system in Pakistan.
文摘Voting is a general and indispensable method, and widely used to express a choice or preference, to elect a person, or to choose an opinion by ballot in education, enterprise, medicine, and government.?Until now, various E-voting schemes are proposed in the world but they are different from each other. There is no system that can provide users with E-voting services anytime and anywhere such that one can use E-voting servers without even thinking about them.?Therefore, an E-voting system for general-purpose is demanded. To support any kinds of vote, we divide voting system into components, and make different assembly of those components for different kinds of voting.
文摘E-voting (electronic voting) is a significant part of an E-election (electronic election), which refers to the use of computers or computerized voting equipment to cast ballots in an election. Due to the rapid growth of computer technologies and advances in cryptographic techniques, E-voting is now an applicable alternative for many non-governmental elections. However, security demands are paramount to electoral process in political arena. It was revealed that researchers show little interest in robustness of E-voting system compared to other E-voting requirements [1]. This paper shows that RSA (Ron Rivest, Adi Shamir and Leonard Adleman) cryptography algorithm can be incorporated into E-voting process as a whole. The RSA cryptography algorithm ensures that votes casted are secured, thus maintaining the privacy of votes. The performance of the cryptography algorithm is tested on a university E-voting system over a public network. The E-voting process is initiated by a server system that other computer nodes are connected to. The system is such that when the votes are cast on the nodes, the RSA technique encrypts the vote that is sent to the server system using both node and vote identity number. The system performs consistently and reliably which in return gives good level of confidence of votes count.
文摘With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election processes.During pandemic situations,citizens tend to develop panic about mass gatherings,which may influence the decrease in the number of votes.This urges a reliable,flexible,transparent,secure,and cost-effective voting system.The proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system,and it is carried out in three phases:the registration phase,vote casting phase and vote counting phase.A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting phases.Using smart contracts,third-party interventions are eliminated,and the transactions are secured in the blockchain network.Finally,to provide accurate voting results,the practical Byzantine fault tolerance(PBFT)consensus mechanism is adopted to ensure that the vote has not been modified or corrupted.Hence,the overall performance of the proposed system is significantly better than that of the existing system.Further performance was analyzed based on authentication delay,vote alteration,response time,and latency.
文摘Advanced Metering Infrastructure(AMI)is the metering network of the smart grid that enables bidirectional communications between each consumer’s premises and the provider’s control center.The massive amount of data collected supports the real-time decision-making required for diverse applications.The communication infrastructure relies on different network types,including the Internet.This makes the infrastructure vulnerable to various attacks,which could compromise security or have devastating effects.However,traditional machine learning solutions cannot adapt to the increasing complexity and diversity of attacks.The objective of this paper is to develop an Anomaly Detection System(ADS)based on deep learning using the CIC-IDS2017 dataset.However,this dataset is highly imbalanced;thus,a two-step sampling technique:random under-sampling and the Synthetic Minority Oversampling Technique(SMOTE),is proposed to balance the dataset.The proposed system utilizes a multiple hidden layer Auto-encoder(AE)for feature extraction and dimensional reduction.In addition,an ensemble voting based on both Random Forest(RF)and Convolu-tional Neural Network(CNN)is developed to classify the multiclass attack cate-gories.The proposed system is evaluated and compared with six different state-of-the-art machine learning and deep learning algorithms:Random Forest(RF),Light Gradient Boosting Machine(LightGBM),eXtreme Gradient Boosting(XGboost),Convolutional Neural Network(CNN),Long Short-Term Memory(LSTM),and bidirectional LSTM(biLSTM).Experimental results show that the proposed model enhances the detection for each attack class compared with the other machine learning and deep learning models with overall accuracy(98.29%),precision(99%),recall(98%),F_(1) score(98%),and the UNDetection rate(UND)(8%).
基金supported by the Tang Scholar Project of Soochow Universitythe National Natural Science Foundation of China(Grant No.61873162)+1 种基金the Fund from Jiangsu Engineering Research Center of Novel Optical Fiber Technology and Communication NetworkSuzhou Key Laboratory of Advanced Optical Communication Network Technology。
文摘Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.
基金supported by the Fundamental Research Funds for the Universities of Heilongjiang(Nos.145109217,135509234)the Youth Science and Technology Innovation Personnel Training Project of Heilongjiang(No.UNPYSCT-2020072)the Innovative Research Projects for Postgraduates of Qiqihar University(No.YJSCX2022048).
文摘Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.
文摘Managing physical objects in the network’s periphery is made possible by the Internet of Things(IoT),revolutionizing human life.Open attacks and unauthorized access are possible with these IoT devices,which exchange data to enable remote access.These attacks are often detected using intrusion detection methodologies,although these systems’effectiveness and accuracy are subpar.This paper proposes a new voting classifier composed of an ensemble of machine learning models trained and optimized using metaheuristic optimization.The employed metaheuristic optimizer is a new version of the whale optimization algorithm(WOA),which is guided by the dipper throated optimizer(DTO)to improve the exploration process of the traditionalWOA optimizer.The proposed voting classifier categorizes the network intrusions robustly and efficiently.To assess the proposed approach,a dataset created from IoT devices is employed to record the efficiency of the proposed algorithm for binary attack categorization.The dataset records are balanced using the locality-sensitive hashing(LSH)and Synthetic Minority Oversampling Technique(SMOTE).The evaluation of the achieved results is performed in terms of statistical analysis and visual plots to prove the proposed approach’s effectiveness,stability,and significance.The achieved results confirmed the superiority of the proposed algorithm for the task of network intrusion detection.