Free 2010 midterm elections software for linux

CElect provides a tool for finding preferential ballot election winners and PR council sets.

CElect is a console-based tool for determining a social preference ordering, such as an elected candidate or choice in a single-winner election, or the preferred composition of a multi-member council, based on a list of individual preference orderings (ballots) over the candidates or choices.

It can also calculate the winner and social ordering when given a Condorcet matrix and list of candidates, though it is in that case limited to Condorcet methods.

Of single-winner methods, it supports Dodgson, Simpson, Tideman/wv, first and second-order Copeland, and Schulze (all Condorcet methods), and FPTP, Borda, 1/n Borda, Hare, Nanson, and 1/n Nanson.

Of proportional representation, it supports CPO-STV, CFPRM, and DHondt without lists.

DNS Domain Expiration Check is a utility for checking DNS domain expiration dates.

domain-check queries WHOIS data in realtime, and can be integrated with cron to provide e-mail notifications prior to a domain expiring.

The first example will print the expiration date and registrar for daemons.net:

$ domain-check.sh -d daemons.net

Domain Registrar Status Expires Days Left
----------------------------------- ----------------- -------- ----------- ---------
daemons.net INTERCOSMOS MEDIA Valid 13-feb-2006 64


The second example prints the expiration date and registrar for the domains listed in the file "domains":

$ domain-check.sh -f domains

Domain Registrar Status Expires Days Left
----------------------------------- ----------------- -------- ----------- ---------
sun.com NETWORK SOLUTIONS Valid 20-mar-2010 1560
google.com EMARKMONITOR INC. Valid 14-sep-2011 2103
daemons.net INTERCOSMOS MEDIA Valid 13-feb-2006 64
spotch.com GANDI Valid 03-dec-2006 357


The third example will e-mail the address admin@daemons.net with the domains that will expire in 60-days or less:

$ domain-check -a -f domains -q -x 60 -e admin@daemons.net

rblsd is a small, fast, SpamAssassin-compatible spam filter. It filters mail by performing a series of RBL lookups on each message. This results in fast, accurate, low-load spam filtration. This can be used as a standalone, replacement for SpamAssassin, or as an secondary filter to increase mail throughput.
As for the folks here in collegeland, were getting to that point in the semester when we discover its the fifth week already, and midterms are coming up, and all of a sudden, weve got tests. I have nearly completed a major improvement to the internal loop (the backbone of the server), but dont use it right now, because clients wont time out (you should note that the development version in cvs is rarely usable for real mail, and sometimes it wont even run normally). Here are features that Im planning for the fifth release:
Compatibility with firedns To me, rblsd and firedns seem meant for each other. This is optional, of course, just be sure your OS has copy-on-write :-).
Multiple-user configurations, with flexible passwd files.
A "lite" version, that processes a single piece of mail from input. rblsd was designed for a high volume of mail, and is indeed optimized for this, but I could create a light-weight mail filter that uses the rich ruleset of rblsd for a less hardcore user.
The ability to record marked spam (in its unprocessed form) for any reason you may need a collection of spam mails (to train a smart filter perhaps? Vipuls Razor?)
Of course, a few new knobs to turn, in order to best reduce spam, based on your particular mail flow patterns.
And of course, performance improvements.
Hopefully this will get done by November. It is possible I may have to put this off till winter break, in which case, late December, at the latest. Ill try to give occasional progress reports, so check the site back if youre interested. Meanwhile, Im going to drift back into college life and prioritize my obligations there. Have fun out there in the real world!
Enhancements:
- Countless internal changes, clean-ups, and minor bugfixes made.
- Fixed support for new resolver libraries (BIND-9).
- spamc2 rebuilt from the ground up (built from SpamAssassins spamc).
- Cleaned up the appearance of the filtered messages.
- Improved hash table performance (faster responses).
- Documentation rewritten.
- Configuration file added (see rblsd.conf).
- Custom rules based on header IP addresses added.
- Support for blacklists and whitelists via SpamAssassin configuration file added.
- Network access rules added.

ProjectCenter is GNUsteps integrated developement environment (IDE). It is based in part on NeXTs original Project Builder. It assists you in starting new projects and lets you manage your project files using a intuitive and well ordered graphical user interface.

Serg Stoyan is the current maintainer of ProjectCenter. Please contact him if you would like to submit a bug report or volunteer to improve ProjectCenter. The original author of ProjectCenter, Philippe C.D. Robert, no longer actively contributes to the application.

