Patents by Inventor George Copeland

George Copeland 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: 7579972
    Abstract: An RFIC controller configured for executing multiple tasks. A serial interface is included having a serial bus for receiving a data stream having control bits and data bits. One or more registers are coupled to the serial bus for storing the control bits and data bits as they are received. Control circuitry is also included. The data stream is formatted such that the control bits are received before the data bits, the control bits specifying an operation. The control circuitry is configured to examine the control bits as they are received to determine the operation specified by the control bits before the data bits are received. A task corresponding to the operation specified by the control bits is then initiated before the data bits are received.
    Type: Grant
    Filed: November 30, 2007
    Date of Patent: August 25, 2009
    Assignee: ITT Manufacturing Enterprises, Inc.
    Inventors: David George Copeland, Patrick Arthur McCabe, Rocky Ardy Ilen, Jonathan Borui Kang
  • Publication number: 20090140901
    Abstract: An RFIC controller configured for executing multiple tasks. A serial interface is included having a serial bus for receiving a data stream having control bits and data bits. One or more registers are coupled to the serial bus for storing the control bits and data bits as they are received. Control circuitry is also included. The data stream is formatted such that the control bits are received before the data bits, the control bits specifying an operation. The control circuitry is configured to examine the control bits as they are received to determine the operation specified by the control bits before the data bits are received. A task corresponding to the operation specified by the control bits is then initiated before the data bits are received.
    Type: Application
    Filed: November 30, 2007
    Publication date: June 4, 2009
    Applicant: ITT MANUFACTURING ENTERPRISES, INC.
    Inventors: David George Copeland, Patrick Arthur McCabe, Rocky Ardy Ilen, Jonathan Borui Kang
  • Publication number: 20080138253
    Abstract: An autoclave comprises an enclosure 10 defining a chamber 12, steam supply means 20, 22 arranged to supply steam to the chamber, steam venting means 34, 40, 58, 60 arranged to vent steam from the chamber, and control means 100, 102 arranged to control operation of the autoclave. The control means comprises a first controller 100 and a second controller 102, each controller being arranged to define a respective set of conditions required for a change of state of the autoclave, to monitor a parameter of the autoclave and determine therefrom whether its respective conditions have been met, and the control means is arranged to allow the change of state only if both sets of conditions have been met.
    Type: Application
    Filed: July 27, 2007
    Publication date: June 12, 2008
    Applicant: Eschmann Holdsings Limited
    Inventors: Roger Francis Golder, Terence George Copeland
  • Publication number: 20080098261
    Abstract: Mechanisms for adaptively entering and exiting recovery mode. When a message is received from a particular message transaction, the appropriate processing instance is loaded from persistent memory to system memory. The processing instance then determines from its own state information whether or not it is in recovery mode. This indication of recovery or normal mode may be set by a system-wide recovery detection module. If the processing instance determines that it is in normal mode, then the processing instance executes code appropriate for normal operation without needing to execute any recovery code at all. If, on the other hand, the processing instance determines that it is in recovery mode, then it executes recovery code. Once the recovery code has completed successfully, the processing instance may then cause its own normal mode.
    Type: Application
    Filed: December 12, 2007
    Publication date: April 24, 2008
    Applicant: Microsoft Corporation
    Inventors: Luis Cabrera, George Copeland
  • Publication number: 20080005273
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device, a fragment in the message body is cached. Cache ID rules from an origin server accompany a fragment to describe a method for forming a unique cache ID for the fragment such that dynamic content can be cached away from an origin server. A cache ID may be based on a URI and/or query parameters and/or cookies that are associated with a fragment. After user authentication, a cookie containing the user's role may be used in subsequent requests for role-specific fragments and in the cache identifier for role-specific fragments, thereby allowing requests from other users for role-specific fragments to be resolved in the cache when the users have the same role because these users would also have the same cookie.
    Type: Application
    Filed: September 13, 2007
    Publication date: January 3, 2008
    Inventors: Rajesh Agarwalla, James Challenger, George Copeland, Arun Iyengar, Mark Linehan, Subbarao Meduri
  • Publication number: 20070244964
    Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. After a message is received at a computing device that contains a cache management unit, a fragment in the message body of the message is cached. Subsequent requests for the fragment at the cache management unit result in a cache hit. A FRAGMENTLINK tag is used to specify the location in a fragment for an included or linked fragment which is to be inserted into the fragment during fragment or page assembly or page rendering. A FRAGMENTLINK tag may include a FOREACH attribute that is interpreted as indicating that the FRAGMENTLINK tag should be replaced with multiple FRAGMENTLINK tags. The FOREACH attribute has an associated parameter that has multiple values that are used in identifying multiple fragments for the multiple FRAGMENTLINK tags.
    Type: Application
    Filed: June 21, 2007
    Publication date: October 18, 2007
    Inventors: James Challenger, Michael Conner, George Copeland, Arun Iyengar
  • Publication number: 20070168723
    Abstract: Mechanisms for adaptively entering and exiting recovery mode. When a message is received from a particular message transaction, the appropriate processing instance is loaded from persistent memory to system memory. The processing instance then determines from its own state information whether or not it is in recovery mode. This indication of recovery or normal mode may be set by a system-wide recovery detection module. If the processing instance determines that it is in normal mode, then the processing instance executes code appropriate for normal operation without needing to execute any recovery code at all. If, on the other hand, the processing instance determines that it is in recovery mode, then it executes recovery code. Once the recovery code has completed successfully, the processing instance may then cause its own normal mode.
    Type: Application
    Filed: January 25, 2007
    Publication date: July 19, 2007
    Applicant: Microsoft Corporation
    Inventors: Luis Cabrera, George Copeland
  • Publication number: 20050198108
    Abstract: Deterministic rule-based dispatch of the data structure to a group of one or more methods. After accessing the data structure to be processed, a list of rules is evaluated to identify multiple rules that apply to the dispatch of the data structure. Each of these multiple rules specifies a different group of one or more methods to which the data structure should be dispatched. The multiple rules are resolved to a single prevailing rule that will be applied for the dispatch of the data structure. Then, the computing system dispatches the data structure to the group of one or more methods specified by the prevailing rule. The rule evaluation and prioritization is deterministic for ease in debugging since it may be determined which group of one or more methods processed a data structure should a performance problem arise during the processing. Furthermore, rules may be added, amended, or deleted dynamically.
    Type: Application
    Filed: January 23, 2004
    Publication date: September 8, 2005
    Inventors: Luis Cabrera, George Copeland
  • Publication number: 20050198554
    Abstract: Mechanisms for operating in recovery mode while ensuring reliable message processing for messages received during the recovery operation mode. Upon receiving a message corresponding to a particular message transaction, the instance responsible for that message transaction determines from state information corresponding to the transaction, whether or not that instance is operating in normal mode, or recovery mode. If the state information reflects normal operation mode, then the instance processes the message. If recover mode, then the instance evaluates whether or not the message is a normal message suitable for normal operation mode, or a recovery message suitable for recovery operation mode. If the message is a normal message, then the message is placed in a persistent queue for later processing. If the message is a recovery message, the message is processed. Upon completion of recovery, the normal message in the queue may be processed.
    Type: Application
    Filed: January 23, 2004
    Publication date: September 8, 2005
    Inventors: Luis Cabrera, George Copeland
  • Publication number: 20050198148
    Abstract: Mechanisms for enforcing a message exchange pattern. When two computing systems communicate in order to accomplish a particular task, they engage in a particular message exchange pattern. Given certain progress through the message exchange pattern, the message exchange pattern may restrict which computing system may send what kind of messages. Each computing system tracks progress through the message exchange pattern by, for example, using a state transition tree in which each node represents a state of the message exchange pattern, and in which transmission or receipt of certain messages may cause state transitions. A computing system then only transmits messages if appropriate given the current tracked progress through the message exchange pattern.
    Type: Application
    Filed: January 23, 2004
    Publication date: September 8, 2005
    Inventors: Luis Cabrera, George Copeland, Steven Lucco, Bradford Lovering
  • Publication number: 20050198390
    Abstract: Mechanisms in which upon receiving a message, the message is passed through one or more receiving path components that are positioned in the receiving path of the message prior to being passed to a dispatching component. One or more of the receiving path components may modify the message to include information that may be helpful to the dispatching component in order to perform the dispatch. The dispatching component receives modified message, and uses information from the modified message (including potentially the modification itself) to perform the dispatch. Since the message is modified to include additional information helpful to the dispatching component, the dispatching component may be more flexible in identifying the processing that should occur with the message. Accordingly, specialized and flexible processing may be enabled that is ideally suited for the message.
    Type: Application
    Filed: January 23, 2004
    Publication date: September 8, 2005
    Inventors: Luis Cabrera, David Wortendyke, George Copeland, Erik Christensen, David Levin, Dhananjay Mahajan, Scott Seely, Daniel Roth
  • Publication number: 20050177774
    Abstract: Mechanisms for executing a transaction such that it may be undone after being committed. The mechanism maintains a mapping between each of a number of groups of one or more direct methods with a corresponding group of one or more inversion methods, that, when executed, causes the computing system to at least partially undo the effects of the execution of the corresponding group of direct methods. Upon beginning a transaction, the computing system runs a one or more groups of one or more direct methods that are part of the transaction. The mapping is then used to identify the corresponding group(s) of inversion methods. The identities of each corresponding group of inversion methods are then saved to a compensation record. The transaction is then committed, and the compensation record is saved to a persistent media along with a transaction identifier.
    Type: Application
    Filed: January 23, 2004
    Publication date: August 11, 2005
    Inventors: George Copeland, Luis Cabrera
  • Publication number: 20050177759
    Abstract: Mechanisms for adaptively entering and exiting recovery mode. When a message is received from a particular message transaction, the appropriate processing instance is loaded from persistent memory to system memory. The processing instance then determines from its own state information whether or not it is in recovery mode. This indication of recovery or normal mode may be set by a system-wide recovery detection module. If the processing instance determines that it is in normal mode, then the processing instance executes code appropriate for normal operation without needing to execute any recovery code at all. If, on the other hand, the processing instance determines that it is in recovery mode, then it executes recovery code. Once the recovery code has completed successfully, the processing instance may then cause its own normal mode.
    Type: Application
    Filed: January 23, 2004
    Publication date: August 11, 2005
    Inventors: Luis Cabrera, George Copeland
  • Publication number: 20050166186
    Abstract: Mechanisms for automatically generating code that tests capabilities of a test computing system to simulate a message exchange pattern. The code generation computing system uses a message exchange pattern definition to generate the simulation code. For each state in which the message exchange pattern definition allows valid messages to be transmitted, code is generated for that state that at least simulates the transmission of a valid transmission message. For each state in which the message exchange pattern definition allows valid messages to be received, code is generated for that state that simulates the receipt of a valid receipt message. If the transmission or receipt of the message causes a state transition to occur, code is generated that causes the appropriate state transition in the message exchange pattern.
    Type: Application
    Filed: January 23, 2004
    Publication date: July 28, 2005
    Inventors: Luis Cabrera, George Copeland, Jason Allen
  • Publication number: 20050165860
    Abstract: A system consistency management module that performs consistency checking on behalf of an instance. The module identifies data fields of state information corresponding to the instance that are to be subject to consistency checking. The instance may identify this data fields to the system module. The system module may also identify an event that will prompt the consistency checking. When the event occurs, the system module performs the consistency checking on the identified fields. If the system module detects an inconsistency, it may set the state information to reflect that the instance is operating in recovery mode. If the instance itself was to perform the consistency checking, the instance may inform the system module that an inconsistency has been detected. The system module then sets the state information for the instance to reflect that the instance is operating in recovery mode.
    Type: Application
    Filed: January 23, 2004
    Publication date: July 28, 2005
    Inventors: Luis Cabrera, George Copeland