Free a purplebunny software for linux

PurpleBunny is a Firefox extension that can help you quickly and easily read and write comments about the web page youre viewing. You can praise a page, ask a question, read comments about an entire site, discuss the content of a web page with other web surfers -- the possibilities are endless!

PurpleBunny stores these comments in a centralized location for easy access, and the handy toolbar alerts you when a page youre viewing has comments. Using PurpleBunny is like writing notes for future readers in the margin of a library book, but without messing up the original material! Plus, its more organized -- PurpleBunny groups comments by web site, and you can also sort all comments or search for specific keywords

A Simple Version Control System is an easy to install and easy to to use version/revision control system.
ASVCS differs from most other version control systems in that ASVCS is designed to keep track of files in place. ASVCS does not allow any changes to be made to files, all changes require the users to change files externally with FTP or SSH access.
ASVCS is very easy to setup and use. Users do not need to work with repository, branches, commit and check-out files. All a user needs to do is upload the changes files and click Update or if enabled just wait for it to be updated automatically.
ASVCS is ideal for small projects or personal use, though it can also be used by large project how do not need or want the complexity of most version control systems.
Main features:
- asy to install and use
- Written in PHP
- Can track binary or text files
- Automatic file tracking (requires cron support)
- Diffs of revisions
- Easy user access management
- Entirely Web based
- Skinable
- Open source (MIT/expat license)

A Small MUD project is a minimal MUD implementation.

A Small MUD is a minimal MUD implementation, with some mildly intelligent mobs running around creating rooms.

A few pointers when reading the source code... the World class contains the "cells" in the dungeon - all those are created randomly by the mobs.

The MobFactory class contains and controls all mobs in the world - the class holds a reference to the World class.

Cells are specified by the World::CELL struct and mobs by the MobFactory::MOB struct. The SmallHandler class contains the World, MobFactory, and active sockets list (via SocketHandler).

Finally, the SmallSocket class handles all socket communication and the ListenSocket template class acts as the socket listen server.

a-renet project is a distributed gaming network.

It supports client-server TCP-based games.

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.

Petals on a Rose is an intriguing puzzle game for all ages. This website claims that Bill Gates was stumped by it for two days. Its usually played with a group of friends and a set of 5 dice. The game master rolls the dice and tells everyone the answer. This computer version of the puzzle works similarly, only in this case the computer plays as the game master.

To play you just double click the icon to start the program. Type your guess in the "Answer" field and press "Check". If your guess is correct you get congratulated, otherwise you need to try again. If you get tired of guessing you can press the "Give Up" button and youll get the answer to that particular roll.

Just press the "Roll Dice" button at any time to get a new set of numbers.

Always remember, dont tell the answer to anyone!

Have fun, and good luck.

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.