Abstract: A method of identifying a topic of a text. Text is received. Then, the nouns in the text are identified. The singular form of each identified noun is determined. Combinations are created of the singular form of the identified nouns, where the number of singular forms of the nouns in the combinations is user-definable. The frequency of occurrence in the text of each noun that corresponds to its singular form is determined. Each frequency of occurrence is assigned as a score to its corresponding singular form noun. Each combination of singular form nouns is assigned a score that is equal to the sum of the scores of its constituent singular form nouns. The user-definable number of top scoring singular form nouns and combinations of singular form nouns are selected as the topic of the text.

Abstract: The present invention is a method of database searching. First, a language is selected and elements received. The system is searched to identify a unit number associated with each element, which is linked to a data unit containing morphological variants of the element. If none are identified, the element is broken into sub-textual units that may contain a prefix, compound-prefix, and/or suffix along with a primary element. A unit number is then obtained for the primary element. If this does not result in a match, the elements may be saved in a database for further linguistic development. A unit number associated with each matched element is then chosen, and the elements contained in the data units linked to the unit numbers are compared to a database index. If an element is associated with multiple unit numbers, this process is repeated until all data units have been compared to the database.

Abstract: The present invention is a method of eliminating loops from a computer program by receiving the program, graphing its function and control, identifying its entry point, and identifying groups of loops connected to its entry point. Stop if there are no such groups. Otherwise, selecting a group of loops. Then, identifying the selected group's entry point. If the selected group includes no group of loops having a different entry point then replacing it with a recursive or non-recursive function, reconfiguring each connection entering and exiting the selected group to preserve their functionality, and returning to the fifth step. Otherwise, identifying groups of loops in the selected group connected to, but having different entry points and returning to the loop selection step.

Abstract: The present invention is a method of database searching. First, a language is selected. Next, elements are received. The system is then searched to identify at least one unit number that is associated with a chosen element, the unit number being linked to a data unit containing morphological variants of the element. If no unit number is identified, the element is compared to a prefix list. If no match is found there, the element is broken into a prefix and suffix, and the prefix and suffix are matched to a prefix list, suffix list or a unit number. This process is repeated for all elements. A unit number associated with each element is then chosen, and the elements contained in the data units linked to the unit numbers are compared to a database. The results are displayed and preferably ranked according to user preferences. If an element is associated with multiple unit numbers, this process is repeated until all data units have been compared to the database.

Abstract: The present invention is a method of finding range and velocity of a target in a radar system using a time scale factor. Specifically, sending at least one signal from at least one transmitter to a target. A return signal is then received from the target at each transmitter and the elapsed time is recorded. The range to the target and velocity of the target are calculated based on a time scale factor of the recorded elapsed times. These values are appropriately output to the user.

Abstract: The present invention is a method of fabricating a waveguide using a sacrificial spacer layer. The first step in this process is to fabricate the underlying optical semiconductor structure. A trench is then etched in this structure resulting in an underlying L-shaped structure. A sacrificial spacer layer is deposited in the trench. The waveguide is created in the trench on the sacrificial spacer layer using a mask layer to angle the vertex of the L-shaped structure. User-defined portions of the sacrificial spacer layer are subsequently removed to create air gaps between the waveguide and the sidewalls of the trench in the optical semiconductor.

Abstract: A method of reliably communicating via a computer network by identifying hub nodes in the network, identifying leaf nodes in the network, communicating from hub nodes to corresponding leaf nodes, reporting from leaf nodes to corresponding hub nodes, communicating between hub nodes, re-designating a leaf node as a hub node if the leaf node identifies a region of the network not known by a hub node, re-designating a hub node as a leaf node if the hub node becomes redundant, re-designating a leaf node as a hub node if the leaf node loses connectivity to its hub node, and returning to the third step for additional processing.

Abstract: A method of establishing and updating a master node in a computer network by scoring each node in the network as a function of its physical attributes, designating the highest scoring node as the master node, sending a periodic message by the master node with its score and a request for non-master node scores, sending a message by a non-master node to the master node requesting relinquishment of master node status if the non-master node has a higher score, relinquishing master node status to a non-master node with a higher score and returning to the third step, and declaring by a non-master node that it is a master node if it has not received a message from the previously designated master node in a user-definable period of time and returning to the third step.

Abstract: A method of encoding a communication signal by selecting a cyclic code, establishing a generator polynomial, generating a polynomial using the generator polynomial, forming a matrix from the generated polynomial, receiving data to be encoded, appending zeros to the received data, calculating a syndrome of the matrix, calculating check values from the syndrome, appending the check values to the received data, and encoding the received data with appended check values using the generator polynomial.

Abstract: A method of sorting text for memory efficient searching is disclosed. A FM-index is created on received text, and a number of rows are marked. The locations of the marked rows are stored in data buckets as well as the last column of the FM-index, which is stored as a wavelet tree. Data blocks containing the data buckets are created; containing the number of times each character appears in the data block before each data bucket. A header block is created comprising an array of the number of times each character appears in the last column of the FM-index before each data blocks, the location of the end of the data blocks and the location of the end of the data, and appended to the data block. The header and data blocks are stored. The search process loads data buckets into memory as needed to find the required text.

