Khoa Thien Nguyen

US Patent:

7657776, Feb 2, 2010

Filed:

Sep 20, 2006

Appl. No.:

11/523892

Inventors:

Anurupa Rajkumari - Austin TX, US
Khoa D. Nguyen - Richardson TX, US
Marvin Spinhirne - Richardson TX, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 11/00

US Classification:

714 2

Abstract:

Embodiments include methods, apparatus, and systems for containing machine check events in a virtual partition. One embodiment is a method of software execution. The method divides a hard partition into first and second virtual partitions and attempts to correct an error in a firmware layer of the first virtual partition. If the error is not correctable, then the method reboots the first virtual partition without disrupting hardware resources in the second virtual partition.

US Patent:

8601128, Dec 3, 2013

Filed:

Dec 10, 2009

Appl. No.:

12/635580

Inventors:

Thomas Ford - Prosper TX, US
Khoa D. Nguyen - Arlington TX, US
Richard D. Powers - Highland Village TX, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173

US Classification:

709226, 718 1, 718104

Abstract:

Methods and apparatus for allocating computer hardware resources of a hard partition of a computer server system to one or more soft partitions. In response to a partitioning request, a nucleus firmware instance of a hard partition may be configured to launch a separate firmware instance corresponding to each requested soft partition, and to allocate partitionable hardware resources of the hard partition to the soft partitions by allocating the hardware resources to each separate firmware instance.

US Patent:

49624687, Oct 9, 1990

Filed:

Dec 9, 1987

Appl. No.:

7/130851

Inventors:

Gary M. Beauregard - Austin TX
Larry K. Loucks - Austin TX
Khoa D. Nguyen - Austin TX
Robert J. Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G09G 116

US Classification:

364521

Abstract:

Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line line of the polygon for each line of the polygon.

US Patent:

57105782, Jan 20, 1998

Filed:

May 9, 1990

Appl. No.:

7/521858

Inventors:

Gary Michael Beauregard - Austin TX
Larry Keith Loucks - Austin TX
Khoa Dang Nguyen - Austin TX
Robert John Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06T 1140

US Classification:

345429

Abstract:

Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line of the polygon for each line of the polygon.

US Patent:

50290770, Jul 2, 1991

Filed:

Sep 7, 1988

Appl. No.:

7/241757

Inventors:

Farhad H. Fatahalian - Round Rock TX
Larry A. Halliday - Austin TX
Khoa D. Nguyen - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 300
G06F 900
G06F 1300

US Classification:

364200

Abstract:

A data processing system gives an application running on the operating system direct access to the output display. The system is operable in two modes. In the first mode, if the application displays text to the output display, the output data must go through every layer of the processing system before it reaches the output display. In the second mode, the application can output data directly to the output display without going through the many layers of the processing system. In this second mode, a buffer is defined by the application. Input data from the input devices are stored in this buffer. The application accesses the buffer for direct output to the display.

US Patent:

45557730, Nov 26, 1985

Filed:

May 11, 1983

Appl. No.:

6/493402

Inventors:

Roy E. Karnes - Austin TX
Rex A. McCaskill - Austin TX
Khoa D. Nguyen - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 300

US Classification:

364900

Abstract:

A word processing system is provided with printing means for printing on a character by character basis a data stream including merged graphic and alphanumeric data. The word processing system is provided with an interactive display for displaying by character generation a data stream representative of alphanumeric characters to be printed together with means for printing the characters on a document on a character by character basis. Operator interactive apparatus is provided whereby the operator can form a graphics data stream which is displayable on said display by character generation. This graphics data stream may then be integrated into the existing alphanumeric data stream, and the data in this integrated data stream may then be applied to the printing means whereby the alphanumeric characters and the graphic characters represented by this data stream are printed character by character to provide a document having the integrated alphanumeric and graphic information.

Address:

14818 Hemlock Brg Ct, Sugar Land, TX 77498

VIN:

JTJZB1BAXA2402057

Make:

LEXUS

Model:

RX 450H

Year:

2010