Patents by Inventor Douglas Purdy

Douglas Purdy 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).

  • Fall arrest system
    Patent number: 11655677
    Abstract: The aspects herein relate to the field of fall prevention systems, and more specifically to fall arrest systems for storage bins and more particularly to grain bins or silos. In one aspect, a fall prevention system for a ladder may have an anchor plate coupled to a roof. In another aspect, the fall prevention system for the ladder may have an anchor bar coupled to at least a portion of the ladder. A rope is coupled at one end to the anchor plate or bar and at the other end to at least one rung of the ladder using a fastener. A rope grab is slidably coupled to the rope between the anchor plate or bar and the fastener.
    Type: Grant
    Filed: July 6, 2018
    Date of Patent: May 23, 2023
    Assignee: NORTHERN STRANDS CO. LTD.
    Inventors: David Perrin, Matthias Rossen, Brad Frehlich, Douglas Purdy, Dayna Gatin, David Lund
  • FALL ARREST SYSTEM
    Publication number: 20200277821
    Abstract: The aspects herein relate to the field of fall prevention systems, and more specifically to fall arrest systems for storage bins and more particularly to grain bins or silos. In one aspect, a fall prevention system for a ladder may have an anchor plate coupled to a roof. In another aspect, the fall prevention system for the ladder may have an anchor bar coupled to at least a portion of the ladder. A rope is coupled at one end to the anchor plate or bar and at the other end to at least one rung of the ladder using a fastener. A rope grab is slidably coupled to the rope between the anchor plate or bar and the fastener.
    Type: Application
    Filed: July 6, 2018
    Publication date: September 3, 2020
    Inventors: David Perrin, Matthias Rossen, Brad Frehlich, Douglas Purdy, Dayna Gatin, David Lund
  • GENEERAL PURPOSE INFINITE DISPLAY CANVAS
    Publication number: 20090204912
    Abstract: Expanding and contracting a display screen container. Data is stored in a computer readable medium. The data represents a screen container such as a graphical desktop user interface displayable to a user on a computer display of a computing device. Data is stored representing artifacts, including one or more application graphical user interface artifacts for applications that are instantiated on the computing device. Information is stored specifying locations where each of the artifacts should be graphically located in the screen container. The graphical size of screen container is determined by the locations of the artifacts. Based on user input, a portion of the screen container is displayed to the user on the computer display of the computing device. The screen container may be expanded or contracted based on opening or closing graphical user interface artifacts, adding or removing artifacts, or repositioning artifacts.
    Type: Application
    Filed: February 8, 2008
    Publication date: August 13, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Bradford H. Lovering, Mohsen Agsen, Randy Kimmerly, Douglas Purdy, Christopher L. Anderson, Vijaye Raji, Vikram Bapat, Steven J. Clarke, Bryan J. Tiller, Florian Voss, Stephen M. Danton, Andrew C. Wassyng, Laurent Mollicone, James R. Flynn, Arwen E. Pond, Robert A. DeLine, Gina D. Venolia
  • Type evolution
    Patent number: 7571196
    Abstract: A versionable schema is both backward-compatible and forward-compatible. Such a schema is able to receive data expected by multiple versions of the schema; tolerates the absence of optional data, in accordance with other versions, and accept wildcard data in accordance with still further versions. Thus, a message or message may be validated by the versionable schema.
    Type: Grant
    Filed: March 31, 2004
    Date of Patent: August 4, 2009
    Assignee: Microsoft Corporation
    Inventors: Douglas Purdy, Natasha Jethanandani, Sowmy Srinivasan, Stefan H. Pharies
  • TYPE BRIDGES
    Publication number: 20070124738
    Abstract: Methods, systems, and computer program products for converting an object of one type to an object of another type that allow for the runtime operation of the conversion process to be altered or customized. The conversion may occur within an extensible serialization engine that serializes, deserializes, and transforms objects of various types. The runtime operation of the serialization engine is altered by one or more extension routines that implement the desired customizations or extensions, without requiring replacement of other existing routines. Based on type information, identified for an initial object, the object is converted to an intermediate representation which permits runtime modification, including modification of object names, object types, and object data. The intermediate representation of the initial object is modified in accordance with extension routines that alter the runtime operation of the serialization engine, and the intermediate representation is converted to a final object and type.
    Type: Application
    Filed: December 5, 2006
    Publication date: May 31, 2007
    Applicant: Microsoft Corporation
    Inventors: Stefan Pharies, Sowmy Srinivasan, Natasha Jethanandani, Yann Christensen, Elena Kharitidi, Douglas Purdy
  • Mechanisms for transferring raw data from one data structure to another representing the same item
    Publication number: 20060173933
    Abstract: The transfer of raw data from a source data structure to a target data structure that represent the same item. During the data transfer, if there is a given field in the target data structure that does not correspond to a field supplied by the source data structure, the transfer mechanism determines whether or not it is mandatory that the source data structure supply the field. If it is mandatory, the transfer fails. Otherwise, the transfer continues. If there is field of the source data structure that does not correspond to a field of the target data structure, the transfer mechanism determines whether or not it is mandatory that the target data structure have the field. If it is mandatory, the transfer fails. Otherwise, the corresponding data may be provided to a residual field of the target data structure dedicated for unknown data.
    Type: Application
    Filed: February 1, 2005
    Publication date: August 3, 2006
    Applicant: Microsoft Corporation
    Inventors: Sowmyanarayanan Srinivasan, Natasha Jethanandani, Stefan Pharies, Douglas Purdy, Donald Box, Gopala Kakivaya
  • Interface infrastructure for creating and interacting with web services
    Publication number: 20060150200
    Abstract: A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
    Type: Application
    Filed: December 3, 2004
    Publication date: July 6, 2006
    Applicant: Microsoft Corporation
    Inventors: Shy Cohen, Geary Eppley, Douglas Purdy, James Johnson, Stephen Millet, Stephen Swartz, Vijay Gajjala, Aaron Stern, Alexander DeJarnatt, Alfred Lee, Anand Rjagopalan, Anastasios Kasiolas, Chaitanya Upadhyay, Christopher Kaler, Craig Critchley, David Levin, David Driver, David Wortendyke, Douglas Walter, Elliot Waingold, Erik Christensen, Erin Honeycutt, Eugene Shvets, Evgeny Osovetsky, Giovanni Della-Libera, Jesus Ruiz-Scougall, John Doty, Jonathan Wheeler, Kapil Gupta, Kenneth Wolf, Krishnan Srinivasan, Lance Olson, Matthew Tavis, Mauro Ottaviani, Max Feingold, Michael Coulson, Michael Marucheck, Michael Vernal, Michael Dice, Mohamed-Hany Ramadan, Mohammad Makarechian, Natasha Jethanandani, Richard Dievendorff, Richard Hill, Ryan Sturgell, Saurab Nog, Scott Seely, Serge Sverdlov, Siddhartha Puri, Sowmyanarayanan Srinivasan, Stefan Batres, Stefan Pharies, Tirunelveli Vishwanath, Tomasz Janczuk, Uday Hegde, Umesh Madan, Vaithialingam Balayogan, Vipul Modi, Yaniv Pessach, Yasser Shohoud
  • Flexibly transferring typed application data
    Publication number: 20060123047
    Abstract: The present invention extends to using Simple Object Access Protocol (“SOAP”) to exchange typed objects, such as, for example, parameters for invoking methods. A computer system accesses typed object parameters corresponding to a typed object. The typed object is annotated with one or one more message contract attributes of a message contract model defining a mapping between typed object parameters and corresponding SOAP elements. The computer system utilizes the message contract attributes to map the typed object parameters into a SOAP element and inserts the SOAP element into a SOAP envelope. A receiving computer system accessing the SOAP element and utilizes the message contract attributes to map the SOAP element back into the typed object parameters.
    Type: Application
    Filed: December 3, 2004
    Publication date: June 8, 2006
    Applicant: Microsoft Corporation
    Inventors: Erik Christensen, Vaithiakingam Balayoghan, Michael Coulson, Ryan Sturgell, Natasha Jethanandani, Michael Marucheck, Douglas Purdy, Kenneth Wolf, Michael Vernal, Stefan Pharies, David Wortendyke
  • Data abstraction based serialization
    Publication number: 20060047679
    Abstract: Serialization and deserialization using data contracts. The data contract specifies data types that are serialized and deserialized for data objects that are associated with the data contract. During serialization, the data contract associated with the data object is identified. Then, the data fields that correspond to those specified data field types are extracted from the data object and serialized into a serialization format. During deserialization, the serialization mechanism receives a serialized data structure having a particular serialization format. A data contract is then identified as being associated with the serialized data structure. After deserialization of the serialized data structure into abstract data, a corresponding data object is populated with data fields that correspond only with those data field types specified in the data contract. Accordingly, data abstraction is enabled while serializing and deserializing.
    Type: Application
    Filed: August 25, 2004
    Publication date: March 2, 2006
    Inventors: Douglas Purdy, Sowmyanarayanan Srinivasan, Bradford Lovering, Donald Box, Gopala Kakivaya, Natasha Jethanandani, Stefan Pharies, Stephen Swartz, Steven Lucco
  • Type evolution
    Publication number: 20050235009
    Abstract: A versionable schema is both backward-compatible and forward-compatible. Such a schema is able to receive data expected by multiple versions of the schema; tolerates the absence of optional data, in accordance with other versions, and accept wildcard data in accordance with still further versions. Thus, a message or message may be validated by the versionable schema.
    Type: Application
    Filed: March 31, 2004
    Publication date: October 20, 2005
    Inventors: Douglas Purdy, Natasha Jethanandani, Sowmy Srinivasan, Stefan Pharies