Thursday, December 15, 2011

Unpatenable idea on building Huffman encoded templates

These idea are released to the public domain.
Huffman codes are run length encoded, less frequent encodings have longer sequences. In making tables of formats for argements models, for example, hos does this work? Maybe an eight element table of formats taking the Dublin Core two different ways. Then a table of 20 formats taking the Dublin Cores three different ways. And so on.

In the machine, the Huffman overload triggers a micro sequence of table operation, generating the proper format, then launching the 'fill in the form' convolution; that is, recasting actual, bound data onto the format. The client then chooses the complexity of the result, the short/long/medium form. The javascript code, using namespace, generates the TE syntax and launches the statement. Sometime later, jquery fills in a display window to match the chosen form, G, underneath, having filled in the form in a returned graph.

No comments: