David J Payne

US Patent:

6865443, Mar 8, 2005

Filed:

Feb 4, 2003

Appl. No.:

10/358440

Inventors:

Robert F. Snapp - Memphis TN, US
David J. Payne - Collierville TN, US
James D. Wilson - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

G06F007/00

US Classification:

700223, 700224, 700226, 209900, 209584

Abstract:

A method and system for sequencing deliverables using combined delivery codes and partial delivery point bar codes (DPBCs) provides pre-sequencing of deliverables for delivery carriers that has improved ordering with respect to the actual delivery route and accounts for un-coded new delivery points in the ordering process. A partial DPBC field is combined with a delivery code to generate the ordering sequence. The DPBC field is combined by generating delivery sequencing tables having sequence numbers splitting ZIP+4 codes into multiple entries delineated by ranges of the last two digits of the DPBC, that can then be flagged for ascending or descending delivery and assigned unique sequence numbers. The full address of actual delivery points is thereby concealed by the table, while providing more accurate sequencing conforming to actual deliver routes. New delivery points within a ZIP+4 code can be assigned a sequence number by reference to the last two digits of the actual address, providing further utility to the method.

US Patent:

7159119, Jan 2, 2007

Filed:

Jun 11, 2003

Appl. No.:

10/459013

Inventors:

James D. Wilson - Collierville TN, US
Robert F. Snapp - Memphis TN, US
David J. Payne - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

H04L 9/00

US Classification:

713181, 707101

Abstract:

A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on only a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

US Patent:

7204415, Apr 17, 2007

Filed:

Sep 30, 2004

Appl. No.:

10/953358

Inventors:

David J. Payne - Collierville TN, US
Robert F. Snapp - Memphis TN, US
James D. Wilson - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

G06F 19/00

US Classification:

235385, 235487, 23546201, 235494, 209584

Abstract:

Systems and methods maintain a database of recipient names and addresses where the delivery point addresses contain secondary address. Data that is stored in the database may be arrayed in secure data tables. The structure of the secure data tables ensures that the data is secure and prevents an unauthorized user from learning address information improperly. A delivery service provider may create secure data tables using 20-byte Secure Hash Algorithm. A software searches secure data tables for the matching recipient name and address. If the match is found, a business sender may receive valid secondary address information for that recipient. If, however, a database does not contain a matching recipient name and address, a business sender may not receive any further information about that recipient's address.

US Patent:

7367488, May 6, 2008

Filed:

May 10, 2005

Appl. No.:

11/127658

Inventors:

David A. Payne - Phoenix AZ, US
Paul E. Garland - Chandler AZ, US

Assignee:

Honeywell International, Inc. - Morristown NJ

International Classification:

B23K 31/00

US Classification:

228119, 427140

Abstract:

The present invention provides methods and materials for use in repairing a worn component having thin walls. One kind of thin wall may be the wall of a cylindrical portion of the component where such wall has a worn inner surface and an opposite outer surface. The method includes the steps of preparing the outer surface of the component for cold spraying; cold spraying material onto the outer surface so as to form a strengthening coating; reaming the inner surface so as to create a repair surface with a repair diameter greater than the inner diameter; and installing an insert on the repair surface. The thickness of the coating is selected so as to impart a desired degree of strength to the wall. The method allows the repair of expensive aluminum castings that would otherwise, because of the thin wall construction, not be suitable for repair.

US Patent:

7391781, Jun 24, 2008

Filed:

Sep 18, 2003

Appl. No.:

10/665456

Inventors:

David J. Payne - Collierville TN, US
Robert F. Snapp - Memphis TN, US
James D. Wilson - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

H04L 12/28
H04L 12/56
G06Q 10/00

US Classification:

370396, 370392, 705 1, 714746

Abstract:

Providing a corrected delivery address comprises receiving a plurality of first data elements, each of the plurality of first data elements comprising a first portion and a second portion. Next providing a corrected delivery address comprises providing a second data element, the second data element corresponding to one of the plurality of first data elements and comprising a corrected version of the second portion of the corresponding first data element. Then providing a corrected delivery address comprises receiving an indication that none of the second portions of the plurality of first data elements match the second data element and providing, in response to the indication, a link associating the second data element with the first data element corresponding to the second data element.

US Patent:

7587408, Sep 8, 2009

Filed:

Feb 28, 2003

Appl. No.:

10/377989

Inventors:

Robert F. Snapp - Memphis TN, US
David J. Payne - Collierville TN, US
James D. Wilson - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

G06F 17/00

US Classification:

707102, 707101, 707 1, 707 3

Abstract:

A method and system for storing and retrieving data using hash-accessed multiple data stores, provides data protection while requiring low computational overhead and further provides storage and retrieval access based on only a single piece of access information, which is generally public. The algorithms provide high security against data-mining and other examination of the data stores. The access information is hashed and is split into offset fields used as indices into a plurality of data stores, generating a quasi-random relationship between the access information and the location of portions of a stored data element. Further protection may be provided by striping the data across the data stores in conformity with a striping order selected by a field of the hashed access information.

US Patent:

7647504, Jan 12, 2010

Filed:

Dec 14, 2006

Appl. No.:

11/638445

Inventors:

James D. Wilson - Collierville TN, US
Robert F. Snapp - Memphis TN, US
David J. Payne - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

H04L 9/32

US Classification:

713181, 713168, 713150

Abstract:

A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

US Patent:

7664731, Feb 16, 2010

Filed:

Sep 22, 2005

Appl. No.:

11/231989

Inventors:

Robert F. Snapp - Memphis TN, US
David J. Payne - Collierville TN, US
James D. Wilson - Collierville TN, US

Assignee:

United States Postal Service - Washington DC

International Classification:

G06F 17/30

US Classification:

707 2, 709201, 709203, 715205, 713171, 713190

Abstract:

A method and system for storing and retrieving data using hash-accessed multiple data stores, provides data protection while requiring low computational overhead and further provides storage and retrieval access based on only a single piece of access information, which is generally public. The algorithms provide high security against data-mining and other examination of the data stores. The access information is hashed and is split into offset fields used as indices into a plurality of data stores, generating a quasi-random relationship between the access information and the location of portions of a stored data element. Further protection may be provided by striping the data across the data stores in conformity with a striping order selected by a field of the hashed access information.

Address:

845 Collierville Arlington Rd, Collierville, TN 38017

Phone:

(901)8545544

VIN:

2CNDL13F496254437

Make:

CHEVROLET

Model:

EQUINOX

Year:

2009