DR. DAVID A GARRISON, PH.D.
Psychologist at Spicewood Springs Rd, Austin, TX

7386796, Jun 10, 2008

Apr 1, 2003

10/404809

Richard Ormond Simpson - Austin TX, US
David Alan Garrison - Austin TX, US
Yiqin Zhao - Austin TX, US

Newisys Inc. - Austin TX

G06F 3/00

715736

One embodiment of the disclosures made herein is a data processing system adapted for enabling at least one of presence and operating condition of system components installed in the data processing system to be monitored. Examples of presence include installed and uninstalled. Examples of operating conditions include temperature, voltage, current, duty-cycle, etc. The data processing system includes provides a user interface adapted for displaying a 1:1 mapped representation of the data processing system. Operating conditions of installed system components may be assessed via the user interface. A system component that is installed in its respective location in the data processing system (e. g. , in a particular socket) is depicted in the 1:1 mapped representation of the data processing system as being installed in a corresponding location of the data processing system. After performing an operation for installing a particular system component in its respective location of the data processing system (e. g.

4701851, Oct 20, 1987

Oct 24, 1984

6/664183

Vance R. Bass - Austin TX
Veronica A. Bonebrake - Leander TX
David A. Garrison - Austin TX
James K. Landis - Austin TX
Mary S. Neff - Montrose NY
Robert J. Urquhart - Austin, both of TX
Susan C. Williams - Austin TX

International Business Machines Corporation - Armonk NY

G06F 1538, G06G 760

364419

A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During attempted verfication of a text word, all initial substrings of the word found in the dictionary are saved in a list. If the entire word is not found in the dictionary, the longest substring in the substring list is subtracted from the entire word to be verified to yield a "remainder" portion of the input text word. The dictionary words are then compared with this remainder portion to determine if a match occurs. If so, then both portions of the word are found in the dictionary and spelling of the word is considered correct. If the remainder is not found in the dictionary, successively shorter initial substrings are accessed to yield successively longer remainders. The word is considered correctly spelled if both a substring and a remainder are found in the dictionary. This techinque is applied recursively so that multiple-piece compounds can also be found.

4672571, Jun 9, 1987

Oct 24, 1984

6/664184

Vance R. Bass - Austin TX
Veronica A. Bonebrake - Leander TX
David A. Garrison - Austin TX
James K. Landis - Austin TX
Mary S. Neff - Montrose NY
Robert J. Urquhart - Austin TX
Susan C. Williams - Austin TX

International Business Machines Corporation - Armonk NY

G06F 722

364900

A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During verification of a text word, an attempt is made to find a pair of words in the dictionary of which the text word consists. A table associated with the dictionary includes compound class information relative to each of the words stored therein. The compound class of each of the pair of words of which the input text word consists are tested for compatibility to determine if each of the pair of words may acceptably be used in a compound word in the physical position in which it is found in the input text word.