Free to calculate software for linux

Date Calculator is a date calculator application written in pyqt. You can add or subtract days to a date, or calculate the number of days between two dates.

You can also choose to run your calculations using only working days and/or calculate inclusive of the start/end dates. There is a comprehensive gui for setting holiday dates.

Holidays can be fixed annual dates, variable dates, such as "the 1st Monday in June" or "the closest Monday to 22 February". This utility could be useful for people who need to be able to calculate time critical deadlines, such as lawyers.

Date Calculator application is also available as a superkaramba theme. You can download both from the download link.

Calorie Burning Calculator project is a free, nicely-formatted online calculator to help your web site visitors calculate how many calories they require a day to maintain their body weight, or basal metabolic rate (BMR).
Main features:
- Calorie Burning Calculator is easy to install, just unzip, upload and youre done!
- Simple interface makes it easy for visitors to use the calculator, and will encourage them to come back to use it again and again!
- Adjust the Calorie Burning Calculator to fit the look and feel of your own site.
- A great way to add some extra content to your health related web site.
- Calorie Burning Calculator is completely free!

Metroid Ultimate Sidebar allows you to calculate your point change in mph.

Calculate your point change in mph or find out your rank and get on the front page of mphtools.com!

Just add the toolbar icon to a toolbar or open the bar using alt M.

Scalar::Defer is a Perl module to calculate values on demand.

SYNOPSIS

use Scalar::Defer; # exports defer and lazy

my ($x, $y);
my $dv = defer { ++$x }; # a deferred value (not memoized)
my $lv = lazy { ++$y }; # a lazy value (memoized)

print "$dv $dv $dv"; # 1 2 3
print "$lv $lv $lv"; # 1 1 1

my $forced = force $dv; # force a normal value out of $dv

print "$forced $forced $forced"; # 4 4 4

This module exports two functions, defer and lazy, for building values that are evaluated on demand. It also exports a force function to force evaluation of a deferred value.

defer {...}

Takes a block or a code reference, and returns a deferred value. Each time that value is demanded, the block is evaluated again to yield a fresh result.

lazy {...}

Like defer, except the value is computed at most once. Subsequent evaluation will simply use the cached result.

force $value

Force evaluation of a deferred value to return a normal value. If $value was already normal value, then force simply returns it.

NOTES

Deferred values are not considered objects (ref on them returns 0), although you can still call methods on them, in which case the invocant is always the forced value.

Unlike the tie-based Data::Lazy, this module operates on values, not variables. Therefore, assigning into $dv and $lv above will simply replace the value, instead of triggering a STORE method call.

Also, thanks to the overload-based implementation, this module is about 2x faster than Data::Lazy.

Sonic Visualiser is an application for viewing and analysing the contents of music audio files.
The aim of Sonic Visualiser is to be the program you reach for when you find a musical recording you want to study rather than simply hear.
As well as a number of features designed to make exploring audio data as revealing and fun as possible, Sonic Visualiser also has powerful annotation capabilities to help you to describe what you find, and the ability to run automated annotation and analysis plugins in the new Vamp analysis plugin format.
We hope Sonic Visualiser will be of particular interest to musicologists, archivists, signal-processing researchers and anyone else looking for a friendly way to take a look at what lies inside the audio file.
Main features:
- Load audio files in WAV, Ogg and MP3 formats, and view their waveforms.
- Look at audio visualisations such as spectrogram views, with interactive adjustment of display parameters.
- Annotate audio data by adding labelled time points and defining segments, point values and curves.
- Overlay annotations on top of one another with aligned scales, and overlay annotations on top of waveform or spectrogram views.
- View the same data at multiple time resolutions simultaneously (for close-up and overview).
- Run feature-extraction plugins to calculate annotations automatically, using algorithms such as beat trackers, pitch detectors and so on.
- Import annotation layers from various text file formats.
- Import note data from MIDI files, view it alongside other frequency scales, and play it with the original audio.
- Play back the audio plus synthesised annotations, taking care to synchronise playback with display.
- Select areas of interest, optionally snapping to nearby feature locations, and audition individual and comparative selections in seamless loops.
- Time-stretch playback, slowing it down to as little as 10% of the original speed while retaining a synchronised display.
- Export audio regions and annotation layers to external files.
The design goals for Sonic Visualiser are:
- To provide the best available core waveform and spectrogram audio visualisations for use with substantial files of music audio data.
- To facilitate ready comparisons between different kinds of data, for example by making it easy to overlay one set of data on another, or display the same data in more than one way at the same time.
- To be straightforward. The user interface should be simpler to learn and to explain than the internal data structures. In this respect, Sonic Visualiser aims to resemble a consumer audio application.
- To be responsive, slick, and enjoyable. Even if you have to wait for your results to be calculated, you should be able to do something else with the audio data while you wait. Sonic Visualiser is pervasively multithreaded, loves multiprocessor and multicore systems, and can make good use of fast processors with plenty of memory.
- To handle large data sets. The work Sonic Visualiser does is intrinsically processor-hungry and (often) memory-hungry, but the aim is to allow you to work with long audio files on machines with modest CPU and memory where reasonable. (Disk space is another matter. Sonic Visualiser eats that.)

