Free tongue in cheek software for linux

Exceptions in C implements fully-functional nested exceptions with these constructs:

try
except
on
throw

Also, it allows to define various datatypes for exception object (default is int, can be anything from char * to struct foo *).

Compiling and running

Precodey straight forward.

admp@sols:~/excc/example$ gcc exception.c -c
admp@sols:~/excc/example$ gcc exception.o example.c -o example
admp@sols:~/excc/example$ ./example
Usage: ./example A B
admp@sols:~/excc/example$ ./example 100 2
100/2=50
Program is going to end its short life.
admp@sols:~/excc/example$ ./example 100 0
Caught up division by zero (100/0).
Program is going to end its short life.

Attributions:

Felix Ogg for inspiring me to write finally, also detailed feedbacks and ideas for documentation (diagrams too!). Though I havent completed that - for almost a year now; I am not sure I ever will.

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.

PNG plug-in provides Portable Network Graphics (PNG) file load & save modules for The GIMP. The plug-in supports all color modes and supports saving of interlaced images and setting the level of compression.

Using the PNG Plug-In:
Figure 1 shows the PNG save options window.
The Interlace toggle button selects interlaced output.
The Compression Level slider controls how much compression is applied to the image (0 = none, 9 = maximum).

Set photo in Kopete is a really simple service menu that just sets the current photo as your photo in Kopete, nothing more, nothing less.

It doesnt handle directories containing space yet, if someone have a workaround so that KURL dont escapes all characters that would be nice=)

Just put this file in ~/.kde/share/apps/konqueror/servicemenus or use http://www.kde-look.org/content/show.php?content=11435 to install it.

Cookie Button in the status bar is a Firefox button for easy access to cookie permissions in the status bar. For those who have been asking for cookie button in the status bar.

Some features are optional. See Tools -> Extensions/Addons, select Cookie button in the status bar, press Options/Preference Button.

Please post more info about the context menu bug to http://bugzilla.mozdev.org/show_bug.cgi?id=15011

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.

Skolelinux is made as free (as in speech) software, and also Skolelinux is an overall computer solution based on schools resources and needs.
- Skolelinux is a network architecture tailored for use in schools.
- Skolelinux is developed and supported by a large and growing international community.
- Skolelinux is designed to be easy and cheap to maintain.
- Skolelinux gives the students their own usernames, home directories and services.
- Skolelinux includes OpenOffice.org
Skolelinux, Debian and all auxiliary software components we use are free software ? free as in freedom. The term "free software" implies the following rights:
- Freedom to use the software regardless of purpose and adapt it to ones needs.
- Freedom to study how the software works.
- Freedom to redistribute the software so ones neighbour can benefit from it.
- Freedom to modify and enhance the software and publish those modifications so everyone benefits from them.
These rights form the foundation of both Debian, Skolelinux and all the software we use. They enable us to use the various software components, put them together in our specialized network design and package and redistribute the software as "Skolelinux".
With proprietary software, such as Microsoft Windows, all adaptions and modifications have to be redone everywhere. With Skolelinux, modifications and enhancements done by a school in Norway may benefit schools in Eritrea ? and vice versa. Windows is the most commonly used operative system used in schools today, but as Windows is proprietary software, it is not possible to tailor Windows for school usage and call it "SkoleWindows".
Skolelinux (aka debian-edu) is a Custom Debian Distribution. This means that Skolelinux is a version of the Debian GNU/Linux operating system that is customized for schools. Debian is a state-of-the-art, user-friendly operating system. The goal of our customization of Debian is to make it easy to install and maintain for schools. ? with all applications available in the students mother tongue.
Despite how easy Skolelinux is to install, asking only a handful of (non-technical) questions, it is an advanced network solution, with many pre-configured services. With ordinary, closed, proprietary software, these services have to be configured manually for every single school ? and that needs careful planning and expertise!
Amongst several pre-configured services are the following:
- Central user catalogue: One username and one password for several machines and services.
- Central storage: Regardless of which machine you use in a Skolelinux network, you have access to your files and meet an interface with your settings ? an interface you are familiar with.
- Thin client solution: The applications are run on a thin client server, which is a powerful machine. The image from those applications is drawn on a "thin client", which usually is an old and cheap machine. This enables you to use old hardware. Moreover, it eases administration, as you have one server to maintain.
- Printers may be shared and made available in the network.
- A proxy server caches files downloaded from the Internet, resulting in a faster surfing experience.
Enhancements:
- This is a community release with comprehensive support from regional and national projects in Germany, Spain, France, Greece and Norway. The Skolelinux project is now a part of Debian under the name Debian-Edu. Several other projects have made additional functionality to Skolelinux tailored for national needs. Skolelinux now supports more than 50 countries. Whats new in Skolelinux 3.0: based on Debian 4.0 "etch" and therefore compatible to LSB 3.1, using kernel 2.6.18 and KDE 3.5.5...