Siu Mui Lam

6509904, Jan 21, 2003

Mar 10, 2000

09/522668

Siu Lam - Woodcliff Lake NJ

Datascope Investment Corp. - Montvale NJ

G09G 500

345613, 345614

A method and device for increasing the horizontal resolution of both a color flat panel display and a cathode ray tube (CRT) display. The method involves fine horizontal positioning of pixels according to information encoded in the color. Since pixel size is not changed, the display and processing bandwidth requirement is not increased. For the case of the color flat panel display, the fact that each pixel is constructed of a horizontal stripe of 3 primary color sub-pixels is utilized. Complex color information is spread across adjacent pixels to increase the apparent horizontal resolution by a factor of three. For the case of the CRT, a clock multiplier is used to multiply the video clock frequency by three. The apparent horizontal resolution of the CRT is increased by a factor of three by delaying pixels a varying multiple of this high clock speed. By encoding the fine repositioning information in the pixel color, the same display output can be post-processed respectively for the color flat panel and the CRT, allowing them to be driven and resolution enhanced simultaneously.

6782461, Aug 24, 2004

Feb 25, 2002

10/082391

Siu H Lam - Woodcliff Lake NJ

Intel Corporation - Santa Clara CA

G06F 1200

711170, 710 54, 710 56, 710 57

Dynamically adjustable load-sharing circular queues are disclosed. That is, a method of reversing the processing order of a second queue placed adjacent to a first queue to allow the space allocated to both queues to be dynamically adjusted, without copying or moving queue data or affecting the performance of the input and output queue functions is described. These advantages are attained without adding any overhead to conventional circular queues, in terms of processing and memory requirements. Dynamically adjustable circular queues are particularly useful in reducing memory requirements for simple circular queues used in serving either a primary/backup or load-sharing configuration of two input queues. A simple way of determining when the queue sizes can be adjusted is further described.

6813658, Nov 2, 2004

Mar 27, 2002

10/108090

Siu H Lam - Woodcliff Lake NJ
Kai X Miao - Boonton Township NJ

Intel Corporation - Santa Clara CA

G06F 300

710 54, 710310, 710 52, 711109, 711110

A dynamic data queuing mechanism for network packets is disclosed. A three-dimensional coil may be expanded or contracted in length. In addition, the size of each loop of the three-dimensional coil may be adjusted. Moreover, simple circular queue and dynamic buffer management techniques are combined to implement circular queues that may be adjusted in size. Size adjustment, in turn, causes an entire queue either to expand or contract. Circular queue size is changed dynamically, without any copying or moving of queue data. This advantage is attained with little overhead added to conventional circular queues, and is useful in reducing memory requirements for simple circular queues by adjusting queue size as needs change. This is particularly useful for multiple queues that share the same memory space.

7137626, Nov 21, 2006

Jul 29, 2002

10/207466

Siu H. Lam - WoodCliff Lake NJ, US

Intel Corporation - Santa Clara CA

H04J 1/16

270216, 370242

A method, apparatus, and system for recovering from loss of a packet.

7245637, Jul 17, 2007

Sep 11, 2003

10/660180

Siu H. Lam - Woodcliff Lake NJ, US
Kai X. Miao - Boonton Township NJ, US

Intel Corporation - Santa Clara CA

H04J 3/06

370512, 370510, 370514, 370516, 370517, 370519, 370471, 370352, 370354, 370355, 370356, 379386, 37938701, 37938702

In some embodiments, a method includes detecting a tone in each data frame of a sequence of telephony signal data frames. A first data frame of the sequence of telephony signal data frames may be transmitted immediately after detecting the tone therein. Transmission of a last one or last ones of the sequence of telephony signal data frames may be deferred. It may then be determined whether the tone is present in a next data frame that immediately follows the sequence of telephony signal data frames. If it is determined that the tone is not present in the next data frame, the last one or ones of the sequence of data frames and the next data frame may be transmitted. If it is determined that the tone is present in the next data frame, a respective replacement data frame may be transmitted in place of each one of the last one or last ones of the sequence of data frames and in place of the next data frame.

7418013, Aug 26, 2008

Sep 22, 2004

10/947889

Siu H. Lam - WoodCliff Lake NJ, US

Intel Corporation - Santa Clara CA

H04J 3/06

370516

Method and apparatus to synchronize packet rate for audio information are described.

7460656, Dec 2, 2008

Dec 18, 2003

10/742560

Siu H. Lam - Woodcliff Lake NJ, US

Intel Corporation - Santa Clara CA

H04M 3/42

37920201, 348 1407, 370267, 379 8816, 381 98

Conference calls are handled using distributed processing. In one embodiment, the invention includes receiving sets of telephone audio signals from conference subnodes, the telephone audio signals corresponding to subscribers of the conference call, selecting an output set of telephone audio signals from all of the received telephone audio signals, and transmitting the output set to the conference subnodes. In another embodiment, the invention includes receiving a set of telephone audio signals, each signal being received from a subscriber node of a single conference call, selecting a subset of the set of signals, transmitting the selected subset of signals to a conference node, receiving a second set of telephone audio signals from the conference node, and transmitting the second set to the subscriber nodes.

7594228, Sep 22, 2009

Sep 23, 2003

10/669309

Siu H. Lam - Woodcliff Lake NJ, US

G06F 9/46
G06F 15/16
G06F 15/173
G06F 15/00

718102, 718104, 718105, 709201, 709202, 709223, 709226, 370229, 370230

A method and apparatus to perform task scheduling are described. Tasks are assigned by receiving a request to execute a task on one of multiprocessors. The type of task is determined for the task. A processor task value is used to select the proper processor and the task is assigned.