Abstract: The present invention is a novel method of performing spectral analysis on a digital signal. The received signal is segmented into a number of data blocks, which may be disjoint or overlapping. For each data block, the signal is differentiated, and the Gram-Schmidt process is used to obtain orthogonality between a signal and its derivative. The complex extension leads to computation of phase using either the inverse tangent function or the complex logarithm. Finally, frequency estimation follows through differentiation of the unwrapped phase.

Abstract: The present invention is a method of fabricating an optical device using multiple sacrificial spacer layers. The first step in this process is to fabricate the underlying base structure and deposit an optical structure thereon. A facet is then created at the ends of the optical structure and alternating sacrificial and intermediate layers are fabricated on the device. A mask layer is deposited on the structure, with openings created in the layers to allow use of an etchant. User-defined portions of the spacer layers are subsequently removed with the etchant to create air gaps between the intermediate layers.

Abstract: A method of correcting a communication signal with BCH product codes is disclosed. The method comprising the steps of receiving a codeword vector, establishing a generator polynomial, establishing a check polynomial, calculating a binary-matrix, and calculating the binary syndrome S=Hrt. If an all zero vector results, no errors exist in the received vector. If errors exist, a tm x (N?k) binary matrix is created, the power basis expansion of (r(?1), r(?3), r(?5), . . . r(?2t?1)) is calculated, and the syndrome is solved. The speed of the method comes from using word-level XOR's to apply the check polynomial to the stream at all offsets. The utility of this approach is due in part to the fact that the conversion matrix involved can be created quickly using only items needed elsewhere in BCH decoders: a field table and the generator polynomial coefficients.

Abstract: The present invention is a method of fabricating an optical device using multiple sacrificial spacer layers. The first step in this process is to fabricate the underlying base structure and deposit an optical structure thereon. A facet is then created at the ends of the optical structure and alternating sacrificial and intermediate layers are fabricated on the device. A mask layer is deposited on the structure, with openings created in the layers to allow use of an etchant. User-defined portions of the spacer layers are subsequently removed with the etchant to create air gaps between the intermediate layers.

Abstract: A method of removing noise and interference from a signal by receiving the signal, calculating a joint time-frequency domain of the signal, estimating instantaneous frequencies of the joint time-frequency domain, modifying each estimated instantaneous frequency, if necessary, to correspond to a frequency of the joint time-frequency domain to which it most closely compares, redistributing the elements within the joint time-frequency domain according to the estimated instantaneous frequencies as modified, computing a magnitude for each element in the joint time-frequency domain as redistributed, plotting the results as the time-frequency representation of the signal, identifying in the plot any noise and interference components in the received signal, eliminating from the redistributed joint time-frequency domain elements that correspond to noise and interference, and recovering a signal devoid of noise and interference from the modified redistributed joint time-frequency domain.

Abstract: A method of generating a code that minimizes error propagation by selecting integers m, n, mrl, and a range of fractions od, where m represents the number of bits in an unencoded sequence, where n represents the number of bits in an encoded sequence, where mrl represents the maximum run length of an encoded sequence, and where od represents a range of ones densities of an encoded sequence. Next, generating an encoding map M that maps each unencoded sequence to an n-bit encoded sequence that satisfies od and mrl. Next, generating a decoding map N that maps each n-bit sequence to an m-bit sequence. Next, determining an error-propagation score for M and N. Then, returning to the step of generating M if a user requires a lower error-propagation score.

Abstract: Range limited antenna includes at least two sets of antenna elements and an RF signal processing network connected to each set of antenna elements. The network has a function, F(?,x)=?A(x)??B(x)+?C(x)??D(x) . . . +?N?1(x)??N(x), where x is a signal, ?A(x) is the phase angle of signal x at the first element set, ?B(x) is the phase angle of signal x at the second element set, ?N(x) is the phase angle of signal x at the set N, and ? contains all additional parameters which bear on the system. The network is configured to pass a signal for which F(?,x)>?, where ? is a threshold amount, such that the antenna has gain to signals within a radius and has attenuation outside the radius.

Abstract: A method of identifying file format, converting file from assumed format and bit ordering to user-definable format, dividing file into blocks, determining frequencies of occurrence in blocks, creating first set of frequencies of occurrence less than and equal to most frequently occurring integer, creating second set of frequencies of occurrence greater than the most frequently occurring integer, creating third set of differences in first sets, creating fourth set of differences in second sets, replacing third and fourth sets with polarity indicators, summing polarity indicators, determining sum percentages, pairing percentages, determining pairing maximum number, determining statistics, determining maximum of statistics, assigning result to converted file, selecting another format and bit ordering and returning to third step, identifying converted file with maximum statistic, and determining format and bit ordering of file to be that of assumed format associated with converted file identified in last step.

Abstract: The present invention is a method of fabricating a waveguide using a sacrificial spacer layer. The first step in this process is to fabricate the underlying optical semiconductor structure. A trench is then etched in this structure resulting in an underlying L-shaped structure. A sacrificial spacer layer is deposited in the trench. The waveguide is created in the trench on the sacrificial spacer layer using a mask layer to angle the vertex of the L-shaped structure. User-defined portions of the sacrificial spacer layer are subsequently removed to create air gaps between the waveguide and the sidewalls of the trench in the optical semiconductor.