Patents by Inventor Michael Sporer

Michael Sporer 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: 10739216
    Abstract: The invention relates to a torque sensor having a base body which extends in a radial direction of the base body from an annular inner flange having first force application points, via a mechanically weakened sensor portion equipped with measurement transducers which generate output signals, to an annular outer flange having second force application points, wherein the second force application points are connected to the sensor portion by a radially elastic material portion.
    Type: Grant
    Filed: August 31, 2017
    Date of Patent: August 11, 2020
    Assignee: SENSODRIVE GMBH
    Inventors: Matthias Haehnle, Norbert Sporer, Michael Grandl, Mathias Sattler
  • Publication number: 20190212217
    Abstract: The invention relates to a torque sensor (1000; 1100) having a base body (1001; 1101) which extends in a radial direction (Y) of the base body from an annular inner flange (1003; 1103) having first force application points (1005; 1105), via a mechanically weakened sensor portion (1007; 1107) equipped with measurement transducers (10, 20) which generate output signals, to an annular outer flange (1009; 1109) having second force application points (1011; 1111), wherein a rubber-elastic sealing membrane (1031; 1131) arranged axially between the outer flange (1009; 1109) and the inner flange (1003; 1103) covers the mechanically weakened sensor portion (1007; 1107) in a fluid-tight manner.
    Type: Application
    Filed: August 31, 2017
    Publication date: July 11, 2019
    Inventors: Matthias Haehnle, Norbert Sporer, Michael Grandl, Mathias Sattler
  • Publication number: 20190204169
    Abstract: The invention relates to a torque sensor having a base body (601) which extends in a radial direction (Y) of the base body from an annular inner flange (603) having first force application points (605), via a mechanically weakened sensor portion (607) equipped with measurement transducers (10, 20) which generate output signals, to an annular outer flange (509; 609) having second force application points (611), wherein the mechanically weakened sensor portion (607) comprises radially extending first connecting webs (619a) and second connecting webs (619b), which have different mechanical properties and are arranged alternately in the circumferential direction.
    Type: Application
    Filed: August 31, 2017
    Publication date: July 4, 2019
    Inventors: Matthias Haehnle, Norbert Sporer, Michael Grandl, Mathias Sattler
  • Publication number: 20190187013
    Abstract: The Invention relates to a torque sensor (100) having a base body (101) which extends in a radial direction (Y) of the base body from an annular inner flange (103) having first force application points (105), via a mechanically weakened sensor portion (107) equipped with measurement transducers (10, 20) which generate output signals, to an annular outer flange (109) having second force application points (111), wherein the second force application points (111) are connected to the sensor portion (107) by a radially elastic material portion (113).
    Type: Application
    Filed: August 31, 2017
    Publication date: June 20, 2019
    Inventors: Matthias Haehnle, Norbert Sporer, Michael Grandl, Matthias Sattler
  • Publication number: 20180052863
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node. A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data. An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.
    Type: Application
    Filed: October 24, 2017
    Publication date: February 22, 2018
    Inventors: Garth A. Dickie, Michael Sporer, Jason A. Viehland
  • Patent number: 9858285
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node. A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data. An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.
    Type: Grant
    Filed: May 4, 2015
    Date of Patent: January 2, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Garth A. Dickie, Michael Sporer, Jason A. Viehland
  • Patent number: 9836473
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node. A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data. An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.
    Type: Grant
    Filed: October 3, 2014
    Date of Patent: December 5, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Garth A. Dickie, Michael Sporer, Jason A. Viehland
  • Publication number: 20160098420
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node. A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data. An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.
    Type: Application
    Filed: May 4, 2015
    Publication date: April 7, 2016
    Inventors: Garth A. Dickie, Michael Sporer, Jason A. Viehland
  • Publication number: 20160098439
    Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hardware acceleration are presented. A plurality of computational nodes for processing data is provided, each node performing a corresponding operation for data received at that node, A metric module is used to determine a compression benefit metric pertaining to performance of the corresponding operations of one or more computational nodes with recompressed data, An accelerator module recompresses data for processing by the one or more computational nodes based on the compression benefit metric indicating a benefit gained by using the recompressed data. A distribution function may be used to distribute data among a plurality of nodes.
    Type: Application
    Filed: October 3, 2014
    Publication date: April 7, 2016
    Inventors: Garth A. Dickie, Michael Sporer, Jason A. Viehland
  • Patent number: 9195695
    Abstract: An approach for providing compression of a database table that uses a compiled table algorithm (CTA) that provides leverage. Data within any given column in adjacent rows is often the same as or closely related to its neighbors. Rather than storing data in each column of each row as a specific integer, floating point, or character data value, a field reconstruction instruction is stored that when executed by a decompression engine can reconstruct the data value. The field reconstruction instruction may be bit granular and may depend upon past history given that the data compression engine may preserve state as row data is streamed off a storage device.
    Type: Grant
    Filed: September 13, 2007
    Date of Patent: November 24, 2015
    Assignee: IBM International Group B.V.
    Inventors: John Yates, Michael Sporer, Sharon Miller
  • Patent number: 7730077
    Abstract: A programmable streaming data processor that can be programmed to recognize record and field structures of data received from a streaming data source such as a mass storage device. Being programmed with, for example, field information, the unit can locate record and field boundaries and employ logical arithmetic methods to compare fields with one another or with values otherwise supplied by general purpose processors to precisely determine which records are worth transferring to memory of the more general purpose distributed processors. The remaining records arrive and are discarded by the streaming data processor or are tagged with status bits to indicate to the more general purpose processor that they are to be ignored. In a preferred embodiment, the streaming data processor may analyze and discard records for several reasons. The first reason may be an analysis of contents of the field.
    Type: Grant
    Filed: September 18, 2003
    Date of Patent: June 1, 2010
    Assignee: Netezza Corporation
    Inventors: Foster D. Hinshaw, Raymond J. Andraka, David L. Meyers, Sharon L. Miller, Michael Sporer, William K. Stewart, Barry M. Zane
  • Publication number: 20080222136
    Abstract: An approach for providing compression of a database table that uses a compiled table algorithm (CTA) that provides leverage. Data within any given column in adjacent rows is often the same as or closely related to its neighbors. Rather than storing data in each column of each row as a specific integer, floating point, or character data value, a field reconstruction instruction is stored that when executed by a decompression engine can reconstruct the data value. The field reconstruction instruction may be bit granular and may depend upon past history given that the data compression engine may preserve state as row data is streamed off a storage device.
    Type: Application
    Filed: September 13, 2007
    Publication date: September 11, 2008
    Inventors: John Yates, Michael Sporer, Sharon Miller
  • Publication number: 20040133565
    Abstract: A programmable streaming data processor that can be programmed to recognize record and field structures of data received from a streaming data source such as a mass storage device. Being programmed with, for example, field information, the unit can locate record and field boundaries and employ logical arithmetic methods to compare fields with one another or with values otherwise supplied by general purpose processors to precisely determine which records are worth transferring to memory of the more general purpose distributed processors. The remaining records arrive and are discarded by the streaming data processor or are tagged with status bits to indicate to the more general purpose processor that they are to be ignored. In a preferred embodiment, the streaming data processor may analyze and discard records for several reasons. The first reason may be an analysis of contents of the field.
    Type: Application
    Filed: September 18, 2003
    Publication date: July 8, 2004
    Applicant: Netezza Corporation
    Inventors: Foster D. Hinshaw, Raymond A. Andraka, David L. Meyers, Sharon L. Miller, Michael Sporer, William K. Stewart, Barry M. Zane
  • Patent number: 6584152
    Abstract: Random access to arbitrary fields of a video segment compressed using both interframe and intraframe techniques is enhanced by adding state information to the bitstream prior to each intraframe compressed image to allow each intraframe compressed image to be randomly accessed, by generating a field index that maps each temporal field to the offset in the compressed bitstream of the data used to decode the field, and by playing back segments using two or more alternatingly used decoders. The cut density may be improved by eliminating from the bitstream applied to each decoder any data corresponding to bidirectionally compressed images that would otherwise be used by the decoder to generate fields prior to the desired field.
    Type: Grant
    Filed: December 11, 2000
    Date of Patent: June 24, 2003
    Assignee: Avid Technology, Inc.
    Inventors: Michael Sporer, Katherine H. Cornog, Peter Zawojski, James Hamilton
  • Publication number: 20010024472
    Abstract: Random access to arbitrary fields of a video segment compressed using both interframe and intraframe techniques is enhanced by adding state information to the bitstream prior to each intraframe compressed image to allow each intraframe compressed image to be randomly accessed, by generating a field index that maps each temporal field to the offset in the compressed bitstream of the data used to decode the field, and by playing back segments using two or more alternatingly used decoders. The cut density may be improved by eliminating from the bitstream applied to each decoder any data corresponding to bidirectionally compressed images that would otherwise be used by the decoder to generate fields prior to the desired field.
    Type: Application
    Filed: December 11, 2000
    Publication date: September 27, 2001
    Inventors: Michael Sporer, Katherine H. Cornog, Peter Zawojski, James Hamilton
  • Patent number: 6167083
    Abstract: Random access to arbitrary fields of a video segment compressed using both interframe and intraframe techniques is enhanced by adding state information to the bitstream prior to each intraframe compressed image to allow each intraframe compressed image to be randomly accessed by generating a field index that maps each temporal field to the offset in the compressed bitstream of the data used to decode the field, and by playing back segments using two or more alternatingly used decoders. The cut density may be improved by eliminating from the bitstream applied to each decoder any data corresponding to bidirectionally compressed images that would otherwise be used by the decoder to generate fields prior to the desired field.
    Type: Grant
    Filed: April 4, 1997
    Date of Patent: December 26, 2000
    Assignee: Avid Technology, Inc.
    Inventors: Michael Sporer, Katherine H. Cornog, Peter Zawojski, James Hamilton
  • Patent number: 6091778
    Abstract: A digital motion video processing circuit can capture, playback and manipulate digital motion video information using the system memory of a computer as a data buffer for holding compressed video data from the circuit. The system memory may be accessed by the circuit over a standard bus. A controller in the circuit directs data flow between an input/output port which transfer a stream of pixel data and to the standard bus. The controller directs data to and from either the standard bus or the input/output port through processing circuitry for compression, decompression, scaling and buffering. The standard bus may be a peripheral component interconnect (PCI) bus. The motion video processing circuit has a data path including pixel data and timing data indicative of a size of an image defined by the pixel data. The timing data is used and/or generated by each component which processes the pixel data, thereby enabling each component to process the pixel data without prior knowledge of the image format.
    Type: Grant
    Filed: December 14, 1998
    Date of Patent: July 18, 2000
    Assignee: Avid Technology, Inc.
    Inventors: Michael Sporer, Mark H. Kline, Peter Zawojski
  • Patent number: 6026461
    Abstract: A very fast, memory efficient, highly expandable, highly efficient CCNUMA processing system based on a hardware architecture that minimizes system bus contention, maximizes processing forward progress by maintaining strong ordering and avoiding retries, and implements a full-map directory structure cache coherency protocol. A Cache Coherent Non-Uniform Memory Access (CCNUMA) architecture is implemented in a system comprising a plurality of integrated modules each consisting of a motherboard and two daughterboards. The daughterboards, which plug into the motherboard, each contain two Job Processors (JPs), cache memory, and input/output (I/O) capabilities. Located directly on the motherboard are additional integrated I/O capabilities in the form of two Small Computer System Interfaces (SCSI) and one Local Area Network (LAN) interface. The motherboard includes main memory, a memory controller (MC) and directory DRAMs for cache coherency.
    Type: Grant
    Filed: December 9, 1998
    Date of Patent: February 15, 2000
    Assignee: Data General Corporation
    Inventors: William F. Baxter, Robert G. Gelinas, James M. Guyer, Dan R. Huck, Michael F. Hunt, David L. Keating, Jeff S. Kimmell, Phil J. Roux, Liz M. Truebenbach, Rob P. Valentine, Pat J. Weiler, Joseph Cox, Barry E. Gillott, Andrea Heyda, Rob J. Pike, Tom V. Radogna, Art A. Sherman, Michael Sporer, Doug J. Tucker, Simon N. Yeung
  • Patent number: 5887146
    Abstract: A very fast, memory efficient, highly expandable, highly efficient CCNUMA processing system based on a hardware architecture that minimizes system bus contention, maximizes processing forward progress by maintaining strong ordering and avoiding retries, and implements a full-map directory structure cache coherency protocol. A Cache Coherent Non-Uniform Memory Access (CCNUMA) architecture is implemented in a system comprising a plurality of integrated modules each consisting of a motherboard and two daughterboards. The daughterboards, which plug into the motherboard, each contain two Job Processors (JPs), cache memory, and input/output (I/O) capabilities. Located directly on the motherboard are additional integrated I/O capabilities in the form of two Small Computer System Interfaces (SCSI) and one Local Area Network (LAN) interface. The motherboard includes main memory, a memory controller (MC) and directory DRAMs for cache coherency.
    Type: Grant
    Filed: August 12, 1996
    Date of Patent: March 23, 1999
    Assignee: Data General Corporation
    Inventors: William F. Baxter, Robert G. Gelinas, James M. Guyer, Dan R. Huck, Michael F. Hunt, David L. Keating, Jeff S. Kimmell, Phil J. Roux, Liz M. Truebenbach, Rob P. Valentine, Pat J. Weiler, Joseph Cox, Barry E. Gillott, Andrea Heyda, Rob J. Pike, Tom V. Radogna, Art A. Sherman, Michael Sporer, Doug J. Tucker, Simon N. Yeung
  • Patent number: 5883670
    Abstract: A digital motion video processing circuit can capture, playback and manipulate digital motion video information using the system memory of a computer as a data buffer for holding compressed video data from the circuit. The system memory may be accessed by the circuit over a standard bus. A controller in the circuit directs data flow between an input/output port which transfer a stream of pixel data and to the standard bus. The controller directs data to and from either the standard bus or the input/output port through processing circuitry for compression, decompression, scaling and buffering. The standard bus may be a peripheral component interconnect (PCI) bus. The motion video processing circuit has a data path including pixel data and timing data indicative of a size of an image defined by the pixel data. The timing data is used and/or generated by each component which processes the pixel data, thereby enabling each component to process the pixel data without prior knowledge of the image format.
    Type: Grant
    Filed: August 2, 1996
    Date of Patent: March 16, 1999
    Assignee: Avid Technology, Inc.
    Inventors: Michael Sporer, Mark H. Kline, Peter Zawojski