This directory has a description of the Omega Complexity procedure in postscript, tex, or dvi format. The nsfo subdirectory contains the source code for the functional program written by Jiri Wackermann to compute Omega Complexity for data from the EGG project. A compiled version (Redhat 5.2 or 6.2) is called nsfo, and there is a man file called nsfo.man. A couple of scripts to reformat the data to conform to the requirements of nsfo are also present, along with some data files that were used in testing and learning how the program works. Some usage notes addressing the critical issue of selecting a reasonable time-slice for the EGG application can be found in jiri.notes. Numerous possible uses might be made, but the essence is a way to compute a small set of parameters that summarize the inter-relationship of huge numbers of data points. The program was originally designed to process EEG data taken over several hours (e.g., during sleep) to obtain a relatively small number of points in the multi-dimensional space defined by multiple channels. Three parameters are computed, which in the brain data represent frequency, amplitude, and complexity. In the EGG data these parameters, especially complexity, may allow identification of structure such as intercorrelation among the eggs, and to express it in a highly compact way. For a brief but relatively complete (and more accurate) description, see the "globdesc" papers in this directory.