Free in a few software for linux

Mint is a small X toolbar that can switch network configurations in a few keystrokes. Mint enables you to change your network configurations in a few keystrokes. It supports DHCP and static addresses, and can execute an authentication script when it changes the configuration. It also displays a clock and a battery meter.
mint displays the name of current network configuration. It also displays a clock and a battery meter. The battery meter shows the percentage of remaining battery life and appends a `+ to the battery life when AC power is connected.
Since it changes network configuration, mint must be run setuid root. It safely invokes the authentication script as the user who started mint, not root.
mint provides a network configuration called "off" to shutdown the network interface. mint displays "?" if it does not recognize the current network configuration. It displays "xx" if the network interface does not exist.
The authentication script is run in the background. When you switch network configuration, mint kills any previously running authentication script. For DHCP configurations, mint does does not run the authentication script if the DHCP request fails.
DHCP support is made by the "dhcpcd" command, which mint expects to find in /sbin. dhcpcd should have come with your Linux distribution; if not you can get it from http://www.phystech.com/download/dhcpcd.html.
Enhancements:
- The beta version of Bianca was released and is available for download. Bianca comes with two brand new themes: Bianca-Blue and Bianca-Green which give the distribution a whole new minty look. Only one panel at the bottom, a Slab-like menu, new default icons. The following applications were added to Bianca: mintMenu, a replacement for the GNOME menu; mintConfig, a Control Center application; mintDisk, a program which automatically mounts FAT32 and NTFS partitions; mintDesktop, which now comes as a package, has a graphical configuration front-end; mintWifi, which now comes as a package.

Red-Piranha is an open source search system that can actually learn what you are looking for. It lets you go everywhere , find anything , understand everything.
Because it is open source , it can integrate with any system. Because you can use it as a web page , command line or XML- WebService , it will work with most languages , including Java , Perl , C#/.Net and PHP. As a Java based program , it will run on any platform including Windows , Linux / Unix and Mac.
Main features:
- Personal Search Engine for your Desktop (Windows , Linux and Mac).
- Intranet Search Engine - Search your Company or College Intranet.
- Part of your Development Project - Have search abilities up and running in a few minutes.
- To provide Search facilities on your website.
- As a P2P search engine.
- In conjunction with a wiki, as a knowledge / document management solution.
- Scan a set of websites for the data you want (e.g. Search Job sites on a hourly basis).
- Explore the Semantic web using RDF.
- Search RSS feeds for the information you want.
- Search your Companies systems (including SAP , Oracle or any other Database / Data source).
- Provide a back end for searching in your App (Web , Swing , SWT , Flash, Mozilla-XUL, PHP , Perl or even c#/.Net) .
- Document Management for PDF, Word and other Docs.
- As a Webservice to provide search information
- As a command line tool , to give searching power to your scripts.
- Provide a Search facility for your project documentation.
Using
To use Red-Piranha - open your favourite web browser and point it at http://localhost:8080/RP . Within a few seconds , you should see the Red-Piranha start screen. This will have three items of interest
- A Text box , where we enter the information to add or search
- An add information button - to tell Red-Piranha about new information
- A Search button - to carry out a search.
Before we can search , we must tell Red-Piranha we information we are interested in. This is as easy as putting the piece of information we want to add (e.g. the folder c:temp) in the search box and pressing the Add information button. A message will be displayed saying that your information is being added and will be available to search shortly. For more information , look in the logs at TOMCAT_HOMEWebappsRPlogsrp.log
Examples of things we can add to Red-Piranha are
- A folder (e.g. C:Temp). All files in both this folder and *all* its subfolders will be added.
- An individual file. This file can be text , a web page , a word document , or pdf document. For binary files (like word , which are not plain text) , Red-Piranha will scan the file for recognizable text and add that.
- A Web page. Red-Piranha will add this web page , *and* web pages it links to.
- A Google Search (e.g. http://www.google.com/search?q=some+thing?m=100). Red-Piranha will get the results of the google search , and add information on the pages it links to.
- An XML file (including RSS feeds) , either on disk or over the web.
- Favourites / Bookmarks folders - Red-Piranha will index the web pages that these favourites point to.
Adding information can take anything from a few milliseconds , depending on the amount of information being added. Once added, Red-Piranha will check on a regular basis to see if the information added has changed and re-index if required. Your information is now available to be searched.
To do a search , put the item you want to search for into the textbox and press search. Red-Piranha will show the search results on the screen. Clicking on the link beside the search results will show you the original information (as long as you have access to it).
From version 0.3 onwards , Red-Piranha can learn what search results you are interested in an improve your future searches. To give Red-Piranha feedback and help it learn what you are interested in , click on any of the links on the search results page. Red-Piranha makes a note of your choice , which is used to adjust the search results later.

Script for a dual-homed firewall script is intended to setup a masquerading firewall based on the IPTABLES (Net)filter-machanism of Linux 2.3.15+
Syslogging matches fireparse for graphical output (see http://www.fireparse.com)
Normally this script will work out-of-the-box, but you should adapt it to your own needs (At least you should set the correct default interfaces --> see Default-Interfaces section)
Syntax to invoke script: firewall (start|stop|restart|status) EXTIF INTIF
Example: "firewall start ppp0 eth0"
Enhancements:
- Added a few comments

regular expression parser is a C++ regexp parser that accomplishes The Open Group specification Issue 6, IEEE Std 1003.1, 2004 Edition.

regular expression parser allows you to parse input using regular expressions, and to retrieve parsed sub-expression matches in a few steps.

iOfficeV4 is a ready-to-work Groupware application suite.
Various applications are easy to use and can improve productivity of cooperative work in your group or whole organization. iOfficeV4 offers your work group 21 powerful collaboration tools.
Main features:
Personalizing Options
- Personalize your desktop and change various options of each application to better suit your needs.
Administration Tools
- iOfficeV4 provides powerful and flexible Administration tools that can reduce TCO. Once iOfficeV4 is installed on your server, a non-IT expert can administer the entire system.
Security Features
- Planning and implementing security policies are critical issues in Groupware applications. To determine and manage the security issues, iOfficeV4 provides three different security policies.
National Language Support
- iOfficeV4 has no built-in assumptions or dependencies on language specific or cultural specific conventions. Although the user interface is English, iOfficeV4 NLS supports non-English speaking countries and regions.
Other Unique Features
- Weve developed abundant auxiliary functions so that the applications can be used more conveniently.
System Requirements
- iOfficeV4 runs on various operating systems, including Windows, Linux, and UNIX. Installing iOfficeV4 is easy, and can be done in a few minutes with most operating systems.
More about iOfficeV4
- We provide a comprehensive user guide that allows you to learn iOfficeV4s features.
Version restrictions:
- 60-Day Free Trial

The inline_smtp perl script was created to allow filtering of incoming mail on a separate server that houses the mailspools without running a full blown MTA. While its possible to configure another MTA, e.g. postfix, to relay all mail to a smart host and do filtering through postfix, the queue can get behind easily, and on a busy host thousands of messages can get queued in a few hours causing delays in delivery from a few minutes to several hours. Because its filtering while redirecting, mail arrives as fast as if it were coming directly to the final mail server because its relayed as the message is received.

inline_smtp works by accepting connections and relaying the conversation to the maildrop host as it takes place, so any 550 messages pass through instantly instead of getting the 550 on the relay server then having to process a bounce, which also fills the queue. inline_smtp understands enough of the smtp protocol to filter on rctp to: addresses and to process the mail body, optionally running it through a filter.

PGUI is a frontend to the positron neuros software for adding songs to your neuros MP3 player.

PGUI is a frontend to the positron Sync command written in python and GTK2, it also enhances some of the functionality of positron sync and fixes a few bugs.

A Sudoku Solver in C is a console-based Linux program, written in C language, that solves Su Doku puzzles using deductive logic. It will only resort to trial-and-error and backtracking approaches upon exhausting its deductive moves.
Puzzles must be of the standard 9x9 variety using the (ASCII) characters 1 through 9 for the puzzle symbols. Puzzles should be submitted as 81 character strings which, when read left-to-right will fill a 9x9 Sudoku grid from left-to-right and top-to-bottom. In the puzzle specification, the characters 1 - 9 represent the puzzle givens or clues. Any other non-blank character represents an unsolved cell.
The puzzle solving algorithm is home grown. I did not borrow any of the usual techniques from the literature, e.g. Donald Knuths "Dancing Links." Instead I rolled my own from scratch as a personal challenge. As such, its performance can only be blamed on yours truly. Still, I feel it is quite fast. On a 333 MHz Pentium II Linux box it solves typical medium force puzzles in approximately 800 microseconds or about 1,200 puzzles per second, give or take. On an Athlon XP 3000 it solves about 6,600 puzzles per sec. (Solving time is dependent upon degree of difficulty, so YMMV.)
Description of Algorithm:
The puzzle algorithm initially assumes every unsolved cell can assume every possible value. It then uses the placement of the givens to refine the choices available to each cell. I call this the markup phase.
After markup completes, the algorithm then looks for singleton cells with values that, due to constraints imposed by the row, column, or 3x3 region, may only assume one possible value. Once these cells are assigned values, the algorithm returns to the markup phase to apply these changes to the remaining candidate solutions. The markup/singleton phases alternate until either no more changes occur, or the puzzle is solved. I call the markup/singleton elimination loop the Simple Solver because in a large percentage of cases it solves the puzzle.
If the simple solver portion of the algorithm doesnt produce a solution, then more advanced deductive rules are applied.
Ive implemented two additional rules as part of the deductive puzzle solver. The first is subset elimination wherein a row/column/region is scanned for X number of cells with X number of matching candidate solutions. If such subsets (or tuples) are found in the row, column, or region, then the candidates values from the subset may be eliminated from all other unsolved cells within the row, column, or region, respectively.
The next deductive rule examines each region looking for candidate values that exclusively align themselves along a single row or column, i.e. a vector. If such candidate values are found, then they may be eliminated from the cells outside of the region that are part of the aligned row or column.
Note that each of the advanced deductive rules calls all preceeding rules, in order, if that advanced rule has effected a change in puzzle markup.
Finally, if no solution is found after iteratively applying all deductive rules, then we begin trial-and-error using recursion for backtracking. A working copy is created from our puzzle, and using this copy the first cell with the smallest number of candidate solutions is chosen. One of the solutions values is assigned to that cell, and the solver algorithm is called using this working copy as its starting point. Eventually, either a solution, or an impasse is reached.
If we reach an impasse, the recursion unwinds and the next trial solution is attempted. If a solution is found (at any point) the values for the solution are added to a list. Again, so long as we are examining all possibilities, the recursion unwinds so that the next trial may be attempted. It is in this manner that we enumerate puzzles with multiple solutions.
Note that it is certainly possible to add to the list of applied deductive rules. The techniques known as "X-Wing" and "Swordfish" come to mind. On the other hand, adding these additional rules will, in all likelihood, slow the solver down by adding to the computational burden while producing very few results. Ive seen the law of diminishing returns even in some of the existing rules, e.g. in subset elimination I only look at two and three valued subsets because taking it any further than that degraded performance.
Enhancements:
- Code optimization has resulted in a 30% increase in speed.