Search

Colin J Meek

from Kirkland, WA
Age ~48
Get Report
Related to:
Andrew D Moore, 38Judith Halicki, 76Martha S Moore, 65Barbaba HalickiCharlene Halicki, 70Stanley HalickiAnna HalickiBenjamin Pierson, 43
Connected to:
Ana G Meek, 51Anne M Meek, 46Ariel D Meek, 34Bennett Meek, 49Bridgett Meek, 37Bruce L Meek, 41Cameron Meek, 57Candice L Meek, 35Carey L Meek, 70Carol W Meek, 84

Colin Meek Phones & Addresses

  • Kirkland, WA
  • Redmond, WA
  • 801 Miller Ave, Ann Arbor, MI 48103 (734) 663-2435
  • Kiona, WA
  • 11748 82Nd Ave NE, Kirkland, WA 98034 (425) 636-8651

Resumes

Resumes

Colin Meek Photo 1

Software Engineer

View page
Location:
Seattle, WA
Industry:
Computer Software
Work:
Google
Software Engineer
Microsoft Jan 2004 - Jun 2012
Software Development Engineer
Education:
University of Michigan 2000 - 2002
Doctorates, Doctor of Philosophy, Computer Science, Engineering University of Michigan 1998 - 2000
Dalhousie University 1994 - 1998
Skills:
.Net
C#
Mapreduce
Distributed Systems
Software Engineering
Scalability
Software Design
Colin Meek Photo 2

Colin Meek

View page
Colin Meek Photo 3

Colin Meek

View page
Colin Meek Photo 4

Colin Meek

View page
Colin Meek Photo 5

Colin Meek

View page

Publications

Us Patents

Determining Satisfiability Of A Function With Arbitrary Domain Constraints

View page
US Patent:
8001072, Aug 16, 2011
Filed:
Jun 19, 2008
Appl. No.:
12/141923
Inventors:
Colin Meek - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/00
G06N 5/02
US Classification:
706 47
Abstract:
A function can be represented as a canonical decision diagram structure. Each vertex of the diagram is associated with a respective function variable. The vertices include at least one vertex that represents a domain of more than two values for the variable associated with the vertex. The decision diagram is used to evaluate the function to determine whether the function is satisfiable or unsatisfiable for given values of the variables.

Mapping From Objects To Data Model

View page
US Patent:
8150882, Apr 3, 2012
Filed:
Mar 3, 2009
Appl. No.:
12/396471
Inventors:
Colin Joseph Meek - Redmond WA, US
Jeffrey M. Derstadt - Sammamish WA, US
Arthur John Cerdic Vickers - Issaquah WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707792, 707812
Abstract:
Aspects of the subject matter described herein relate to mapping from application objects to an abstract data model. In aspects, a mapper receives registrations that indicate behavior (e. g. , how objects are constructed, modified, or examined) of application objects. The behavior may be specified using user-supplied expressions. The mapper aggregates this data and uses it to map application requests for data access into one or more operations that operate on the abstract data model. A data access layer may then translate the operations into actions to access data corresponding to the requests from a store. If appropriate, data obtained from the store may then be inserted into application objects as indicated by the registrations.

Translating Queries To Representational State Transfer (Rest)

View page
US Patent:
8255410, Aug 28, 2012
Filed:
Mar 27, 2009
Appl. No.:
12/412544
Inventors:
Andrew Conrad - Sammamish WA, US
Pablo Castro - Redmond WA, US
Michael Flasko - Duvall WA, US
Colin Meek - Redmond WA, US
Simon Cavanagh - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707761, 707763, 707E1707
Abstract:
Query expressions, such as LINQ (language integrated queries) queries, are enabled to be translated to URIs (uniform resource indicators) that may be used to query data sources at REST (representational state transfer) interfaces. A compiler is configured to convert a query into an expression tree. An expression tree normalizer is configured to normalize the expression tree into a normalized expression tree. A resource bound expression tree generator is configured to transform the normalized expression tree into a resource bound expression tree. A URI generator is configured to translate the resource bound expression tree into a URI.

Translating Late Bound Linq Expressions Into Database Queries

