Patents by Inventor Harold Douglas Dykeman

Harold Douglas Dykeman 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: 11874863
    Abstract: The present disclosure relates to a method for query expansion. The method comprises: a) receiving a current query having at least one search term; b) inputting the at least one search term of the current query to a set of one or more query expansion modules, wherein the query expansion modules are configured to predict expansion terms of input terms; c) receiving from the set of expansion modules candidate expansion terms of the search term; d) modifying the current query using at least part of the candidate expansion terms, resulting in a modified query having at least one modified search term, The method further comprises repeating steps b) to d) using the modified query as the current query, the repeating being performed until a predefined stopping criterion is fulfilled.
    Type: Grant
    Filed: April 3, 2020
    Date of Patent: January 16, 2024
    Assignee: International Business Machines Corporation
    Inventors: Ivan Girardi, Harold Douglas Dykeman, Andrea Giovannini, Adam Ivankay, Chiara Marchiori, Kevin Thandiackal, Mario Zusag
  • Publication number: 20220051090
    Abstract: An approach for determining a concatenated confidence value of a first class using an artificial-intelligence module (AI-module) for performing a classification based on the concatenated confidence value of the first class. The AI-module comprises a knowledge graph module, a machine learning module, and a weighting module. A processor determines a first confidence value of the first class as a first function of an input dataset using the machine learning module. A processor determines a second confidence value of the first class as a second function of the input dataset using the knowledge graph module. A processor determines the concatenated confidence value of the first class as a third function of the first confidence value of the first class, the second confidence value of the first class, and a value of a weighting parameter of the weighting module.
    Type: Application
    Filed: August 11, 2020
    Publication date: February 17, 2022
    Inventors: Andrea Giovannini, Harold Douglas Dykeman, Ivan Girardi, Adam Ivankay, Chiara Marchiori, Konrad Paluch, Kevin Thandiackal, Mario Zusag
  • Publication number: 20210286831
    Abstract: The present disclosure relates to a method for query expansion. The method comprises: a) receiving a current query having at least one search term; b) inputting the at least one search term of the current query to a set of one or more query expansion modules, wherein the query expansion modules are configured to predict expansion terms of input terms; c) receiving from the set of expansion modules candidate expansion terms of the search term; d) modifying the current query using at least part of the candidate expansion terms, resulting in a modified query having at least one modified search term, The method further comprises repeating steps b) to d) using the modified query as the current query, the repeating being performed until a predefined stopping criterion is fulfilled.
    Type: Application
    Filed: April 3, 2020
    Publication date: September 16, 2021
    Inventors: Ivan Girardi, Harold Douglas Dykeman, Andrea Giovannini, Adam Ivankay, Chiara Marchiori, Kevin Thandiackal, Mario Zusag
  • Patent number: 9286333
    Abstract: A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described.
    Type: Grant
    Filed: July 19, 2012
    Date of Patent: March 15, 2016
    Assignee: International Business Machines Corporation
    Inventors: Harold Douglas Dykeman, Francesco Fusco, Thomas R. Locher
  • Patent number: 8959354
    Abstract: A method for digitally signing a document, a secure device, and a computer program product for implementing the method. The method employs a secure device which is protected against malicious software or malware and is adapted to establish a secure connection to a recipient via a host. The method includes: connecting to a terminal; accessing the contents of a document received by the secure device; instructing at the secure device to communicate the accessed contents to an output device other than the terminal such that the contents can be verified by a user; ascertaining at the secure device a command received to digitally sign the document; executing at the secure device the ascertained command; and instructing to send a digitally signed document to a recipient over a connection established via the host connected to a telecommunication network.
    Type: Grant
    Filed: March 29, 2011
    Date of Patent: February 17, 2015
    Assignee: International Business Machines Corporation
    Inventors: Michael Baentsch, Peter Buhler, Harold Douglas Dykeman
  • Publication number: 20130024434
    Abstract: A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described.
    Type: Application
    Filed: July 19, 2012
    Publication date: January 24, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Harold Douglas DYKEMAN, Francesco FUSCO, Thomas R. LOCHER
  • Publication number: 20110247057
    Abstract: A method for digitally signing a document, a secure device, and a computer program product for implementing the method. The method employs a secure device which is protected against malicious software or malware and is adapted to establish a secure connection to a recipient via a host. The method includes: connecting to a terminal; accessing the contents of a document received by the secure device; instructing at the secure device to communicate the accessed contents to an output device other than the terminal such that the contents can be verified by a user; ascertaining at the secure device a command received to digitally sign the document; executing at the secure device the ascertained command; and instructing to send a digitally signed document to a recipient over a connection established via the host connected to a telecommunication network.
    Type: Application
    Filed: March 29, 2011
    Publication date: October 6, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael Baentsch, Peter Buhler, Harold Douglas Dykeman
  • Patent number: 7573885
    Abstract: Methods and apparatus are provided for alternative routing of a connection between a source node and a destination node in a PNNI hierarchical network. The alternative routing method comprises responding to a failed connection between said nodes due to a sole-access element of the network structure as seen by the source node, where a said sole-access element is an element which provides sole access to the destination node in said network structure, by: selecting at least one non-sole-access element of the route used by the failed connection in said network structure; identifying an alternative route for the connection in said network structure which does not utilize the at least one selected element; and using the alternative route for establishment of the connection between said nodes.
    Type: Grant
    Filed: August 7, 2000
    Date of Patent: August 11, 2009
    Assignee: International Business Machines Corporation
    Inventors: Harold Douglas Dykeman, Paolo Michele Scotton, Claude Basso, Philippe Damon