The Network Security Monitor Daemon is a lightweight network security monitor for TCP/IP LANs. It will capture certain network events and record them in a relational database. The recorded data is available for analysis through a CGI-based interface.
You can run test version with ./Monitord, just to see how it works. Production version should be run in background, v.g. with nohup ./monitord &. Both versions will accept a device name as a parameter (default: eth0). You can send them SIGHUP at any time to print some stats. If you send SIGTERM, SIGQUIT or SIGINT, all threads will end gracefully.
Enhancements:
- Linux Kernel with "packet sockets" and "socket filtering" support.
- GNU C Library 2 (glibc2) with LinuxThreads support. (integrated in most recent versions).
- Full MySQL, including headers and libmysqlclient_r.
- GNU C Compiler (gcc).
- GNU Make (make).
- Perl (perl).
- Wget (wget).
Enhancements:
- Added chmod 4755 ... in Makefile
- Root should run make now, but not the daemon ;-)
- The daemon will drop root privileges as soon as possible
- (after creating the raw socket with an attached linux socket
- filter and putting the interface in promiscuous mode)
- No threads run with root privileges so its much safer
- (specially the new server thread which reads remote user input)
- Added stats thread
- To calculate/mantain exponential averages
- Added server thread
- It accepts HTTP requests and serves stats in XML

JSmancala project is a Javascript/DHTML implementation of the strategy board game "Mancala". Runs in the browser with several challenging computer intelligence levels. Play human versus computer, human versus human or computer versus computer.

JSmancala is a Javascript/DHTML implementation of the board game "Mancala". Traditionally, Mancala is played with small stones on a wooden board with little cups scooped out.

Mancala is very easy to play. It is a two player game. The object is to collect as many of the stones as possible.

Each player controls one side of the board. On a traditional (real) board, the player controls the side closest to him. Each side of the board has six "cups" and one "jar". The "cups" are spaces along the length of the board and the "jar" is a larger space at the end of the board. When the game begins, each "cup" contains 4 stones and each "jar" is empty.
Play begins when one player selects a "cup" on his side of the board and removes all of the stones from it. The stones are then redistributed in the other "cups" on the players side, one stone at a time, moving toward the right. If any stones remain after the last "cup" has had a stone added to it, one stone is placed in the players "jar" and the redistribution continues on the opponents side of the board. Redistribution continues in a counterclockwise manner until all the stones have been placed. No stones are ever placed in the opponents jar when the player is making his move.

Once a stone is placed in a players "jar", it cannot be removed.
There are two twists. First, if the last stone being redistributed lands in the players "jar", the player gains an extra turn.

Second, if the last stone being redistributed lands in an empty "cup" on the players side of the board and the "cup" on the opposite side of the board is not empty, the stones in both "cups" are "captured". Captured stones are immediately removed from both "cups" and placed in the players "jar".

Play ends when there are no stones in any "cup" on one of the sides of the board, regardless of whose turn it is.

A players score is determined by totalling all of the stones in his "cups" and his "jar". The player with the highest score wins.

This version allows the user to play the computer, another human or watch the computer play itself. The computer players have five levels of "intelligence", rated from "foolish" to "wise". An "advice" button is also provided that the player may click at any time during his turn. It will use the "computer intelligence level" set for the player to calculate the best move. That move will be highlighted on the board.

Search::VectorSpace is a very basic vector-space search engine.

SYNOPSIS

use Search::VectorSpace;

my @docs = ...;
my $engine = Search::VectorSpace->new( docs => @docs, threshold => .04);
$engine->build_index();

while ( my $query = ) {
my %results = $engine->search( $query );
print join "n", keys %results;
}

This module takes a list of documents (in English) and builds a simple in-memory search engine using a vector space model. Documents are stored as PDL objects, and after the initial indexing phase, the search should be very fast. This implementation applies a rudimentary stop list to filter out very common words, and uses a cosine measure to calculate document similarity. All documents above a user-configurable similarity threshold are returned.