Election Problem Research Articles

Незашоренные размышления в связи с внесением 22 мая 2024 г. в Государственную Думу проекта федерального конституционного закона «О Конституционном Собрании»

The proposed article discusses various scientific and legal, as well as practical and political aspects of the problem of legislative regulation of the convening of the Constitutional Assembly as the last constitutional body prescribed in the Constitution, but not yet activated, which has exclusive powers to decide on the issue of preserving the invariability of the current Constitution, drafting a new Constitution and its adoption or its submission to a national vote. The paper considers the significance and status of this institution, offers a historical excursion — previous attempts to adopt the law, substantiates the strategic nature of the Constitutional Assembly, the problem of election of its members and the popular vote on the draft of the new Constitution, analyses the correlation between the Constitutional Assembly and the State Duma, makes a proposal on how to update the Constitution of 1993, makes specific comments on the draft law submitted to the State Duma on 22 May 2024, raises the question of the possibility of an integrated approach to the drafting of the new Constitution. The article is oriented towards continuing the discussion on this issue in scientific and practical terms.

Crossover Boosted Grey Wolf Optimizer‐based framework for leader election and resource allocation in Intrusion Detection Systems for MANETs

AbstractMobile Ad hoc Networks (MANETs) is a self‐organizing networks without having a fixed infrastructure for making them susceptible to security threats. Intrusion Detection Systems (IDS) promotes security in MANETs by identifying malicious activities. Leader election is a fundamental aspect of IDS deployment, impacting resource allocation and system efficiency. This article presents a novel approach, the Crossover Boosted Grey Wolf Optimizer (CBGWO), for leader election and resource allocation in MANET‐based IDS. The proposed CBGWO algorithm integrates the Grey Wolf Optimizer (GWO) with innovative crossover operators that have an ability to enhance the capabilities of exploration and exploitation in the optimization process. The leader election problem is solved through applying multi‐objective optimization by considering energy consumption, reputation, and communication overhead. Objective functions are defined to maximize energy efficiency while maintaining a balanced distribution of leadership roles. Extensive simulations are conducted, varying network densities and the percentage of selfish nodes. Results demonstrate the effectiveness of the CBGWO‐based model in balancing energy consumption, prolonging network lifespan, and enhancing intrusion detection by comparing different state‐of‐the‐art models such as PCA‐FELM, CTAA‐MPSO, FLS‐RE, LEACH, DCAIDS, WOA‐GA, and VOELA. The proposed model achieved an energy consumption of 4.31 J, network lifetime of 560.482 ms, and average intrusion detection latency of 0.12 s, respectively. The proposed model outperforms than existing random and connectivity‐based leader election methods that is evaluated by taking main consideration of energy efficiency and network survivability. This research contributes to the field by introducing a robust algorithm for leader election in MANET‐based IDS, addressing challenges posed by network dynamics and resource constraints. The CBGWO‐based approach showcases its potential to achieve effective leader election and efficient resource allocation, thereby enhancing the security and sustainability of MANETs.

Mixed choice in session types

Session types provide a flexible programming style for structuring interaction, and are used to guarantee a safe and consistent composition of distributed processes. Traditional session types include only one-directional input (external) and output (internal) guarded choices. This prevents the session-processes to explore the full expressive power of the π-calculus where mixed choice was proved more expressive. Recently Casal, Mordido, and Vasconcelos proposed binary session types with mixed choices (CMV+). Surprisingly, in spite of an inclusion of unrestricted channels with mixed choice, CMV+'s mixed choice is rather separate and not mixed. We prove this negative result using two methodologies (using either the leader election problem or a synchronisation pattern as distinguishing feature), showing that there exists no good encoding from the π-calculus into CMV+, preserving distribution. We then close their open problem on the encoding from CMV+ into CMV (without mixed choice), proving its soundness.

Research on WSN Intelligent Routing Algorithm based on Bayesian Learning and Particle Swarm Optimization

Background: Wireless sensor networks have the characteristics of strong scalability, easy maintenance, and self-organization, but the energy of nodes is limited and it is difficult to replace the energy supply module. The survival time of the network has always been the key to restricting the development of wireless sensor networks. Objective: Aiming at the problems of short network lifetime and low coverage, a multi-objective optimization routing algorithm has been proposed, focusing on how to balance the communication energy consumption of each node in the network and improve the coverage area of the remaining nodes. Method: Firstly, the node region was divided into several fan ring subregions. Then, the particle swarm optimization algorithm was used to find the fan angles and radii of each fan ring subregion. Next, Bayesian learning was used to select the appropriate cluster head. Results: The simulation results showed the convergence speed of the proposed algorithm to be improved, solving the problems of cluster head election and node routing planning, improving the utilization of node energy, and verifying the effectiveness. Conclusion: The particle swarm optimization algorithm and Bayesian learning have been introduced to cluster network nodes, and a multi-objective fitness function compatible with the energy consumption and coverage of network nodes has been designed. By optimizing the selection method of convergence nodes, the network communication cost of each node can be effectively balanced, and the speed of network coverage area reduction can be effectively reduced in the later period of node communication.

VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for Blockchain

To solve the problems of vote forgery and malicious election of candidate nodes in the Raft consensus algorithm, we combine zero trust with the Raft consensus algorithm and propose a secure and efficient consensus algorithm -Verifiable Secret Sharing Byzantine Fault Tolerance Raft Consensus Algorithm (VSSB-Raft). The VSSB-Raft consensus algorithm realizes zero trust through the supervisor node and secret sharing algorithm without the invisible trust between nodes required by the algorithm. Meanwhile, the VSSB-Raft consensus algorithm uses the SM2 signature algorithm to realize the characteristics of zero trust requiring authentication before data use. In addition, by introducing the NDN network, we redesign the communication between nodes and guarantee the communication quality among nodes. The VSSB-Raft consensus algorithm proposed in this paper can make the algorithm Byzantine fault tolerant by setting a threshold for secret sharing while maintaining the algorithm’s complexity to be O(n). Experiments show that the VSSB-Raft consensus algorithm is secure and efficient with high throughput and low consensus latency.

Политический анализ и прогнозирование: отечественный опыт (учебник Д.А. Ежова «Политический анализ и прогнозирование»)

The purpose of the published review is to evaluate and analyze a textbook that has no analogues in the domestic political science educational and methodological literature, authored by Candidate of Political Sciences, Associate Professor D.A. Yezhov. The author of the textbook has gained fame in the scientific community due to his research in the field of showization of politics, both in modern Russia and in various countries of the world community, as well as in the study of election campaigns and the peculiarities of electoral behavior of Russian voters during parliamentary and presidential elections. He has experience working at the Russian Center for Electoral Technology Training at the CEC of the Russian Federation, so he considers election problems from a practical point of view. The peer-reviewed textbook intended for undergraduate students studying in political science specialties provides a detailed description of the categorical apparatus of political analysis and forecasting in domestic political science, these mechanisms are considered in a comparative way with foreign analogues. The methodological and conceptual foundations of analytical and predictive techniques used in political research are analyzed. The experience of their application in modern Russia is considered on concrete examples from political practice (including managerial activities). The emphasis is on the study and comparison of methods of political analysis, political decision-making and forecasting (both in the short and long term). The author does not forget about the coverage of such controversial topics of the course as the analysis of theoretical and applied features of the domestic political TV discourse and the study of theoretical and methodological aspects and problems of forecasting electoral behavior at elections of various levels.

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election

We consider the energy complexity of the leader election problem in the single-hop radio network model, where each device v has a unique identifier ID ( v ) ∈{ 1, 2, ⋖ , N } . Energy is a scarce resource for small battery-powered devices. For such devices, most of the energy is often spent on communication, not on computation. To approximate the actual energy cost, the energy complexity of an algorithm is defined as the maximum over all devices of the number of time slots where the device transmits or listens. Much progress has been made in understanding the energy complexity of leader election in radio networks, but very little is known about the tradeoff between time and energy. Chang et al. [STOC 2017] showed that the optimal deterministic energy complexity of leader election is Θ (log log N ) if each device can simultaneously transmit and listen but still leaving the problem of determining the optimal time complexity under any given energy constraint. Time–energy tradeoff: For any k ≥ log log N , we show that a leader among at most n devices can be elected deterministically in O ( k ċ n 1+ε ) + O ( k ċ N 1/k ) time and O ( k ) energy if each device can simultaneously transmit and listen, where ε > 0 is any small constant. This improves upon the previous O ( N )-time O (log log N )-energy algorithm by Chang et al. [STOC 2017]. We provide lower bounds to show that the time–energy tradeoff of our algorithm is near-optimal. Dense instances: For the dense instances where the number of devices is n = Θ ( N ), we design a deterministic leader election algorithm using only O (1) energy. This improves upon the O (log* N )-energy algorithm by Jurdziński, Kutyłowski, and Zatopiański [PODC 2002] and the O (α ( N ))-energy algorithm by Chang et al. [STOC 2017]. More specifically, we show that the optimal deterministic energy complexity of leader election is \(\Theta (\max \lbrace 1, \log \tfrac{N}{n}\rbrace)\) if each device cannot simultaneously transmit and listen, and it is \(Θ (\max \lbrace 1, \log \log \tfrac{N}{n}\rbrace)\) if each device can simultaneously transmit and listen.

