Patents by Inventor Vivian Sewelson

Vivian Sewelson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8549464
    Abstract: 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.
    Type: Grant
    Filed: November 22, 2010
    Date of Patent: October 1, 2013
    Assignee: Microsoft Corporation
    Inventors: Barry Clayton Bond, Vivian Sewelson, Daniel Johannes Pieter Leijin, Lubomir Boyanov Litchev
  • Publication number: 20120131537
    Abstract: 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.
    Type: Application
    Filed: November 22, 2010
    Publication date: May 24, 2012
    Applicant: Microsoft Corporation
    Inventors: Barry Clayton Bond, Vivian Sewelson, Daniel Johannes Pieter Leijin, Lubomir Boyanov Litchev
  • Patent number: 7800620
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Grant
    Filed: October 21, 2005
    Date of Patent: September 21, 2010
    Assignee: Microsoft Corporation
    Inventors: David Read Tarditi, Jr., Vivian Sewelson
  • Patent number: 7733347
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Grant
    Filed: October 21, 2005
    Date of Patent: June 8, 2010
    Assignee: Microsoft Corporation
    Inventors: David Read Tarditi, Jr., Vivian Sewelson
  • Patent number: 7598953
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Grant
    Filed: November 5, 2004
    Date of Patent: October 6, 2009
    Assignee: Microsoft Corporation
    Inventors: David Read Tarditi, Jr., Raymond E. Endres, Vivian Sewelson
  • Publication number: 20060107250
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Application
    Filed: December 3, 2004
    Publication date: May 18, 2006
    Applicant: Microsoft Corporation
    Inventors: David Tarditi, Raymond Endres, Vivian Sewelson
  • Publication number: 20060098019
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Application
    Filed: October 21, 2005
    Publication date: May 11, 2006
    Applicant: Microsoft Corporation
    Inventors: David Tarditi,, Vivian Sewelson
  • Publication number: 20060098018
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Application
    Filed: October 21, 2005
    Publication date: May 11, 2006
    Applicant: Microsoft Corporation
    Inventors: David Tarditi, Vivian Sewelson
  • Publication number: 20060098017
    Abstract: 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®, OpenGL®, Cg®, and/or HLSL®.
    Type: Application
    Filed: November 5, 2004
    Publication date: May 11, 2006
    Applicant: Microsoft Corporation
    Inventors: David Tarditi, Raymond Endres, Vivian Sewelson
  • Patent number: 6029147
    Abstract: 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.
    Type: Grant
    Filed: March 14, 1997
    Date of Patent: February 22, 2000
    Assignee: Microsoft Corporation
    Inventors: Peter H. Horadan, Richard A. Vaughan, Vivian Sewelson, Timothy J. Johnstone