Microsoft Technology Licensing, LLC

Vivian Sewelson

David Read Tarditi, Jr

Raymond Edward Endres

Barry Clayton Bond

Richard A Vaughan

Peter H Horadan

Daniel Johannes Pieter Leijin

Timothy J Johnstone

Lubomir Boyanov Litchev

A reusable expression graph system and method that generates reusable expression graphs that can be used with potentially different input parameters in order to achieve computational efficiency and ease of programming. Reusable expression graph mitigate the need to rebuild an expression for each new value. This is achieved in part by creating a node called a 'parameter node.' The parameter node acts as a generic placeholder for a leaf node in the expression graph. In addition, the parameter node acts as a proxy for a bindable term of the leaf node, and the bindable term can be either a value or one or more additional expressions. The parameter node then is bound to the bindable term and the expression is evaluated with that bindable term instead of the placeholder. The parameter node created by embodiments of the reusable expression graph system and method works across many different programming languages.

Reusing expression graphs in computer programming languages

Although GPUs have been harnessed to solve non-graphics problems, these solutions are not widespread because GPUs remain difficult to program. Instead, an interpreter simplifies the task of programming a GPU by providing language constructs such as a set of data types and operations that are more familiar to non-graphics programmers. The interpreter maps these familiar language constructs to the more difficult graphics programming resources such as DirectX&#xae;, OpenGL&#xae;, Cg&#xae;, and/or HLSL&#xae;.

Optimizing automated shader program construction

Automated construction of shader programs

Although GPUs have been harnessed to solve non-graphics problems, these solutions are not widespread because GPUs remain difficult to program. Instead, an interpreter simplifies the task of programming a GPU by providing language constructs such as a set of data types and operations that are more familiar to non-graphics programmers. The interpreter maps these familiar language constructs to the more difficult graphics programming languages such as DirectX&#xae;, OpenGL&#xae;, Cg&#xae;, and/or HLSL&#xae;.

Interpreter for simplified programming of graphics processor units in general purpose programming languages

In association with a computer system, a method and system for providing an interface for establishing connections with financial institution to utilize on-line services. An application program sends a request to a branding server to look up information related to a particular financial institution. The branding server executes the request and, if the branding server contains information relating to the method of connection with identified financial institution, the branding server sends the information to the application program. The application program then loads an appropriate driver corresponding to the method of connection as determined by the branding server. If the method of connection is open financial connectivity (OFC), then the application loads a flexible driver (the OFC driver) which causes the application program to request the business rules of the particular financial institution from the financial institution's server. The bank server then transmits the business rules to the OFC driver which incorporates the business rules into the application program software and reconfigures the application program to operate according to the business rules.

Growing community of inventors

Redmond, WA, United States of America

Vivian Sewelson