Open Source Mac Voting Software

This script helps organizations to make polls of different types of positions with a number of candidates under each position. The script is not very stable and the code is still rough. Installation: i. Download the script and unzip it to your localhost or web server. Works best with Wamp server. ii. Import polling3.sql from the dbBackups folder in the admin folder. Use phpMyAdmin in this case or together with cPanel for online server. iii. Add login.html into the Apache configuration file to enable direct redirection to the system. If you don't know the config file, Google for more info about this!!! v. You're done! Hooray!!! Now you can test drive the system. Username: admin, Password: admin, URL: http://localhost/yoursite/admin; For the admin section. The rest is in the database tables. NB: Please use the "External Link" menus above to support this project in one way or another. PM me for other means. Any kind of support will be very much appreciated. Thanks a bunch.

Tracking Politicians Like Bugs. Using java, maven, spring 5.x, hibernate 5.2.x, ehcache 2.x, vaadin, javamelody.

Java software for computing seats distribution in a proportional voting scenario. D'Hondt, Saint-Lague and Hare-Nimeyer. For more info: https://sites.google.com/site/pubredi/social-choice/seats-calculator

ADSVote is an election result analyzer able to go from the raw results to a nice table and graph. Currently, it works for constituencies with proportional allocation methods like D'Hondt or Sainte-Lague.

Belief merging aims at combining several pieces of (possibly inconsistent) information coming from different sources. The goal is to produce a single consistent set of information, trying to keep the most of the information of the sources. A belief merging operator is the responsible for making the belief merging. With this tool you can compare the ΔΣ, ΔGMax and the Δps (PS-Merge) operators.

Belief revision is a central topic in knowledge representation and reasoning. It consists in incorporating a new belief, changing as few as possible of the original beliefs while preserving consistency. Revision always considers new evidence as a better belief. Such new evidence is usually represented in the form of a propositional formula which must be preserved after the revision. Here, the Δps (PS-Merge) belief merging operator is extended in order to consider constraints, and this extension is used as a strategy for belief revision. The new evidence is treated as a constraint so the extended merging operator can obtain the revised belief base.

This collection of Python3 modules provides a large range of implemented decision aiding algorithms useful in the field of outranking digraphs based Multiple Criteria Decision Aid (MCDA), especially best choice, linear ranking and absolute or relative rating algorithms with multiple incommensurable criteria. Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs.

The site for developing the new direct democratic website and platform based on Drupal, primarily used for the Swedish direct democracy party Direktdemokraterna.

Accompanying software for the paper "Optimal Decision Rules for the Discursive Dilemma", by A. Alabert, M. Farré and R. Montes (https://arxiv.org/abs/2210.13100). Computes a ranking of the best decision rules according to a quantitative criterion based on the minimisation of the combined probabilities of false positives and false negatives

OUT OF DATE: See the Singularity project here at sourceforge. This project aims to make the expanse of human knowledge beautifully presentable and the exabytes of data navigable by an average user via the power of a Unified Data Model and 3d visualization layer for the Web. It will invert the top 3 layers of the OSI network model to make a 3-dimensional presentation layer with a peer-to-peer session layer for the Internet. For the curious, there is a simple demo that provides a small sense of the possibilities. Requires: VPython available here or see http://vpython.org.

A dynamic flair for Stack Exchange sites inspired by Stack Exchange's native User Flairs (http://stackoverflow.com/users/flair/) with advanced features: • including sites with more than 101 reputation (compared to 200) • detailed reputation summary (compared to K and M abbreviations) • detailed statistics about Questions, Answers, Reputation, Gold, Silver and Bronze badges for each included site (compared to <null>) • updated in real-time (compared to 24–36 hrs) Please note the throttles the Stack Exchange API defines: https://api.stackexchange.com/docs/throttle IGB Stack Flair web page integration: https://sourceforge.net/p/igbstackflair/code/ci/master/tree/v1/igbstackflair.html IGB Stack Flair wiki page for Wikipedia Integration: https://sourceforge.net/p/igbstackflair/wiki/Wikipedia%20Integration/

A rich client to analyse data from a liquid-feedback (http://liquidfeedback.org/) instance, for now it's a 3d graph explorer to inspect the delegations. It's an application based on the eclipse platform (indigo). To be precise its a directed weighted multi graph browser in 3d. Find out more in the wiki https://sourceforge.net/p/lqfbanalyser/wiki/Home/ . Generated reports https://sourceforge.net/p/lqfbanalyser/wiki/generated%20lqfb%20reports/ .

This project allows you to create anonymus but controllable online surveys by generating one time passwords.

Issue Campaign web site. 3 pages are available: index to tell the issue, voters page, and administration page.

The purpose of this project is to create an open and transparent standard format in XML for trust metric data and aggregate contribution calculation.

This project is related to the Partito Pirata source code issueHere we host the development and sharing of the source code of the production into the Partito Pirata project. Every single bit in terms of information and source code will be available here for free

Google Desktop Gadget inspired by the 'Change the Web Challenge' and an application of the Social Actions API. Takes advantage of the Social Actions API, an open database of 60,000+ actions from over 40 action sources. See www.socialactions.com.

VoteCounter is a distributed voting program which can handle multiple clients over a network. VoteCounter is written in Java, and so it is very portable; VoteCounter's input is an XML file specifying posts to be voted for and nominees contesting them, and it's output is a human-readable tally of votes for each nominee, making it easy to use and customize. VoteCounter is still under development, but is ready to use for small elections. Help is welcome! VoteCounter is authored by Shardul C.

A tool for exploring records of nominative votes in various legislatures. Currently, it includes just one legislature -- the US Congress -- and one simple visualization. (Code for CPython and Jython.)

Uses the USGS Watershed Boundary Dataset and the 2010 US Census data to create representational voting districts with equivalent population.

A web-based system to assign a set of known persons anonymous ids, such that every person only receives one id. The ids cannot be mapped to the corresponding persons afterwards.

Little statistic for livejournal post's