Jason Paul Brewer

US Patent:

7853992, Dec 14, 2010

Filed:

May 31, 2007

Appl. No.:

11/756310

Inventors:

Neeraj Garg - Redmond WA, US
Jason Brewer - Kirkland WA, US
Anatoliy Panasyuk - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30
G06F 17/00

US Classification:

726 4, 726 3, 726 11

Abstract:

Implementations of configuring security mechanisms utilizing a trust system are described. In one implementation, a request to communicate is received at a protected device. Before permission to communicate can be granted, a list of trusted devices is accessed. If information, such as an identity or a secret, associated with the device sending the request to communicate correlates to information found on the list of trusted devices, then communication can be allowed. Otherwise, communication between the device and the protected device can be denied.

US Patent:

20090327502, Dec 31, 2009

Filed:

Jun 30, 2008

Appl. No.:

12/165495

Inventors:

Jason Brewer - Kirkland WA, US
Neeraj Garg - Redmond WA, US
Gavarraju Nanduri - Bellevue WA, US
Vikram Kakumani - Kirkland WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 15/16

US Classification:

709229

Abstract:

In order to allow a single user registered on a single local host or other machine to access multiple shared resources on a remote host, an aliasing mechanism is employed so that multiple concurrent connections can be established by the user to a single remote host, with each connection using a different identity. Each connection can therefore be used to access a different shared resource on the remote host. In some illustrative examples, a user's identifier such as his or her machine log-in identification may be associated with two or more resource sharing aliases. As a result, two or more resource sharing sessions can be established by the user with a single remote host, with each of the sessions using a different one of the aliases. The resource sharing sessions are usually established in accordance with a resource sharing protocol such as the Server Block Message (SBM) protocol.

US Patent:

20120110003, May 3, 2012

Filed:

Nov 3, 2010

Appl. No.:

12/938895

Inventors:

Jason E. Brewer - Kirkland WA, US
Charles W. Lamanna - Bellevue WA, US
Mauktik H. Gandhi - Redmond WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 17/30

US Classification:

707769, 707E17014

Abstract:

Embodiments directed to conditionally executing regular expressions and to simplifying regular expressions by canonicalizing regular expression terms. In an embodiment, a computer system accesses identified regular expression key terms that are to appear in a selected portion of text. The regular expression key terms are identified from terms in a selected regular expression. The computer system determines whether the identified regular expression key terms appear in the selected portion of text. The computer system also, upon determining that none of the identified regular expression key terms appears in the selected portion of text, prevents execution of the regular expression. Upon determining that at least one of the identified regular expression key terms appears in the selected portion of text, the computer system executes the regular expression.

US Patent:

20120117080, May 10, 2012

Filed:

Nov 10, 2010

Appl. No.:

12/943780

Inventors:

Charles William Lamanna - Bellevue WA, US
Mauktik H. Gandhi - Redmond WA, US
Jason Eric Brewer - Kirkland WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 17/30

US Classification:

707747, 707E17052

Abstract:

Embodiments are directed to indexing and querying a sequence of hash values in an indexing matrix. A computer system accesses a document to extract a portion of text from the document. The computer system applies a hashing algorithm to the extracted text. The hash values of the extracted text form a representative sequence of hash values. The computer system inserts each hash value of the sequence of hash values into an indexing matrix, which is configured to store multiple different hash value sequences. The computer system also queries the indexing matrix to determine how similar the plurality of hash value sequences are to the selected hash value sequence based on how many hash values of the selected hash value sequence overlap with the hash values of the plurality of stored hash value sequences.

US Patent:

20120158768, Jun 21, 2012

Filed:

Dec 15, 2010

Appl. No.:

12/968618

Inventors:

Charles William Lamanna - Bellevue WA, US
Mauktik H. Gandhi - Redmond WA, US
Jason Eric Brewer - Kirkland WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707769, 707E17039

Abstract:

The present invention extends to methods, systems, and computer program products for decomposing and merging regular expressions. Embodiments of the invention decompose a regular expression into multiple simple keyword graphs, merge those keyword graphs in a compact and efficient manner, and produce a directed acyclic graph (DAG) that can execute a simplified regular expression alphabet. Several of these regular expression DAG's can then be merged together to produce a single DAG that represents an entire collection of regular expressions. DAGs along with other text processing algorithms and a heap collection can be combined in a multi-pass approach to expand the regular expression alphabet.

US Patent:

20210224661, Jul 22, 2021

Filed:

Apr 8, 2021

Appl. No.:

17/225767

Inventors:

- Santa Monica CA, US
Jason Brewer - Marina del Rey CA, US
Nima Khajehnouri - Los Angeles CA, US
Hadi Minooei - Irvine CA, US
Benjamin C. Steele - Oak Park CA, US
Qian You - Marina del Rey CA, US

International Classification:

G06N 5/02
G06F 16/951
G06N 20/00

Abstract:

Systems and methods are provided for receiving a request for lookalike data, the request for lookalike data comprising seed data and generating sample data from the seed data and from user data for a plurality of users, to use in a lookalike model training. The systems and methods further provide for capturing a snapshot of social graph data for a plurality of users and computing social graph features based on the seed data and the user data for the plurality of users, training a lookalike model based on the sample data and the computed social graph features to generate a trained lookalike model, generating a lookalike score for each user of the plurality of users in the user data using the trained lookalike model, and generating a list comprising a unique identifier for each user of the plurality of users and an associated lookalike score for each unique identifier.

US Patent:

20180165302, Jun 14, 2018

Filed:

Dec 12, 2016

Appl. No.:

15/376287

Inventors:

- Menlo Park CA, US
Jason Eric Brewer - Kirkland WA, US
Bradley Ray Green - Snohomish WA, US

International Classification:

G06F 17/30
H04L 29/08

Abstract:

Systems, methods, and non-transitory computer readable media are configured to apply a spectral clustering technique to at least a portion of a similarity graph to generate clusters of geographic sub-regions constituting geographic regions. A tf-idf technique is performed to determine pages of a social networking system associated with a geographic region as potential local suggestions for a user associated with a geographic sub-region in the geographic region. References to at least a portion of the pages are presented as local suggestions to the user.

US Patent:

20180115479, Apr 26, 2018

Filed:

Dec 11, 2017

Appl. No.:

15/837864

Inventors:

- Menlo Park CA, US
Jason Eric Brewer - Kirkland WA, US

International Classification:

H04L 12/26
G06F 17/30

Abstract:

In one embodiment, a method includes receiving a query input, parsing the query input to identify one or more n-grams, determining a search bias of the first user with respect to the query input, the search bias being determined based on an explicit bias and an implicit bias of the first user, wherein the explicit bias is based on an analysis of the entities associated with the online social networking matching n-grams in the query input, and wherein the implicit bias is based on an analysis of user-profile information of a plurality of second users sharing one or more user attributes with the first user, identifying content objects matching the query input based at least in part on the search bias of the first user, and sending instructions for presenting a search-results interface comprising references to the identified content objects.