Wei Yu

US Patent:

7158563, Jan 2, 2007

Filed:

Jun 8, 2001

Appl. No.:

09/877724

Inventors:

Georgios Ginis - Stanford CA, US
Wei Yu - Stanford CA, US
Chaohuang Zeng - Palo Alto CA, US
John M. Cioffi - Atherton CA, US

Assignee:

The Board of Trustees of the Leland Stanford Junior University - Palo Alto CA

International Classification:

H04B 3/46

US Classification:

375224, 375225, 375285, 375346, 370201, 455295, 455296, 455501, 455 631

Abstract:

Methods, apparatus and systems for dynamically controlling a digital communication system, such as a DSL system, collect information about digital communication lines in the system and adaptively and/or dynamically determine line and signal characteristics of the digital communication lines, including interference effects. Based on the determined characteristics and the desired performance parameters, operation of the digital communication lines is adjusted to improve or otherwise control the performance of the system. The collection and processing of information may be performed by a party that is not a user in the system. This independent party also may control operational characteristics and parameters of the system. The invention can be used to eliminate or reduce signal interference such as crosstalk that can be induced on communication lines in systems such as DSL systems. Specific iterative power allocation and vectored transmission techniques and apparatus are disclosed.

US Patent:

7386541, Jun 10, 2008

Filed:

Mar 18, 2004

Appl. No.:

10/803283

Inventors:

Shankar Pal - Redmond WA, US
Istvan Cseri - Redmond WA, US
Oliver Seeliger - Sammamish WA, US
Gideon Schaller - Bellevue WA, US
Adrian Baras - Redmond WA, US
Wei Yu - Issaquah WA, US
Denis Churin - Sammamish WA, US
Peter Kukol - Scottsdale AZ, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30
G06F 7/00

US Classification:

707 3, 707 1, 707 2, 707100, 707101, 707102

Abstract:

An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.

US Patent:

7437371, Oct 14, 2008

Filed:

Dec 30, 2004

Appl. No.:

11/027416

Inventors:

Balaji Rathakrishnan - Sammamish WA, US
Beysim Sezgin - Redmond WA, US
Denis Y. Altudov - Redmond WA, US
Jose A. Blakeley - Redmond WA, US
Oliver Nicholas Seeliger - Sammamish WA, US
Ramachandran Venkatesh - Bellevue WA, US
Wei Yu - Issaquah WA, US
Dragan Tomic - Redmond WA, US
Denis Churin - Bellevue WA, US
Bruno H. M. Denuit - Bellevue WA, US
Conor J. Cunningham - Redmond WA, US
Stefano Stefani - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

707100, 707 4, 707200, 717108

Abstract:

Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.

US Patent:

7464071, Dec 9, 2008

Filed:

Apr 28, 2005

Appl. No.:

11/117586

Inventors:

Cesar Galindo-Legaria - Redmond WA, US
Ganapathy Krishnamoorthy - Issaquah WA, US
Eric N. Hanson - Bellevue WA, US
Wei Yu - Issaquah WA, US
Milind Joshi - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00

US Classification:

707 2, 707 3

Abstract:

A suggested query execution plan is used as a constraint on a guided optimization process such that all execution plans that do not conform to the suggested execution plan are eliminated as possible alternatives. If the guided optimization process successfully generates a resulting execution plan, then the result will conform to the suggested execution plan. If the guided optimization process fails to generate a resulting execution plan, then it may be determined that the suggested execution plan is invalid.

US Patent:

7539688, May 26, 2009

Filed:

May 3, 2004

Appl. No.:

10/837929

Inventors:

Beysim Sezgin - Redmond WA, US
Denis Y. Altudov - Redmond WA, US
Jose A. Blakeley - Bothell WA, US
Ramachandran Venkatesh - Bellevue WA, US
Wei Yu - Issaquah WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707100, 707 4, 717106, 717108

Abstract:

Various embodiments of the present invention are directed to a database with an extensible type system for at least one user-defined type that comprises information for describing its structure as well as information for describing an inheritance relationship between itself and another user-defined type (either a subtype or a supertype/base type). For certain embodiments, the user-defined type is defined in something other than Sequential Query Language (SQL) statement such as, for example, a Common Language Runtime (CLR) statement, a statement in C, C++, and C# (“C-sharp”), and/or a visual basic statement. In any event, several embodiments are further directed to a system wherein the database is aware of the inheritance relationship between two user-defined types by an explicit registration of the user-defined types with said database.

US Patent:

7611254, Nov 3, 2009

Filed:

Feb 25, 2009

Appl. No.:

12/379557

Inventors:

Wei Hung Yu - Irvine CA, US
Connie Wang - Irvine CA, US

International Classification:

F21V 33/00

US Classification:

362102, 362 96, 362101, 362318, 362577

Abstract:

This invention is a light baton for use in aquatic games, comprising a translucent baton body, end inserts at both ends of the baton body, an end insert connected to an inserted light-emitting module, holes in the translucent baton body, and arcuate convex protuberances on the outer surface of the translucent baton body; the holes in the translucent baton body allow water to flow in and surround the light-emitting module, with the change in air and water density causing the baton to sink in water, while the liquid has a refractive effect on the colorful lights from the light-emitting module; the colorful beams of light pass through and are refracted by the ripples in the liquid within the baton body to produce illumination, making the baton ideal for having fun in water.

US Patent:

7774321, Aug 10, 2010

Filed:

Nov 7, 2005

Appl. No.:

11/268090

Inventors:

Dragan Tomic - Redmond WA, US
Shankar Pal - Redmond WA, US
Gideon Schaller - Killara, AU
Istvan Cseri - Redmond WA, US
Wei Yu - Issaquah WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707690, 707803

Abstract:

Modifying a portion of an XML document stored in a relational database includes converting operations on the document into an operator tree. The operator tree includes a first operator corresponding to a first portion of the schema for the modified data and a second operator corresponding to a parent portion of the schema for the modified data. A first and a second portion of the schema are extracted from the overall document schema. A first validation of the modified data using the first operator with the first portion of the schema is performed. This forms a partially validated XML document portion. Next, a second validation of the partially validated XML document portion with the second portion of the schema is performed using the second operator. The XML document constraints are verified and the modified data is merged into the XML document, thus avoiding a full validation of the XML document when certain XML Schema types are absent in the modified data.

US Patent:

7818278, Oct 19, 2010

Filed:

Jun 14, 2007

Appl. No.:

11/763200

Inventors:

Amir J. Padovitz - Redmond WA, US
Dima Suponau - Bellevue WA, US
Wei Yu - Issaquah WA, US
Mikhail Bilenko - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06N 5/02

US Classification:

706 52, 706 45, 706 48, 706 55, 707730, 707750, 707780, 707917

Abstract:

A two-phase process quickly and accurately identifies representations of the same items within a collection of item representations. In the first phase, referred to as a “blocking phase,” frequency information indicating the frequency with which terms appear within the collection of item representations is used to quickly identify “candidate pairs” (i. e. , pairs of item representations that have a relatively high probability of matching). The blocking phase results in a reduced subset of the data for further analysis during the second phase. In the second phase, referred to as a “matching phase,” the candidate pairs are analyzed using fuzzy matching functions to accurately identify “matching pairs” (i. e. , representations of the same items).