Free lookup anyone software for linux

Geo::Lookup::ByTime is a Perl module to lookup location by time.

SYNOPSIS

use Geo::Lookup::ByTime;

$lookup = Geo::Lookup::ByTime->new( @points );
my $pt = $lookup->nearest( $tm );

Given a set of timestamped locations guess the location at a particular time. This is a useful operation for, e.g., adding location information to pictures based on their timestamp and a GPS trace that covers the same time period.

INTERFACE

new( [ points ] )

Create a new object optionally supplying a list of points. The points may be supplied as an array or as a reference to an array. Each point may be a reference to a hash containing at least the keys lat, lon and time or a reference to an object that supports accessor methods called latitude, longitude and time.

If a coderef is supplied it is assumed to be an iterator that may be called repeatedly to yield a set of points.

add_points( [ points ] )

Add points. The specification for what constitutes a point is the same as for new.

nearest( $time [ , $max_dist ] )

Return a hash indicating the estimated position at the specified time. The returned hash has lat, lon and time keys like this:

my $best = {
lat => 54.29344,
lon => -2.02393,
time => $time
};

Returns undef if the position cant be computed. By default a position will be calculated for any point that lies within the range of time covered by the reference points. Optionally $max_dist may be specified in which case undef will be returned if the closest real point is more than that many metres away from the computed point.
If the requested time coincides exactly with the timestamp of one of the points the returned point will be at the same location as the matching point. If the time falls between the timestamps of two points the returned point will be linearly interpolated from those two points.

In an array context returns a list containing the synthetic point at the specified time (i.e. the value that would be returned in scalar context), the closest real point and the distance between the two in metres

my ($best, $nearest, $dist) = $lookup->nearest( $tm );

get_points()

Return a reference to an array containing all the points in ascending time order.

time_range()

Return as a two element list the time range from earliest to latest of the points in the index. Returns undef if the index is empty.

hav_distance($pt, ...)

Exportable function. Computes the Haversine distance in metres along the line described by the points passed in. Points must be references to hashes with keys lat and lon.

Anyone who has spent enough time in Linux probably believes that you can never have enough control.

LPQ Control PHP script is a tool that parses the output of the lpq command and provides a web interface that allows you to remove print jobs from a printer.

You need to make sure that Apache can execute the lprm command. For a
default Apache installation, you will need to add the following line to
your /etc/sudoers file:

apache ALL=(root) NOPASSWD:/usr/bin/lprm

This allows the PHP program to remove *ANY* specified print job.

KaPooka project is a logic game involving pushing blobbies around and finding your way to the exit.

Its kind of a cross between Sokoban and Pengo with regards to gameplay.

You move your red blobby around, pushing the green blobbies out of the way and finding the exit.

The game currently consists of 30 levels.

Anyone that feels like contributing other levels is most welcome.

SDLjump is a clone of the Xjump game. Jump as long as you can!

SDLjump is a clone of the simple yet addictive game Xjump, adding new features like multiplaying, unlimited FPS, smooth floor falling, themable graphics etc...

The goal in this game is to jump to the next floor so you dont fall down. As you go upper in the Falling Tower the floors will fall faster.

Try to survive longer than anyone. It might seem too simple but once youve tried youll realize how addictive this is.

Search-Engine-Optimized project is a free online resource for anyone who wants to step up their search engine optimization strategies to the next gear.
The web is a constantly changing place, expecially search engines, but there are numerous search engine optimization strategies that are consistant across all the major search engines, and are probably going to be very useful for a long time to come.
Read on to learn what they are and how to employ them in the development of your web site.
Main features:
SEO Rank Checker is a nice little script for checking your keyword status for a few select keywords without going through the trouble of checking the search engine result pages yourself.
- Automated fetching of the top 100 results for MSN, Yahoo and Google to check for your site.
- Easy to read, compare and print output
- Installation is super easy, just upload to your server and youre done!
- Super small script, just a few KBs of space!

WoodPusher is a chess application written in C# for the Mono framework.

While in early development, the intention is for WoodPusher to become a full-featured chess application, including the ability to connect to ICS (Internet Chess Servers), play against engines such as Crafty, Phalanx, and gnuchess, and lookup positions in move databases.

Initially Were focusing on its ICS client abilities. This is a great project to get involved with if you want to get your hands dirty with some C# and Gtk#.

AFELO allows you to compress and send images to your webserver.

Compressing images and sending them to your webserver has never been so easy before! AFELO allows to select images on your local computer, to resize and compress them and to send them to your server with only a few clicks!

AFELO is free and can be used by anyone! You can send your images to your OLEFA server (using your usual OLEFA username & password), to any other website (via FTP) or save them to your local computer.

AFELO can be used on any computer and is fully compatible with Microsoft Windows, Apple MacOS X and Linux/UNIX operating systems!