Patents by Inventor Scott Ehrlich Friedman

Scott Ehrlich Friedman 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: 11755838
    Abstract: A computing machine receives an input comprising unstructured text. The computing machine identifies, within the unstructured text, one or more entities using a named entity recognition (NER) engine in a trained machine learning model. The trained machine learning model embeds tokens from the text into a vector space and uses generated embeddings to identify one or more tokens as being associated with the one or more entities. The computing machine determines, using the trained machine learning model that identifies the one or more entities and based on the embedded tokens, an assertion applied, within the text, to at least one entity. The assertion is represented as a vector in a multi-dimensional space. Each dimension corresponds to a part of the assertion. The trained machine learning model is a span-level model that both identifies the one or more entities and determines the assertion based on candidate spans of tokens.
    Type: Grant
    Filed: September 14, 2020
    Date of Patent: September 12, 2023
    Assignee: Smart Information Flow Technologies, LLC
    Inventors: Ian H. Magnusson, Scott Ehrlich Friedman, Sonja M. Schmer-Galunder
  • Patent number: 11468608
    Abstract: A computing machine accesses a directed graph representing one or more sequences of actions. The directed graph comprises nodes and edges between the nodes. Each node is either a beginning node, an intermediate node, or an end node. Each intermediate is downstream from at least one beginning node and upstream from at least one end node. Each beginning node in at least a subset of the beginning nodes has an explainability value vector. The computing machine computes, for each first node from among a plurality of first nodes that are intermediate nodes or end nodes, a provenance value representing dependency of an explainability value vector of the first node on the one or more nodes upstream from the first node. The computing machine computes, for each first node, the explainability value vector. The computing machine provides a graphical output representing at least an explainability value vector of an end node.
    Type: Grant
    Filed: November 24, 2020
    Date of Patent: October 11, 2022
    Assignee: Smart Information Flow Technologies, LLC
    Inventors: Scott Ehrlich Friedman, Robert Prescott Goldman, Richard Gabriel Freedman, Ugur Kuter, Christopher William Geib, Jeffrey M. Rye
  • Patent number: 11372854
    Abstract: Provenance analysis systems and methods. Datums representing relationships between entities can be stored in a knowledge store. Datums can be received from agents as agents perform activities. Activity records are be stored in a provenance graph, the activity record and associate received datums with any input datums used in the activity. Provenance subgraphs can 5 be retrieved by traversing the provenance graph for selected datums and presented through a user interface. Provenance subgraphs can be augmented with trust modifiers determined based on attributions, confidences, and refutations provided by a user. Trust modifiers can be propagated downstream to enable the addressing of junctions in variable confidence.
    Type: Grant
    Filed: September 11, 2020
    Date of Patent: June 28, 2022
    Assignee: Smart Information Flow Technologies, LLC
    Inventors: Scott Ehrlich Friedman, Jeffrey Mathew Rye, David Thomas LaVergne
  • Publication number: 20220165007
    Abstract: A computing machine accesses a directed graph representing one or more sequences of actions. The directed graph comprises nodes and edges between the nodes. Each node is either a beginning node, an intermediate node, or an end node. Each intermediate is downstream from at least one beginning node and upstream from at least one end node. Each beginning node in at least a subset of the beginning nodes has an explainability value vector. The computing machine computes, for each first node from among a plurality of first nodes that are intermediate nodes or end nodes, a provenance value representing dependency of an explainability value vector of the first node on the one or more nodes upstream from the first node. The computing machine computes, for each first node, the explainability value vector. The computing machine provides a graphical output representing at least an explainability value vector of an end node.
    Type: Application
    Filed: November 24, 2020
    Publication date: May 26, 2022
    Inventors: Scott Ehrlich Friedman, Robert Prescott Goldman, Richard Gabriel Freedman, Ugur Kuter, Christopher William Geib, Jeffrey M. Rye
  • Publication number: 20220083739
    Abstract: A computing machine receives an input comprising unstructured text. The computing machine identifies, within the unstructured text, one or more entities using a named entity recognition (NER) engine in a trained machine learning model. The trained machine learning model embeds tokens from the text into a vector space and uses generated embeddings to identify one or more tokens as being associated with the one or more entities. The computing machine determines, using the trained machine learning model that identifies the one or more entities and based on the embedded tokens, an assertion applied, within the text, to at least one entity. The assertion is represented as a vector in a multi-dimensional space. Each dimension corresponds to a part of the assertion. The trained machine learning model is a span-level model that both identifies the one or more entities and determines the assertion based on candidate spans of tokens.
    Type: Application
    Filed: September 14, 2020
    Publication date: March 17, 2022
    Inventors: Ian H. Magnusson, Scott Ehrlich Friedman, Sonja M. Schmer-Galunder
  • Publication number: 20210406257
    Abstract: Provenance analysis systems and methods. Datums representing relationships between entities can be stored in a knowledge store. Datums can be received from agents as agents perform activities. Activity records are be stored in a provenance graph, the activity record and associate received datums with any input datums used in the activity. Provenance subgraphs can 5 be retrieved by traversing the provenance graph for selected datums and presented through a user interface. Provenance subgraphs can be augmented with trust modifiers determined based on attributions, confidences, and refutations provided by a user. Trust modifiers can be propagated downstream to enable the addressing of junctions in variable confidence.
    Type: Application
    Filed: September 11, 2020
    Publication date: December 30, 2021
    Inventors: Scott Ehrlich Friedman, Jeffrey Mathew Rye, David Thomas LaVergne
  • Publication number: 20210406254
    Abstract: Provenance analysis systems and methods. Datums representing relationships between entities can be stored in a knowledge store. Datums can be received from agents as agents perform activities. Activity records are be stored in a provenance graph, the activity record and associate received datums with any input datums used in the activity. Provenance subgraphs can be retrieved by traversing the provenance graph for selected datums and presented through a user interface. Provenance subgraphs can be augmented with trust modifiers determined based on attributions, confidences, and refutations provided by a user. Trust modifiers can be propagated downstream to enable the addressing of junctions in variable confidence.
    Type: Application
    Filed: June 26, 2020
    Publication date: December 30, 2021
    Inventors: Scott Ehrlich Friedman, Jeffrey Mathew Rye, David Thomas LaVergne
  • Patent number: 10528729
    Abstract: Methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method includes receiving, by a processor, program code and automatically generating a chronomorphic binary for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code. A system includes memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for performing the above-referenced method. One computer program product includes computer code for performing the above-referenced method.
    Type: Grant
    Filed: October 22, 2018
    Date of Patent: January 7, 2020
    Assignee: SMART INFORMATION FLOW TECHNOLOGIES LLC
    Inventors: Scott Ehrlich Friedman, David John Musliner, Peter Kelly Keller
  • Publication number: 20190286818
    Abstract: Methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method includes receiving, by a processor, program code and automatically generating a chronomorphic binary for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code. A system includes memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for performing the above-referenced method. One computer program product includes computer code for performing the above-referenced method.
    Type: Application
    Filed: October 22, 2018
    Publication date: September 19, 2019
    Applicant: SMART INFORMATION FLOW TECHNOLOGIES LLC
    Inventors: Scott Ehrlich FRIEDMAN, David John MUSLINER, Peter Kelly KELLER
  • Patent number: 10108798
    Abstract: Methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method includes receiving, by a processor, program code and automatically generating a chronomorphic binary for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code. A system includes memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for performing the above-referenced method. One computer program product includes computer code for performing the above-referenced method.
    Type: Grant
    Filed: January 4, 2016
    Date of Patent: October 23, 2018
    Assignee: SMART INFORMATION FLOW TECHNOLOGIES LLC
    Inventors: Scott Ehrlich Friedman, David John Musliner, Peter Kelly Keller