Some things I've worked on
JiniLiteI currently work on methods to connect non-Java devices to Jini systems. Some of the work I did last year is archived here. I've done some work after that, and I've written it all up in my Master's Thesis.
There is a surrogate group at jini.org actively exploring many of the same issues, although I doubt they have a sample implementation out there. They have a home page listing draft standards and a pretty active mailing list. You might need to register with jini.org before you can access their links.
I have an implementation of what I call an RPS and the jini.org surrogate community call a surrogate. Since I wrote it before the surrogate group was set up, it does not conform to the surrogate architecture proposed by the group, although it has similar functionality. In my copious spare time ;-), I plan to rework this so that it fits the proposed surrogate architecture.
Meanwhile, I'm putting my code up for download in the hope that it benefits someone in the jini community. The code is reasonably clean and well-documented, but it might still require some effort to use and understand. If anybody who downloads this code converts it to fit in with the surrogate architecture, I would appreciate it if you would let me know so that I can make the revised version available.
After all that preamble, here's the actual code ( UcscRps.jar (500k)). On some browsers you may need to right click and select "Save Link As" to get it to download properly. For installation instructions, look here.
Graph decoder appletOne of the nicer class projects I've done is a graph based decoder for an Error Control Coding class (CMPE251) taught by R. Micheal Tanner. This applet has been written in Java 1.2, so you need the Java1.2 Plugin installed if you want to run it in Netscape or IE.
The explanation about graph based decoders is very sketchy because I don't have
the time to write it up, but the animation is rather pretty. For the
error-control buffs out there, it implements a sum-product algorithm and works
on arbitrary graphs. The current example is a [15,5,6] graph with 6 weak
Extracting the package