Mystery and the Problem of Election in Judaism and Christianity

Abstract: In the early Common Era, followers of Jesus approached their contradictory truth claims by arguing that God's nature is enveloped in mysterion , and is ultimately unknowable. Rabbinic writers, however, treated their own truth claims through the lens of sod , a word that denoted a secret body of knowledge that was hidden from most but accessible to some. In the wake of the Enlightenment, and particularly after the Second Vatican Council produced Nostra Aetate in 1965, Jewish theologians have begun to engage with Catholic theology, and in particular with the idea of how mystery can be activated as a meaningfully Jewish category that addresses contradictions related to the claim of Jewish election.

A general framework to quantify the event importance in multi-event contests

We propose a statistical framework for quantifying the importance of single events that do not provide intermediate rewards but offer implicit incentives through scheduling and the reward structure at the end of a multi-event contest. Applying the framework to primary elections in the US, where earlier elections have greater importance and influence, we show that schedule variations can mitigate the problem of front-loading elections. When applied to European football, we demonstrate the utility and meaningfulness of quantified event importance in relation to the in-match performance of contestants to improve outcome prediction and to provide an early indication of public interest.

The return of silent elections: democracy, uncontested elections and citizen participation in Czechia

ABSTRACT Even when robust competition becomes institutionalized for national elections in democracies, this is no guarantee that elections to subnational governments will be equally competitive there. This article documents a recent disconcerting worldwide return of “silent elections'' - electoral races in which citizens are unable to choose among political alternatives and their vote makes no difference to the outcome. Holding such uncontested elections clashes simultaneously with the dual dimensions of democratic government: contestation and inclusiveness. Eliminating any contestation whatsoever not only skews democratic representation but is also expected to have a devastating effect on citizen participation. Leveraging a large dataset of 6,254 Czech municipalities in seven municipal elections between 1998 and 2022, the main contributions of this article are assessing the extent of the problem of silent elections over time, understanding its root causes, estimating its effect on turnout and exploring what mechanisms drive the nexus between uncontested elections and voter participation. The steady rise in the proportion of uncontested races (28% of all municipalities by 2022) as well as their staggering and increasing estimated effect on turnout (17 points relative to contested) point towards a thus far unnoticed deficit of local democracy.

Elección de pareja: implicaciones y complicaciones

Human individualistic loneliness impels us to live as a couple and to achieve male/female complementarity, affection, and reciprocity. The scientific journalism of this article paraphrases the content of its bibliography when reviewing the choice of a partner, its satisfaction and complications and preventive instruction of circumstances that cause rupture. The flaw, since the election, ignores the mechanisms between reason and sexual instinct. The problem of love is not to be loved but to develop such a capacity, since maladjustment and monotony extinguishes it. The elector/chosen act and its simultaneous reasons are described: conscious (homogeneity/heterogeneity of the encounter; emulation of the animal model; type, link dynamics and social networks; sociodemographic aspects; geographic location and accessibility; sexual sharing and immediate/future expectations), and unconscious (election problems, dyadic interaction and parental history; defense mechanisms, exchange of dissociations; idealization; negative reciprocity, power struggle, projective identification, search for appreciation for the other; narcissism, false self, delay/avoidance mechanisms liability, insecurity, trespass and collusion). A healthy couple understands/attends to the creation and maintenance of ""we"", eliminates the power struggle and produces permanent conciliation. Agreement and tolerant understanding are essential for a satisfactory, stable, and lasting emotional relationship. Keywords: Choice of partner; conscious/unconscious reasons; “we”; power struggle; conciliation

Self-stabilizing systems in spite of high dynamics

We initiate research on self-stabilization in highly dynamic identified message-passing systems where dynamics is modeled using time-varying graphs (TVGs). More precisely, we address the self-stabilizing leader election problem in three wide classes of TVGs: the class TCB(Δ) of TVGs with temporal diameter bounded by Δ, the class TCQ(Δ) of TVGs with temporal diameter quasi-bounded by Δ, and the class TCR of TVGs with recurrent connectivity only, where TCB(Δ)⊆TCQ(Δ)⊆TCR. We first study conditions under which our problem can be solved. We introduce the notion of size-ambiguity to show that the assumption on the knowledge of the number n of processes is central. Our results reveal that, despite the existence of unique process identifiers, any deterministic self-stabilizing leader election algorithm working on the class TCQ(Δ) or TCR cannot be size-ambiguous, justifying why our solutions for those classes assume the exact knowledge of n. We then present three self-stabilizing leader election algorithms for Classes TCB(Δ), TCQ(Δ), and TCR, respectively. Our algorithm for TCB(Δ) stabilizes in at most 3Δ rounds. However, we show that stabilization time cannot be bounded for the leader election problem in TCQ(Δ) and TCR. Nevertheless, we circumvent this issue by showing that our solutions are speculative in the sense that their stabilization time in TCB(Δ) (⊆TCQ(Δ)⊆TCR) is O(Δ) rounds.