Over a decade ago, NeXT Computer Inc. revolutionized application development by making two great developer tools available for their operation system OPENSTEP: Project Builder and Interface Builder. These applications made application development much easier and faster and took NeXT ahead of the other computer manufacturers and operating system vendors.

Supporting the project types Application, Bundle, Library, Tool, and Aggregate, ProjectCenter automatically creates the project makefiles and aids you in the process of editing, project compilation, package building and debugging. In the future, built-in CVS support will be available, too.

ProjectCenter is a very useable application, but is still evolving. Support is there for project creation and inspection as well as basic Makefile generation. Using the Application project type, you can already create graphical applications using ProjectCenter and Gorm in conjunction.

GNUstep is a free, standard, object-oriented, cross-platform development environment meant to provide generalized visual interface design, a cohesive user interface, and look good as well. GNUstep is based on and completely compatible with the OpenStep specification developed by NeXT (now Apple Computer Inc.).
GNUstep is a whole load of things, but primarily a framework (libraries, tools, applications) for developing software. It is not a not a window manager. And the libraries are not used by WindowMaker at present, although WindowMaker shares a similar look.

At no stage will you ever run GNUstep - you will run applications and tools and will make use of its services. At some point you may well find packages distributed as GNUstep systems in the way that you get GNU/Linux systems packaged today. Look at Simply GNUstep, the GNUstep Live CD, and Project Backbone for examples.

The ProjectCenter will hopefully consist of the following capabilities somewhen in the midterm future:

* Project management
This includes versioning control, automatic makefile generation, file management etc.

* Source code editing facilities
A builtin editor will be available in a future release. This has not main priority, though.

* Debugging fascilities
A builtin debugger will be added to ProjectCenter as soon as possible!

* Documentation automation help
Automatic documentation generation using autogsdoc or another tool will be introduced later.

* UML-based case tool

American Political Science: Campaign Simulator project is a statistically based political campaign simulation game.
The Campaign Simulator is an attempt to statistically model and predict the outcome of an American presidential election.
Several users assume the roles of competitive candidates and inflict the repercussions of certain decisions on a GSS-based dataset.
The application is written in Java and supports all operating systems with a Java 1.5 VM.
Main features:
- Time is not the only limiting variable. In fact, time may not be the proper limit as most operations may be performed in tandem; an economic system that allows fund raising elements should be implemented.
- The current choices all utilize the same dataset algorithm to effect the populace in similar ways- this set of scripts should be broadened and deepened as they are too high level.
- The Python Architecture needs polishing- the internal IDE is not complete, and the ability to assign scripts to run at differing points in the lifetime of the application has yet to be created.
- The installer should place links on the desktops of Mac and Unix/Linux Systems.
- Some of the small features planned, such as a GUI for dialog creation, have been cut for the deadline and should be added.

Statistics::RankOrder contains algorithms for determining overall rankings from a panel of judges.

SYNOPSIS

use Statistics::RankOrder;

my $r = Statistics::RankOrder->new();

$r->add_judge( [qw( A B C )] );
$r->add_judge( [qw( A C B )] );
$r->add_judge( [qw( B A C )] );

my %ranks = $r->mean_rank;
my %ranks = $r->trimmed_mean_rank(1);
my %ranks = $r->median_rank;
my %ranks = $r->best_majority_rank;

This module offers algorithms for combining the rank-ordering of candidates by a panel of judges. For the purpose of this module, the term "candidates" means candidates in an election, brands in a taste-test, competitors in a sporting event, and so on. "Judges" means those rank-ordering the candidates, whether these are event judges, voters, etc. Unlike "voting" algorithms (e.g. majority-rule or single-transferable-vote), these algorithms require judges to rank-order all candidates. (Ties may be permissible for some algorithms).

Algorithms included are:

Lowest-Mean
Trimmed-Lowest-Mean
Median-Rank
Best-of-Majority

In this alpha version, there is minimal error checking. Future versions will have more robust error checking and may have additional ranking methods such as pair-ranking methods.

FDDA project is a framework for the demonstration of distributed algorithms. (such as flooding or election algorithms), meant for learning and teaching.
After you program an algorithm, you may model a small network and FDDA will show how it works, mainly by visualizing the messages sent in the network
Main features:
- Program the algorithm, using the framework capabilities
- Model a small network on which the algorithm will run
- Then, you can demonstrate it, see how it reacts to errors, look at some statistics, ...