Patents by Inventor William S. Davidson

William S. Davidson 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: 20220404343
    Abstract: The present invention relates to a drum stencil printing system for reliably and automatically printing materials on the inside of a concave surface. The drum stencil printing system includes a pliable drum stencil secured in place by a stencil spring. As the printhead applies radial pressure to the drum stencil, the portion of the stencil in contact with the printhead is deflected to make contact with the container sidewall. When the printhead rotates, the portion of the stencil contacting the container sidewall also rotates to match the nozzle of the printhead. After printing is complete, the printhead retracts, and the pliable stencil is returned to its undeflected position, breaking contact between the stencil and the container, and protecting the printed material from being rubbed or worn off of the container.
    Type: Application
    Filed: August 23, 2022
    Publication date: December 22, 2022
    Applicant: Smart Cups, LLC
    Inventors: Owen J. Dolan, II, Chris Kanik, John Depiano, Mark Clemons, Gary Ayotte, Frank S. Silveira, Michael Marcoux, Matthew Ebbs, William S. Davidson, III
  • Patent number: 5375234
    Abstract: The data dictionary manager takes advantage of the computer system's journaling capability enhanced to allow users and application programs to manipulate system objects without the use of the data dictionary's built-in utilities. As used here, journaling capability is an internal tracking facility which exists in a somewhat limited form on many computer systems. Typical journaling mechanisms maintain a repository of information about some of the activities that have taken place on the computer system. The information is usually stored in a record called an audit journal. Since many computer systems have limited journaling mechanisms already in place, these mechanisms can be enhanced to add the ability to record information about changes to system objects. Examples of system object changes included in the audit journal are deletes, creates, renames, and moves.
    Type: Grant
    Filed: January 28, 1994
    Date of Patent: December 20, 1994
    Assignee: International Business Machines Corporation
    Inventors: William S. Davidson, Kurt W. Eggerling
  • Patent number: 4847749
    Abstract: A recovery mechanism restarts jobs following correction of a system failure and automatically marks the jobs for interruption at a logical boundary. The logical boundary is above logical file updating functions such that logical files are in a known state when jobs reach the boundary. When a system failure is detected which has not yet resulted in lost data, an image of working memory, including hardware status is saved on nonvolatile storage. After the failure has been resolved, the system is initially loaded with operating programs (IPL) and working memory is reloaded from the nonvolatile storage. All jobs which were reloaded are marked for interrupt at a machine instruction boundary, and processing is started. After all jobs have reached the boundary, or a predetermined time has elapsed, processing is stopped and the system is re-IPLed. There are few system index recoveries to be performed, since most jobs reached a point where logical files were synchronized with corresponding data.
    Type: Grant
    Filed: June 13, 1986
    Date of Patent: July 11, 1989
    Assignee: International Business Machines Corporation
    Inventors: Robert W. Collins, William S. Davidson, Steven M. Dickes, James S. Effle, Carle J. Larson, Russell J. Weinschenk, Peter M. Wottreng
  • Patent number: 4774657
    Abstract: A key estimator estimates the number of keys over a key range defined by key endpoints in an index to a data space. The number of keys in the key range required to be processed for a particular operation is estimated as a function of the number of pages referenced during a range level limited search. Two keys defining range endpoint keys are searched down to their lowest level in the tree. The level limit is then calculated as a function of desired granularity or accuracy of the estimate. The entire range of keys in the desired key range is then searched down to the level limit and the number of pages referenced during the search is counted and multiplied by an average key density per page to calculate the number of keys in the range.
    Type: Grant
    Filed: June 6, 1986
    Date of Patent: September 27, 1988
    Assignee: International Business Machines Corporation
    Inventors: Mark J. Anderson, Richard L. Cole, William S. Davidson, Wilson D. Lee, Peter B. Passe, Gary R. Ricard, Larry W. Youngren