Free kerio law software for linux

KOJAC project contains Java libraries and applications for optical raytracing.
KOJAC is a set of Java classes implementing optical elements and optics laws in order to build and simulate optical systems.
It is also aimed at being a demonstrator of optics for educational purposes.
Optical systems are composed of objects with defined properties that may be modified by the user through the applets buttons and scrollbars.
Such basic devices are lenses, apertures, interfaces, and may be themselves composite sets of other elements.
KOJAC is able to do exact raytracing in 3 dimensions, taking into account the wavelength of the rays, and simulating real materials.
Main features:
- no paraxial restrictions
- elements can be off axis
- all computations are done in 3 dimensions - no 2D restriction
- rays may have amplitude, polarisation, wavelength and more
- refraction index can be described by up to 10 formulas
- polarisation dependant effects may be introduced
- devices can be built from primitives or from other devices
- this special device contains many elements that can be interchanged

WAusers application is one component of the WAhelper Web accessibility testing suite.

WAusers serves for managing Web accessibility testing sites where users can register, create their own Web accessibility testing projects, and log into all their projects using a single global password.

Web pages are often designed without handicapped users in mind. Despite there exist Web accessibility guidelines such as W3C Accessibility Guidelines or U.S. Section 508 law, many Web designers are not aware about problems they cause to handicapped visitors of their pages. And even when a Web designer tries to make Web pages accessible, he may not be aware about all the obstacles handicapped users can meet.

- Software tools can be helpful here. Several Web accessibility checking tools already exist, but they have various problems:
Most of them are non-free and you cant use them freely to evaluate accessibility of your website effectively. Making things accessible means removing barriers and it is important to make the barriers as low as possible.
- New tests usually cant be added easily. An easily extensible and freely modifiable tool is needed so that its features can be improved efficiently. A good and maintained tool can make the whole process of making Web pages accessible more effective.
- The tools often dont try to go beyond semi-automated tests. But there are many accessibility problems which cant be detected, diagnosed and reported without human assistance. A tool helping humans with the testing process is needed.

Sendmail Analyzer is a perl script reporting full HTML and graph sendmail usage reports. The project reports statistics on inbound, outbound and largest messages, senders and recipients, relays, domains, and complete mailboxes usage if your country law allow it.

Statistics are generated per hour, day, month and year. Graphs are in PNG format.

EMIPLIB comes from EDM Media over IP libray. This library was developed at the Expertise Centre for Digital Media (EDM), a research institute of the Hasselt University.
As the name suggests, the goal of the library is to make it easier to stream several kinds of media, including (but not limited to) audio and video.
Main features:
- Soundcard IO (using OSS and WinMM)
- WAV file IO (using libsndfile)
- Webcam input (using Video4Linux and DirectShow)
- Speex compression
- H.263+ compression (using libavcodec)
- Mixing of incoming audio streams
- Synchronization of RTP streams based on RTCP information
- 3D sound effects
- Easy to use audio and video over IP sessions
Enhancements:
- Some bugs were fixed.
- Several audio compression and encoding components were added: A-law encoding, LPC compression, and GSM compression.
- An OpenAL output component was added.

The Audio File Library provides a uniform and elegant API for accessing a variety of audio file formats, such as AIFF/AIFF-C, WAVE, NeXT/Sun .snd/.au, Berkeley/IRCAM/CARL Sound File, Audio Visual Research, Amiga IFF/8SVX, and NIST SPHERE. Supported compression formats are currently G.711 mu-law and A-law and IMA and MS ADPCM.
Key goals of the Audio File Library are file format transparency and data format transparency. The same calls for opening a file, accessing and manipulating audio metadata (e.g. sample rate, sample format, textual information, MIDI parameters), and reading/writing sample data will work with any supported audio file format. Likewise, the format of the audio data presented to the application need not be like the format of the data contained in the file.
Enhancements:
- libaudiofile/Makefile.am, libaudiofile/audiofile.exports:
- Export only public entry points.
- Released version 0.2.6 of the Audio File Library.

Operator is a complete Linux (Debian) distribution that runs from a single bootable CD and runs entirely in RAM.
The Operator contains an extensive set of Open Source network security tools that can be used for monitoring and discovering networks.
This virtually can turn any PC into a network security pen-testing device without having to install any software. Operator also contains a set of computer forensic and data recovery tools that can be used to assist you in data retrieval on the local system.
Starting with the 3.3 version of Operator, we have started completely from scratch by installing a basic Debian installation then adding the KNOPPIX functionality afterwards. This allowed us to have more control and understanding of what is on the CD.
Main features:
- Debian based Linux Installation
- Linux-Kernel 2.4.31
- KDE V3.3.2-1
- wine Windows Emulator (Binary Emulator)
- Konqueror and Mozilla Firebird Web Browsers
- Koffice which includes korganizer, kword, kspread and more
- X Multimedia System (xmms) an MPEG-video, MP3
- Internet connection software kppp,pppoeconf (DSL)
- utilities for data recovery and system repairs, even for other operating systems
- network and security analysis tools for network administrators
- many programming languages, development tools
- in total more than 900 installed software packages with over 2000 executable user programs and utilities
- 100+ Unix/Windows Exploits and Tools ready to run
Enhancements:
- Modified wireless_select to use /proc/net/dev instead of /proc/net/wireless. Some cards were not showing up after they were reinserted like orinoco.
- Added package aim_1.5.286 AOL Instant Messenger
- Stripped down locales to use en_, de_, es_ only
- upgraded hydra-4.6 to hydra-4.7
- Added BusLogic driver to the kernel so that vmware would not panic when booting after an HD install.
- Updated Metasploit framework from 2.3 to 2.4
- reinstalled libnet1-dev
- fixed captive-ntfs
- Added new Exploits:
- HOD-ms05039-pnp-expl - (MS05-039) Microsoft Windows Plug-and-Play Service Remote Overflow
- HOD-kerio-firewall-DoS-expl - Kerio Personal Firewall Multiple IP Options Denial of Service
- HOD-ms04031-netdde-expl - Microsoft Windows NetDDE Remote Buffer Overflow Exploit
- HOD-ms04032-emf-expl - Microsoft Windows Metafile (.emf) Heap Overflow Exploit
- HOD-ms05002-ani-expl - Internet Explorer .ANI files handling Universal Exploit
- HOD-ms05017-msmq-expl - Message Queuing Buffer Overflow Universal Exploit
- DSR-cpanel - POC for Cpanel 5 and below
- cpanel-9x_RCE - POC for Cpanel 9 and below
- DSR-nethack - local exploit for Nethack 3.4.0
- phpLDAPadmin - phpLDAPadmin 0.9.6 - 0.9.7 Remote command Execution
- phpbb.php - phpBB 2.0.10 Remote command Execution
- HP_OV_NNM_RCE - HP OpenView Network Node Manager 6.2, 6.4, 7.01, 7.50 Remote Command Execution
- Added new Tools:
- zebra 0.94 - Tool that manages TCP/IP based routing protocols
- voipong 1.2 dev - VoIP call detector and voice dumper VoIPong is a utility which detects all Voice Over IP calls on a pipeline, and for those which are G711 encoded, dumps actual conversation to seperate wave files. It supports SIP, H323, Ciscos Skinny Client Protocol, RTP and RTCP.
- Upgraded yersinia v0.5.3 to v0.5.6 - Framework for performing layer 2 attacks
- ike-scan v1.2 - Discover and fingerprint IKE hosts (IPsec VPN Servers)

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.