Dataset Similarity to Assess Semisupervised Learning Under Distribution Mismatch Between the Labeled and Unlabeled Datasets

Semi-supervised deep learning (SSDL) is a popular strategy to leverage unlabelled data for machine learning when labelled data is not readily available. In real-world scenarios, different unlabelled data sources are usually available, with varying degrees of distribution mismatch regarding the labelled datasets. It begs the question which unlabelled dataset to choose for good SSDL outcomes. ftentimes, semantic heuristics are used to match unlabelled data with labelled data. However, a quantitative and systematic approach to this election problem would be preferable. In this work, we first test the SSDL MixMatch algorithm under various distribution mismatch configurations to study the impact on SSDL accuracy. Then, we propose a quantitative unlabelled dataset selection heuristic based on dataset dissimilarity measures. These are designed to systematically assess how distribution mismatch between the labelled and unlabelled datasets affects MixMatch performance. We refer to our proposed method as deep dataset dissimilarity measures (DeDiMs), designed to compare labelled and unlabelled datasets. They use the feature space of a generic Wide-ResNet, can be applied prior to learning, are quick to evaluate and model agnostic. The strong correlation in our tests between MixMatch accuracy and the proposed DeDiMs suggests that this approach can be a good fit for quantitatively ranking different unlabelled datasets prior to SSDL training.

Want to Gather? No Need to Chatter!

A team of mobile agents with different labels, starting from different nodes of an unknown anonymous network, must meet at the same node and declare that they all met. This task of gathering was traditionally considered assuming that agents at the same node can exchange information. We ask if this ability of talking is needed. The answer turns out to be no. We design two deterministic algorithms that accomplish gathering in a much weaker model. We only assume that each agent knows how many agents are at the node that it currently occupies. Our first algorithm assumes that agents know some upper bound N on the size of the network, and works in time polynomial in N and in the length of the smallest label. Our second algorithm does not assume any knowledge about the network, but its complexity is at least exponential in the size of the network and in the labels of agents. Its purpose is to show feasibility of gathering under this harsher scenario. As a by-product we solve, in the same weak model, the fundamental problem of leader election among agents. As an application we solve the gossiping problem in this model: if each agent has a message, all agents can learn all messages. This is perhaps our most surprising finding: agents without any transmitting devices can solve the most general information exchange problem if they can count the number of agents present at visited nodes.

Kontribusi Kearifan Lokal Dalam Mewujudkan Pemilu Damai


 The theoretical dominance of direct local election is mainly based on western theory of democracy, local politics and development. There are plenty western theories used to analyze current Indonesian local politics, including direct local election. In fact, however, the problems of local direct election still take place in many forms of disadvantages. These problems are, for instance, money politics, riots, long conflicts, black campaigns and so forth. In order to minimize these problems, local wisdom based on Javanese values is important in contribution to solve the relevant problems. There are many Javanese value based local wisdom that may useful to be implemented.
 Keywords: local direct elections, local wisdom, Javanese values, local politics.

Teaching Case

Democracy is based on education according to Socrates (470-390 B.C.) A lack of education leads to election problems. The 2020 presidential election has raised questions of election fraud and rigged software and the integrity of the results. Such questions can be resolved through election technology & security education. Education can put you in a position of knowledge if you find yourself in a discussion on voter fraud. The purpose of this paper is to propose a curriculum for different courses on election security and election technology to educate people. Individuals’ trust of an election can be impacted by education which may overriding propaganda, and fake news. Proposed curriculum also covers misleading election numbers from statistics and Benford's Law.

Central node selection algorithm of minimizing maximum weighted response time based on dynamic programming

In order to minimize the maximum weighted response time for any node in the network to reach the central control node, a central control node election algorithm based on dynamic programming is proposed. Firstly, the response times of nodes and links in the wireless network are modeled as the node weights and edge weights in the network topology, and then the central control node election problem that minimizes the maximum weighted response time for any node in the network to reach the central control node is modeled as the central problem, where represents the number of central control nodes. Then, by using the interpolation method based on dynamic programming, the weighted response time between the two points can be obtained, and the K-central problem modeled is transformed into several R-control set problems. Then, several control R-set problems are transformed into several 0-1 integer programming problems, and each integer programming problem can be solved one by one by using the branch and bound method. Finally, a simplified implementation method based on the above algorithm is given when K=1, the optimality of the proposed algorithm is proved and the complexity of the algorithm is analyzed. Simulation results show that the proposed central control algorithm can minimize the maximum weighted response time of the network.

