Free a renet 1.1.0rc4 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-foto is a theme (applet) for Superkaramba. A-foto show pictures on your desktop with different frame decorations and has the ability to change picture at present intervals.

Known Issues in this version:
- There is NO "add to line" mode. The organization of presented images is now accomplished through management of contents of the chosen folder. One suggested way of organizing custom slide shows is to create an empty folder and drag LINKS to preferred photos into that folder. Drop that folder onto a-foto. Presently, this appears to be the easiest way to achieve manageability of slide show content. Your alternative suggestions are welcome.
- Starting a second instance of A-foto from SuperKaramba interface may fail. Double-click on afoto.skz file to start additional applets.
- A-foto settings have "historical priority." Settings for 1st afoto applet ever will always be the 1st in line to be used when you open afoto. To get to the settings of the 3rd afoto instance, you need to open 3 afoto applets. We are working on a solution. Any comments and suggestions are welcome

A Jacks Game is a real-time game that runs in a Web browser using the AJAX (Asynchronous JavaScript and XML) technology.

Multiple users can login in A Jacks Game to explore a common map and earn a common currency as their score.

A Jacks Game is free software released under GNU/GPL Open Source License.

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.

The Life of a Geek is very silly console game in which you (a geek) must keep a computer running until you graduate college.
Surf around on the Internet, battling hackers to gain money and better security for your box. Drink lots of caffeine to keep yourself awake, since if you go to sleep, you risk an attack on your computer.
The Life of a Geek is a simple console game.
Save up money to take a month-long college course and improve your education, but remember that paying attention to schoolwork also leaves your computer open to attack.
Find a quick job for a month at places like fast-food restaurants and grocery stores, but remember again that time away from your computer leaves it open to attack. Viruses may also appear on your computer, weakening your computers health points regularly until cleaned.
Enhancements:
- Improved randomness, a fix for a bug where more energy drinks could be bought than the available money allowed, and support for compiling using Visual C++.

Repeat A/B - Amarok script is an Amarok script which can repeat a song from point A to point B.

Usage:

Right click the playlist and select Repeat --> A/B.
Now you have your first mark.
Hit Repeat --> A/B again and you have the second mark.
Repeat A/B starts.

Hit Repeat --> A/B a third time
or change track
or move the scrollbar outside the A/B border to stop repeating.