Patents by Inventor William B. Ackerman

William B. Ackerman 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: 9356621
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.
    Type: Grant
    Filed: May 1, 2015
    Date of Patent: May 31, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
  • Patent number: 9350384
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: May 24, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
  • Publication number: 20160094243
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.
    Type: Application
    Filed: May 1, 2015
    Publication date: March 31, 2016
    Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
  • Publication number: 20160094242
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.
    Type: Application
    Filed: September 30, 2014
    Publication date: March 31, 2016
    Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
  • Patent number: 8287457
    Abstract: An ultrasound system and method are described for assessing cardiac performance which is particularly useful for diagnosing heart remodeling. A 3D data set of a surface of the heart is acquired and the principal curvatures determined at one or more points of the surface. A curvature metric is produced which is the difference of the two principal curvatures at each point. Metrics produced from the heart surface acquired at systole have been found to correlate strongly with ejection fraction.
    Type: Grant
    Filed: May 17, 2007
    Date of Patent: October 16, 2012
    Assignee: Koninklijke Philips Electronics N.V
    Inventors: Ivan Salgo, William B. Ackerman
  • Publication number: 20100056915
    Abstract: An ultrasound system and method are described for assessing cardiac performance which is particularly useful for diagnosing heart remodeling. A 3D data set of a surface of the heart is acquired and the principal curvatures determined at one or more points of the surface. A curvature metric is produced which is the difference of the two principal curvatures at each point. Metrics produced from the heart surface acquired at systole have been found to correlate strongly with ejection fraction.
    Type: Application
    Filed: May 17, 2007
    Publication date: March 4, 2010
    Applicant: KONINKLIJKE PHILIPS ELECTRONICS, N.V.
    Inventors: Ivan Salgo, William B. Ackerman
  • Patent number: 6256777
    Abstract: A debugging method is described wherein a debug information file is constructed which includes information that identifies changes of variable value assignments to registers at plural steps of program. The information further includes data that identifies any change of sequence of machine code instructions from the sequence of source code instructions that gave rise to the machine code instructions. Using such information, hidden breakpoints are inserted into the machine code (wherein a hidden breakpoint enables access to an instruction to either store a variable value from an identified register or to move to a machine code instruction that corresponds in order to a source code instruction that gave rise to the machine code instruction).
    Type: Grant
    Filed: October 9, 1998
    Date of Patent: July 3, 2001
    Assignee: Hewlett-Packard Company
    Inventor: William B. Ackerman