Free 3.90 kgs in lbs software for linux

Ghost In The Mail is an anonymous e-mail client for linux written in C and designed in GTK+ 2. Look at the screenshots below to have a better idea of how does it works.
This piece of software allows to send e-mails to any person over the net with a fake email address, and also a fake name. Obviously you can use your true identity. gitmail can also send attached files. Ghost In The Mail uses MIME and Base64 technologies.
Enhancements:
- Full review of the code in order to improve stability and performances.
- Rewrite of all functions that contained malloc(CONST_VAL).
- Added functions gitm_malloc & gitm_realloc that check pointers after allocating them.
- Added some commentaries to describe functions.
- New sources files: functions are distributed into files in a more logical way.
- Files cbbentries.* removed (functions in cbbentries.* are now in history.*) Better core/gui splitting.
- Created a constant GITM_VERSION to hold the version number.
- MIME boundary is now randomly generated.
- Server errors are fully displayed.

Dry Brush Plug-In is a plug-in like a tool in Gimp.

It mainly tries to express a feeling of a drawing materials with strength that is brought by pressure sensor of a tablet.

Ryans In/Out Board is a perl driven in/out board for small-medium size organisations that needs staff to be aware of other staff whereabouts.
(Ryans In/Out Board will work for larger organisations but it may be more cumbersome to use with larger numbers of staff).
Main features:
- Displays name,phone,status,comments and date/time for each staff member
- Staff are able to quickly change their status by either clicking on their name or calling the main script with a "name" parameter.
- Standard comments are provided (Lunch, Leave etc) but can be added to/replaced by any comment the user wishes.
- With the aid of a cron job it will also clear all staff as OUT every night, without removing any comments they have entered.
- It has a simple and clear interface and users can also search for the status of any staff member.
- The generated page can be automatically refreshed at your chosen interval and status colours are defined by you.
- It also displays staff internal phone numbers and you can use your own header and footer files.

Hakin9 Live distro is a bootable distribution (based on Aurox Live) which contains hacking, security, and network diagnostic tools.
Youll find following tools on hakin9.live:
- airsnort-0.2.7
- ald-0.1.7-1
- bc-1.06
- bfbtester-2.0.1-1
- burpproxy-1.22
- coreography-1a
- dataworkshop-1.1.1
- driftnet-0.1.6
- dsniff-2.4.b1
- etherape-0.9.1
- ethereal-0.10.0a
- ettercap-0.7.2
- fakeconnect-1.2.1
- firestarter-1.0.1
- gdb-5.3.90
- gnupg-1.2.4
- gtk-iptables-0.4.2
- hping2
- hping3
- ht-0.8.0
- iproute-2.4.7
- iptables-1.2.9
- iptraf-2.7.0
- ipw2100-firmware-1.2
- jwhois-3.2.2
- john-the-ripper-1.6
- kismet-3.0.1-1.200410r1
- libnet-1.1.2.1
- logwatch-5.1
- memtest86-3.0
- mtr-0.54
- nasm-0.98.38
- netcat-1.10
- ndiswrapper-kernel-2.6.7
- ndiswrapper-tools-0.9
- nessus-2.2.2a
- nload-0.6.0
- nmap-3.50
- openssh-3.6.1p2
- openssl-0.9.7a
- parted-1.6.9
- p0f-2.0.5
- rp-pppoe-3.5
- rdesktop-1.3.1
- sam-20040323
- sendip-2.5
- sleuthkit-1.69
- sniffit-0.3.7
- snort-2.3.0RC2
- snortconf-0.4.2
- snortkonsole-0.1
- stunnel-4.05
- tcpdump-3.8.2
- traceroute-1.4a12
- vnc-4.0
- wvdial-1.53
Enhancements:
- new links and icons on the ROX desktop
- new tools: ap-utils, ekg2, mrtg, hostapd, madwifi-tools, hostap-utils, sing and more
- language choose script at fluxbox startup
- removed old XFce4 files
- new drivers: hostap-driver, madwifi-driver, rt2x00, zd1211
- all drivers updated to work with new kernel
- new kernel gentoo-sources-2.6.14-r4 build without IEEE80211 stack (too old version for new drivers. Used package net-wireless/ieee80211-1.1.6)

Easiest Edit In Place enables Web (2.0) developers to generate any number of edit in place widgets with only one line of script code.
Using stylesheets and spans, any piece of text can be edited by any type of widget. Easiest Edit In Place features CSS customization and automatic caret positioning.
Main features:
- It requires only 1 line of javascript to make any number of widgets editable.
- Caret positioning. When editing inline, the caret is positioned at the point the user clicked, to make it more intuitive.
- Editor can be anything, from ordinary text input to text areas or custom widgets.
- Everything can be styled using CSS.
Eeip has been tested on Firefox and IE.
Enhancements:
- A bug that could lead to the accidental display of placeholder text when dealing with empty fields in some circumstances was fixed.

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.

Claros In Touch is a webmail, address book, calendar, and notebook application. Claros In Touch aims to fulfill the need for a stable, full featured messaging application.
Main features:
- Bayesian Spam protection (no need to do setting on mail server, it is bundled with the webmail)
- Message Filtering (custom filters can be applied to the incoming mail)
- Its is developed using Apache Struts, Apache Commons, Claros Commons, JSP and Servlet technology.
- Folder support on the POP3 protocol. (It simulates the IMAP folders by database)
- No need to do database setup (indeed it supports any JDBC compliant database engine), it comes bundled with a ready to run database engine. (Look: http://www.hsqldb.org)
- It is compatible with any standarts compliant POP3 and SMTP server. (No IMAP)
- Operating system independent. Written with regular JSP and servlets.
- Can send HTML e-mail (DHTML based HTML editor included)
- Fully MIME compatible (can read any HTML e-mail)
- An address book aplication
- An advanced notebook application
- A calendar application, with daily, weekly, monthly views and reminder facilities etc...
Enhancements:
- The UI was improved.
- A preference window was added.
- More languages were added.
- Internet Explorer compatibility problems were fixed.
- POP3 mode was re-engineered. List titles were fixed.
- Attachment handling and the drag-drop system were improved.
- Message headers are now shown correctly.
- Message arrived (sound) notification was added.
- A paging system was introduced.
- Inline HTML messages are now shown correctly.
- A HTML sanitizer was added to prevent hacking.
- An address book was added.
- A chat module was added.
- Performance was improved.
- Less system resources are used.

Python in Scheme is a scheme library that allows you to run Python code within Scheme.

Python in Scheme project uses the Python/C API to embed a Python interpreter.