Patents by Inventor David G. Carlson

David G. Carlson 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: 20150048213
    Abstract: A tiltrotor aircraft includes a fuselage; a wing member having a first rib, a second rib, a first spar, second spar; and an upper wing skin; an engine disposed at a fixed location relative to the wing member; and a proprotor having a spindle gearbox, rotor mast, and a plurality of rotor blades drivable in rotation about the rotor mast, the spindle gearbox being rotatable about a conversion axis. The spindle gearbox is located above the upper wing skin of the wing member.
    Type: Application
    Filed: August 14, 2013
    Publication date: February 19, 2015
    Applicant: Bell Helicopter Textron Inc.
    Inventors: Brent C. Ross, David R. Bockmiller, John R. McCullough, David G. Carlson
  • Publication number: 20150037533
    Abstract: A method of manufacturing a core stiffened structure includes orienting the plurality of core wafers in a non-uniform pattern onto a first face sheet, the non-uniform pattern producing non-uniform spacing between adjacent core wafers; assembling a second face sheet onto the plurality of wafers; and curing an adhesive to create a bond between the plurality of wafers, the first face sheet, and the second face sheet.
    Type: Application
    Filed: July 31, 2013
    Publication date: February 5, 2015
    Applicant: Bell Helicopter Textron Inc.
    Inventors: Phillip A. Kendrick, Paul K. Oldroyd, David G. Carlson
  • Patent number: 8484276
    Abstract: Techniques are disclosed for converting data into a format tailored for efficient multidimensional fast Fourier transforms (FFTS) on single instruction, multiple data (SIMD) multi-core processor architectures. The technique includes converting data from a multidimensional array stored in a conventional row-major order into SIMD format. Converted data in SIMD format consists of a sequence of blocks, where each block interleaves s rows such that SIMD vector processors may operate on s rows simultaneously. As a result, the converted data in SIMD format enables smaller-sized 1D FFTs to be optimized in SIMD multi-core processor architectures.
    Type: Grant
    Filed: March 18, 2009
    Date of Patent: July 9, 2013
    Assignee: International Business Machines Corporation
    Inventors: David G. Carlson, Travis M. Drucker, Timothy J. Mullins, Jeffrey S. McAllister, Nelson Ramirez
  • Patent number: 8316159
    Abstract: A method, apparatus, and program product retrieve data for a task utilizing demand-based direct memory access (“DMA”) requests. The method comprises, prior to the execution thereof, analyzing a first portion of a task to determine whether data required for execution thereby is stored in a local memory, and, in response to determining that the data required for execution by the first portion of the task is not stored in the local memory, proactively issuing a first DMA request for the data required for execution by the first portion of the task. The method further comprises, in response to determining that the first DMA request is not complete, determining whether to proactively analyze a second portion of the task prior to the execution thereof for a determination whether data required for execution thereby is stored in the local memory.
    Type: Grant
    Filed: April 15, 2011
    Date of Patent: November 20, 2012
    Assignee: International Business Machines Corporation
    Inventor: David G. Carlson
  • Publication number: 20120265906
    Abstract: A method, apparatus, and program product retrieve data for a task utilizing demand-based direct memory access (“DMA”) requests. The method comprises, prior to the execution thereof, analyzing a first portion of a task to determine whether data required for execution thereby is stored in a local memory, and, in response to determining that the data required for execution by the first portion of the task is not stored in the local memory, proactively issuing a first DMA request for the data required for execution by the first portion of the task. The method further comprises, in response to determining that the first DMA request is not complete, determining whether to proactively analyze a second portion of the task prior to the execution thereof for a determination whether data required for execution thereby is stored in the local memory.
    Type: Application
    Filed: April 15, 2011
    Publication date: October 18, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: David G. Carlson
  • Publication number: 20120265890
    Abstract: A method, apparatus, and program product stream data between a host element and a target element in a parallel computing system. The method comprises partitioning data used to perform a task into a plurality of data streams based at least in part upon data associated with the task and partitioning a data stream into a plurality of data stream views based at least in part on a memory size associated with a target element configured to process the data stream. The method further comprises sequentially communicating at least a portion of the data stream views to the target element via a data streaming infrastructure implemented on at least a host element and the target element, wherein the portion of the data streaming infrastructure on the host element transfers the portion of the data stream views to the portion of the data streaming infrastructure on the target element.
    Type: Application
    Filed: April 15, 2011
    Publication date: October 18, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David G. Carlson, Jeffrey S. McAllister, Nelson Ramirez
  • Patent number: 8037059
    Abstract: A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.
    Type: Grant
    Filed: May 1, 2008
    Date of Patent: October 11, 2011
    Assignee: International Business Machines Corporation
    Inventors: Robert J. Bestgen, David G. Carlson, Robert V. Downer, Shantan Kethireddy
  • Patent number: 7836714
    Abstract: A fluid compression system includes a compressor that is operable to produce a flow of compressed fluid and a coolant compressor that is operable to produce a flow of coolant. A base includes at least one polymer wall that at least partially defines a reservoir space. The base supports the compressor and the coolant compressor. A first tube is at least partially positioned within the reservoir space and is in fluid communication with the compressor to receive the flow of compressed air and a second tube is at least partially positioned within the reservoir space and is in fluid communication with the coolant compressor to receive the flow of coolant.
    Type: Grant
    Filed: May 2, 2006
    Date of Patent: November 23, 2010
    Assignee: Ingersoll-Rand Company
    Inventors: David G. Carlson, Kurt A. Dimos
  • Publication number: 20100241824
    Abstract: Techniques are disclosed for converting data into a format tailored for efficient multidimensional fast Fourier transforms (FFTS) on single instruction, multiple data (SIMD) multi-core processor architectures. The technique includes converting data from a multidimensional array stored in a conventional row-major order into SIMD format. Converted data in SIMD format consists of a sequence of blocks, where each block interleaves s rows such that SIMD vector processors may operate on s rows simultaneously. As a result, the converted data in SIMD format enables smaller-sized 1D FFTs to be optimized in SIMD multi-core processor architectures.
    Type: Application
    Filed: March 18, 2009
    Publication date: September 23, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David G. Carlson, Travis M. Drucker, Timothy J. Mullins, Jeffrey S. McAllister, Nelson Ramirez
  • Publication number: 20090276393
    Abstract: A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.
    Type: Application
    Filed: May 1, 2008
    Publication date: November 5, 2009
    Inventors: Robert J. Bestgen, David G. Carlson, Robert V. Downer, Shantan Kethireddy
  • Patent number: 6961309
    Abstract: This invention relates to reception and transmission of data over a network. More specifically, this invention relates to Transmission Control Protocol's delayed acknowledgment and improving transmission throughput by adaptively adjusting the use of delayed acknowledgment.
    Type: Grant
    Filed: April 25, 2001
    Date of Patent: November 1, 2005
    Assignee: International Business Machines Corporation
    Inventors: David G. Carlson, Paul R. Chmielewski
  • Publication number: 20020159396
    Abstract: This invention relates to reception and transmission of data over a network. More specifically, this invention relates to Transmission Control Protocol's delayed acknowledgment and improving transmission throughput by adaptively adjusting the use of delayed acknowledgment.
    Type: Application
    Filed: April 25, 2001
    Publication date: October 31, 2002
    Inventors: David G. Carlson, Paul R. Chmielewski
  • Patent number: 5748781
    Abstract: Data compression and decompression are performed on a series of data points, by expressing a plurality of data points as an equation or a series of equations. Variable accuracies, and accordingly variable compression ratios, may be provided. Multiple versions of the compressed data, with corresponding multiple accuracy levels, and resulting multiple decompressions may be displayed for comparison. The method and apparatus may be used for storing network statistical data.
    Type: Grant
    Filed: January 4, 1995
    Date of Patent: May 5, 1998
    Assignee: Cabletron Systems, Inc.
    Inventors: Utpal Datta, David G. Carlson
  • Patent number: 5408528
    Abstract: A telephone call is made by a calling party. The telephone call is routed through a telephone network to a piece of terminal equipment. The terminal equipment analyzes call information associated with the telephone call. The call information is divided into separate call attributes, such as calling telephone number and called telephone number. One or more number lists, stored in the terminal equipment, are then searched to see if they contain an entry that matches the call attributes. If a match is not found, the call is rejected. If one or more matches is found, the call is routed as specified by the number list entry having the most optimal match. The number lists can be easily user-modified.
    Type: Grant
    Filed: June 16, 1994
    Date of Patent: April 18, 1995
    Assignee: International Business Machines Corporation
    Inventors: David G. Carlson, Thomas E. Miller