Free their time software for linux

WMitime is yet another clock dock app (and quite overglorified at that! WMitime shows standard time, date, as well as the new internet time (see www.swatch.com)

Multiple Time Sheets is a simple tool to help you keep track of how many hours you work and for whom.
It differs from most time-tracking software because its designed to work like paper that magically totals up hours.
Main features:
- Uses text files, requiring no database.
- Supports only one user per app, for simpler code.
- Sends and tracks invoices, and payments thereof.
- Features a rudimentary to-do list that displays your list as an outline.
- Sends you a backup of your data automatically.
- Assume the user prefers free-form data entry in text files rather than typing into forms.
- Uses the htmlMimeMail.php class by Richard Heye (phpguru.org).
- CSV and OPML exports of some data.
- Automatic hyperlinking from MTS to your favorite web-based software.
Enhancements:
- This release added a feature that replaces text patterns with links so that strings like "Bug 10" can link to a bug tracking application.
- CSV export was added for the timesheet along with OPML export for the to-do list.

Network Time Tools (NTT) is a set of network tools designed to provide monitoring of a network and the services on that network, and provide various reports on the hosts/services and optional alerts via email, pager, and cellphones. It also has the capability to send messages on user-specified services to email, pagers and cell phones.
Main features:
- Bandwidth measurement based on time intervals
- Checks Service availibilty on specified Hosts for the following protocols:
- ftp
- ssh
- telnet
- dns
- http ( specific pages )
- www ( simple head )
- pop
- nntp
- imap
- irc
- smtp
- Ability to send alerts based on user specified services to:
- pagers
- cell phones
- email
- A frontend that displays a daily report that can be viewed by a web browser or cell phone.
- views specific servers
- views specific services
- views bandwidth measurements
- view alerts
- Data stored in a Mysql Database
- Easily configurable via an XML config file
- Runs in Daemon or one-shot mode

Ruby Time Tracker is a stable and complete time tracking system for small businesses that invoice for time spent by several employees on many projects.

Future Plans

Planned upgrades include:

Locking down past periods so that no entries can be made or changed after invoicing
Custom periods so that users may define billing cycles for thier company
Reminders sent to employees who have not made entries daily or at the end of a billing cycle

Two Versions

There are currently two versions in development. The professional version uses a MySQL database and requires some knowlege of installing and configuring Ruby on Rails applications to install. The lite version includes an installer that will install and configure an SQLight database and a webrick web server for easy installation. Development is being done on the professional version and periodically the lite version will be updated to include new functionality.

Bookmark Time is an Amarok script that lets you bookmark a point in time in a music file.

When you play it again, you can choose the bookmarked times from the mouse menu.

Simple Timetracker provides an application for keeping a record of time vs tasks.

Timetracker is a Java application for recording time spent on projects and activities.

PHP time management project is a Web-based time management application. You can enter scheduled items, copy items, and view them on a calendar.

A few minor items in the login page for the system were fixed.

Time::Skew is a Perl module that computes local clock skew with respect to a remote clock.

SYNOPISI

use Time::Skew

# Init Convex Hull and timing data
my $hull=[];
my $result={};

# Iterate data point introduction
Time::Skew::convexhull($result,$datapoint,$hull);

This module supports the computation of the skew between two clocks: the (relative) skew is the speed with which two clocks diverge. For instance, if yesterday two clocks, at the same time, showed respectively 10:00 and 10:05, while today when the former shows 10:00 the latter shows 10:04, we say that their relative skew is 1 minute/24 hours, roughly 7E-4.

The module contains one single subroutine, which accepts as input a pair of timestamps, associated to a message from host A to host B: the timestamps correspond to the time when the message was sent, and to the time when message is received. Each timestamp reflects the value of the local clock where the operation takes place: the clock of host A for the send, the clock of B for the receive.

Please note that the module does _not_ contain any message exchange facility, but only the mathematics needed to perform the skew approximation, once timestamps are known.

The subroutine takes as argument:

a reference to a hash where values related to the timing of the network path from A to B;
a 2-elems array (a data point in the sequel) containing the timestamp of the receive event, and the differece between the send timestamp and the receive timestamp for one message;
a stack containing some data points, those that form the convex hull.

The usage is very simple, and is illustrated by the following example:

#!/usr/bin/perl -w
use strict;
use Time::Skew;

# Initialize data
my $hull=[];
my $result={};
while ( 1 ) {
# Exchange message and acquire a new data point
my $datapoint = acquire();
# Call the convexhull subroutine
Time::Skew::convexhull($result,$datapoint,$hull);
# After first message some results are still undefined
( defined $result->{skewjitter} ) || next;
# here you can use the results

};
}

The data returned in the "result" hash is the following:

result->{skew} the clock skew;
result->{skewjitter} the variance of the skew estimate, used to estimate convergence;
result->{jitter} difference between the current delay and the previous delay;
result->{delay} the communication delay, decremented by a constant (yet unknown) value, used to compute communication jitter;
result->{elems} the number of data points in the convex hull;
result->{select} the index of the data point in the convex hull used to compute the skew;
result->{itimestamp} the timestamp, first element in the data point just passed to the subroutine;
result->{delta} the timestamp difference, second element in the data point just passed to the subroutine;

The data returned in the "hull" stack is a series of data points, selected from those passed to successive calls of the subroutine. The number of data points in the "hull" stack usually does not exceed 20 units.

The algorithm is very fast: each call consists in scanning at most all data points in the "hull" stack, performing simple arithmetic operations for each element.

The algorithm must be fed with a sequence of data points before returning significant results. The accuracy of the estimate keeps growing while new data points are passed to the subroutine. A rough rule of thumb to evaluate estimate accuracy is to observe the skew jitter, and assume it corresponds to the skew estimate accuracy. Paths with quite regular communication delay (small jitter) converge faster.