Patents by Inventor Jonathan Drew Cohen

Jonathan Drew Cohen 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).

  • Method for constructing graph abstractions
    Patent number: 6515666
    Abstract: A method of constructing graph abstractions using a computer is described. The abstraction is presented on a computer display and used by a human viewer to understand a more complicated set of raw graphs. The method provides rapid generation of an abstraction that offers an arbitrary composition graph of vertices into composite vertices, dispersing and marshaling of composite vertices, arbitrary hiding and showing of portions of the composition, and marking of points of elision.
    Type: Grant
    Filed: July 17, 2001
    Date of Patent: February 4, 2003
    Inventor: Jonathan Drew Cohen
  • METHOD FOR CONSTRUCTING GRAPH ABSTRACTIONS
    Publication number: 20030016220
    Abstract: A method of constructing graph abstractions using a computer is described. The abstraction is presented on a computer display and used by a human viewer to understand a more complicated set of raw graphs. The method provides rapid generation of an abstraction that offers an arbitrary composition graph of vertices into composite vertices, dispersing and marshaling of composite vertices, arbitrary hiding and showing of portions of the composition, and marking of points of elision.
    Type: Application
    Filed: July 17, 2001
    Publication date: January 23, 2003
    Inventor: Jonathan Drew Cohen
  • Method for finding large numbers of keywords in continuous text streams
    Patent number: 6311183
    Abstract: A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for SDI (selective dissemination of information). The method is applicable to large dictionaries (hundreds of thousands of entries) and to arbitrary byte sequences for both patterns and sample streams. The approach employs Boyer-Moore-Horspool skipping, extended to pattern collections and digrams, followed by an n-gram hash test, which also identifies a subset of feasible keywords for conventional pattern matching at each location of a putative match.
    Type: Grant
    Filed: July 14, 1999
    Date of Patent: October 30, 2001
    Assignee: The United States of America as represented by the Director of National Security Agency
    Inventor: Jonathan Drew Cohen
  • Device and method for full-text large-dictionary string matching using n-gram hashing
    Patent number: 6169969
    Abstract: A method and apparatus providing full-text scanning for matches in a large dictionary is described. The invention is suitable for SDI (selective dissemination of information) systems, accommodating large dictionaries (104 to 105 entries) and rapid processing. A preferred embodiment employs a hardware primary test on a single commercially-available gate-array board hosted by a computer, in which a software secondary test is conducted. No delimiter cues such as spaces or punctuation are required.
    Type: Grant
    Filed: February 10, 1999
    Date of Patent: January 2, 2001
    Assignee: The United States of America as represented by the Director of the National Security Agency
    Inventor: Jonathan Drew Cohen
  • Language-independent method of generating index terms
    Patent number: 5752051
    Abstract: Index terms are drawn from text documents without the need for language-specific processes or training and are suitable as gists for the subject documents. Index terms are extracted on the basis of scores of constituent n-grams relative to n-gram counts in a corpus. A method of extracting joint index terms to represent a plurality of documents is also provided.
    Type: Grant
    Filed: July 19, 1994
    Date of Patent: May 12, 1998
    Assignee: The United States of America as represented by the Secretary of NSA
    Inventor: Jonathan Drew Cohen