Allen R Brown

Address:

226 Park Laureate Dr, Houston, TX 77024

Phone:

(713)9570254

VIN:

4JGBF22EX7A224100

Make:

MERCEDES-BENZ

Model:

GL-CLASS

Year:

2007

Address:

9915 Sagerock Dr, Houston, TX 77089

VIN:

1HD1CX3127K447435

Make:

Cadillac

Model:

Escalade ESV AWD 4dr

Year:

2007

US Patent:

20050131978, Jun 16, 2005

Filed:

Jul 30, 2004

Appl. No.:

10/903959

Inventors:

Lucius Meredith - Seattle WA, US
Allen Brown - Bellevue WA, US
David Richter - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F007/38

US Classification:

708446000

Abstract:

The systems and methods of the present invention utilize stochastic calculus (e.g., pi calculus) to determine (e.g., specify, predict, etc.) quality of service that includes at least one of rate, uptime and capacity. The quality of service can be indicative of a level of service provided and/or required by an agent (e.g., a web service). The quality of service can be obtained by representing an agent's contract via a model (e.g., state diagram or mathematical algorithm) and decorating the model with cost functions that are utilized to compute transition costs that are employed to predict associated rates for respective transitions. The model can further be decorated with error states to determine uptime and employed to determine channel capacity. In general, the quality service of a requesting agent and a providing agent can be compared to determine whether the providing agent can satisfy the level of performance of the requesting agent.

US Patent:

20050166183, Jul 28, 2005

Filed:

Jun 30, 2004

Appl. No.:

10/881142

Inventors:

Allen Brown - Bellevue WA, US
Lucius Meredith - Seattle WA, US
Cosimo Laneve - Bologna, IT

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F009/44

US Classification:

717114000

Abstract:

Trees are a common semantic denominator of XML data types and process calculi. This indicates a potential tight intertwining of the syntax and semantics of data and processes. The invention provides this intertwining via a process calculus wherein the data language syntax is a fragment of the programming language syntax.

US Patent:

20050183099, Aug 18, 2005

Filed:

Mar 30, 2004

Appl. No.:

10/816558

Inventors:

L. Meredith - Seattle WA, US
Allen Brown - Bellevue WA, US
David Richter - Seattle WA, US
George Moore - Issaquah WA, US

International Classification:

G06F015/00

US Classification:

719330000, 709200000

Abstract:

A reflective process algebra called the ρ-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.

US Patent:

20070079287, Apr 5, 2007

Filed:

Dec 28, 2005

Appl. No.:

11/320122

Inventors:

Allen Brown - Bellevue WA, US
Matthew Fuchs - Los Gatos CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717114000

Abstract:

Systems and methods for incorporating qualified, polymorphic, hedge-regular types into computer-programming languages are disclosed. A programming language having such a type system, and a typing system for such a programming language are also disclosed. Also described is Haxell, an effort to completely integrate regular hedge pattern-matching into Haskell. Haxell is a Haskell embodiment of a set of concepts that may be applied to any of a number of functional and/or traditional languages.

US Patent:

20080120490, May 22, 2008

Filed:

Nov 20, 2006

Appl. No.:

11/602092

Inventors:

Allen L. Brown - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/30

US Classification:

712216, 712E09016

Abstract:

Solver state merging in parallel constraint satisfaction problem (CSP) solvers. Solver state during processing of a computational thread of parallel CSP solvers is represented as a set of support graphs. The support graphs are merged in a pairwise fashion, yielding a new conflict-free graph. The merge process is free of cycles, conflicts are removed, and thread processing is lock-free. The architecture can be applied, generally, in any CSP solver (e.g., a Boolean SAT solver) having certain formal properties. A system is provided that facilitates solver processing, the system comprising a bookkeeping component for representing input solver state of a computational thread as a set of graphs, and a merge component for pairwise merging of at least two input graphs of the set of graphs into a merged graph that represents final state of the computational thread.

US Patent:

20180230250, Aug 16, 2018

Filed:

Feb 7, 2018

Appl. No.:

15/890647

Inventors:

- HOUSTON TX, US
ALLEN L. BROWN - PEARLAND TX, US
STEPHEN M. IMFELD - MASON OH, US

Assignee:

EQUISTAR CHEMICALS, LP - HOUSTON TX

International Classification:

C08F 10/02
C08J 5/18
C08K 3/34

Abstract:

A low density polyethylene composition characterized by having a density in range of 0.91 to 0.94 gm/cm, a melt index in the range of 1 to 5 g/10 minutes, a gel permeation chromatography branching index in the range of 1.2 to 1, a polydispersity index in the range of 3.5 to 7.5, a viscosity ratio in the range of 0.7 to 1, and a long chain branching frequency greater than zero at a log molecular weight (log(MW)) value in the range of 4 to 5.5. Film formed from the polyethylene compositions with favorable haze and gloss characteristics, and a process for forming such film, are also described.