View page
US Patent:
8255883, Aug 28, 2012
Filed:
Nov 14, 2007
Appl. No.:
11/940029
Inventors:
David E Sceppa - Seattle WA, US
Carl Y Perry - Woodinville WA, US
Jeffrey M Derstadt - Seattle WA, US
Andrew J Conrad - Sammamish WA, US
Amanda K Silver - Seattle WA, US
Paul A Vick - Seattle WA, US
Shyamalan Pather - Seattle WA, US
Colin Joseph Meek - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
US Classification:
717136
Abstract:
There is alteration of a late-bound expression produced by a compiler into an early-bound structure. Alteration of the late-bound expression can occur at runtime and a visitor pattern can be used to create the alteration. In one instance, a conversion from late-bound to early-bound takes place through replacing a late-bound property with a statically typed call. The early-bound structure can translate into an expression tree to enable an implementation of a store specific query operated upon storage.

Mapping From Objects To Data Model

View page
US Patent:
8392462, Mar 5, 2013
Filed:
Feb 29, 2012
Appl. No.:
13/408798
Inventors:
Colin Joseph Meek - Redmond WA, US
Jeffrey M. Derstadt - Sammamish WA, US
Arthur John Cerdic Vickers - Issaquah WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707792, 717108
Abstract:
Aspects of the subject matter described herein relate to mapping from application objects to an abstract data model. In aspects, a mapper receives registrations that indicate behavior (e. g. , how objects are constructed, modified, or examined) of application objects. The behavior may be specified using user-supplied expressions. The mapper aggregates this data and uses it to map application requests for data access into one or more operations that operate on the abstract data model. A data access layer may then translate the operations into actions to access data corresponding to the requests from a store. If appropriate, data obtained from the store may then be inserted into application objects as indicated by the registrations.

Efficient Functional Representation Of Result Shaping

View page
US Patent:
8209340, Jun 26, 2012
Filed:
Mar 31, 2008
Appl. No.:
12/059056
Inventors:
Colin Joseph Meek - Redmond WA, US
Stephen Frederick Starck - Bothell WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707753
Abstract:
A result shaping methodology is part of a bridge (translation layer) between an entity provider and an underlying store provider. The bridge accepts command trees and parameter values from a consumer (e. g. , the entity provider), reshapes the trees as necessary for its underlying store provider to execute, executes resulting commands, and assembles the results from the commands into the nested data reader that the initial command tree requested. The result assembly advantageously takes a mapping declaration and compiles it into a set of expression definitions composed from a small number of simple functions. Each collection in the result has a corresponding expression describing how collection elements are realized given relational results. Other expressions describe boundary detection behavior. These expressions are compiled into functions used to shape relational data into arbitrary object graphs or streaming interfaces.

Method And System For Extracting Melodic Patterns In A Musical Piece And Computer-Readable Storage Medium Having A Program For Executing The Method

View page
US Patent:
20030089216, May 15, 2003
Filed:
Sep 26, 2001
Appl. No.:
09/965051
Inventors:
William Birmingham - Ann Arbor MI, US
Colin Meek - Ann Arbor MI, US
International Classification:
G10H001/26
US Classification:
084/609000
Abstract:
A method and system for extracting melodic patterns by first recognizing musical “keywords” or themes. The invention searches for all instances of melodic (intervallic) repetition in a piece (patterns). This process generally uncovers a large number of patterns, many of which are either uninteresting or are only superficially prevalent. Filters reduce the number and/or prevalence of such patterns. Patterns are then rated according to characteristics deemed perceptually significant. The top ranked patterns correspond to important thematic or motivic musical content. The system operates robustly across a broad range of styles, and relies on no metadata on its input, allowing it to independently and efficiently catalog multimedia data.

Lightweight Query Processing Over In-Memory Data Structures

View page
US Patent:
20080065590, Mar 13, 2008
Filed:
Sep 7, 2006
Appl. No.:
11/470940
Inventors:
Pablo Castro - Redmond WA, US
Andrew J. Conrad - Sammamish WA, US
Jose A. Blakely - Redmond WA, US
Colin Joseph Meek - Redmond WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 17/30
US Classification:
707 2
Abstract:
Lightweight query processing for in-memory or cache memory data structures, such as DataSet, is provided. Prior to executing a query over an in-memory data structure, a query processor determines whether any benefits can be obtained by first optimizing the query execution strategy. Additionally, one or more bail out points can be applied to the optimization analysis to further enhance query execution speed for circumstances where optimization is unlikely to provide significant performance benefits. The lightweight query processing techniques can be supported in any framework for processing or formulating queries of in-memory data structures, such as language integrated query (LINQ) queries.
Control profile
Colin J Meek from Kirkland, WA, age ~48 Get Report