Free semi automatic software for linux

Automatic Firewall is a script that will automatically configure a firewall. If you are a broadband or dial-up user who doesnt have a firewall script, you need to get one to protect yourself. AutoFW is made to help you do that with no efforts.
Many people when connecting to the internet need a firewall script made for them so they can surf the net without being susceptible to various attacks. Most, if not all (until now :-), of the existing scripts are written for a large range of requirements and require some tweaking to make them work for a specific user. However many users do not know which parameters to fill in the script config file.
AutoFW intends to provide a simple firewall script that you just need to fire and forget. You make sure to run it on computer start-up or just before connecting to the net, and it will detect network condition and setup appropriate firewall rules for you.
In order to be "smart" AutoFW has to be limited, the current scope of AutoFW are standard broadband connections, it will also cover dial-up users and stand-alone servers.
AutoFW works only for Linux IPTables firewall and needs the iptables utility to update the firewall, it also needs the ifconfig utility, both of these are available on any standard install of a GNU/Linux machine.
AutoFW also needs the ip program which is part of the iproute2 package, sometimes also called iproute. It is available as a package for any standard GNU/Linux install, not it might not be installed in your particular.
There are two parts that do automatic detection, one is for interfaces and IPs and the other is for open listening ports.
The interface part looks at all the active interfaces in the machine and classifies them between internal and external. It does that by looking at the IPv4 address of the device. If it is one of:
127.0.0.0/8
10.0.0.0/8
172.16.0.0/12
192.168.0.0/16
it is considered to be an internal IP and thus an internal interface, otherwise it is an external IP and thus an external interface. There is no handling of an interface with both an internal and an external IP on it.
The listening ports are scanned for a known port and the accompanying known program name that binds to that port, known ports are opened later in the configuration stage.
The configuration itself is very simple for now, without many of the bell and whistles that exist in other scripts, but it works for the basic needs and provides adequate protection.
Enhancements:
- Internal systems are now protected, as well as servers and NAT gateways.

Sendmail application is a Mail Transfer Agent, which is the program that moves mail from one machine to another.

Sendmail implements a general internetwork mail routing facility, featuring aliasing and forwarding, automatic routing to network gateways, and flexible configuration.

Semi-Batched-Image-Editor program is an image editor for Linux.
The problem: Got a huge amount of scanned pictures (from your digital camera, or as Picture-CD from your favorite lab)? Want to rotate some of them to the right orientation? Select a good detail? Scale to a given output format? Want to do this with as less as possible mouseclicks?
The solution: SeBIE - the Semi-Batched-Image-Editor.
Main features:
- Input filename selection via regular expressions.
- Create output filename via regular expression and substitution.
- Select image details with a given proportion.
- Scale to a given output format when saving.
- Apply some color correction (at the moment only gamma curve correction is possible).
Why Semi-Batched? Because SeBIE is not fully batch processing. A rest of user interaction is still needed (and wanted).
SeBIE is written in C using the gdk/gtk (glib-2.0.7/gtk+-2.0.9) toolkit.
Installation:
Get the source distribution from the download page and unpack:
tar -xvzf sebie-0.9.tar.gz
Change to the sebie source directory:
cd sebie-0.9
Run the configure script:
./configure
Build the executable:
make all
And install it as root:
make install
Start the application using the command sebie....
Enhancements:
- Add events delete_event and destroy to main window.
- Handling resizable drawing area.

Bio::Tree::Compatible is a Perl module for testing compatibility of phylogenetic trees with nested taxa.

SYNOPSIS

use Bio::Tree::Compatible;
use Bio::TreeIO;
my $input = new Bio::TreeIO(-format => newick,
-file => input.tre);
my $t1 = $input->next_tree;
my $t2 = $input->next_tree;

my ($incompat, $ilabels, $inodes) = $t1->is_compatible($t2);
if ($incompat) {
my %cluster1 = %{ $t1->cluster_representation };
my %cluster2 = %{ $t2->cluster_representation };
print "incompatible treesn";
if (scalar(@$ilabels)) {
foreach my $label (@$ilabels) {
my $node1 = $t1->find_node(-id => $label);
my $node2 = $t2->find_node(-id => $label);
my @c1 = sort @{ $cluster1{$node1} };
my @c2 = sort @{ $cluster2{$node2} };
print "label $label";
print " cluster"; map { print " ",$_ } @c1;
print " cluster"; map { print " ",$_ } @c2; print "n";
}
}
if (scalar(@$inodes)) {
while (@$inodes) {
my $node1 = shift @$inodes;
my $node2 = shift @$inodes;
my @c1 = sort @{ $cluster1{$node1} };
my @c2 = sort @{ $cluster2{$node2} };
print "cluster"; map { print " ",$_ } @c1;
print " properly intersects cluster";
map { print " ",$_ } @c2; print "n";
}
}
} else {
print "compatible treesn";
}

Bio::Tree::Compatible is a Perl tool for testing compatibility of phylogenetic trees with nested taxa represented as Bio::Tree::Tree objects. It is based on a recent characterization of ancestral compatibility of semi-labeled trees in terms of their cluster representations.

A semi-labeled tree is a phylogenetic tree with some of its internal nodes labeled, and it can represent a classification tree as well as a phylogenetic tree with nested taxa, with labeled internal nodes corresponding to taxa at a higher level of aggregation or nesting than that of their descendents.

Two semi-labeled trees are compatible if their topological restrictions to the common labels are such that for each node label, the smallest clusters containing it in each of the trees coincide and, furthermore, no cluster in one of the trees properly intersects a cluster of the other tree.

