Free feature set software for linux

FtpCube project is a multi-platform, graphical FTP client written in Python, using the wxPython graphical tookit.
FtpCubes interface is based on LeechFTP by Jan Debis but its codebase has been developed from scratch and includes functionality that surpasses the original LeechFTP.
FtpCube aims to provide a high quality user interface, as well as a rich feature set.
Main features:
- Threaded browsing and multi-threaded downloading
- Queuing of file transfers
- Site Management
- Recursive transfers
- Remote Directory Caching
- Internationalization
- ... and more
Enhancements:
- This release greatly improves the stability of the ftpcube 0.5.x line.
- The 0.5.x line brings many features to ftpcube, including updated wxPython support, SFTP integration, and much more.

Lingua::Phonology::Features is a module to handle a set of hierarchical features.

SYNOPSIS

use Lingua::Phonology;

my $phono = new Lingua::Phonology;
my $features = $phono->features;

# Add features programmatically
$features->add_feature(
Node => { type => privative, children => [Scalar, Binary, Privative] },
Scalar => { type => scalar },
Binary => { type => binary },
Privative => { type => privative }
);

# Drop features
$features->drop_feature(Privative);

# Load feature definitions from a file
$features->loadfile(phono.xml);

# Load default features
$features->loadfile;

Lingua::Phonology::Features allows you to create a hierarchy of features of various types, and includes methods for adding and deleting features and changing the relationships between them.

By "heirarchical features" we mean that some features dominate some other features, as in a tree. By having heirarchical features, it becomes possible to set multiple features at once by assigning to a node, and to indicate conceptually related features that are combined under the same node. This module, however, does not instantiate values of features, but only establishes the relationships between features.

Lingua::Phonology::Features recognizes multiple types of features. Features may be privative (which means that their legal values are either true or undef), binary (which means they may be true, false, or undef), or scalar (which means that their legal value may be anything). You can freely mix different kinds of features into the same set of features.

Finally, while this module provides a full set of methods to add and delete features programmatically, it also provides the option of reading feature definitions from a file. This is usually faster and more convenient. The method to do this is "loadfile". Lingua::Phonology::Features also comes with an extensive default feature set.

Fuzzy sets for Ada is a library providing implementations of confidence factors with the operations not, and, or, xor, +, and *, classical fuzzy sets with the set-theoretic operations and the operations of the possibility theory, intuitionistic fuzzy sets with the operations on them, fuzzy logic based on the intuitionistic fuzzy sets and the possibility theory; fuzzy numbers, both integer and floating-point with conventional arithmetical operations, and linguistic variables and sets of linguistic variables with operations on them. Fuzzy sets for Ada has support for string-oriented I/O.
Main features:
- Confidence factors with the operations not, and, or, xor, +, *;
- Classical fuzzy sets with the set-theoretic operations and the operations of the possibility theory;
- Intuitionistic fuzzy sets with the operations on them;
- Fuzzy logic based on the intuitionistic fuzzy sets and the possibility theory;
- Fuzzy numbers both integer and floating-point ones with conventional arithmetical operations;
- Dimensioned fuzzy numbers;
- Linguistic variables and sets of linguistic variables with operations on them;
- String-oriented I/O is supported.
Enhancements:
- The code was tested with GNAT Ada 2005 (GCC 4.0.2 20051125).
- A bug was fixed in Fuzzy.Linguistics.Sets.Defuzzify, which led to incorrect defuzzification with a descending membership function.

Timos rescue CD set provides an easy way to generate bootable CDROMs with a ready-to-use rescue system on them. The system is designed to be fully customizable and easy to build.
The rescue system includes reiserfs, parted, partimage, nmap, w3m, bash, sshd, telnetd, ftpd, and nfsd. It is based on Debians "Sarge" release. LILO, syslinux, isolinux, and GRUB are supported.
The project is evolving more and more into a "Debian on CD" project, which means that its use is not limited to a rescue CD; it is also possible to install a whole Debian system on CD.
Enhancements:
- the cdrecord script was buggy - fixed

Unicode::Regex::Set is a subtraction and intersection of Character Sets in Unicode Regular Expressions.

SYNOPSIS

use Unicode::Regex::Set qw(parse);

$regex = parse([p{Latin} & p{L&} - A-Z]);

Perl 5.8.0 misses subtraction and intersection of characters, which is described in Unicode Regular Expressions (UTS #18). This module provides a mimic syntax of character classes including subtraction and intersection, taking advantage of look-ahead assertions.

The syntax provided by this module is considerably incompatible with the standard Perls regex syntax.

Any whitespace character (that matches /s/) is allowed between any tokens. Square brackets ([ and ]) are used for grouping. A literal whitespace and square brackets must be backslashed (escaped with a backslash, ). You cannot put literal ] at the start of a group.

A POSIX-style character class like [:alpha:] is allowed since its [ is not a literal.
SEPARATORS (& for intersection, | for union, and - for subtraction) should be enclosed with one or more whitespaces. E.g. [A&Z] is a list of A, &, Z. [A-Z] is a character range from A to Z. [A-Z - Z] is a set by removal of [Z] from [A-Z].
Union operator | may be omitted. E.g. [A-Z | a-z] is equivalent to [A-Z a-z], and also to [A-Za-z].

Intersection operator & has high precedence, so [p{A} p{B} & p{C} p{D}] is equivalent to [p{A} | [p{B} & p{C}] | p{D}].

Subtraction operator - has low precedence, so [p{A} p{B} - p{C} p{D}] is equivalent to [[p{A} | p{B}] - [p{C} | p{D}] ].

[p{A} - p{B} - p{C}] is a set by removal of p{B} and p{C} from p{A}. It is equivalent to [p{A} - [p{B} p{C}]] and [p{A} - p{B} p{C}].

Negation. when ^ just after a group-opening [, i.e. when they are combined as [^, all the tokens following are negated. E.g. [^A-Z a-z] matches anything but neither [A-Z] nor [a-z]. More clearly you can say this with grouping as [^ [A-Z a-z]].

If ^ that is not next to [ is prefixed to a sequence of literal characters, character ranges, and/or metacharacters, such a ^ only negates that sequence; e.g. [A-Z ^p{Latin}] matches A-Z or a non-Latin character. But [A-Z [^p{Latin}]] (or [A-Z P{Latin}], for this is a simple case) is recommended for clarity.

If you want to remove anything other than PERL from [A-Z], use [A-Z & PERL] as well as [A-Z - [^PERL]]. Similarly, if you want to intersect [A-Z] and a thing not JUNK, use [A-Z - JUNK] as well as [A-Z & [^JUNK]].