Feng Mika Pan

US Patent:

20130086509, Apr 4, 2013

Filed:

Sep 29, 2011

Appl. No.:

13/248261

Inventors:

ASHWIN SATYANARAYANA - SAMMAMISH WA, US
TABREEZ GOVANI - BELLEVUE WA, US
SAMIR SHIRAZ PRADHAN - BELLEVUE WA, US
GIRIDHAR KUMARAN - BOTHELL WA, US
XIN FU - SANTA CLARA CA, US
FENG PAN - REDMOND WA, US
NITIN AGRAWAL - REDMOND WA, US

Assignee:

MICROSOFT CORPORATION - REDMOND WA

International Classification:

G06F 17/30
G06F 3/048

US Classification:

715781, 707759, 707E17141, 707E17137

Abstract:

Computer-readable media, computer systems, and computing devices method of facilitating presentation of alternative query suggestions. The method includes referencing an initial query having a plurality of terms. A term(s) to remove from the initial query is identified, for example, based at least on a number of times the term(s) occur in previous queries. The initial query is modified by removing the term(s) from the initial query. Thereafter, the modified query is used to identify an alternative query suggestion(s) that includes at least one term that matches at least one term of the modified query.

US Patent:

20200350762, Nov 5, 2020

Filed:

Apr 30, 2020

Appl. No.:

16/863756

Inventors:

- Richland WA, US
Yonghong Chen - Zionsville IN, US
Feng Pan - Sugar Land TX, US
Edward Rothberg - Portland OR, US

Assignee:

BATTELLE MEMORIAL INSTITUTE - Richland WA

International Classification:

H02J 3/00
G06Q 50/06

Abstract:

Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.

US Patent:

20190286993, Sep 19, 2019

Filed:

Mar 15, 2019

Appl. No.:

16/355574

Inventors:

Feng Pan - Sugarland TX, US
Jesse T. Holzer - Kennewick WA, US
Yonghong Chen - Carmel IN, US
Edward Rothberg - Houston TX, US

International Classification:

G06N 5/00
G06F 9/54
H02J 3/14

Abstract:

Apparatus and methods are disclosed for solving Mixed Integer Programming (MIP) problems, such as Security Constrained Unit Commitment (SCUC) problems used by power grid authorities to perform day-ahead market clearing. In certain examples, a plurality of threads of a software tool implementing a concurrent optimizer can be executed concurrently and sequentially to generate new solutions to a SCUC problem for an upcoming planning horizon. Data can be shared among the concurrently executing threads, such as intermediate/incumbent solutions and hints regarding the fixing of variables and constraints to reduce the size of the SCUC problem. In some examples, the threads are seeded with historical solutions from prior planning horizons. The software tool can select a best solution from the solutions generated by the threads, and determine dispatch instructions for a device coupled to the power grid for the upcoming planning horizon based at least in part on the selected solution.