Patents by Inventor Martin Gudgin

Martin Gudgin 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: 7836489
    Abstract: The present invention extends to methods, systems, and computer program products for selecting policy for compatible communication. Hierarchical policy document data structures represent communication (e.g., security) aspects and options such that lower aspects and options are accessed in the context of corresponding higher aspects and options to define applicable scope. Use of a hierarchical description also facilitates separation of what is being protected from how it is being protected thereby allowing security policy to be considered at different locations of a description document.
    Type: Grant
    Filed: June 15, 2006
    Date of Patent: November 16, 2010
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Douglas A. Walter, Martin Gudgin
  • Patent number: 7640260
    Abstract: Structuring a data structure that is of a particular type that has a particular schema used for validation, in a manner that permits selected components of the data structure to be optionally transformed while retaining the ability to validate the data structure. The data structure includes information that is sufficient to identify one or more transformations that may occur on at least one component of the data structure while still being valid.
    Type: Grant
    Filed: December 12, 2005
    Date of Patent: December 29, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Donald F. Box, Martin Gudgin
  • Patent number: 7453875
    Abstract: A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using Simple Object Access Protocol (SOAP) over User Datagram Protocol (UDP). In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast Uniform Resource Identifier (URI). The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.
    Type: Grant
    Filed: March 23, 2005
    Date of Patent: November 18, 2008
    Assignee: Microsoft Corporation
    Inventors: Michael S. Vernal, Erik B. Christensen, Martin Gudgin, John R. Justice, Gopal Kakivaya, David Langworthy, Yaniv Pessach, Jeffrey Schlimmer, Elliot Waingold, Kenneth D. Wolf
  • Publication number: 20070294743
    Abstract: The present invention extends to methods, systems, and computer program products for selecting policy for compatible communication. Hierarchical policy document data structures represent communication (e.g., security) aspects and options such that lower aspects and options are accessed in the context of corresponding higher aspects and options to define applicable scope. Use of a hierarchical description also facilitates separation of what is being protected from how it is being protected thereby allowing security policy to be considered at different locations of a description document.
    Type: Application
    Filed: June 15, 2006
    Publication date: December 20, 2007
    Applicant: Microsoft Corporation
    Inventors: Christopher G. Kaler, Douglas A. Walter, Martin Gudgin
  • Publication number: 20070136338
    Abstract: Structuring a data structure that is of a particular type that has a particular schema used for validation, in a manner that permits selected components of the data structure to be optionally transformed while retaining the ability to validate the data structure. The data structure includes information that is sufficient to identify one or more transformations that may occur on at least one component of the data structure while still being valid.
    Type: Application
    Filed: December 12, 2005
    Publication date: June 14, 2007
    Applicant: Microsoft Corporation
    Inventors: Christopher Kaler, Donald Box, Martin Gudgin
  • Publication number: 20060215571
    Abstract: A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using SOAP over UDP. In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast URI. The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.
    Type: Application
    Filed: March 23, 2005
    Publication date: September 28, 2006
    Applicant: Microsoft Corporation
    Inventors: Michael Vernal, Erik Christensen, Martin Gudgin, John Justice, Gopal Kakivaya, David Langworthy, Yaniv Pessach, Jeffrey Schlimmer, Elliot Waingold, Kenneth Wolf
  • Publication number: 20060133427
    Abstract: A mechanism for sending structured data using a corresponding byte stream. Upon accessing structured data such as a Simple Object Access Protocol (SOAP) envelope, a byte stream is generated. The byte stream includes bytes that represent the structured data, as well as a collection of bytes that represents properties about the byte stream such as, for example, a mode of communication. The byte stream may then be passed to a communication module (e.g., a TCP or Named Pipes module) capable of receiving and transmitting the byte stream.
    Type: Application
    Filed: December 3, 2004
    Publication date: June 22, 2006
    Applicant: Microsoft Corporation
    Inventors: Kenneth Wolf, Michael Vernal, Christopher Kaler, Elliot Waingold, Eric Christensen, Jeffrey Schlimmer, Martin Gudgin, Siddhartha Puri
  • Publication number: 20050086594
    Abstract: Information that is encoded in different character sets can be combined within a single package without having to perform character set-to-character set encodings, either by interleaving the data or by referencing the data.
    Type: Application
    Filed: October 15, 2003
    Publication date: April 21, 2005
    Inventors: Jeffrey Schlimmer, Martin Gudgin, Donald Box, Christopher Kaler, Timothy Ewald, Yasser Shohoud
  • Publication number: 20040239674
    Abstract: Systems and methods for modeling graphs as XML information sets and describing them with XML schema. An edge labeled directed graph is converted to an edge labeled directed tree representing some of the edges directly and some of the edges indirectly. A graph is completely traversed such that all nodes are visited and all edges are traversed. Nodes are included by value initially and then by reference. A schema is provided that describes the structure of an XML tree than contains graph data.
    Type: Application
    Filed: June 2, 2003
    Publication date: December 2, 2004
    Applicant: Microsoft Corporation
    Inventors: Timothy J. Ewald, Donald F. Box, Keith W. Ballinger, Stefan H. Pharies, Martin Gudgin