Search

Gary Ricard Phones & Addresses

  • 142 Sapphire Ice Dr, Delaware, OH 43015 (740) 972-6655
  • Chatfield, MN
  • Powell, OH
  • 413 Elm St, Fairmont, MN 56031
  • 511 Park St, Fairmont, MN 56031
  • 296 Turnstone Rd, Columbus, OH 43235 (614) 854-9544
  • Worthington, OH
  • Westerville, OH
  • Estherville, IA
  • Odin, MN
  • Cordova, TN

Public records

Vehicle Records

Gary Ricard

View page
Address:
10440 County Rd 139 SE, Chatfield, MN 55923
VIN:
1GCHK23D67F153576
Make:
CHEVROLET
Model:
SILVERADO 2500HD CLASSIC
Year:
2007

Publications

Us Patents

Utilizing Encoded Vector Indexes For Statistics In Database Processing

View page
US Patent:
6405187, Jun 11, 2002
Filed:
Sep 10, 1999
Appl. No.:
09/393530
Inventors:
Randy Lynn Egan - Rochester MN
Kevin James Kathmann - Rochester MN
Gary Ross Ricard - Chatfield MN
Thuan Bui - Fremont CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 2, 707 3, 707100
Abstract:
An apparatus and method to significantly improve performance of SQL function processing through the use of an encoded vector index (EVI). An EVI provides the data necessary to count the number of records in a database that match criteria provided by a SQL function. The resulting count can then be used to determine, from among two or more candidate approaches, an approach to use in processing an SQL function. By processing the EVI symbol table in lieu of more traditional database indexes, and/or in lieu of the database table itself, statistics for SQL functions are generated significantly faster.

Method And Apparatus For Removing Defects From Digital Images

View page
US Patent:
6731795, May 4, 2004
Filed:
May 31, 2000
Appl. No.:
09/584294
Inventors:
Gary Ross Ricard - Chatfield MN
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06K 940
US Classification:
382167, 382275, 382254, 382274, 37524012
Abstract:
A relatively long, narrow defect in a digital image is repaired by identifying an elongated area to be repaired, and by automatically calculating pixel color/shade values within the area to be repaired from pixel values in the vicinity of the perimeter of the elongated area. Preferably, a user identifies an elongated rectangular area to be repaired on an interactive display. The computer automatically generates the pixel coordinates of a pair of parallel lines constituting the opposite long sides of the rectangle, and a set of line segments running between the long sides. The interior pixels of the rectangle are then filled by interpolating color values along each line segment. Since this method is not guaranteed to fill all pixels, the system optionally maintains a map of pixels filled and not filled while performing this method, and after completion, performs an additional step of assigning to any unfilled pixels a value based on the average of all adjacent pixels. For long, narrow defects, particularly those introduced by creasing, the automated digital image repair method herein described generally produces images without significant visually noticeable defects, and does so without undue effort on the part of the user.

Method And Apparatus For Data Recovery Optimization In A Logically Partitioned Computer System

View page
US Patent:
6820217, Nov 16, 2004
Filed:
Oct 29, 2001
Appl. No.:
10/074889
Inventors:
Matthew Mark Mock - Rochester MN
David Finian Owen - Rochester MN
Gary Ross Ricard - Chatfield MN
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1100
US Classification:
714 15, 707202
Abstract:
A protection utility for compiled data in a computer system having dynamically configurable logical partitions determines the time for rebuilding compiled data, and selectively stores data in a form not requiring rebuild to meet a pre-specified recovery time limit. If the configuration changes, the protection strategy is automatically migrated to adapt to the new configuration. Preferably, the compiled data is multiple database indexes, which are selectively logged to reduce recovery time. Logging is selectively discontinued or extended responsive to changes in partition configuration, allowing a gradual migration to the target recovery time using the new set of configured resources.

Database Commit Control Mechanism That Provides More Efficient Memory Utilization Through Consideration Of Task Priority

View page
US Patent:
6874071, Mar 29, 2005
Filed:
Dec 13, 2001
Appl. No.:
10/021945
Inventors:
Chad Allen Olstad - Rochester MN, US
Gary Ross Ricard - Chatfield MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F012/00
US Classification:
711158, 711111, 711154, 711170, 707 2, 707202, 705 35, 705 39, 705 42
Abstract:
Disclosed is an enhanced database journaling mechanism that results in reduced secondary storage consumption. The memory management mechanism of the present invention reduces journal size, and accordingly, secondary storage utilization by monitoring the effects to the journal by certain transactions and by making one or more adjustments to reduce those effects.

