Xiao T Li

6424003, Jul 23, 2002

Oct 9, 1998

09/169492

Xiao Yu Li - San Jose CA
Sunil D. Mehta - San Jose CA
Christopher O. Schmidt - Sunnyvale CA

Lattice Semiconductor Corporation - Hillsboro OR

H07L 29788

257318, 257321

An improved EEPROM cell with a self-aligned tunneling window is provided which is fabricated by a standard STI process so as to produce a smaller layout size and a reduced cell height. The EEPROM cell includes a floating gate, a programmable junction region, and a tunneling oxide layer separating the programmable junction region and the floating gate. The length dimension of the floating gate is less than the length dimension of the tunneling window so that the tunneling window is overlapping the floating gate. The tunneling window is self-aligned by edges forming the length dimension of the floating gate so as to form a self-aligned tunneling window.

6804310, Oct 12, 2004

Nov 3, 2000

09/705665

Xiao Bo Li - Santa Clara CA
David Lam - Fremont CA

Koninklijke Philips Electronics N.V. - Eindhoven

H04L 2714

375316, 375350

A decision feedback loop for a receiver for channel estimation and de-rotation of complex input symbols derived from a sampled information signal received via a channel which contains data organized into successive time slots, is configured to retrain and reinitialize the loop during each slot in order to mitigate slot to slot propagation of the estimation error.

20120317134, Dec 13, 2012

Jun 9, 2011

13/156629

Serge Bourbonnais - Palo Alto CA, US
Marcel Kutsch - San Jose CA, US
Xiao Li - Cupertino CA, US
Jonathan W. Wierenga - San Jose CA, US

INTERNATIONAL BUSINESS MACHINES INCORPORATION - Armonk NY

G06F 17/30

707769, 707E17014

Techniques are disclosed for comparing database tables. In one embodiment, the database tables are partitioned. Queries are generated for retrieving each partition. For each generated query, a stored procedure is invoked, using the respective generated query as an input parameter to the stored procedure. The stored procedure is configured to generate a checksum based on the partition retrieved from executing the respective query. The application compares the generated checksums to determine if the partitions and/or tables are consistent.

20130124538, May 16, 2013

Jul 23, 2012

13/556060

Yofay Kari Lee - Palo Alto CA, US
Michael Benjamin Cohen - Menlo Park CA, US
Maxime Boucher - Mountain View CA, US
Alisson Gusatti Azzolini - San Francisco CA, US
Xiao Li - Sunnyvale CA, US
Lars Eilstrup Rasmussen - San Francsciso CA, US

G06F 17/30

707749, 707772, 707751, 707748

In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges.

20130191372, Jul 25, 2013

Jul 23, 2012

13/556046

Yofay Kari Lee - Palo Alto CA, US
Michael Benjamin Cohen - Menlo Park CA, US
Maxime Boucher - Mountain View CA, US
Alisson Gusatti Azzolini - San Francisco CA, US
Xiao Li - Sunnyvale CA, US
Lars Eilstrup Rasmussen - San Francsciso CA, US

G06F 17/30

707722, 707769

In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges.

20130191416, Jul 25, 2013

Jul 23, 2012

13/556072

Yofay Kari Lee - Palo Alto CA, US
Michael Benjamin Cohen - Menlo Park CA, US
Maxime Boucher - Mountain View CA, US
Alisson Gusatti Azzolini - San Francisco CA, US
Xiao Li - Sunnyvale CA, US
Lars Eilstrup Rasmussen - San Francsciso CA, US

G06F 17/30

707771

In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.

20130245519, Sep 19, 2013

Mar 13, 2012

13/419022

Howard Edelman - San Francisco CA, US
Scott Ganaja - San Luis Obispo CA, US
Aaron Alexander Selig - Mill Valley CA, US
Xiao Li - Mountain View CA, US

MEDICAL TECHNOLOGY INC. - Grand Prairie TX

A61H 7/00

601152

A pressure therapy system includes an air pump; a pneumatic line pressurized by the air pump; and a cuff in fluid communication with the pneumatic line, the cuff including flaps sized and shaped to extend around a user's limb, a first chamber and a second chamber separated fluidly by the cuff from the first chamber, wherein the pneumatic line splits into first and second line segments or openings, the first line segment or opening communicating fluidly with the first separated chamber, the second line segment or opening communicating fluidly with the second separated chamber, and wherein the second line segment or opening or a pathway of the cuff leading to the second separated chamber includes a flow restricting structure that delays pressurized air from reaching the second chamber relative to the first chamber.

61410551, Oct 31, 2000

Jul 10, 1997

8/890941

Xiao Chuan Li - Cupertino CA

Aitech Int'l Corporation - Fremont CA

H04N 701

348446

It is disclosed herein that a system for reducing video data memory in VGA-to-TV converters that convert computer video signals to TV compliant signals for display on regular TV screens. By closely tracking two pointers, one being a write pointer responsible for writing incoming video data into the video data memory and the other being a read pointer responsible for reading out the stored video data in the video data memory, the memory is efficiently used for buffering the video data. To ensure that the read pointer always retrieves the valid video data at its own speed, an address monitoring process is provided to monitor the address difference between the write pointer and the read pointer. When the monitoring process detects that the read pointer may soon surpass the write pointer, a control process is placed on the write pointer to prevent the read pointer from passing over the write pointer. Depending on the speed difference between the write and read pointers, the writer pointer is either paused for a frame time or assigned to a secondary write pointer that writes data into the memory just visited by the read pointer.