Patents by Inventor Thomas A. Kraay

Thomas A. Kraay 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: 6751607
    Abstract: A database tool comprises a computer-implemented method for quick low-intensity processing to identify latent relationships among data elements in very large databases and to determine whether a keyword or character string is contained in a document which is part of a large collection of documents. Text in data fields of source documents are enciphered into surrogate vectors comprising wide binary numbers. Each keyword of text will set a corresponding group of bits in the associated surrogate vector. Any non-true bit required in the enciphered word is a quick indication the word cannot possibly be found in the associated document.
    Type: Grant
    Filed: October 2, 2001
    Date of Patent: June 15, 2004
    Inventors: Thomas A. Kraay, Charles E. Brisbin, Ralph Carlson
  • Publication number: 20020147707
    Abstract: A database tool comprises a computer-implemented method for quick low-intensity processing to identify latent relationships among data elements in very large databases and to determine whether a keyword or character string is contained in a document which is part of a large collection of documents. Text in data fields of source documents are enciphered into surrogate vectors comprising wide binary numbers. Each keyword of text will set a corresponding group of bits in the associated surrogate vector. Any non-true bit required in the enciphered word is a quick indication the word cannot possibly be found in the associated document.
    Type: Application
    Filed: October 2, 2001
    Publication date: October 10, 2002
    Inventors: Thomas A. Kraay, Charles E. Brisbin, Ralph Carlson
  • Patent number: 6202068
    Abstract: A method for efficiently and expediently searching a database so that large quantities of data may be visualized to reveal and readily identify underlying patterns and/or obscure, latent relationships among the individual data elements, comprising: selecting a particular aspect of relationship information; scanning the data items and their associated information to determine the existence of the selected aspect of relationship information; selecting an object data item from the data items; grouping a plurality of data items related to the object data item into a specific group having a defined relationship with at least one other related data item contained within the specific group; identifying each data item contained within the same group as the object data item; tallying the magnitude associated with the selected aspect of relationship information for each data item with respect to every other data item in the database; and mapping the object data item and the other data items identified as being containe
    Type: Grant
    Filed: July 2, 1998
    Date of Patent: March 13, 2001
    Inventors: Thomas A. Kraay, Charles E. Brisbin
  • Patent number: 5956717
    Abstract: A database tool comprises a computer-implemented method for extracting systematic information from one or more databases that apparently only comprise data noise or seemingly unrelated data items. Criminal and community relationships that exist amongst telephone and internet subscribers are extracted from large telephone databases derived from wire taps and/or long distance telephone records. A telephone records file is used that comprises a caller's telephone number, dialed telephone numbers, and the time. A second database comprises a list of telephone numbers which are suspicious for some reason, and a descriptor as to why each such telephone number is suspicious. A third database includes biographical data about the telephone subscribers, such as name, address, and other facts. The unique telephone numbers in the database are identified. Matches between the first and second databases are made. Related components are grouped into clusters. The valence for each telephone number is computed.
    Type: Grant
    Filed: February 6, 1997
    Date of Patent: September 21, 1999
    Inventors: Thomas A. Kraay, Charles E. Brisbin