Free condition software for linux

gBootRoot makes the construction and development of distributions fun and simple with its Root Methods (Yard) and user-mode-linux test bed. Finish the product with a Boot Method (2-disk compression supported).
Normal (non-root) users can make root filesystems and boot disks. It includes the make_debian script to create a testable user-mode-linux base Debian system, add-ons to enhance methods, and an MTD Emulator useful for running distributions made with the jffs/jffs2 filesystem.
Enhancements:
- Fixed a @INC problem with rpm packages. The fhs checks usually insert the module path (Debian std. path) into @INC via a BEGIN {}, but the new BootRoot::Options was trying to be loaded before the fact because it had been placed within the BEGIN{} and there was even a reminder in the code documentation from prior releases explaining not to do this. Updated BEGIN statements in gbootroot, expect_uml and yard_chrooted_tests, and made sure "." is always specified first in @INC.
- Thanks to Stian Skjelstad for pointing out some bugs - namely the former annoying @INC bug that never should have occurred in the first place - after I asked him to try out gbootroot to help with his MTD requirements.
- Added a new if/elsif control structure. if ( condition ) n statement(s) n elsif ( condition ) n statements elsif .. Nice functionality to have.
- Made Example.yard portable with the new if/elsif control structure, and added pam.d/system-auth if it exists on the system.
- Commented out many things in Helper.yard because UML.pm has been modified to allow no login along with no password, and provides a new method "close_no_init" to provide a shutdown marker after which uml_mconsole can be used to halt the process. This means faster creation time for root_fs and no lag.
- Huge fixes to all source packages.
- Added format rules found in Example* to the main documentation.
- Compiled for >= glibc 2.2.5. Previous version was compiled >= 2.3.1 which caused some things not to work on old distributions using 2.2*
- Removed the -q from expect_uml because this caused the newer version of mkreiserfs to fail because Namesys decided that unsolicited advertising was in order so everybody knows that there are actually some organizations and companies paying for its development. Wouldnt this be nice in a perfect world for all Free Software projects?
- Tested on Debian stable/unstable and rpm based distros RedHat 7.3/8.0, Mandrake 9.0, and Suse 7.3 thanks to umlbuilder. Overall, this is by far the most heavily tested release to date. Observed that stack overflows are occxurring from time to time in the nested testing environment.
- Added /usr/info/dir and info to make_debian which makes things much nicer.
- Added libexpect-perl and libgtk-perl to Build-Depends for debs; in general, there were many fixes for both debs and rpms and their respective source packages.
- Improved documentation.
- Added stop and go to the uml_mconsole interface for the UML Box.
- Made perl 5.8 compliant perl-IO-Stty, perl-IO-tty and perl-Expect rpm packages. Many things have changed especially with IO-tty and perl-Expect.
- Had to build slram into the kernel because RedHat 7.3s depmod causes the build to fail.

Snow Path Formation Simulator is a program that models the process of people forming very distinct, and yet not always altogether logical looking, paths in the snow as they walk across open spaces.

The evolving condition of the snow is displayed graphically. This project may eventually mature into a screensaver.

This program enables you to draw sky charts, making use of the data in 16 catalogs of stars and nebulae. In addition the position of planets, asteroids and comets are shown.
The purpose of this program is to prepare different sky maps for a particular observation.
A large number of parameters help you to choose specifically or automatically which catalogs to use, the colour and the dimension of stars and nebulae, the representation of planets, the display of labels and coordinate grids, the superposition of pictures, the condition of visibility and more. All these features make this celestial atlas more complete than a conventional
planetarium.
Enhancements:
- The default database is now SQLite to simplify the installation process.
- MySQL is still available if need.
- Add the Calendar menu with more functions for the comets and asteroids.
- Add a display bar to quickly show or hide some object from the chart.
- Complete the menu with all the available functions.
- In the configuration menu you can set the nebulae color and preview the background picture.
- Now it use Xplanet (xplanet.sourceforge.net) to display the planet image on Linux.
- Plus a lot of bug fix the previous version was filled with.

