Bugs in or manipulations of an e-voting system can have considerable influence on society . Therefore , e-voting systems are an obvious target for software verification . This case study proves the preservation of privacy of votes for a basic electronic voting system . The aim of the present study was to examine voters ' perception of e-voting system in India . Here , e-voting system refers to an online voting anywhere in the country by voters in public elections . The goals of an e-voting system is to increase voter participation and relieve congestion at polling stations on election day . For example multiple voters , invalid voter data , broken ballots and so forth . One solution to solve the problems in conventional electoral systems is to apply electronic voting ( e-voting ) . Various research and development carried out in order to build a secure e-voting system . In this paper , we investigate a fully decentralized electronic voting scheme based on a privacy-preserving sum protocol without an authenticated channel . Our solution not only satisfies the most essential requirements for an e-voting scheme but also is convenient since it can be directly implemented on the public network without installing any cryptographic tool . In addition , the experimental results show that the total voting time of our scheme is approximately 20 % faster than that of the typical voting protocols With the receipt , voter can verify whether the content of vote meets his aspiration or not , but he can not prove to others whom he has vote . The improved e-voting scheme based on verifiable random number that is fair , verifiable , and untraceable can efficiently prevent from colluding and buying vote . Doubleblind IBE schemes , which are extensions of blind IBE schemes , allow a user to construct an identity string that is partially obscured from the KGC , while also facilitating the KGC adding elements to the identity string which are obscured from the user . Using DB-IBE , we present an e-voting scheme with desirable features such as universal verifiability , voter verifiability and receipt-freeness . The better algorithm , Guo-Hall ’s was recommended for implementation on e-voting systems . Guo-Hall ’s algorithm is very effective and has the capacity to curb electoral fraud when adopted in e-voting process . The integrity and image of such applications wo n’t be maintained unless strict measures on security and authenticity are applied . This chapter explores the e-voting process , reviews the authentication techniques and methods that are used in this process and proposed in the literature , and demonstrates few cases of applying e-voting systems from different countries in the world . Conclusions and proposed future work are stated at the end of the chapter . Recently developed blockchain technology may be a solution to these issues . The paper describes the use of intelligent agents and multi-agent system concept for Auditable Blockchain Voting System ( ABVS ) , which integrates e-voting process with blockchain technology into one supervised non-remote internet voting system which is end-to-end verifiable . However , considering the security problems that can occur using the underlying technologies , it is difficult to construct an impenetrable system . This chapter presents e-Vote , a distributed electronic voting system architecture that is designed to ensure the accuracy , privacy , verifiability , convenience , and the openness of the democracy of a large-scale electoral process . We describe the necessary requirements for the e-voting protocol , and propose a cryptographic voting scheme that achieves them . The PriS conceptual framework . Purpose – To present a new methodology for incorporating privacy requirements into the system design process called PriS , and describe its applicability in the e‐VOTE system for presenting methodology 's way‐of‐working . Design/methodology/approach – PriS is a requirement engineering methodology focused on privacy issues . A device and a method for performing an e-vote using a mobile terminal are provided to identify a voter with a certificate without making the voter report the e-vote previously when the voter casts a ballot with a mobile terminal of the voter , and guarantee secrecy of the e-vote by encoding voting contents of the voter and deleting a user ID of a mobile terminal user . A voter ID checker(310 ) authenticates a voter based on a certificate received from a mobile terminal(100 ) of the voter through the mobile network . A safe , reliable and effective e-voting system should satisfy four core requirements , such as democracy , anonymity , accuracy and verifiability . This paper researches on three typical e-voting system models , including Modi?ed EIGamal Model , Blind Signature Model and Secret Sharing Model , analyzes their methods and procedures of protecting a voter ’s privacy and a ballot ’s integrity , specifies how these three models meet with the core requirements and points out their relative merits respectively . In this paper , we present an imperceptible stegano-cryptographic model for securing generic security requirements of e-voting systems . The purpose is to model a secure e-electronic voting capable of delivering credible , fair and transparent future e-democratic decision making in developing countries like Nigeria . The model was implemented on our framework for secure e-voting using Java programming language and Oracle database management system . Election of Chairman STMIK Banjarbaru BEM can be overcome by utilizing Computer Science and Information Technology ( ICT ) that electronic voting ( e-voting ) or build an application of e-voting to carry out the selection head is that it takes time and place of voters ( students ) in the election can be balanced and can increase the number of voters . One way that is easy and efficient in the development of e-voting election is to use a client-server architecture and algorithms pesentase in the graph . From the research that has been done to implement the e-voting system , then the conclusion is obtained that can increase the number of voters , smoothed data management , reduce the risk of loss of voice , reducing the budget , as well as speeding up the counting . The results of this study tested the Network Local Area Network ( LAN ) , where several computers as a client computer and a computer unit as a data bank or as a server with a database that has been in sharingkan . With the BEM application program in STMIK Pontiaanak Based Desktop allows the user ( users ) the easier it is to perform the E-Voting election . Keyword : E-Voting , BEM STMIK Pontianak , RAD , Visual Basic 6 We have established the need to further explore the re-design of the electoral process and consider procedural security as primarily applicable to agent-related processes . In view of the increased complexity of the e-voting processes , which can involve multi-channel e-voting options , and the increase in the number of agents involved in the administration of e-elections , we relate procedural security to the need for transparent allocation of responsibilities among the different agents . In concluding we argue that existing procedural security should be enhanced , that there is a clear need for better monitoring of compliance to such procedures and that further security procedures need to be put in place at specific points in the e-election process . Even though e-voting systems have already been widely studied , there are still some situations not covered yet by classical bibliography , and then it becomes necessary to introduce interesting variations to the main schema . In this paper , we will present one of such occurrences ( that associated with e-cognocracy ) , and will study the modifications needed in the traditional e-voting processes as well as the implications they have . The paper contains a list of suggestions on ways how best to introduce ( remote ) e-voting . 1 Growing attention to e-voting E-Voting has been attracting considerable attention during the last years . This fact is based on the one hand upon interest and attention devoted to e-government , edemocracy , e-governance , etc . Proponents of Approval Voting argue that this electoral rule leads to more centrist outcomes compared to Plurality Voting . This claim has been substantiated by scholarly work using spatial models of political competition . In this paper , we propose a family of approval voting-schemes for electing committees based on the preferences of voters . In our schemes , we calculate the vector of distances of the possible committees from each of the ballots and , for a given $ p $ -norm , choose the one that minimizes the magnitude of the distance vector under that norm . It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small . Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta ( nlogn ) algorithms for both exact and inexact voting as well as for certain approval-voting schemes . An unordered input object space leads to worst-case Omega ( n/sup 2/ ) algorithms , even when a distance metric can be defined on the input object space . An increasing body of theoretical and empirical work on discrete choice considers a choice design in which a person is asked to select both the best and the worst alternative in an available set of alternatives , in contrast to more traditional tasks such as where the person is asked to : select the best alternative ; select the worst alternative ; rank the alternatives . Here we consider voting systems motivated by such “ best-worst ” choice ; relate them to approval and disapproval voting systems ; and characterize a “ best-worst ” voting system in terms of a set of axioms in the context of scoring rules . Several methods exist for electing committees of representatives and conducting multiple referenda based on approval voting . Recently , a family of rules for approval-based voting using ordered weighted averaging was proposed , ranging from a simple candidate-wise majority ( minisum ) to egalitarian rule ( minimax ) . Even though the first rule is strategyproof and the second is not , due to its egalitarian nature , only a partial study on manipulation has been conducted for inbetween rules . Groth presented some efficient non-interactive zero-knowledge ( NIZK ) arguments based on homomorphic integer commitments for voting . He investigated four types of e-voting schemes : limited vote , approval vote , divisible vote and Borda vote . Receipt-freeness means that a voter is unable to construct a receipt to convince others she has voted for a particular candidate . However , most available secure vote schemes mainly focused on the simple " one-man-one-vote " plurality protocol . In this paper , we address the security issues in Approval voting protocol , another important social decision protocol , in which voters can vote for , or approval of , as many candidates as they wish in multi-candidate elections . By employing several cryptographic primitives , such as , homomorphic encryption , mix network , etc . , we propose a voter-resolved secure Approval voting scheme over Internet which guarantees the complete privacy protection of the voters as well as the universal verifiability . For net approval and minisum approval voting rules , we provide a dichotomous result , resolving the parameterized complexity of this problem for all subsets of five natural parameters considered ( by showing either FPT or W[1]-hardness for all subsets of parameters ) . For the approval voting rule , we resolve the parameterized complexity of this problem for all subsets of parameters except one . We also study approximation algorithms for this problem . In many approval voting settings voters are a priori uncertain regarding their true preferences , yet can obtain this information if willing to incur some cost . This paper provides a comprehensive analysis of such model focusing in simultaneous and sequential voting . We compare the results with state-of-the-art pseudo relevance feedback based retrieval techniques . In quest of enhancing the results of pseudo relevance feedback approach , we introduce two term selection combination techniques namely Borda Count and Intersection . Surprisingly , combinational techniques performed worse than single term selection techniques . In the second model , many classifiers are fused to increase the recognition rate . In this method , two methods are used , namely , Borda count and majority voting . The results of this model ranged from 94.12 \ % to 96.08 \ % . For the upper bound of uncertainty ( upper ( right ) end of the α-cut level = 0.3 ) , a maximum reduction of 57 % was obtained . In applying FSC methods through the decision-making process , the Borda Counting method considered the preferences of all stakeholders best . Moreover , the proposed framework allows decision-makers to decide on the acceptability and reliability of the optimal management scenarios considering their preferences and uncertainties . Our classification is based on the more general problem of rank aggregation in which , beyond electing a winner , we also seek to compute an aggregate ranking of all the candidates ; moreover , our classification is offered from a computational perspective --- based on whether or not the voting method generalizes to an aggregation algorithm guaranteed to produce solutions that are near optimal in minimizing the distance of the aggregate ranking to the voters ' rankings with respect to one of three well-known distance measures : the Kendall tau , the Spearman footrule , and the Spearman rho measures . We show that methods based on the average rank of the candidates ( Borda counting ) , on the median rank of the candidates , and on the number of pairwise-majority wins ( Copeland ) all satisfy the near-optimality criterion with respect to each of these distance measures . On the other hand , we show that natural extensions of each of plurality v ... This paper makes a systematic attempt to provide virtual teams with the power of voting procedures developed in the context of the theory of collective choice . A toolset called TEAMVOTE , for electronic decision-making , is presented , implementing a blend of the most important collective choice strategies , like the Dodgson rule , the majority rule , plurality voting , Borda counting , approval voting , the Nanson rule , the Hare rule , the Coomb rule , etc . , based on standard Internet technology . The services of TEAMVOTE , which are targeted to support goal-oriented business teams in group decision matters , raise the perspective of its use to enable democratic processes on a societal scale . In this paper , we investigate the effects of noise , both random and nonrandom , on the aggregated rank orders determined from the degree , PageRank , eigenvector centrality , and closeness centrality-based rankings . This paper reveals an important insight that even the simple Borda Count ranking has the potential to improve on the accuracy of rank orders in networks with uncertainty . This paper shows the existence of stable nodes in various networks and indicates that the design of the consensus approach based on the properties of the stable nodes can further improve the stability of the rank orders . This paper presents a novel approach for off-line text-independent Arabic writer identification . The approach operates in four steps : 1 ) handwritten text is segmented into strokes after an image thinning step ; 2)length , height/width ratio and curvature stroke features are extracted ; 3 ) five feature vectors are computed : stroke length/ratio probability distribution function ( PDF ) , stroke length/ratio horizontal and vertical cross-correlation , stroke length/curvature PDF , stroke length/curvature horizontal and vertical cross-correlation , and stroke length/curvature and length/ratio cross-correlation ; 4 ) classification is carried out using different metrics and the Borda count ranking algorithm . A first experimental evaluation performed on 40 writers from the IFN/ENIT database produced a promising identification rate of 92.5 % for Top1 and 100 % for Top5 . Our method identifies the most susceptible filters and applies retraining only to the filters that show the highest activation maps distance between clean and distorted images . Filters are ranked using the Borda count election method and then only the most affected filters are fine-tuned . This significantly reduces the number of parameters to retrain . In our study , weights ensued from a Pan-Hellenic electronic questionnaire survey constituting of a sample of 871 people mainly sought the hierarchical significance of each of the walkability index 's parameters and sub-parameters according to the preferences of respondents which stated they basically choose walking/cycling to their daily destinations . Hierarchy analysis of results was carried out through the utilization of the Borda count election method , a consensus-based method instead of a majoritarian one . Results indicated that proximity to basic urban destinations is assigned the highest weight with a value of 38.3 % and population density the lowest with a value of 13.8 % . A group of eight procedures that are vulnerable to non-monotonicity under ( only ) variable electorates : Successive Elimination , Bucklin ’s Method , Majority Judgment , Copeland ’s Method , Black ’s Method , Kemeny ’s Method , Schwartz ’s Method , Young ’s Method . A group of five procedures that are invulnerable to any monotonicity failures : Plurality Voting , Approval Voting , Borda ’s Count , Range Voting , the Minmax Method . The proposed rank aggregation algorithm is implemented as a part of a complete metasearch engine . In order to ensure the effectiveness of our proposed rank aggregation algorithm , we compare the results obtained by our proposed PSO based algorithm with that obtained by the classical Borda 's count method . The obtained result shows that our proposed rank aggregation method is better than the classical Borda 's based method in two sides . In addition , the nodes identified by using single centrality are not always placed in the top section , where the super-spreaders are supposed to be , of the ranking generated by simulation . In this paper we take a meta-centrality approach by combining different centrality measures using a modified version of Borda count aggregation method . As a result , we are able to improve the performance of super-spreader identification for a broad range of real-world networks . This paper proposes a Borda count based approach to combine the complimentary edge information present in spatial domain and Fourier domain representation of image for face recognition . The edges in spatial domain are captured using analytic phase based representation . Meanwhile , the ranking aggregation approach uses Borda and Copeland methods to be compared . The results of the experiment show that Borda method is superior than Copeland method . The mean score of NDCG for Borda and Copeland methods are 0.6251 and 0.5649 respectively . Also , four conventional multi-attribute decision analysis ( MADA ) methods were implemented in the evaluation model for impact evaluation , including simple weighted addition ( SWA ) , weighted product ( WP ) , cooperative game theory ( CGT ) and technique for order preference by similarity to ideal solution ( TOPSIS ) . Moreover , several aggregation methods including average ranking procedure , Borda and Copeland methods were used to integrate the ranking results , helping rank the water resources security in those nine provinces as well as improving reliability of evaluation results . The ranking results showed that the water resources security of the entire basin was in critical condition , including the insecurity and absolute insecurity states , especially in Shanxi , Inner Mongolia and Ningxia provinces in which water resources were lower than the average quantity in China . At first , the model uses AHP , gray correlation , factor analysis evaluation , and uses KENDALL-W concord coefficient method to check up the coherence of different methods . Then using mean , Borda and Copeland model gets the comprehensive results . Subsequently , in order to evaluate the availability of results , Spearman correlation is used , and based on the Spearman correlation , the best model is seleeted . Faliszewski et al. [ 9 ] proved that Llull voting ( which is here denoted by Copeland1 ) and a variant ( here denoted by Copeland0 ) of Copeland voting are computationally resistant to many , yet not all , types of constructive control and that they also provide broad resistance to bribery . We study a parameterized version of Copeland voting , denoted by Copeland ? , where the parameter ? is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections . For each rational ? , 0 < ? The only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization . We study a parameterized version of Copeland voting , denoted by Copeland^\alpha , where the parameter \alpha is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates . We prove that Copeland^{0.5 } , the system commonly referred to as " Copeland voting , " provides full resistance to constructive control , and we prove the same for Copeland^\alpha , for all rational \alpha , 0 < \alpha < 1 . The AHP method was used to generate values for the criteria used as input in the calculation process of the TOPSIS method . Results of the TOPSIS calculation generated a project rank indicated by each decision maker , and to combine the different preferences of these decision makers , the Copeland Score method was used as one of the voting methods to determine the best project rank of all the ranks indicated by the desicion makers . These procedures are divided into three groups : A group of five procedures that are vulnerable to non-monotonicity under both fixed and variable electorates : Plurality with Runoff , Alternative Vote , Coombs ’ Method , Dodgson ’s Method , Nanson ’s Method . A group of eight procedures that are vulnerable to non-monotonicity under ( only ) variable electorates : Successive Elimination , Bucklin ’s Method , Majority Judgment , Copeland ’s Method , Black ’s Method , Kemeny ’s Method , Schwartz ’s Method , Young ’s Method . A group of five procedures that are invulnerable to any monotonicity failures : Plurality Voting , Approval Voting , Borda ’s Count , Range Voting , the Minmax Method . A committee 's decisions on more than two alternatives much depend on the adopted voting method , and so does the distribution of power among the committee members . We investigate how different aggregation methods such as plurality runoff , Borda count , or Copeland rule map asymmetric numbers of seats , shares , voting weights , etc . to influence on outcomes when preferences vary . A generalization of the Penrose-Banzhaf power index is proposed and applied to the IMF Executive Board 's election of a Managing Director , extending a priori voting power analysis from binary simple voting games to choice in weighted committees . This paper proposes a new combinational evaluation method -- Football method , which is based on the Borda and Copeland method . Compared with Borda and Copeland method , because this method further distinguishes " good " and " poor " level , the conclusion of combinational evaluation is more accurate , the degree of division is better and it has very good consistency with the conclusion of each comprehensive evaluation method . Given a tournament T = ( X , A ) , we consider two tournament solutions applied to T : Slater ’s solution and Copeland ’s solution . Slater ’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive . The distribution functions of component repair moment can be obtained after a sufficient system state sampling . And Copeland ranking method is adopted to rank the component importance . Finally , the feasibility of the proposed approach is validated by extensive case studies . Mastering big data . • The Copeland ranking rule is based on crisp net flows requiring the inand out-degree of each node in the outranking digraph ; • When the order n of the outranking digraph becomes big ( several thousand or millions of alternatives ) , this requires handling a huge set of n2 pairwise outranking situations ; • We use instead a sparse model of the outranking digraph , where we only keep a linearly ordered list of diagonal multicriteria quantiles equivalence classes with local outranking content . Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner , which , unlike the Condorcet winner , is guaranteed to exist . The first , Copeland Confidence Bound ( CCB ) , is designed for small numbers of arms , while the second , Scalable Copeland Bandits ( SCB ) , works better for large-scale problems . We provide theoretical results bounding the regret accumulated by CCB and SCB , both substantially improving existing results . In this dissertation we will analyze the proximity spatial models for cumulative voting . We will show that the cumulative voting method , with its plumping strategy , provides a greater chance of minority representation in the elected body than often occurs in multimember districts elected by plu-rality . This second degree of freedom allows choosing between system reliability and performance during operation . The number of available replicas in the pA-RMR architecture determines the maximum reliability achievable , while the voting policy allows us to adapt the structure to different design requirements and achieve the desired balance between reliability and performance . ProWord builds on two nontrivial algorithms . First , we propose an unsupervised segmentation algorithm based on the modified Voting Experts algorithm , such that we break payload into candidate words according to entropy information and provide more accurate segmentation than existing n-gram and CS approaches . Second , we propose a ranking algorithm that incorporates different types of well-known feature word retrieval heuristics , such that we can build an ordered structure on the candidate words and select the highest ranked ones as protocol feature words . ProWord builds on two nontrivial algorithms . First , we propose an unsupervised segmentation algorithm based on the modified Voting Experts algorithm , such that we break payload into candidate words according to entropy information and provide more accurate segmentation than existing n-gram approaches . Second , we propose a ranking algorithm that incorporates different types of well-known feature word retrieval heuristics , such that we can build an ordered structure on the candidate words and select the highest ranked ones as protocol feature words . We analyze the voting behavior of members who take into account the effect of their votes not only on the elected candidates , but also on the final composition of the society . For additive and monotonic preferences with dichotomous bads we construct a strategy profile that is an undominated pure strategy Nash equilibrium of the induced voting game . The system performs three sub-tasks : concept extraction , assertion classification , and relation identification . DESIGN The overall system consists of five steps : ( 1 ) pre-processing sentences , ( 2 ) marking noun phrases ( NPs ) and adjective phrases ( APs ) , ( 3 ) extracting concepts that use a dosage-unit dictionary to dynamically switch two models based on Conditional Random Fields ( CRF ) , ( 4 ) classifying assertions based on voting of five classifiers , and ( 5 ) identifying relations using normalized sentences with a set of effective discriminating features . MEASUREMENTS Macro-averaged and micro-averaged precision , recall and F-measure were used to evaluate results . We discuss an implementation of a network voting scheme based on mix-net technology . We employed the scheme presented at Financial Cryptography 2002 , but replaced the numeric computations with those on a elliptic curve . We propose a new robust focal length estimation method in multi-view structure from motion from unordered data sets , e.g. downloaded from the Flickr database , where jpeg-exif headers are often incorrect or missing . The method is based on a combination of RANSAC with weighted kernel voting and can use any algorithm for estimating epipolar geometry and unknown focal lengths . We demonstrate by experiments with synthetic and real data that the method produces reliable focal length estimates which are better than estimates obtained using RANSAC or kernel voting alone and which are in most real situations very close to the ground truth . Support for parameters in events , complex expressions in guards , and support to nested states are some of the distinguishing features of FSMC+ . In this paper we present FSMC+ and we show how we used it for the development and the verification of the ProVotE e-voting machine . Even though FSMC+ has been specifically created to ease the development of jprovote , we believe the approach and the tool we developed to be general enough to be used in other applications . Existing technology is capable of yielding secure , reliable , and auditable voting systems . This system outlines an architecture for polling place electronic voting , based on redundancy at each stage of the ballot submission process that is resistant to external hacking and internal insertion of malicious code . Specifically , each received antenna gives their recognition sub-results via the CNN , respectively . Then , the decision maker identifies the modulation types , based on these sub-results and cooperative decision rules , such as direct voting ( DV ) , weighty voting ( WV ) , direct averaging ( DA ) and weighty averaging ( WA ) . The simulation results demonstrate that the Co-AMC method , based on the CNN and WA , has the highest correct classification probability in the four cooperative decision rules . For each question , 10 answers are annotated by another batch of AMT workers . To pre - process the annotation for training , we perform majority voting on the 10 ground - truth answers to get the most certain answer for each question . Here the answer could be in single word or multiple words . Taillight ” wins among the different car parts , mostly likely due to the relatively more distinctive designs , and the model name printed close to the taillight , which is a very informative feature for the CNN model . We also combine predictions using the eight car part models by voting strategy . This strategy significantly improves the performance due to the complementary nature of different car parts . Such segmentations are obtained by only considering local context and therefore are prone to failure , especially in challenging modalities such as ultrasound , where a high number of mis - classified voxel are to be expected . Post - processing approaches such as connected components analysis normally yield no improvement and therefore , more recent works , propose to use the network predictions in combination with Markov random fields , voting strategies or more traditional approaches such as level - sets . Patch - wise approaches also suffer from efficiency issues . The proposed voter design features robust performance when the uncertainty assumptions dynamically change over time . The IT2 fuzzy voter architecture was compared against the average voter , inexact majority voter , and the T1 fuzzy voter using a refined experimental harness . The reported results demonstrate improved availability , safety and reliability of the presented IT2 fuzzy voting scheme . This paper introduces a novel voting scheme based on fuzzy set theory . It softens the harsh behaviour of the inexact majority voter in the neighbourhood of the ‘ voter threshold ’ , and handles uncertainty and some multiple error cases in the region defined by the fuzzy input variables . The voter assigns a fuzzy difference value to each pair of voter inputs based on their numerical distance . The impact of changing some fuzzy variables on the performance of the voter is also investigated . We show that the fuzzy voter gives more correct outputs ( higher availability ) than the inexact majority voter with small and large errors , less incorrect outputs ( higher safety ) than the inexact majority voter in the presence of small errors , and less benign outputs than the inexact majority voter . The percentage of the benign outputs of the majority voter that are successfully handled by the fuzzy voter ( resulting in correct outputs ) is more than the percentage of those that are unsuccessfully resolved by the fuzzy voter ( resulting in incorrect outputs ) .
Bugs in or manipulations of an e-voting system can have considerable influence on society . Therefore , e-voting systems are an obvious target for software verification . This case study proves the preservation of privacy of votes for a basic electronic voting system .
The aim of the present study was to examine voters ' perception of e-voting system in India . Here , e-voting system refers to an online voting anywhere in the country by voters in public elections . The goals of an e-voting system is to increase voter participation and relieve congestion at polling stations on election day .
For example multiple voters , invalid voter data , broken ballots and so forth . One solution to solve the problems in conventional electoral systems is to apply electronic voting ( e-voting ) . Various research and development carried out in order to build a secure e-voting system .
In this paper , we investigate a fully decentralized electronic voting scheme based on a privacy-preserving sum protocol without an authenticated channel . Our solution not only satisfies the most essential requirements for an e-voting scheme but also is convenient since it can be directly implemented on the public network without installing any cryptographic tool . In addition , the experimental results show that the total voting time of our scheme is approximately 20 % faster than that of the typical voting protocols
With the receipt , voter can verify whether the content of vote meets his aspiration or not , but he can not prove to others whom he has vote . The improved e-voting scheme based on verifiable random number that is fair , verifiable , and untraceable can efficiently prevent from colluding and buying vote .
Doubleblind IBE schemes , which are extensions of blind IBE schemes , allow a user to construct an identity string that is partially obscured from the KGC , while also facilitating the KGC adding elements to the identity string which are obscured from the user . Using DB-IBE , we present an e-voting scheme with desirable features such as universal verifiability , voter verifiability and receipt-freeness .
The better algorithm , Guo-Hall ’s was recommended for implementation on e-voting systems . Guo-Hall ’s algorithm is very effective and has the capacity to curb electoral fraud when adopted in e-voting process .
The integrity and image of such applications wo n’t be maintained unless strict measures on security and authenticity are applied . This chapter explores the e-voting process , reviews the authentication techniques and methods that are used in this process and proposed in the literature , and demonstrates few cases of applying e-voting systems from different countries in the world . Conclusions and proposed future work are stated at the end of the chapter .
Recently developed blockchain technology may be a solution to these issues . The paper describes the use of intelligent agents and multi-agent system concept for Auditable Blockchain Voting System ( ABVS ) , which integrates e-voting process with blockchain technology into one supervised non-remote internet voting system which is end-to-end verifiable .
However , considering the security problems that can occur using the underlying technologies , it is difficult to construct an impenetrable system . This chapter presents e-Vote , a distributed electronic voting system architecture that is designed to ensure the accuracy , privacy , verifiability , convenience , and the openness of the democracy of a large-scale electoral process . We describe the necessary requirements for the e-voting protocol , and propose a cryptographic voting scheme that achieves them .
The PriS conceptual framework . Purpose – To present a new methodology for incorporating privacy requirements into the system design process called PriS , and describe its applicability in the e‐VOTE system for presenting methodology 's way‐of‐working . Design/methodology/approach – PriS is a requirement engineering methodology focused on privacy issues .
A device and a method for performing an e-vote using a mobile terminal are provided to identify a voter with a certificate without making the voter report the e-vote previously when the voter casts a ballot with a mobile terminal of the voter , and guarantee secrecy of the e-vote by encoding voting contents of the voter and deleting a user ID of a mobile terminal user . A voter ID checker(310 ) authenticates a voter based on a certificate received from a mobile terminal(100 ) of the voter through the mobile network .
A safe , reliable and effective e-voting system should satisfy four core requirements , such as democracy , anonymity , accuracy and verifiability . This paper researches on three typical e-voting system models , including Modi?ed EIGamal Model , Blind Signature Model and Secret Sharing Model , analyzes their methods and procedures of protecting a voter ’s privacy and a ballot ’s integrity , specifies how these three models meet with the core requirements and points out their relative merits respectively .
In this paper , we present an imperceptible stegano-cryptographic model for securing generic security requirements of e-voting systems . The purpose is to model a secure e-electronic voting capable of delivering credible , fair and transparent future e-democratic decision making in developing countries like Nigeria . The model was implemented on our framework for secure e-voting using Java programming language and Oracle database management system .
Election of Chairman STMIK Banjarbaru BEM can be overcome by utilizing Computer Science and Information Technology ( ICT ) that electronic voting ( e-voting ) or build an application of e-voting to carry out the selection head is that it takes time and place of voters ( students ) in the election can be balanced and can increase the number of voters . One way that is easy and efficient in the development of e-voting election is to use a client-server architecture and algorithms pesentase in the graph . From the research that has been done to implement the e-voting system , then the conclusion is obtained that can increase the number of voters , smoothed data management , reduce the risk of loss of voice , reducing the budget , as well as speeding up the counting .
The results of this study tested the Network Local Area Network ( LAN ) , where several computers as a client computer and a computer unit as a data bank or as a server with a database that has been in sharingkan . With the BEM application program in STMIK Pontiaanak Based Desktop allows the user ( users ) the easier it is to perform the E-Voting election . Keyword : E-Voting , BEM STMIK Pontianak , RAD , Visual Basic 6
We have established the need to further explore the re-design of the electoral process and consider procedural security as primarily applicable to agent-related processes . In view of the increased complexity of the e-voting processes , which can involve multi-channel e-voting options , and the increase in the number of agents involved in the administration of e-elections , we relate procedural security to the need for transparent allocation of responsibilities among the different agents . In concluding we argue that existing procedural security should be enhanced , that there is a clear need for better monitoring of compliance to such procedures and that further security procedures need to be put in place at specific points in the e-election process .
Even though e-voting systems have already been widely studied , there are still some situations not covered yet by classical bibliography , and then it becomes necessary to introduce interesting variations to the main schema . In this paper , we will present one of such occurrences ( that associated with e-cognocracy ) , and will study the modifications needed in the traditional e-voting processes as well as the implications they have .
The paper contains a list of suggestions on ways how best to introduce ( remote ) e-voting . 1 Growing attention to e-voting E-Voting has been attracting considerable attention during the last years . This fact is based on the one hand upon interest and attention devoted to e-government , edemocracy , e-governance , etc .
Proponents of Approval Voting argue that this electoral rule leads to more centrist outcomes compared to Plurality Voting . This claim has been substantiated by scholarly work using spatial models of political competition .
In this paper , we propose a family of approval voting-schemes for electing committees based on the preferences of voters . In our schemes , we calculate the vector of distances of the possible committees from each of the ballots and , for a given $ p $ -norm , choose the one that minimizes the magnitude of the distance vector under that norm .
It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small . Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta ( nlogn ) algorithms for both exact and inexact voting as well as for certain approval-voting schemes . An unordered input object space leads to worst-case Omega ( n/sup 2/ ) algorithms , even when a distance metric can be defined on the input object space .
An increasing body of theoretical and empirical work on discrete choice considers a choice design in which a person is asked to select both the best and the worst alternative in an available set of alternatives , in contrast to more traditional tasks such as where the person is asked to : select the best alternative ; select the worst alternative ; rank the alternatives . Here we consider voting systems motivated by such “ best-worst ” choice ; relate them to approval and disapproval voting systems ; and characterize a “ best-worst ” voting system in terms of a set of axioms in the context of scoring rules .
Several methods exist for electing committees of representatives and conducting multiple referenda based on approval voting . Recently , a family of rules for approval-based voting using ordered weighted averaging was proposed , ranging from a simple candidate-wise majority ( minisum ) to egalitarian rule ( minimax ) . Even though the first rule is strategyproof and the second is not , due to its egalitarian nature , only a partial study on manipulation has been conducted for inbetween rules .
Groth presented some efficient non-interactive zero-knowledge ( NIZK ) arguments based on homomorphic integer commitments for voting . He investigated four types of e-voting schemes : limited vote , approval vote , divisible vote and Borda vote . Receipt-freeness means that a voter is unable to construct a receipt to convince others she has voted for a particular candidate .
However , most available secure vote schemes mainly focused on the simple " one-man-one-vote " plurality protocol . In this paper , we address the security issues in Approval voting protocol , another important social decision protocol , in which voters can vote for , or approval of , as many candidates as they wish in multi-candidate elections . By employing several cryptographic primitives , such as , homomorphic encryption , mix network , etc . , we propose a voter-resolved secure Approval voting scheme over Internet which guarantees the complete privacy protection of the voters as well as the universal verifiability .
For net approval and minisum approval voting rules , we provide a dichotomous result , resolving the parameterized complexity of this problem for all subsets of five natural parameters considered ( by showing either FPT or W[1]-hardness for all subsets of parameters ) . For the approval voting rule , we resolve the parameterized complexity of this problem for all subsets of parameters except one . We also study approximation algorithms for this problem .
In many approval voting settings voters are a priori uncertain regarding their true preferences , yet can obtain this information if willing to incur some cost . This paper provides a comprehensive analysis of such model focusing in simultaneous and sequential voting .
We compare the results with state-of-the-art pseudo relevance feedback based retrieval techniques . In quest of enhancing the results of pseudo relevance feedback approach , we introduce two term selection combination techniques namely Borda Count and Intersection . Surprisingly , combinational techniques performed worse than single term selection techniques .
In the second model , many classifiers are fused to increase the recognition rate . In this method , two methods are used , namely , Borda count and majority voting . The results of this model ranged from 94.12 \ % to 96.08 \ % .
For the upper bound of uncertainty ( upper ( right ) end of the α-cut level = 0.3 ) , a maximum reduction of 57 % was obtained . In applying FSC methods through the decision-making process , the Borda Counting method considered the preferences of all stakeholders best . Moreover , the proposed framework allows decision-makers to decide on the acceptability and reliability of the optimal management scenarios considering their preferences and uncertainties .
Our classification is based on the more general problem of rank aggregation in which , beyond electing a winner , we also seek to compute an aggregate ranking of all the candidates ; moreover , our classification is offered from a computational perspective --- based on whether or not the voting method generalizes to an aggregation algorithm guaranteed to produce solutions that are near optimal in minimizing the distance of the aggregate ranking to the voters ' rankings with respect to one of three well-known distance measures : the Kendall tau , the Spearman footrule , and the Spearman rho measures . We show that methods based on the average rank of the candidates ( Borda counting ) , on the median rank of the candidates , and on the number of pairwise-majority wins ( Copeland ) all satisfy the near-optimality criterion with respect to each of these distance measures . On the other hand , we show that natural extensions of each of plurality v ...
This paper makes a systematic attempt to provide virtual teams with the power of voting procedures developed in the context of the theory of collective choice . A toolset called TEAMVOTE , for electronic decision-making , is presented , implementing a blend of the most important collective choice strategies , like the Dodgson rule , the majority rule , plurality voting , Borda counting , approval voting , the Nanson rule , the Hare rule , the Coomb rule , etc . , based on standard Internet technology . The services of TEAMVOTE , which are targeted to support goal-oriented business teams in group decision matters , raise the perspective of its use to enable democratic processes on a societal scale .
In this paper , we investigate the effects of noise , both random and nonrandom , on the aggregated rank orders determined from the degree , PageRank , eigenvector centrality , and closeness centrality-based rankings . This paper reveals an important insight that even the simple Borda Count ranking has the potential to improve on the accuracy of rank orders in networks with uncertainty . This paper shows the existence of stable nodes in various networks and indicates that the design of the consensus approach based on the properties of the stable nodes can further improve the stability of the rank orders .
This paper presents a novel approach for off-line text-independent Arabic writer identification . The approach operates in four steps : 1 ) handwritten text is segmented into strokes after an image thinning step ; 2)length , height/width ratio and curvature stroke features are extracted ; 3 ) five feature vectors are computed : stroke length/ratio probability distribution function ( PDF ) , stroke length/ratio horizontal and vertical cross-correlation , stroke length/curvature PDF , stroke length/curvature horizontal and vertical cross-correlation , and stroke length/curvature and length/ratio cross-correlation ; 4 ) classification is carried out using different metrics and the Borda count ranking algorithm . A first experimental evaluation performed on 40 writers from the IFN/ENIT database produced a promising identification rate of 92.5 % for Top1 and 100 % for Top5 .
Our method identifies the most susceptible filters and applies retraining only to the filters that show the highest activation maps distance between clean and distorted images . Filters are ranked using the Borda count election method and then only the most affected filters are fine-tuned . This significantly reduces the number of parameters to retrain .
In our study , weights ensued from a Pan-Hellenic electronic questionnaire survey constituting of a sample of 871 people mainly sought the hierarchical significance of each of the walkability index 's parameters and sub-parameters according to the preferences of respondents which stated they basically choose walking/cycling to their daily destinations . Hierarchy analysis of results was carried out through the utilization of the Borda count election method , a consensus-based method instead of a majoritarian one . Results indicated that proximity to basic urban destinations is assigned the highest weight with a value of 38.3 % and population density the lowest with a value of 13.8 % .
A group of eight procedures that are vulnerable to non-monotonicity under ( only ) variable electorates : Successive Elimination , Bucklin ’s Method , Majority Judgment , Copeland ’s Method , Black ’s Method , Kemeny ’s Method , Schwartz ’s Method , Young ’s Method . A group of five procedures that are invulnerable to any monotonicity failures : Plurality Voting , Approval Voting , Borda ’s Count , Range Voting , the Minmax Method .
The proposed rank aggregation algorithm is implemented as a part of a complete metasearch engine . In order to ensure the effectiveness of our proposed rank aggregation algorithm , we compare the results obtained by our proposed PSO based algorithm with that obtained by the classical Borda 's count method . The obtained result shows that our proposed rank aggregation method is better than the classical Borda 's based method in two sides .
In addition , the nodes identified by using single centrality are not always placed in the top section , where the super-spreaders are supposed to be , of the ranking generated by simulation . In this paper we take a meta-centrality approach by combining different centrality measures using a modified version of Borda count aggregation method . As a result , we are able to improve the performance of super-spreader identification for a broad range of real-world networks .
This paper proposes a Borda count based approach to combine the complimentary edge information present in spatial domain and Fourier domain representation of image for face recognition . The edges in spatial domain are captured using analytic phase based representation .
Meanwhile , the ranking aggregation approach uses Borda and Copeland methods to be compared . The results of the experiment show that Borda method is superior than Copeland method . The mean score of NDCG for Borda and Copeland methods are 0.6251 and 0.5649 respectively .
Also , four conventional multi-attribute decision analysis ( MADA ) methods were implemented in the evaluation model for impact evaluation , including simple weighted addition ( SWA ) , weighted product ( WP ) , cooperative game theory ( CGT ) and technique for order preference by similarity to ideal solution ( TOPSIS ) . Moreover , several aggregation methods including average ranking procedure , Borda and Copeland methods were used to integrate the ranking results , helping rank the water resources security in those nine provinces as well as improving reliability of evaluation results . The ranking results showed that the water resources security of the entire basin was in critical condition , including the insecurity and absolute insecurity states , especially in Shanxi , Inner Mongolia and Ningxia provinces in which water resources were lower than the average quantity in China .
At first , the model uses AHP , gray correlation , factor analysis evaluation , and uses KENDALL-W concord coefficient method to check up the coherence of different methods . Then using mean , Borda and Copeland model gets the comprehensive results . Subsequently , in order to evaluate the availability of results , Spearman correlation is used , and based on the Spearman correlation , the best model is seleeted .
Faliszewski et al. [ 9 ] proved that Llull voting ( which is here denoted by Copeland1 ) and a variant ( here denoted by Copeland0 ) of Copeland voting are computationally resistant to many , yet not all , types of constructive control and that they also provide broad resistance to bribery . We study a parameterized version of Copeland voting , denoted by Copeland ? , where the parameter ? is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections . For each rational ? , 0 < ?
The only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization . We study a parameterized version of Copeland voting , denoted by Copeland^\alpha , where the parameter \alpha is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates . We prove that Copeland^{0.5 } , the system commonly referred to as " Copeland voting , " provides full resistance to constructive control , and we prove the same for Copeland^\alpha , for all rational \alpha , 0 < \alpha < 1 .
The AHP method was used to generate values for the criteria used as input in the calculation process of the TOPSIS method . Results of the TOPSIS calculation generated a project rank indicated by each decision maker , and to combine the different preferences of these decision makers , the Copeland Score method was used as one of the voting methods to determine the best project rank of all the ranks indicated by the desicion makers .
These procedures are divided into three groups : A group of five procedures that are vulnerable to non-monotonicity under both fixed and variable electorates : Plurality with Runoff , Alternative Vote , Coombs ’ Method , Dodgson ’s Method , Nanson ’s Method . A group of eight procedures that are vulnerable to non-monotonicity under ( only ) variable electorates : Successive Elimination , Bucklin ’s Method , Majority Judgment , Copeland ’s Method , Black ’s Method , Kemeny ’s Method , Schwartz ’s Method , Young ’s Method . A group of five procedures that are invulnerable to any monotonicity failures : Plurality Voting , Approval Voting , Borda ’s Count , Range Voting , the Minmax Method .
A committee 's decisions on more than two alternatives much depend on the adopted voting method , and so does the distribution of power among the committee members . We investigate how different aggregation methods such as plurality runoff , Borda count , or Copeland rule map asymmetric numbers of seats , shares , voting weights , etc . to influence on outcomes when preferences vary . A generalization of the Penrose-Banzhaf power index is proposed and applied to the IMF Executive Board 's election of a Managing Director , extending a priori voting power analysis from binary simple voting games to choice in weighted committees .
This paper proposes a new combinational evaluation method -- Football method , which is based on the Borda and Copeland method . Compared with Borda and Copeland method , because this method further distinguishes " good " and " poor " level , the conclusion of combinational evaluation is more accurate , the degree of division is better and it has very good consistency with the conclusion of each comprehensive evaluation method .
Given a tournament T = ( X , A ) , we consider two tournament solutions applied to T : Slater ’s solution and Copeland ’s solution . Slater ’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive .
The distribution functions of component repair moment can be obtained after a sufficient system state sampling . And Copeland ranking method is adopted to rank the component importance . Finally , the feasibility of the proposed approach is validated by extensive case studies .
Mastering big data . • The Copeland ranking rule is based on crisp net flows requiring the inand out-degree of each node in the outranking digraph ; • When the order n of the outranking digraph becomes big ( several thousand or millions of alternatives ) , this requires handling a huge set of n2 pairwise outranking situations ; • We use instead a sparse model of the outranking digraph , where we only keep a linearly ordered list of diagonal multicriteria quantiles equivalence classes with local outranking content .
Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner , which , unlike the Condorcet winner , is guaranteed to exist . The first , Copeland Confidence Bound ( CCB ) , is designed for small numbers of arms , while the second , Scalable Copeland Bandits ( SCB ) , works better for large-scale problems . We provide theoretical results bounding the regret accumulated by CCB and SCB , both substantially improving existing results .
In this dissertation we will analyze the proximity spatial models for cumulative voting . We will show that the cumulative voting method , with its plumping strategy , provides a greater chance of minority representation in the elected body than often occurs in multimember districts elected by plu-rality .
This second degree of freedom allows choosing between system reliability and performance during operation . The number of available replicas in the pA-RMR architecture determines the maximum reliability achievable , while the voting policy allows us to adapt the structure to different design requirements and achieve the desired balance between reliability and performance .
ProWord builds on two nontrivial algorithms . First , we propose an unsupervised segmentation algorithm based on the modified Voting Experts algorithm , such that we break payload into candidate words according to entropy information and provide more accurate segmentation than existing n-gram and CS approaches . Second , we propose a ranking algorithm that incorporates different types of well-known feature word retrieval heuristics , such that we can build an ordered structure on the candidate words and select the highest ranked ones as protocol feature words .
ProWord builds on two nontrivial algorithms . First , we propose an unsupervised segmentation algorithm based on the modified Voting Experts algorithm , such that we break payload into candidate words according to entropy information and provide more accurate segmentation than existing n-gram approaches . Second , we propose a ranking algorithm that incorporates different types of well-known feature word retrieval heuristics , such that we can build an ordered structure on the candidate words and select the highest ranked ones as protocol feature words .
We analyze the voting behavior of members who take into account the effect of their votes not only on the elected candidates , but also on the final composition of the society . For additive and monotonic preferences with dichotomous bads we construct a strategy profile that is an undominated pure strategy Nash equilibrium of the induced voting game .
The system performs three sub-tasks : concept extraction , assertion classification , and relation identification . DESIGN The overall system consists of five steps : ( 1 ) pre-processing sentences , ( 2 ) marking noun phrases ( NPs ) and adjective phrases ( APs ) , ( 3 ) extracting concepts that use a dosage-unit dictionary to dynamically switch two models based on Conditional Random Fields ( CRF ) , ( 4 ) classifying assertions based on voting of five classifiers , and ( 5 ) identifying relations using normalized sentences with a set of effective discriminating features . MEASUREMENTS Macro-averaged and micro-averaged precision , recall and F-measure were used to evaluate results .
We discuss an implementation of a network voting scheme based on mix-net technology . We employed the scheme presented at Financial Cryptography 2002 , but replaced the numeric computations with those on a elliptic curve .
We propose a new robust focal length estimation method in multi-view structure from motion from unordered data sets , e.g. downloaded from the Flickr database , where jpeg-exif headers are often incorrect or missing . The method is based on a combination of RANSAC with weighted kernel voting and can use any algorithm for estimating epipolar geometry and unknown focal lengths . We demonstrate by experiments with synthetic and real data that the method produces reliable focal length estimates which are better than estimates obtained using RANSAC or kernel voting alone and which are in most real situations very close to the ground truth .
Support for parameters in events , complex expressions in guards , and support to nested states are some of the distinguishing features of FSMC+ . In this paper we present FSMC+ and we show how we used it for the development and the verification of the ProVotE e-voting machine . Even though FSMC+ has been specifically created to ease the development of jprovote , we believe the approach and the tool we developed to be general enough to be used in other applications .
Existing technology is capable of yielding secure , reliable , and auditable voting systems . This system outlines an architecture for polling place electronic voting , based on redundancy at each stage of the ballot submission process that is resistant to external hacking and internal insertion of malicious code .
Specifically , each received antenna gives their recognition sub-results via the CNN , respectively . Then , the decision maker identifies the modulation types , based on these sub-results and cooperative decision rules , such as direct voting ( DV ) , weighty voting ( WV ) , direct averaging ( DA ) and weighty averaging ( WA ) . The simulation results demonstrate that the Co-AMC method , based on the CNN and WA , has the highest correct classification probability in the four cooperative decision rules .
For each question , 10 answers are annotated by another batch of AMT workers . To pre - process the annotation for training , we perform majority voting on the 10 ground - truth answers to get the most certain answer for each question . Here the answer could be in single word or multiple words .
Taillight ” wins among the different car parts , mostly likely due to the relatively more distinctive designs , and the model name printed close to the taillight , which is a very informative feature for the CNN model . We also combine predictions using the eight car part models by voting strategy . This strategy significantly improves the performance due to the complementary nature of different car parts .
Such segmentations are obtained by only considering local context and therefore are prone to failure , especially in challenging modalities such as ultrasound , where a high number of mis - classified voxel are to be expected . Post - processing approaches such as connected components analysis normally yield no improvement and therefore , more recent works , propose to use the network predictions in combination with Markov random fields , voting strategies or more traditional approaches such as level - sets . Patch - wise approaches also suffer from efficiency issues .
The proposed voter design features robust performance when the uncertainty assumptions dynamically change over time . The IT2 fuzzy voter architecture was compared against the average voter , inexact majority voter , and the T1 fuzzy voter using a refined experimental harness . The reported results demonstrate improved availability , safety and reliability of the presented IT2 fuzzy voting scheme .
This paper introduces a novel voting scheme based on fuzzy set theory . It softens the harsh behaviour of the inexact majority voter in the neighbourhood of the ‘ voter threshold ’ , and handles uncertainty and some multiple error cases in the region defined by the fuzzy input variables . The voter assigns a fuzzy difference value to each pair of voter inputs based on their numerical distance .
The impact of changing some fuzzy variables on the performance of the voter is also investigated . We show that the fuzzy voter gives more correct outputs ( higher availability ) than the inexact majority voter with small and large errors , less incorrect outputs ( higher safety ) than the inexact majority voter in the presence of small errors , and less benign outputs than the inexact majority voter . The percentage of the benign outputs of the majority voter that are successfully handled by the fuzzy voter ( resulting in correct outputs ) is more than the percentage of those that are unsuccessfully resolved by the fuzzy voter ( resulting in incorrect outputs ) .
Functional Verification and Information Flow Analysis of an Electronic Voting System Determinants of Voter Perception towards E-Voting System in India: A Confirmatory Factor Analysis Analisis Protokol CryptO-0N2 dengan Menggunakan Scyther Tool An Efficient Approach for Electronic Voting Scheme without An Authenticated Channel An Improved Electronic Voting Scheme without a Trusted Random Number Generator E-Voting: A New Approach Using Double-Blind Identity-Based Encryption Comparative Analysis of Fingerprint Preprocessing Algorithms for Electronic Voting Processes Authentication Mechanisms for E-Voting Towards the intelligent agents for blockchain e-voting system E-Vote: A Cloud-Based Electronic Voting System for Large-Scale Election Incorporating privacy requirements into the system design process: The PriS conceptual framework Device and method of e-voting using mobile terminal The Research of Three Typical Electronic Voting System Models Implementing generic security requirements in e-voting using modified stegano-cryptographic approach Model Aplikasi E-Voting Berbasis WEB Pada Pemilihan Ketua Badan Eksekutif Mahasiswa APLIKASI PEMILIHAN KETUA BADAN EKSEKUTIF MAHASISWA STMIK PONTIANAK BERBASIS DESKTOP Procedural security in electronic voting The Voting Challenges in e-Cognocracy E-Voting: International Developments and Lessons Learnt Policy convergence under approval and plurality voting: the role of policy commitment A Generalization of the Minisum and Minimax Voting Methods Optimal algorithms for exact, inexact, and approval voting Voting for the best and against the worst Manipulation of Hamming-based Approval Voting for Multiple Referenda and Committee Elections Receipt-Freeness for Groth e-Voting Schemes A secure voter-resolved approval voting protocol over internet On Choosing Committees Based on Approval Votes in the Presence of Outliers Approval voting with costly information Lexical paraphrasing and pseudo relevance feedback for biomedical document retrieval Personal Identification Using Ears Based on Statistical Features Multi-objective decision-making for green infrastructure planning (LID-BMPs) in urban storm water management under uncertainty An Algorithmic View of Voting Collective choice in virtual teams Stability of Consensus Node Orderings Under Imperfect Network Data A novel approach for off-line Arabic writer identification based on stroke feature combination Improving Image Classification Robustness through Selective CNN-Filters Fine-Tuning What matters when it comes to “Walk and the city”? Defining a weighted GIS-based walkability index Descriptions of the Voting Methods to Be Analyzed Rank aggregation algorithm using particle swarm optimization for metasearch engines Super-Spreader Identification Using Meta-Centrality Combining analytic phase and Fourier phase for face recognition Performance Comparison of Rank Aggregation Using Borda and Copeland in Recommender System Comprehensive evaluation of water resources security in the Yellow River basin based on a fuzzy multi-attribute decision analysis approach Improved Integrated Evaluation of Listed Companies'Financial Performance-A Case Study of 26 Transport Companies Copeland Voting Fully Resists Constructive Control Llull and Copeland Voting Computationally Resist Bribery and Control The Group Decision Support System to Evaluate the ICT Project Performance Using the Hybrid Method of AHP, TOPSIS and Copeland Score Descriptions of the Voting Methods to Be Analyzed Influence in Weighted Committees A New Combinational Evaluation Method Maximum Distance Between Slater Orders and Copeland Orders of Tournaments Component importance assessment of power systems for improving resilience under wind storms UL HPC users'session: Mastering big data Copeland Dueling Bandits Extension of Spatial Theory for At-Large Elections through Analysis and Simulation Reliability and Performance Tunable Architecture: The Partially Asynchronous R-Fold Modular Redundancy (pA-RMR) Toward Unsupervised Protocol Feature Word Extraction ProWord: An unsupervised approach to protocol feature word extraction An undominated Nash equilibrium for voting by committees with exit Feature engineering combined with machine learning and rule-based methods for structured information extraction from narrative clinical discharge summaries An Implementation of a Mix-Net Based Network Voting Scheme and Its Use in a Private Organization Robust Focal Length Estimation by Voting in Multi-view Scene Reconstruction FSMC+, a tool for the generation of Java code from statecharts The SAVE System — Secure Architecture for Voting Electronically Deep Learning-Based Cooperative Automatic Modulation Classification Method for MIMO Systems Simple Baseline for Visual Question Answering A large-scale car dataset for fine-grained categorization and verification V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation Interval Type-2 fuzzy voter design for fault tolerant systems A fuzzy voting scheme for hardware and software fault tolerant systems
c12597bc7502fee9e2294d6308f9722133fd267d 47f12eb2d163b1ab74e22d57ec3834ae9888a597 6dd8694a0c38813afad9438224007eabc5395ac0 948e26fee1161072104cc1c88b95d7b60445f3ad 7e6b1cdf0896fbec45848be6f91dbe6eb8207d98 cd588f48acbe5f3f4410b9703edc2ad21b9744c7 f537ae54830a5a991ee2e8f7e3004bd6eafc5931 0e0bb260bc7989a627935c52e5eb8959319a1ea9 7e68d64be2dff6ad24994769d78c7445b198f6ea 35ea69db230d74819237d4ec29310ceb59d040b5 a0619a3be790759ad43b86a3747b21c9b6ee254f a8a4ed745e190d237f783923ca63e8edc59339db ed36125aeb78f67a09016a9312d1a59ec4e5927d 211a259c34640481d1ef02d12cfeca680f3113f2 eda46a1ccddbb3c5b72d4c345c829a5b8564d530 657de409cb6c1a95084aa559b416623c8d00f790 d66f66b8456c1d6fd530a48b98c49f0e2a920d4e 981a7334230d06458ca49b040a80422f4df59f7b 1d24ca9749a8e347668ebc57c0a42ae52282e44a 3342ec60dd1bf2ca0b7075ce3a3995832495a548 e80984b9350c2ee24dafda63b8a002fa9b25aba3 d7e9ae26eff044cdf479cbb9b8375ce4d95cc220 db1b41e9de56f53bd53cc998d568b7b50fbe8816 7ffba0b4945db55377f1220f24caba07985b8cc7 003960e4f94104e3a01d0238cf24a40ef3c13e08 9cf5ecbcae6bc7198d750805e799f5da3a5fc14f 7d3ecdb3cf413d664b7e89259ac12453da29bfed d557f464974d9c34303b48a6345f308d451379cf 3479222f3319092a2c57b908fa908d179766a605 a9db7207faf207cd9b96e068b5c7dbe6fe65144b 04c4ab6660d6456da63475d7f580f70f750be296 ac60f9d94a753767810b53f17ecf69bd3c25b362 d26fe29765a7aead214e1e424ea0b5962d69fdd7 2213361eb0937a96c315cfd08cc1c398d78c0537 79a3ddfc8bfda8a0a99fb11622698242b7679e25 ac545a93c7650c40c0c342d4a89c4a40338b509a 6620bff99feb4e89f388d7828cbbf3cfade5206a e359ffb1850c6d923f8c120abc257817decfddd8 82a26c7c26dc0b3f7619f8c90121ddc08b4e7bbf 1da2399b393b2a3fabc06018115f750b9fbef80d bd97f43f5f077bb7be3cd02b0054f38ccedb531f 3e99f59092557dc008fc0bee3b5749580cc96c43 d6159f2b3d686edfc17cca4f5955cccddf8f1ec0 b93de9c8cebc208a6a24aafb321f7891c531dbf0 07d8929027ef19fc13943e0bbcdc12e624815e90 946dc4b791270d045e29700018c08297a9b13c2a 3c444f4795b7371dc250669a48a2a29671389f7a e359ffb1850c6d923f8c120abc257817decfddd8 4f00ce93fa361a5870ea0d9e9e2761ce4f4e0e3d 359bd889806e9a2723c5650291fc14ad7c3d1233 e56d6bd3c66ea0223cceec1f7ac02c069912a374 40a01bc4562bb50c0aeaab95233079d204201bfc d9523102d8c4888da4ed293b026e1482220ee818 806938bddc59916fd5799669db96c4a5fd66cf23 100a6160bb5a9f159825dc97f2cc0ecb3a8768fb 9a2d64b93711285c83b2febfe7e65ab744fac81b 82a3002be0ddc544c7d8b3c6f242a794b8fea8aa 4663104641abe726f273edfa92c6813ecd506b75 85f39e3795a748593c1672f0750b77a57d86482b b30dbcc94c6dbb42638734f13d37d3b5b96b3ff9 e8f7241ceafb58216013891b958290c621c9e849 e738df15c44c956618e6735a3a67701f4fefc338 79b86064584ec14c004be8855fe4ccd59ac23dc5 034f44fad29c3030de6d11450706f5d4b49d0969 67c00c6fe97cba7db8141afbcfc99f7b7f02049b 08dae9e713dce48611f21a6c59eb8dc1fe142838 2e3d661d1a29b783b65b947d1b82268e88ad5cec
["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Political Science"] ["Political Science","Computer Science"] ["Economics","Computer Science"] ["Computer Science","Mathematics"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science","Business"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Geology"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Computer Science"] ["Medicine","Computer Science"] ["Mathematics"] ["Computer Science"] ["Geology"] ["Computer Science"] ["Computer Science","Mathematics"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Computer Science","Mathematics"] ["Computer Science"] ["Physics"] ["Computer Science"] ["Computer Science"] ["Computer Science","Economics"] ["Computer Science","Medicine"] ["Computer Science","Mathematics"] ["Computer Science"] ["Computer Science"] ["Computer Science","Political Science"] ["Computer Science"] ["Mathematics","Computer Science"] ["Computer Science","Mathematics"]
2016 2017 2019 2018 2011 2010 2018 2013 2018 2016 2006 2006 2009 2015 2016 2011 2004 2006 2004 2007 2018 1992 2007 2017 2009 2005 2015 2019 2019 2015 2019 2016 1999 2016 2009 2019 2017 2017 2010 2016 2011 2018 2014 2012 2008 2008 2016 2017 2019 2009 2011 2019 2018 2015 2002 2014 2014 2014 2007 2012 2010 2009 2007 2004 2020 2015 2015 2016 2011 2005
Deductive Software Verification KSE Inscrypt EuroPKI EUSPN/ICTH HICSS Electronic Voting Electronic Voting in Europe FTCS AAMAS ICEC DAI WETICE ISCIS ISSPIT IWBIS AAIM NIPS INFOCOM Towards Trustworthy Elections ACCV (1) PPPJ ArXiv 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2016 Fourth International Conference on 3D Vision (3DV)
https://api.semanticscholar.org/c12597bc7502fee9e2294d6308f9722133fd267d https://api.semanticscholar.org/47f12eb2d163b1ab74e22d57ec3834ae9888a597 https://api.semanticscholar.org/6dd8694a0c38813afad9438224007eabc5395ac0 https://api.semanticscholar.org/948e26fee1161072104cc1c88b95d7b60445f3ad https://api.semanticscholar.org/7e6b1cdf0896fbec45848be6f91dbe6eb8207d98 https://api.semanticscholar.org/cd588f48acbe5f3f4410b9703edc2ad21b9744c7 https://api.semanticscholar.org/f537ae54830a5a991ee2e8f7e3004bd6eafc5931 https://api.semanticscholar.org/0e0bb260bc7989a627935c52e5eb8959319a1ea9 https://api.semanticscholar.org/7e68d64be2dff6ad24994769d78c7445b198f6ea https://api.semanticscholar.org/35ea69db230d74819237d4ec29310ceb59d040b5 https://api.semanticscholar.org/a0619a3be790759ad43b86a3747b21c9b6ee254f https://api.semanticscholar.org/a8a4ed745e190d237f783923ca63e8edc59339db https://api.semanticscholar.org/ed36125aeb78f67a09016a9312d1a59ec4e5927d https://api.semanticscholar.org/211a259c34640481d1ef02d12cfeca680f3113f2 https://api.semanticscholar.org/eda46a1ccddbb3c5b72d4c345c829a5b8564d530 https://api.semanticscholar.org/657de409cb6c1a95084aa559b416623c8d00f790 https://api.semanticscholar.org/d66f66b8456c1d6fd530a48b98c49f0e2a920d4e https://api.semanticscholar.org/981a7334230d06458ca49b040a80422f4df59f7b https://api.semanticscholar.org/1d24ca9749a8e347668ebc57c0a42ae52282e44a https://api.semanticscholar.org/3342ec60dd1bf2ca0b7075ce3a3995832495a548 https://api.semanticscholar.org/e80984b9350c2ee24dafda63b8a002fa9b25aba3 https://api.semanticscholar.org/d7e9ae26eff044cdf479cbb9b8375ce4d95cc220 https://api.semanticscholar.org/db1b41e9de56f53bd53cc998d568b7b50fbe8816 https://api.semanticscholar.org/7ffba0b4945db55377f1220f24caba07985b8cc7 https://api.semanticscholar.org/003960e4f94104e3a01d0238cf24a40ef3c13e08 https://api.semanticscholar.org/9cf5ecbcae6bc7198d750805e799f5da3a5fc14f https://api.semanticscholar.org/7d3ecdb3cf413d664b7e89259ac12453da29bfed https://api.semanticscholar.org/d557f464974d9c34303b48a6345f308d451379cf https://api.semanticscholar.org/3479222f3319092a2c57b908fa908d179766a605 https://api.semanticscholar.org/a9db7207faf207cd9b96e068b5c7dbe6fe65144b https://api.semanticscholar.org/04c4ab6660d6456da63475d7f580f70f750be296 https://api.semanticscholar.org/ac60f9d94a753767810b53f17ecf69bd3c25b362 https://api.semanticscholar.org/d26fe29765a7aead214e1e424ea0b5962d69fdd7 https://api.semanticscholar.org/2213361eb0937a96c315cfd08cc1c398d78c0537 https://api.semanticscholar.org/79a3ddfc8bfda8a0a99fb11622698242b7679e25 https://api.semanticscholar.org/ac545a93c7650c40c0c342d4a89c4a40338b509a https://api.semanticscholar.org/6620bff99feb4e89f388d7828cbbf3cfade5206a https://api.semanticscholar.org/e359ffb1850c6d923f8c120abc257817decfddd8 https://api.semanticscholar.org/82a26c7c26dc0b3f7619f8c90121ddc08b4e7bbf https://api.semanticscholar.org/1da2399b393b2a3fabc06018115f750b9fbef80d https://api.semanticscholar.org/bd97f43f5f077bb7be3cd02b0054f38ccedb531f https://api.semanticscholar.org/3e99f59092557dc008fc0bee3b5749580cc96c43 https://api.semanticscholar.org/d6159f2b3d686edfc17cca4f5955cccddf8f1ec0 https://api.semanticscholar.org/b93de9c8cebc208a6a24aafb321f7891c531dbf0 https://api.semanticscholar.org/07d8929027ef19fc13943e0bbcdc12e624815e90 https://api.semanticscholar.org/946dc4b791270d045e29700018c08297a9b13c2a https://api.semanticscholar.org/3c444f4795b7371dc250669a48a2a29671389f7a https://api.semanticscholar.org/e359ffb1850c6d923f8c120abc257817decfddd8 https://api.semanticscholar.org/4f00ce93fa361a5870ea0d9e9e2761ce4f4e0e3d https://api.semanticscholar.org/359bd889806e9a2723c5650291fc14ad7c3d1233 https://api.semanticscholar.org/e56d6bd3c66ea0223cceec1f7ac02c069912a374 https://api.semanticscholar.org/40a01bc4562bb50c0aeaab95233079d204201bfc https://api.semanticscholar.org/d9523102d8c4888da4ed293b026e1482220ee818 https://api.semanticscholar.org/806938bddc59916fd5799669db96c4a5fd66cf23 https://api.semanticscholar.org/100a6160bb5a9f159825dc97f2cc0ecb3a8768fb https://api.semanticscholar.org/9a2d64b93711285c83b2febfe7e65ab744fac81b https://api.semanticscholar.org/82a3002be0ddc544c7d8b3c6f242a794b8fea8aa https://api.semanticscholar.org/4663104641abe726f273edfa92c6813ecd506b75 https://api.semanticscholar.org/85f39e3795a748593c1672f0750b77a57d86482b https://api.semanticscholar.org/b30dbcc94c6dbb42638734f13d37d3b5b96b3ff9 https://api.semanticscholar.org/e8f7241ceafb58216013891b958290c621c9e849 https://api.semanticscholar.org/e738df15c44c956618e6735a3a67701f4fefc338 https://api.semanticscholar.org/79b86064584ec14c004be8855fe4ccd59ac23dc5 https://api.semanticscholar.org/034f44fad29c3030de6d11450706f5d4b49d0969 https://api.semanticscholar.org/67c00c6fe97cba7db8141afbcfc99f7b7f02049b https://www.semanticscholar.org/paper/267fb4ac632449dbe84f7acf17c8c7527cb25b0d https://www.semanticscholar.org/paper/496c6db97a4f16e6bc9e4d63af420eb66f900f74 https://www.semanticscholar.org/paper/50004c086ffd6a201a4b782281aaa930fbfe6ecf https://api.semanticscholar.org/08dae9e713dce48611f21a6c59eb8dc1fe142838 https://api.semanticscholar.org/2e3d661d1a29b783b65b947d1b82268e88ad5cec