Free sexual harassment in the workplace software for linux

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.

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.

Really Rather Good Battles In Space is a real time strategy game with fleets of spaceships.
Single player real time strategy game following the fall of the great Argonian empire.
Main features:
- a short but relatively polished single player campaign
- pretty (albeit 2d) graphics
- spaceships
- explosions

Sidebar in a Can is a simple and powerful tool for webmasters to take a large amount of static content (intimidating to new users) and turn it into a quite manageable amount of dynamic content. The result showcases your sites material.

Sidebar in a Can is built on Snippets technology.

Sidebar in a Can is designed to be run as a straightforward web application, with much administrative activity performed on-web. Rather than trying to explain how to use it, I simply encourage you to explore.

Security

The present release of Sidebar in a Can has not been closely scrutinized for security, and should be treated as such by security-conscious administrators. If you examine the code and discover a vulnerability that could compromise the server, please contact the author at jshayward@pobox.com. The script is intended to have light security and not to compromise a server, but it is not intended to store credit card numbers or other sensitive information.

The default installation sets < the private sidebar data directory > and contents to mode 777. Administrators are encouraged to set directory and contents to mode 700, owned by the effective user ID that Snippets will be running under.

run in xterm is an servcie menu which adds "run in xterm" & "run in xterm as root" to action menu on binary files, scripts etc.

It has 2 languages: english and polish.

Installation:

copy/save this file in
~/.kde/share/apps/konqueror/servicemenus

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.

Formulas Rendering Plug-In for the Gimp 2 is a simple plugin that allows you to change the values of each color channel of each pixel of a layer by using mathematical expressions. It is able to handle RGB* and Gray* images.

Available operators are: +, -, *, /, ^, and %. There are many functions available, such as sin, cos, sqrt, abs, min, max. A few constants are provided (pi, e, j), and a lot of pre-defined variables are usable (w for images width, h for images height, x and y for cartesian coordinates in the image, etc.).