Future extensions of Bio::Tree::Compatible include a Bio::Tree::Supertree module for combining compatible phylogenetic trees with nested taxa into a common supertree.

jSVR is a java implementation of a semi-automatic process for identifying and exporting three-dimensional information from a single un-calibrated image. The project is based on previous publications of A. Criminisi, A. Zisserman and others. svrIn the section "svr theory" there is a brief presentation of the principals behind single view reconstruction, using perspective information of an image.

jSVR was originally developed as my degree project in the computer science department of the university of Crete, in 2004. Most of the initial work was done in the CVRL lab of ics-forth, under the supervision of professors A. Argyros and M. Lourakis. Many documents in this site come from my report on svr, and where initially converted from latex using latex2html and then modified. If you find any broken links or other problems please let me know.

I recently decided to try and continue that work, as an open source project.

Single View reconstruction is a technique that can have various applications in different areas of interest. From acquiring metric information from low quality images, to reconstructing scenes from paintings. The process of reconstructing an image is semi-automated and can be really tricky for the user, who is requested to define and/or fine tune a set of difficult to understand parameters, (see the "svr theory" section for some examples).

Depending on the goal, the demands to the reconstruction technique differ. In the original work the goal was to test the proposed methodology in the relevant literature and to implement the techniques into an application that could reconstruct an image. The new goal of svr is to provide a user-friendly and intuitive way for reconstructing images, as well as to improve the existing implementation to produce better results. Determining the correct vanishing points with an automatic algorithm would be a great improvement to the whole process.

One step towards this direction would be an MLE estimation for the best intersection point. Also it is probable that suitable heuristics could be used to exclude intersections (false vanishing points) in areas that vanishing points are not expected (i.e. the center of the image). In order to exclude as many false VP detections as possible, appropriate filters could be applied on the image before the reconstruction (i.e. noise reduction, removing the radial distortion, and sharpen edges).

The phase of manual reconstruction could also be made semi-automatic by implementing object identification algorithms. This would help by automatically identifying the bigger structures in the image (i.e the vertical planes). In addition smaller structures can be interactively traced. This would also allow better texture extraction from the objects in the image.

Tactical Rogue game aims to take the best of two very interesting concepts and merge them together, namely, the variety and endlessness of rogue and the strategic elements of Tactics Ogre/Final Fantasy Tactics.

Basically this means well be autogenerating vast amounts of items, weapons and armors, autogenerating dungeon labyrinths and autogenerating monsters based on set profiles. Then, we will use these autogenerated worlds and enforce a strategical/tactical engine based upon many simply attributes such as speed, movement, agility, strength, dexterity, wisdom, intelligence, hp, mp, level, class and experience. The game will run semi-realtime, in the sense that time progresses until someones wait-time reaches zero allowing them to move/act which will then reset their wait-time to its maximum value based upon the characters traits and attributes.

The game will be developed under linux using sdl and c++, using .png for graphical storage of sprites and aminations and .ogg (vorbis) for storage of sound effects and music. All files, be it code, music or sprites will be licenced in a license compatible with the GPL, most likely under the GPL.

Qu is a powerful full-featured object oriented programming language. It is an Open Source software. The Qu Programming Language is absolutely free (as in free lunch) and distributed under the GNU General Public License (GPL).
Qu is inspired by other languages. Most noticeably Perl, Python, Ruby and C. It mostly resembles Python except that the syntax is more flexible, the internals are simpler, and Qu allows you to use either indentation or non-indentation style.
Qu has a clean syntax designed to promote readability. There is no need for semi-colons and commas to separate items except in rare cases when the end of an expression is not obvious.
Qu is a procedural language. A program consist of statements and expressions evaluated in the order they appear.
Qu is a strong semi-dynamic (optional-static) typing language. Adding a number to a string will throw an exception. A variable can hold anything or you can attach a validator to it. Validators can be as simple as a class, a constant object (Array, Range, Struct, etc.) or even a validator function.
Arrays, dictionaries, and sets can be constrained to hold only a specific "type" of data as well.
Everything in Qu are objects, including numbers, strings, etc. The number 123, for example, is actually an instance of the builtin Int class. Classes are instances of the builtin Class class, etc. But this does not mean that you must write your programs in an object oriented manner. That is entirely up to you.
Documentation can be embedded in the source code. The compiler will skip them. The documentation builder will extract them. The builder is included as part of the standard distribution.
In fact, when you install Qu or Qu modules, the documentations are automatically built for you.
Qu is entirely written in C. Readable documentations are embedded in the C sources directly.
Writing C modules for Qu is as easy as it can get!
Main features:
- fast
- clean syntax
- strong semi-dynamic typing
- module management
- multithread
- deadlock detection
- label loops, break, continue, redo
- loop, while, for, atomic, do
- fast exceptions
- try, catch, else, finally
- nested function
- lexical closure
- accummulator
- generator
- coroutine
- type validator
- run once function
- full and safe eval
- buffered printing
- auto self
- private, public and static attributes
- read/write & read-only attributes
- class property and methods
- dynamic attribute access
- single inheritance with mixins
- multiple constructors
- super class attribute access
- finalizers
- multiple assignment
- variable and default arguments
- argument flattening
- uniform attribute access
- complex number
- big integer
- mark & sweep garbage collector

enemy lines 3 is a semi-abstract first person 3D-shooter game. enemy lines 3s goal is to shoot evil robots before they get too close or to use your jetpack to escape.

The robots cant jump, but they can tear down walls.