The Problem of Elections to the Crimean Regional Sejm during the Civil War

The article is devoted to the failed elections to the Crimean Regional Sejm — the regional parliament of Crimea, which was to have been elected on April 6–8, 1919. The paper analyzes the course of the campaign, the features of the electoral law, and lists candidates from various political parties and national groups. The elections to the Sejm were a result of the compromise between the Constitutional Democrats and the Socialist Revolutionaries during the formation of the second Crimean regional government in the autumn of 1918. By the beginning of 1919, when the Red Army had approached the borders of Crimea, it became clear that it would be difficult to hold elections in the existing conditions. The issue of elections became one of the main factors of internal political instability in Crimea and caused the conflict between the liberal government, the socialist opposition, and the leadership of the White Movement. The election campaign was sluggish; absenteeism was predominant among most of the electorate (with the exception of Crimean Tatars), which was fueled by underground Bolshevik organizations actively campaigning for a boycott of the vote. Both the Constitutional Democrats, the Social Revolutionaries, and the Mensheviks understood all the risks associated with holding the elections under martial law, but they did not dare cancel them and deviate from democratic principles, although it was quite clear that the workers’ and peasants’ masses of Crimea did not need any Sejm. The vote was postponed (and actually canceled) only on April 1, 1919, after the Soviet military units reached Perekop.

On the Expressiveness of Mixed Choice Sessions

Session types provide a flexible programming style for structuring interaction, and are used to guarantee a safe and consistent composition of distributed processes. Traditional session types include only one-directional input (external) and output (internal) guarded choices. This prevents the session-processes to explore the full expressive power of the pi-calculus where the mixed choices are proved more expressive than the (non-mixed) guarded choices. To account this issue, recently Casal, Mordido, and Vasconcelos proposed the binary session types with mixed choices (CMV+). This paper carries a surprising, unfortunate result on CMV+: in spite of an inclusion of unrestricted channels with mixed choice, CMV+'s mixed choice is rather separate and not mixed. We prove this negative result using two methodologies (using either the leader election problem or a synchronisation pattern as distinguishing feature), showing that there exists no good encoding from the pi-calculus into CMV+, preserving distribution. We then close their open problem on the encoding from CMV+ into CMV (without mixed choice), proving its soundness and thereby that the encoding is good up to coupled similarity.

Избрание и утверждение казахских ханов в условиях укрепления позиций Российской империи во второй половине XVIII в.

The article studies the problem of functioning of the khan’s power in the Kazakh society in the second half of the XVIII century. At this time, the Russian border administration attempted to strengthen its influence onKazakh society, which was manifested in a policy aimed at transforming the procedure of electing and legitimizing Kazakh khans. The purpose of the article is to study the problem of election of Kazakh khans in the conditions of attempts of the Imperial administration to influence the process and procedure of election and approval of Kazakh rulers in the Khan’s dignity in the second half of the XVIII century. An important task is to show how these attempts were implemented and what results they led to. Another task is to show the procedure of election and approval of Kazakh khans and the innovations that appeared under the influence of the Russian authorities based on archival materials. The article uses materials from the Archive of Foreign Policy of the Russian Empire, Russian State Military Historical Archive, Russian State Archive of Ancient Acts, as well as published documents and materials. Since the middle of the XVIII century, the Orenburg administration made attempts to influence the election of Nurali Khan of the Small Horde, who became the first Kazakh ruler to be confirmed in the dignity of Khan by the Russian monarch. In the Middle Horde, the introduction of this innovation was delayed, which was primarily due to the position and real capabilities of the Sultan, and then Ablai Khan. Having established a noticeable control over the Kazakh clans of the Middle Horde while still a Sultan, he continued to strengthen his influence among the Kazakhs, which drew the attention of the Russian administration to him. In the late 1750s, he offered the title of Khan, with the condition of approval in this title in St. Petersburg, but this attempt was unsuccessful. The next attempt was made in the 1770s, when Ablai, who had been already elected Khan by the Kazakhs, asked to approve St. Petersburg in this dignity. Despite the obvious influence of the Russian Empire on the process of approval of Kazakh rulers by the khans, throughout the XVIII and even later, the Kazakhs retained many elements related to the procedure of election and proclamation of khans.