Free transcription jobs software for linux

Computation Job Management (jobman in short) is a program that calls executables according to a given program flow. Each executable is run in a separate process. It is useful when a project needs to carry out a series of calculations that are performed by software written in different languages or supplied by third parties, but invoking individual programs manually is error prone and hard to manage.
The various individual programs dont communicate with each other except via persistent storage. This is especially the case for some scientific computing, quantitative finance, and prototyped programming.
Enhancements:
- A job can output a status string indicating to skip other sibling jobs.
- Fixed a number of bugs.
- Mark the program in beta status as it has been used to manage jobs completed in days.

GNU mcron (Mellors cron) is a 100% compatible replacement for Vixie cron.

It is written in pure Guile, and allows configuration files to be written in scheme (as well as Vixies original format) for infinite flexibility in specifying when jobs should be run.

Mcron was written by Dale Mellor (see his personal web pages). Mcron was proposed to the FSF (2003-07-11) as a component of the GNU system, and accepted on 2003-12-02. Version 1.0.1 was the first release of mcron as a GNU package homed at gnu.org.

Lemonrip project is an Linux application for ripping and encoding DVD into AVI files. Design of application is using a quality profiles instead of technical settings.
In mostly cases everything you need to do is pick a title of DVD, choose your language and let it work.
Main features:
- written in Perl::GTK using mencoder as frontend
- qulity profiles, takes a care of all setting jobs
- language selection (subtitles are encoded in a movie only at this time)
- ripping into AVI files using XVID and X264 codecs with best qulity switchies enabled (default profiles)
- automatic cropping and scaling with preview
- options to eject DVD tray or turn off a computer when encoding is finished

WWW::Search::Brassring is a class for searching http://www.Brassring.com/jobsearch

SYNOPSIS

use WWW::Search;
my $oSearch = new WWW::Search(Brassring);
my $sQuery = WWW::Search::escape_query("java");
$oSearch->native_query($sQuery,
{city => San Diego,
st => CA,
prox => 10, # proximity to city, 10, 25, 50 miles
pp => 10}); # hits per page, 10, 25, 50
while (my $res = $oSearch->next_result()) { print "$res->{url} $res->{title} $res->{change_date} $res->{description}n";
}

This class is a Brassring specialization of WWW::Search. It handles making and interpreting Brassring searches at http://www.brassring.com/jobsearch.
By default, returned WWW::SearchResult objects contain only url, title and description which is a mixture of location and skills wanted.

OPTIONS

Query on Keywords, Title or Company

{q => programmer}

The following search options can be activated by sending a hash as the second argument to native_query().

Restrict search by country

{ctry => United States}

Sort jobs found

Sort by relevance: {like => likep}

Sort by posting date: {like => like}

Restrict jobs found by state (US)

{st => $st} - Only jobs in st $st.

Anarchist project is a tactics RPG.
Anarchist is a tactics RPG written in Java. It draws heavy influence from Final Fantasy Tactics in the way combat works. It is designed to run on any platform and have minimal system requirements. Anarchist is copyrighted under the GNU General Public License.
Enhancements:
- It has been ported to Java
- It is now graphical instead of ASCII
- Classes are now referred to as Jobs, to avoid confusing Java.
- The Jobs file has been split into a barebones Jobs file and a Skills file.
- Everything that relates to in-game definitions (such as the Jobs and Skills file, as well as maps) has been moved into a modules directory, ./modules/anarchist. This is to allow 3rd parties to develop their own plot and use the Anarchist engine. The "Anarchist" project is now both the Anarchist engine and the Anarchist module that uses the Anarchist engine.

Algorithm::Munkres is a Perl extension for Munkres solution to classical Assignment problem for square and rectangular matrices. This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square matrix by padding necessary zeros.

SYNOPSIS

use Algorithm::Munkres;
@mat = (
[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7],
);
assign(@mat,@out_mat);

Then the @out_mat array will have the output as: (0,3,1,2), where 0th element indicates that 0th row is assigned 0th column i.e value=2

1st element indicates that 1st row is assigned 3rd column i.e.value=1
2nd element indicates that 2nd row is assigned 1st column.i.e.value=2
3rd element indicates that 3rd row is assigned 2nd column.i.e.value=0

Assignment Problem: Given N jobs, N workers and the time taken by each worker to complete a job then how should the assignment of a Worker to a Job be done, so as to minimize the time taken.

Thus if we have 3 jobs p,q,r and 3 workers x,y,z such that:
x y z
p 2 4 7
q 3 9 5
r 8 2 9

where the cell values of the above matrix give the time required for the worker(given by column name) to complete the job(given by the row name)

then possible solutions are:

Total
1. 2, 9, 9 20
2. 2, 2, 5 9
3. 3, 4, 9 16
4. 3, 2, 7 12
5. 8, 9, 7 24
6. 8, 4, 5 17

Thus (2) is the optimal solution for the above problem. This kind of brute-force approach of solving Assignment problem quickly becomes slow and bulky as N grows, because the number of possible solution are N! and thus the task is to evaluate each and then find the optimal solution.(If N=10, number of possible solutions: 3628800 !)

Munkres gives us a solution to this problem, which is implemented in this module.

This module also solves Assignment problem for rectangular matrices (M x N) by converting them to square matrices by padding zeros. ex:

If input matrix is:

[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7]

i.e 3 x 4 then we will convert it to 4 x 4 and the modified input matrix will be:

[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7],
[0, 0, 0, 0]