Patents by Inventor David A. Maluf

David A. Maluf 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: 7596416
    Abstract: A system for managing a project that includes multiple tasks and a plurality of workers. Input information includes characterizations based upon a human model, a team model and a product model. Periodic reports, such as a monthly report, a task plan report, a budget report and a risk management report, are generated and made available for display or further analysis. An extensible database allows searching for information based upon context and upon content.
    Type: Grant
    Filed: August 25, 2004
    Date of Patent: September 29, 2009
    Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space Administration
    Inventors: David A. Maluf, Yuri O. Gawdiak, David G. Bell, Mohana M. Gurram
  • Patent number: 7529769
    Abstract: Method and associated system for partitioning a collection of databases, by indexing folders within each database, files within each folder, documents within each file, and features (characters, words, phrases, symbols, expressions and image components) with each document so that content and context searching can proceed at any level. Databases need not be mutually exclusive, and a document, file or folder may be referenced in more than one database. One or more documents or files or folders or databases can be added to, or deleted from, the collection without changing the indexing scheme or interpretation assigned to a concatenated index.
    Type: Grant
    Filed: November 15, 2006
    Date of Patent: May 5, 2009
    Assignee: Cap Epsilon, Inc.
    Inventor: David A. Maluf
  • Publication number: 20080222107
    Abstract: A method for querying a database comprises receiving a query from a client, querying a plurality of databases, receiving replies from the databases, relaying the replies from the databases to the client as they are received from the databases. A system for querying a database comprises a client, a plurality of databases, and a query dispatcher receiving a query from the client, querying the plurality of databases, receiving replies from the databases, relaying the replies from the databases to the client as they are received from the databases.
    Type: Application
    Filed: July 20, 2007
    Publication date: September 11, 2008
    Inventor: David A. Maluf
  • Publication number: 20080065618
    Abstract: Methods and systems for implementing a rapid search of information items in a database. Each relevant Word (an individual word and/or a phrase including two or more words) in a collection of documents is associated with a location number within the collection, as a Word pair, including a Word and a location number. The Word pairs in the collection are rearranged into consecutive sub-sequences, each sub-sequence including all occurrences of each Word in the collection. For each, sub-sequence, upper and lower bounds are provided to limit the search for a specified Word to a relatively narrow range of location numbers. The approach is extended from single Word occurrences to Boolean occurrences involving two or more Words, using Boolean operators such as OR, AND and XOR.
    Type: Application
    Filed: July 25, 2006
    Publication date: March 13, 2008
    Inventor: David A. Maluf
  • Publication number: 20080018507
    Abstract: Method and system for representing a strong of alpha characters, numeral characters and/or delimiters that allows uniform searching procedures, whether or not numerals and/or delimiters are present in the string. Numerical sub strings, containing only numerals and delimiters, are re characterized in binary format and are separated from, and later recombined with, sub strings containing only alpha characters and delimiters, to provide a modified searchable string in binary format Floating point numbers are easily handled in this approach. Delimiters may be any subset of ASCII characters, as distinguished from numerals and from alpha characters. A numeral character, to be transmitted as a sequence of bits, is optimized by expression in a base (power of 2) requiring the smallest bit count.
    Type: Application
    Filed: March 1, 2007
    Publication date: January 24, 2008
    Inventors: David A. Maluf, John F. Schipper
  • Publication number: 20060047646
    Abstract: Method and system for querying a collection of unstructured and semi-structured documents in a specified database to identify presence of, and provide context and/or content for, keywords and/or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) query is specified, the query is converted to a statement that is recognized and respondeed to by the specified database, and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context and/or the content of the query node.
    Type: Application
    Filed: September 1, 2004
    Publication date: March 2, 2006
    Inventors: David Maluf, David Bell, Mohana Gurram, Yuri Gawdiak
  • Patent number: 6968338
    Abstract: Method and system for querying a collection of Unstructured or semi-structured documents to identify presence of, and provide context and/or content for, keywords and/or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) is specified, and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context and/or the content of the query node.
    Type: Grant
    Filed: August 29, 2002
    Date of Patent: November 22, 2005
    Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space Administration
    Inventors: Yuri O. Gawdiak, Tracy T. La, Shu-Chun Y. Lin, David A. Maluf, Khai Peter B. Tran