Method And Apparatus For Selective Caching Of Transactions In A Computer System

View page
US Patent:
6947956, Sep 20, 2005
Filed:
Jun 6, 2002
Appl. No.:
10/164200
Inventors:
Chad Allen Olstad - Rochester MN, US
Gary Ross Ricard - Chatfield MN, US
Adam Thomas Stallman - Rochester MN, US
Larry William Youngren - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F017/30
US Classification:
707200, 711159
Abstract:
A database manager selectively caches journal entries for certain database changes based on dynamic selection criteria. Preferably, a journal disk drive is provided for storing changes to the database. Database change entries are sequentially cached in a main memory journal buffer, awaiting journal write. When a buffer is filled, its buffer contents are written to the journal disk. However, certain change operations will cause the contents of the buffer to be written to the journal disk immediately, before filling the buffer. Certain database change entries selectively cause the buffer to be written, depending on dynamic selection criteria. Preferably, these selection criteria take into account both the estimated time to recover in the event of a system crash and the current level of activity on the system. Generally, the busier the system, the more data will be cached, and vice versa.

Radio Receiver That Changes Function According To The Output Of An Internal Voice-Only Detector

View page
US Patent:
6961550, Nov 1, 2005
Filed:
Dec 12, 2000
Appl. No.:
09/735341
Inventors:
Gary Ross Ricard - Chatfield MN, US
James William Bonalumi - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H04B001/18
US Classification:
4551861, 4551612, 4551741
Abstract:
A radio receiver includes a voice-only detection mechanism that detects when the current radio station is transmitting mostly voice, and that changes the function of the receiver depending on whether or not the current radio station is transmitting mostly voice. In a first embodiment, the radio receiver mutes its audio output when the voice-only detection mechanism detects a voice broadcast, or mutes its audio output when the voice-only detection mechanism detects a music broadcast. In a second embodiment, the radio receiver changes to a different radio station when a voice-only signal is detected, or when a music signal is detected. The second embodiment preferably includes a spectrum analyzer that can store a frequency spectrum “signature” of a radio signal, and a second tuner that scans the available radio stations for a signal that matches the stored signature.

Apparatus And Method For Validating A Database Record Before Applying Journal Data

View page
US Patent:
6968349, Nov 22, 2005
Filed:
May 16, 2002
Appl. No.:
10/147574
Inventors:
David Finian Owen - Rochester MN, US
Gary Ross Ricard - Chatfield MN, US
Larry William Youngren - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F017/30
US Classification:
707204
Abstract:
An apparatus and method includes a database journal that records journal entries. Each journal entry includes a validation value that is computed from the data and metadata for the record before it is changed. In this manner, journal entries may be applied with confidence to a record in a database. This is especially useful when minimized data journal entries are used. If the validation value of the journal entry matches the validation value computed from the data and metadata of the record that the journal entry is to be applied to, then the record before applying the journal entry is identical to the record in the original database, and the journal data may be applied to the database record. If the validation value of the journal entry does not match the validation value computed from the data and metadata of the record that the journal entry is to be applied to, the record is not the same as in the original database when the journal entry was generated. As a result, an error message is generated to indicate that an error was encountered when applying the journal entry.

Task Synchronization Mechanism And Method

View page
US Patent:
6990560, Jan 24, 2006
Filed:
Jan 16, 2003
Appl. No.:
10/346010
Inventors:
William Joseph Armstrong - Rochester MN, US
Michael Joseph Corrigan - Rochester MN, US
Gary Ross Ricard - Chatfield MN, US
Timothy Joseph Torzewski - Rochester MN, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 12/02
US Classification:
711152
Abstract:
A task synchronization mechanism operates on a global lock that is shared between processors an on local locks that are not shared between processors. The local locks are processor-specific locks. Each processor-specific lock is dedicated to a particular processor in the system. When shared access to a resource is required, a processor updates its processor-specific lock to indicate the processor is sharing the resource. Because each processor-specific lock is dedicated to a particular processor, this eliminates a significant portion of the memory bus traffic associated with all processors reading and updating the same lock. When exclusive access to a resource is required, the requesting processor waits until the count of all processor-specific locks indicate that none of these processors have a lock on the resource. Once no processor has a lock on the resource, exclusive access to the resource may be granted.
Gary N Ricard from Delaware, OH, age ~52 Get Report