Drools is a Rules Engine implementation based on Charles Forgys Rete algorithm tailored for the Java language. Adapting Rete to an object-oriented interface allows for more natural expression of business rules with regards to business objects. Drools is written in Java, but able to run on Java and .Net.
Drools is designed to allow pluggeable language implementations. Currently rules can be written in Java, Python and Groovy. More importantly, Drools provides for Declarative Programming and is flexible enough to match the semantics of your problem domain with Domain Specific Languages (DSL) via XML using a Schema defined for your problem domain.
DSLs consist of XML elements and attributes that represent the problem domain.
Enhancements:
Bug
- DROOLS-294 - WorkingMemory synchronization is not complete (Barry Kaplan)
- DROOLS-314 - MethodMetadataSources need a stopping Class (Barry Kaplan)
- DROOLS-318 - WorkingMemoryEventListenerProcessor implements wrong interface (Barry Kaplan)
- DROOLS-347 - Maven build of drools-spring-jdk5 fails on Mac OS X (Andy Barnett)
- DROOLS-367 - Wrong rule executed when modifying object in workingmemory (Michael Neale)
- DROOLS-374 - Caching of classloaders in causes problems with hot deployment in some J2EE containers (Michael Neale)
- DROOLS-376 - Make source file (c) headers consistent with codehaus (Michael Neale)
- DROOLS-386 - Bug with the Escalation example? (Robert Laflamme)
- DROOLS-401 - Missing semaphore types in schema file (rules.xsd) (Edson Tirelli)
- DROOLS-403 - no-loop incorrectly removes all instances of a rule from the agenda (Michael Neale)
- DROOLS-409 - rename getNoLoop to isNoLoop to obey JavaBean naming convention (Mark Proctor)
- New Feature
- DROOLS-303 - Default rule-method parameter annotation (Barry Kaplan)
- DROOLS-360 - Maven goal for drools-all-src-XXX.zip (Mark Proctor)
- DROOLS-361 - Auto add RuleSet to RuleBase (Barry Kaplan)
- DROOLS-363 - Decision tables in spreadsheets (Michael Neale)
- DROOLS-383 - Integrate java:functions feature in decision tables. (Michael Neale)
- DROOLS-388 - Support for application data (variables), per rule duration, salience and names (Ricardo Rojas)
- DROOLS-408 - Xor Group so only one rule can fire for a specific group (Mark Proctor)
Improvement
- DROOLS-296 - Allow for default id value in parameter annotations (Barry Kaplan)
- DROOLS-297 - Allow multiple consequence annotations per rule (Barry Kaplan)
- DROOLS-301 - Remove Drools prefix from annotations (Barry Kaplan)
- DROOLS-309 - MethodMetadataSource to ignore certain classes (Barry Kaplan)
- DROOLS-310 - Condition sharing for POJO rules (Peter Royal)
- DROOLS-348 - JDK 1.3 no longer supported (Barry Kaplan)
- DROOLS-350 - Utilize 1.4 nested exceptions (Barry Kaplan)
- DROOLS-357 - Packaging between factory and meta needs some attention (Barry Kaplan)
- DROOLS-364 - Update spring libs and config files for 1.2 (Barry Kaplan)
- DROOLS-372 - Update Groovy to JSR-03 (Mark Proctor)
- DROOLS-381 - Add object-condition tests to RuleBuilderTest (Barry Kaplan)
- DROOLS-387 - add ability for a DSL to acces the XML namespace information in a Configuration (James Strachan)
- DROOLS-402 - Refactor maven.xml and drools:dist to make it faster and more intelligent (Mark Proctor)
- DROOLS-410 - Update Janino to 2.3.8 (Mark Proctor)
Test
- DROOLS-346 - Ant build.xml doesnt run drools-jsr94 unit tests (Andy Barnett)
- Task
- DROOLS-351 - Remove drools-annotation and derivitives from 2.1 (Barry Kaplan)
- DROOLS-370 - Add in drools-decisiontables subproject (Michael Neale)

ssss project is an implementation of Shamirs secret sharing scheme for UNIX systems.
In cryptography, a secret sharing scheme is a method for distributing a secret amongst a group of participants, each of which is allocated a share of the secret. The secret can only be reconstructed when the shares are combined together; individual shares are of no use on their own.
More formally, in a secret sharing scheme there is one dealer and n players. The dealer gives a secret to the players, but only when specific conditions are fulfilled.
The dealer accomplishes this by giving each player a share in such a way that any group of t (for threshold) or more players can together reconstruct the secret but no group of less than t players can. Such a system is called a (t,n)-threshold scheme.
A popular technique to implement threshold schemes uses polynomial interpolation ("Lagrange interpolation"). This method was invented by Adi Shamir in 1979. You can play around with a threshold scheme on the demo page.
Note that Shamirs scheme is provable secure, that means: in a (t,n) scheme one can prove that it makes no difference whether an attacker has t-1 valid shares at his disposal or none at all; as long as he has less than t shares, there is no better option than guessing to find out the secret.
Enhancements:
- This release adds memory locking and TTY echo suppression.
- A buffer overflow condition has been fixed.

libcontain library provides a large and growing number of fast and thread-safe containter objects written in C and C++.
The libcontain library now provides the following container types:
- a series of hash tables libcontain includes the hash table implementation from GNU glib and a hash implementation in C++ it inherited from the libhash library it originates from. This latter has been rendered thread-safe in the 0.2 release and implements a linear hashing algorithm. A single hash table implementation that will replace them both is on the drawing boards and is intended to be thread-safe and non-blocking.
- an array (vector) implementation
libcontain currently includes a non-blocking array implementation. However, this implementation presents a race-condition in concurrent calls to any of its writing functions if the array is in the process of being resized. There is currently no known non-blocking way to solve this race condition. Help is welcome in this area.
- a binomial tree
The binomial tree provided by libcontain does not provide any algorithmic logic in its implementation: it is a generic container that can be used as the basis for other container implementations, such as a heap or a map (as a matter of fact, the heap and the map are both based on this binomial tree)
- a heap
libcontain provides an automatically sorting heap implementation that (obviously) uses a heap sort to sort the elements it contains. Unfortunately, the heap implementation is not non-blocking (although bases on a non-blocking binomial tree implementation). It contains four levels of locks: a reader count and a write lock at the level of the nodes, and a reader count and a write lock at the level of the container. The locks are posed on the container for as short a time as possible so at to prevent the progress of the algorithm to block too long. If anyone knows of a non-blocking heap algorithm, input is more than welcome.
- a list
libcontain provides a non-blocking list implementation based on an algorithm by M.M. Micheal (also the inventor of Safe Memory Reclamation on which libmemory is based).
a map
The map implementation included in libcontain is based on the binomial tree implementation. Unlike some implementations based on binary trees, this implementation stores values in each node of the tree (not just the leaf nodes) and therefore allows a more memory-efficient way to store information than hashes and other map implementations. Also, the map implementation does not use a "less" function but uses a three-way comparison to compare keys (much like the helper function used by qsort). The implementation is almost (but not quite) non-blocking: for most intents and purposes, there are no real locks: read and write operations may be re-directed along a branch of the binomial tree if a node that they traverse is being deleted, but will not block for that. However, a remove operation will wait for another remove operation to finish if it traverses a node being removed.
- a queue
a non-blocking queue implementation is provided
- a stack
a non-blocking stack implementation is also provided
In future versions, the hash implementation will be replaced by a non-blocking one and the remaining problems with the existing containers will (hopefully) be solved. Help is also needed to write the architecture-dependant code for non-IA32 platforms such as Sparc.
Enhancements:
- The 0.2 release introduces number of important new features including a heap and a map, both based on a lock-free binomial tree. It also includes the required memory management to make the containters impervious to the ABA problem and thus truly thread-safe.

You should have dreamed to do some complex, tricky or user friendly authentication when using Apache web server. You can do this by some CGI or PHP script to send out the requested content only when some condition is met.

However, this approach is not perfect because some features of Apache web server cannot be used under such mechanism. Such features include HTTP/1.1 partial file retrieving, content negotiation and output stream compression.

This simple and small Apache module will solve such problem. And, it also simplifies an authentication mechanism.

mod_auth_script Apache module makes it possible authentication/authorization to be done by an external program. The external program can be provided as a CGI, PHP or any other schemes which allow dynamic content to Apache.

This Apache module is written just like Apaches standard modules. It may be used as DSO (dynamic linked) module or even compiled-in (static linked) module. A simple Makefile is provided for building as DSO module. On most Unix-like system, you will type just like below:

% make
% su
# make install

I am sorry that this version does not include any documentation and samples. For configuration directive, please read the big comment block in the source file mod_auth_script.c.

I hope this module helps your web application project. I will appreciate any comments, bug reports and suggestions. And, I will be very happy if you notify me where and how this module works in a real web application.

Sysfence project is a resource monitoring tool designed for Linux machines. While running as daemon it checks resource levels and makes desired action if some values exceed safety limits.
Main features:
- notifying system administrators when something goes wrong,
- stopping services when system performance is dropping too low and starting them when its going up again,
- periodically restarting memory-leaking processes,
- dumping system statistics in critical situations
Usage
Sysfence reads its configuration from file(s) specified in argument list. Config files may contain one or more rules describing conditions and actions to be performed.
Rule has syntax like this:
if {
resource1 > limit1
or
{ resource2 < limit2 and resource3 < limit3 }
}
run once command-to-be-run
The block enclosed within {} brackets describes condition. When its result is TRUE, following command is invoked.
The once keyword is optional. If present, the command is executed only once after condition becomes TRUE. Next execution will take place only if condition becomes FALSE and then TRUE again. Without once keyword, command is invoked periodically, after every resource check that gives TRUE, no matter what was the condition result before.
Command specified right after run keyword is passed to /bin/sh, so it may contain more than one instruction or even whole script. But be careful - rule checking is suspended unless command execution has been completed! (Other rules are unaffected.)
As resources, following ones can be given:
- la1 - load average during last minute.
- la5 - load average during last 5 minutes.
- la15 - load average during last 15 minutes.
- memfree - lower limit for free memory amount.
- memused - upper limit for memory used by processes.
- swapfree - lower limit for free swap space.
- swapused - upper limit for swap space in use.
Enhancements:
- This release contains bugfix for wrong memory levels recognition on non-vanilla kernels.