Free tf software for linux

TeamFound provides a a team the capability to share search results without any usage-overhead.

TeamFound gives a team the capability to share search results without any usage-overhead. The toolbar can be used to mark interesting pages and full-text-search those while also showing normal search-engine results for the same keywords.

Go to http://teamfound.dyndns.org:8080/tf/tf and setup your own project, then enter your Project-ID into Menu/Tools/TeamFound/Settings.

Tumiki Fighters is a game where you salvage parts from enemies to enhance your firepower. Tumiki Fighters was created by Kenta Cho and ported to Linux by Evil Mr Henry.

Installation:

Tumiki Fighters is entirely contained within this directory. There is no installation. To uninstall, simply delete this directory.

Running:

Type ./tf from this directory to start the game. The command-line line switches listed in readme_e.txt should all work.

Compiling:

Install the OpenGL development libraries. (This is the hard part.)
Install the D compiler, version 0.106. (http://ftp.digitalmars.com/dmd.106.zip) Note that this is non-opensource, so if you cant run the binary, youre out of luck. If you dont like it, talk to digitalmars. I dont like it either. Also, any later versions of the D compiler will NOT work. 0.106 or earlier is needed. As a final note, the resultant binary will not work on other computers, due to problems in the D compiler.

Install SDL_mixer.

Compile with "make". The bulletML libraries will give a few warnings. Ignore them.

Known Issues:

The compiler is non-opensource.

Terrier project is a probabilistic Java toolkit for building search engines.
Terrier is software for the rapid development of Web, intranet, and desktop search engines.
More generally, it is a modular platform for building large-scale information retrieval applications, providing indexing and probabilistic retrieval functionalities.
It comes with a desktop search application.
Terrier has various cutting-edge features including parameter-free probabilistic retrieval approaches (such as Divergence from Randomness models), automatic query expansion/re-formulation methodologies, and efficient data compression techniques.
Terrier comes with a powerful proof-of-concept Desktop search application [Screenshots], and full TREC capabilities including the ability to index, query and evaluate the standard TREC collections, such as AP, WSJ, WT10G, .GOV and .GOV2.
Terrier is written in Java [Requirements] and has been successfully used for adhoc retrieval, Web search and cross-language retrieval, in a centralised or distributed setting.
Currently, it is also being used for running various applications.
Main features:
- Open Source (Mozilla Public Licence)
- Written in cross-platform Java
- Highly compressed disk data structures.
- Handling large-scale document collections.
- Direct file for efficient query expansion.
- Modular and open indexing and querying APIs.
- Testbed for indexing and retrieval from standard TREC test collections.
- Interactive querying application.
- Desktop search application for searching various types of documents.
- Input/output of gamma, unary and binary encoded integers for compressing streams or random access files.
- Standard evaluation of TREC ad-hoc and known-item search retrieval results.
- Indexing of tagged document collections, as well as documents of various formats, such as HTML, PDF, or Microsoft Word, Excel and Powerpoint files.
- Indexing of field information.
- Indexing of position information on a word, or a block level.
- Support for classic retrieval models, such as tf-idf, BM25 and Ponte-Croft language model, and Rocchios query expansion.
- Provides a number of Divergence From Randomness (DFR) document ranking models.
- Provides a number of parameter-free DFR term weighting models for automatic query expansion.
- Advanced query language that supports AND/NOT operators, phrase and proximity search.
- Flexible processing of terms through a pipeline of components, such as stop-words removers and stemmers.
Enhancements:
- This is a major update with improvements in indexing and retrieval functionalities, including faster indexing and retrieval, and new retrieval models (including models from Divergence from Randomness and Language modeling).
- It has support for much larger collections of documents, including TREC GOV2 collections (25M documents), merging of indices, and multi-lingual and non-English collections of documents.
- The documentation has been vastly improved.

Regexp::Common::time Perl module contains date and time regexps.

SYNOPSIS

use Regexp::Common qw(time);

# Piecemeal, Time::Format-like patterns
$RE{time}{tf}{-pat => pattern}

# Piecemeal, strftime-like patterns
$RE{time}{strftime}{-pat => pattern}

# Match ISO8601-style date/time strings
$RE{time}{iso}

# Fuzzy date patterns
# YEAR/MONTH/DAY
$RE{time}{ymd} # Most flexible
$RE{time}{YMD} # Strictest (equivalent to y4m2d2)
# Other available patterns: y2md, y4md, y2m2d2, y4m2d2

# MONTH/DAY/YEAR (American style)
$RE{time}{mdy} # Most flexible
$RE{time}{MDY} # Strictest (equivalent to m2d2y4)
# Other available patterns: mdy2, mdy4, m2d2y2, m2d2y4

# DAY/MONTH/YEAR (European style)
$RE{time}{mdy} # Most flexible
$RE{time}{MDY} # Strictest (equivalent to d2m2y4)
# Other available patterns: dmy2, dmy4, d2m2y2, d2m2y4

# Fuzzy time pattern
# HOUR/MINUTE/SECOND
$RE{time}{hms} # H: matches 1 or 2 digits; 12 or 24 hours
# M: matches 2 digits.
# S: matches 2 digits; may be omitted
# May be followed by "a", "am", "p.m.", etc.

This module creates regular expressions that can be used for parsing dates and times. See Regexp::Common for a general description of how to use this interface.

Parsing dates is a dirty business. Dates are generally specified in one of three possible orders: year/month/day, month/day/year, and day/month/year. Years can be specified with four digits or with two digits (with assumptions made about the century). Months can be specified as one digit, two digits, as a spelled-out name, or as a three-letter abbreviation. Day numbers can be one digit or two digits, with limits depending on the month (and, in the case of February, even the year). Also, different people use different punctuation for separating the various elements.
A human can easily recognize that "October 21, 2005" and "21.10.05" refer to the same date, but its tricky to get a program to come to the same conclusion. This module attempts to make it possible to do so, with a minimum of difficulty.

If you know the exact format of the data to be matched, use one of the specific, piecemeal pattern builders: tf or strftime. If there is some variability, use one of the fuzzy-matching patterns in the dmy, mdy, or ymd families. If the data are wildly variable, such as raw user input, give up and use the Date::Manip or Date::Parse module.

Time values are generally much simpler to parse than date values. Only one fuzzy pattern is provided, and it should suffice for most needs.