Jaxon modulation is a modulation system for placing information on a bitstream generated by a finite generator.
A bitstream of random nature can most probably not have any extra information modulated onto it. While a bitstream with zero entropy can have any amount of information modulated onto it. But such a stream which holds the modulated information can not be made by a finite generator. In between these two grounds of maximal entropy and minimal entropy perhaps a finite generator exists for a stream having a ratio of 4 to 1 in the bit states.
The bounds for the stream entropy is more than two to one of one bit state to the other for the bit statistics. A three to one bit state bias would allow modulation of information onto the stream at 3/16ths of the stream's bit rate.
3/4*((N-2)/(N+1)) = rate of modulation factor for N to 1 bit state biased carrier stream.
Link awareness is defined as the ability to discover, view, search and update global hyperlink information about any resource with a URL on the World Wide Web. This global link information is a shared information resource.
Implementing link awareness is difficult. In practice, an implementation only approximates link awareness. There are at least two qualitative axes on which we can classify these implementations.
- Breadth of Coverage: The number and type of interlinked documents covered.
- Liveness: The ability (or lack thereof) to update the link information on the fly.
Implementation examples
- Most WikiWiki implementations support link awareness within the scope of the documents that they host. Their breadth of coverage (insofar as link information is concerned) is narrow. A wiki, however, is very live (and indeed, liveness, is its raison d'etre).
- Google supports link awareness through its web interface. (You type in a query of the form
link:<URL>.) Google's breadth is impressive (it covers a lot of interlinked documents), but it is a far cry from live (it can take months before Google indexes a newly created document).
Icecream is a distributed compiler created by SUSE and is based on ideas and code by distcc. Distributed compilers work by distributing the work over several machines thereby increasing the computer-power available for the compiler. Icecream uses a central server that dynamically schedules the compile jobs to the fastest free machine. This advantage pays off mostly for shared computers. Icecream only works with gcc, but does not require the same version of gcc installed on the remote hosts. It figures out which compiler version to use automatically, and distributes the correct compiler and environment if it is missing on the host. Icecream can also handle cross-compilation.
Icecream is designed for SUSE, but is also widely used at KDE community events.
Björn the Pale was a berserker who appears in the Saga of Gisli. He traveled around Norway, making unreasonable demands of various people (such as their land and wives). If they didn't submit to Björn's demands, he would kill them and take what he had demanded. Eventually Björn the Pale met his match in Gisli, son of Thorkel of Surnadal, when Gisli borrowed a powerful sword named Greyflank, and slew Björn the Pale in battle.