Reducing Hyper-Links between Distributed Context-Free
Polymorphic Analog-to-Digital WYSIWYG (Deep Breath)
Distributed Real-Time Logical Network
Data Things
Ian Jacobs
April 1, 1991
In this paper, a subject is presented. The passive voice gets used to
describe it. Distributed hyper-links are concerned. With distributed
hyper-links, the remote transmission of reusable data between clients
is accelerated. Storage space is required, however. The reduction of
these links is therefore motivated. Original work is presented on the
reduction of these links through the context-free logical framework
and a little late night hacking. First, data things, and the links
between them across a network in a real time system consisting of both
analog (for information retrieval) and digital (since I had an A-to-D
converter in the garage) components within the “look and feel” of a
WYSIWYG graphical environment with a self-correcting typechecker and a
grant from the Mobil Corporation, is (are?) introduced. An example is
shown. Another example is shown. Another example is shown, this time
with polymorphic fuel-injected overloading and power network data
steering.
Hyper-links are presented, at first in general, then in detail for
those who don't understand very simple ideas the first time. The
reduction of these hyper-links is achieved by applying the
Huey-Duey-Luey algorithm. The derivation of this algorithm as a
generalization of well-known “Edit-Compile-Run” sequence is done.
With the H-D-L algorithm, a storage reduction of 30% is possible in
the average case. The worst case
performance is quite bad, believe me. The optimality of this algorithm
is proved recursively. This proof is shown to be accurate to
within O(n^3). Finally, other hyper-link reduction techniques
are discussed, but not taken seriously.
Ian Jacobs