Free reference implementation software for linux

JVending project bridges P2P networks and wireless delivery of content to mobile devices. Due to high latency of wireless connections, it is not practical to directly hook up the mobile devices to the peer network, so I have taken a different approach with JVending.

A user sets up a personal provisioning server on their PC and hooks it into the network. Through the P2P network, we create a federation of provisioning servers. The mobile devices use the federated provisioning servers as content portals.

JVending differs from P2P systems, such as Gnutella or "Project JXTA" reference implementation, in the following ways. JVending provides:

1. Catalog management
2. Device detection, which delivers the appropriate content based upon the type of browser or device
3. Web based browsing of content, so you can share with your friends on a wired or wireless network, after you have already collected the content.
4. The ability to search for and distribute packaged archives on the peer network.
5. Web links tying together the network.
6. PPG integration for pushing content to mobile devices.

For 2005 - 2006, the major goals of JVending (roughly in order of importance) are:

1. Expanding P2P support, including more in the area of wireless messaging (SMS)
2. JSR-124 compliance
3. Performance testing and monitoring capability
4. Multimedia server and J2ME support. This covers full integration between the MMS Client and the provisioning server.

Setting up the Environment

Follow these steps:

1. Make sure that you have J2SE 1.4.2 JDK installed. If not, go to http://java.sun.com/j2se/1.4.2/download.html and download and install the JDK (not JRE). I have not tested with J2SE 1.5 JDK, so it may or may not work with that version.
2. Download the jvending-standalone.zip file from the JVending project site.
3. Unzip the file into a directory of your choice, say /jvending
4. Set the JAVA_HOME environmental variable, depending on your OS. In windows, you can do this through the Control Panel/System/Advanced/Environmental Variable: JAVA_HOME =
EXAMPLE: JAVA_HOME=c:Programsj2sdk1.4.2_06

Starting JVending

1. Go to the bin directory and click on the run.bat (for windows) or run.sh for Unix.
2. The first time you start JVending, you will see a JXTA Configurator screen show up. Type in your user name and password/verify password. Click OK.
3. Wait 10 seconds for JVending to finish its startup sequence and then go to http://localhost:80/jvending/login. If you get a 404 error, wait a few more seconds and try again. Login ID/Password: admin/admin. Click "Submit Query" button. You will now see the JVending home page.

cdbxx is a small STL style C++ library for TinyCDB implementation of Constant Database. It provides iterators, data adapters and high level interfaces for databases.

aewm is a minimalist window manager for X11. It has no nifty features, but is light on resources and extremely simple in appearance.
It should eventually make a good reference implementation of the ICCCM. A few separate programs are included to handle running programs, switching between windows, etc.
aewm was based on 9wm, which has also inspired lwm, larswm, and w9wm. It has in turn inspired the following window managers:
Sapphire/aewm++ (defunct?)
alloywm
evilwm
maewm (defunct?)
Oroborus
phluid
swm
Clementine
WindowLab
YeahWM
Spook (defunct?)
wimpwm
Some other minimal WMs worth checking out are:
wm2
wmii (no relation!)
PLWM
YAWM (defunct?)
ratpoison
Anarchy
Ion
Enhancements:
- UTF-8 support was added, and various EWMH bugs were fixed.

libmemory library provides an implementation of M.M. Micheals Safe Memory Reclamation algorithm in C.

The Safe Memory Reclamation algorithm provides a convenient way to get rid of the so-called ABA problem in which a value changes from A to B back to A between reads.

If, for example, the value youre reading is a pointer and the memory to which it points is freed and re-allocated between two reads, what you do with the memory it points to in that time may result in mayhem.

The SMR algorithm prevents this by registering a "hazardous reference" to then pointer thus preventing the memory from being reclaimed while a reference exists.

The implementation is designed to fully implement the SMR algorithm without restricting the user to provide such information as the maximum number of threads used by the application or the batch size used by the algorithm.

It will run on any POSIX-compliant platform and uses the POSIX threads API for thread-local storage. It should, however, be a trivial effort to port this library to Windows.

nss_ldap is an RFC 2307-compliant set of C library extensions.
The resolution of the entities defined in RFC 2307 is generally performed by a set of UNIX C library calls (such as getpwnam() to return the attributes of a user).
The nss_ldap module provides the means for Solaris and Linux workstations to this information (such as users, hosts, and groups) from LDAP directories.
The module is the reference implementation of RFC 2307, and has been studied by vendors such as Sun (who developed the original Name Service Switch interface).
Main features:
- Support for the RFC 2307/RFC 2307bis (including netgroups) as well as user-defined schema
- Common implementation across platforms
- Support for Kerberos and SSL authentication, integrity and privacy
- Configuration file compatibility with pam_ldap
- Bootstraps from the DNS using SRV records
- Support for AIX, glibc, IRS and ONC+ name service switches
- Support for RFC 2307bis groups (including nested groups)
- Specific Active Directory support including incremental retrieval of multi-valued attributes
- Directory-based authentication for platforms that lack PAM (AIX 4.3.3)

Buyasta is a MUD engine which provides a simple-to-use framework for constructing MUDs with the Python programming language.
Buyasta; an ancient Persian demon of laziness who tries to prevent people from working. He is one of the Daevas. (Encyclopedia Mythica)
Buyasta is also (yet another) MUD engine written in Python. The primary goal of this project is to provide a simple-to-use framework for constructing MUDs. Consequently, the Core library implements the bare functionality required for every multi-user environment (i.e. an engine, base objects, rooms, etc).
Why such minimalism? In my opinion, engineering something as complex as a virtual world should be a bottom up process. More often than not, implementors end up striping away most of a MUD distribution before proceeding on with actual development. With Buyasta Core, you wont have to. Just build on top of it.
Since Buyasta is more of a framework/library, a secondary goal (not secondary in priority though!) is to produce thorough API documentation and tutorials. We strive to make documentation a first class citizen of this project!
. . . Of course, I wouldnt be working on this if I didnt have my own delusions of grandeur - and my extensions to the core are also included in the source package.
Enhancements:
- This is a major update and reorganization; changes include command autocompletion, support for command permissions (and admin commands), object visibility rules, better prompt handling, a reference OLC implementation, (buyasta.ext.olc) and sample combat implementation (buyasta.ref.newbie).

Template Numerical Toolkit (TNT) is a collection of interfaces and reference implementations of numerical objects useful for scientific computing in C++.
The toolkit defines interfaces for basic data structures, such as multidimensional arrays and sparse matrices, commonly used in numerical applications. Template Numerical Toolkits goal is to provide reusable software components that address many of the portability and maintennace problems with C++ codes.
TNT provides a distinction between interfaces and implementations of TNT components. For example, there is a TNT interface for two-dimensional arrays which describes how individual elements are accessed and how certain information, such as the array dimensions, can be used in algorithms; however, there can be several implementations of such an interface: one that uses expression templates, or one that uses BLAS kernels, or another that is instrumented to provide debugging information.
By specifying only the interface, applications codes may utilize such algorithms, while giving library developers the greatest flexibility in employing optimization or portability strategies.
TNT Data Structures
- C-style arrays
- Fortran-style arrays
- Sparse Matrices
- Vector/Matrix
TNT utilities
- array I/O
- math routines (hypot(), sign(), etc.)
- Stopwatch class for timing measurements
Libraries that utilize TNT
- JAMA: a linear algebra library with QR, SVD, Cholesky and Eigenvector solvers.
- old (pre 1.0) TNT routines for LU, QR, and Eigenvalue problems