Patents by Inventor Stephen B. Lyle

Stephen B. Lyle 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).

  • Publication number: 20090070789
    Abstract: A computer system includes software running on a hardware platform. The hardware platform provides a platform manager having an user interface that is independent of that for a mission operating system running on said platform. The platform manager issues platform requests for power-setting adjustments. The software includes a mission operating system with a power controller incorporated in or running on the mission operating system. The power controller adjusts power settings for hardware devices at least in part as a function of the platform requests.
    Type: Application
    Filed: September 11, 2007
    Publication date: March 12, 2009
    Inventors: Carey Huscroft, Thomas L. Vaden, Stephen B. Lyle, Martin A. Goldstein
  • Patent number: 7143317
    Abstract: A service processor for a server system includes an event log that, once full, stores recent events by overwriting events of intermediate age so that the information required to diagnose both cascade errors and hangs are preserved. This contrasts with bottom-up buffers that discard recent events when full and with circular buffers that discard the oldest events when full. The event log can be reset by moving an exception region, that is, a region that is not overwritten by recent events. Alternatively, a partial reset can initialize an exception region (e.g., a bottom-up sublog), while a circular region or sublog continues to operate without being reset.
    Type: Grant
    Filed: June 4, 2003
    Date of Patent: November 28, 2006
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Stephen B. Lyle, Paul Henry Bouchier
  • Publication number: 20040250182
    Abstract: A service processor for a server system includes an event log that, once full, stores recent events by overwriting events of intermediate age so that the information required to diagnose both cascade errors and hangs are preserved. This contrasts with bottom-up buffers that discard recent events when full and with circular buffers that discard the oldest events when full. The event log can be reset by moving an exception region, that is, a region that is not overwritten by recent events. Alternatively, a partial reset can initialize an exception region (e.g., a bottom-up sublog), while a circular region or sublog continues to operate without being reset.
    Type: Application
    Filed: June 4, 2003
    Publication date: December 9, 2004
    Inventors: Stephen B. Lyle, Paul Henry Bouchier
  • Publication number: 20040048315
    Abstract: The present invention is directed generally to recombinant methods for making a desired polypeptide. These method(s) yield a polypeptide product containing reduced levels of isoform impurities thereof. In particular, the present invention is directed to (1) a recombinant method for preparing growth hormone with reduced isoform impurities thereof and (2) a recombinant method for preparing a growth hormone antagonist, such as pegvisomant, and its protein intermediate, also having reduced isoform impurities thereof. More specifically, the isoform impurities that are decreased by methods of the present invention are the trisulfide and des-phe isoform impurities of growth hormone and growth hormone antagonist (or its intermediate), respectively.
    Type: Application
    Filed: August 25, 2003
    Publication date: March 11, 2004
    Applicant: Pharmacia Corporation
    Inventors: Anurag Rathore, Stephen B. Lyle, David E. Steinmeyer, Scott I. Allen, John Meyer, Denis M. Boyle, John J. Buckley, Gary V. Johnson
  • Patent number: 6490654
    Abstract: A cache memory replacement algorithm replaces cache lines based on the likelihood that cache lines will not be needed soon. A cache memory in accordance with the present invention includes a plurality of cache lines that are accessed associatively, with a count entry associated with each cache line storing a count value that defines a replacement class. The count entry is typically loaded with a count value when the cache line is accessed, with the count value indicating the likelihood that the contents of cache lines will be needed soon. In other words, data which is likely to be needed soon is assigned a higher replacement class, while data that is more speculative and less likely to be needed soon is assigned a lower replacement class. When the cache memory becomes full, the replacement algorithm selects for replacement those cache lines having the lowest replacement class.
    Type: Grant
    Filed: July 31, 1998
    Date of Patent: December 3, 2002
    Assignee: Hewlett-Packard Company
    Inventors: John A. Wickeraad, Stephen B. Lyle, Brendan A. Voge
  • Publication number: 20010001873
    Abstract: A cache memory replacement algorithm replaces cache lines based on the likelihood that cache lines will not be needed soon. A cache memory in accordance with the present invention includes a plurality of cache lines that are accessed associatively, with a count entry associated with each cache line storing a count value that defines a replacement class. The count entry is typically loaded with a count value when the cache line is accessed, with the count value indicating the likelihood that the contents of cache lines will be needed soon. In other words, data which is likely to be needed soon is assigned a higher replacement class, while data that is more speculative and less likely to be needed soon is assigned a lower replacement class. When the cache memory becomes full, the replacement algorithm selects for replacement those cache lines having the lowest replacement class.
    Type: Application
    Filed: July 31, 1998
    Publication date: May 24, 2001
    Applicant: HEWLETT-PACKARD COMPANY
    Inventors: JOHN A. WICKERAAD, STEPHEN B. LYLE, BRENDAN VOGE
  • Patent number: 5631227
    Abstract: The present invention provides analogs of somatotropins wherein the asparagine residue corresponding to position 99 of a bovine somatotropin is replaced with a compound selected from the group consisting of proline, aspartic acid, glutamic acid, serine, glycine, serine-serine or serine-aspartic acid. Particularly preferred analogs are bovine somatotropin and their use to increase milk production.
    Type: Grant
    Filed: June 5, 1995
    Date of Patent: May 20, 1997
    Assignee: The Upjohn Company
    Inventors: Gary C. Harbour, John G. Hoogerheide, Robert L. Garlick, Stephen B. Lyle, John E. Mott
  • Patent number: 5521154
    Abstract: An imidoester, cross-linked hemoglobin composition useful in the transport of oxygen to living cells and being essentially free of any impurities, a P50 of at least 13mm Hg and predominantly in tetraruer form. Preferably, the cross-linked hemoglobin composition has a predominant molecular weight of at least 64,000. The purified and cross-linked hemoglobin has improved cross-link stability to autoxidation and can be used as a blood substitute for mammals or as an oxygen transport fluid.
    Type: Grant
    Filed: June 15, 1994
    Date of Patent: May 28, 1996
    Assignee: The Upjohn Company
    Inventors: Robert L. Garlick, Joseph P. Martin, Jr., Stephen B. Lyle
  • Patent number: 5362855
    Abstract: An imidoester, cross-linked hemoglobin composition useful in the transport of oxygen to living cells and being essentially free of any impurities, a P50 of at least 13 mm Hg and predominantly in tetramer form. Preferably, the cross-linked hemoglobin composition has a predominant molecular weight of at least 64,000. The purified and cross-linked hemoglobin has improved cross-link stability to autoxidation and can be used as a blood substitute for mammals or as an oxygen transport fluid.
    Type: Grant
    Filed: May 20, 1993
    Date of Patent: November 8, 1994
    Assignee: The Upjohn Company
    Inventors: Robert L. Garlick, Stephen B. Lyle, Joseph P. Martin, Jr.