The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In order for an election system to be trusted, it needs to be verifiable. Methods must exist to check that the votes are cast as intended by the voters. There must be strong evidence that the machines function as they are supposed to function. Voters should feel confident that the election is conducted fairly and accurately. This paper first outlines the major concerns about election technologies...
The problem of summing a set of mutual recurrence relations with constant coefficients is investigated. A method is presented for summing an order d system of the form $A(n) = \sum_{i=1}^dM_iA(n-i) + G(n)$ , where A,G : ℕ → Km and M1,…,Md ∈ Mm(K) for some field K and natural number...
In election systems, there are many opportunities to incorporate forensic techniques and gather forensic evidence that can lead to determining the root cause of an anomaly. Although much has been written about security and forensic techniques in election systems, very little research has focused on measuring the forensic capabilities of election systems and mapping them to potential security safeguards...
We introduce a receipt election algorithm, the WAVE algorithm (Watch, Audit, Verify Elections) and audit trail. Based on set theory, the WAVE election algorithm is deliberately straightforward and intends to increase trust in elections and election transparency while maintaining voter privacy.
Distributive Partitioned Sort (DPS) is a fast internal sorting algorithm which rung in O(n) expected time on uniformly distributed data. Unfortunately, the method is biased toward such inputs, and its performance worsens as the data become increasingly nonuniform, such as with highly skewed distributions. An adaptation of DPS, which estimates the cumulative distribution function of the input data...
An important open question in the field of computational complexity in the development of nontrivial lower bounds on the number of logical operations required to compute switching functions. Although counting arguments can be used to show that most Boolean functions of n inputs and 0(n) or fewer outputs have complexity growing exponentially in n, no one has yet exhibited a particular such function...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.