Patents by Inventor Dan Feldman

Dan Feldman 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: 11570187
    Abstract: There may be provided a method for detecting a cyberattack or an operational issue, the method may include generating, by an IOT device or by an intermediate device located upstream to the IOT device and downstream to a computerized system, a first core-set, wherein the core-set comprises weighted records that are an approximation of a first data set related to a behavior of the IOT device; sending to the computerized system the first core-set; and finding, by the computerized system, outliers in the first core-set, and labeling the outliers as cyber attacks or operational events by the relations between the outliers and a second dataset of cluster centroid indicative of cyber attacks or operational events.
    Type: Grant
    Filed: July 7, 2020
    Date of Patent: January 31, 2023
    Assignee: SHIELDIOT LTD.
    Inventors: Ohad Levin, Dan Feldman
  • Patent number: 11558376
    Abstract: There may be provided a method that includes receiving or generating a first plurality (N) points within a first multi-dimensional space that has M dimensions; M being a positive integer that is smaller than N; wherein the N points represent one or more behaviors of the one or more IOT devices; wherein a clustering of the N points within the first multi-dimensional space results in at least some clusters that are inseparable from each other; generating a representation of the N points within a second multi-dimensional space that has at least N dimensions; wherein a clustering of the N points within the second multi-dimensional space results in clusters that are separable from each other; calculating projections of the N points on a sub-space that has a second plurality (Q) of dimensions; wherein Q is a function of a relationship between a number (K) of clusters and an allowed error (?); computing a core-set that comprises a weighted subset of the projections; clustering the projections of the weighted subset
    Type: Grant
    Filed: October 1, 2020
    Date of Patent: January 17, 2023
    Assignee: SHIELDIOT LTD
    Inventors: Ohad Levin, Dan Feldman
  • Patent number: 11522875
    Abstract: There may be provided a method for detecting a cyberattack, the method may include receiving, by a computerized system, a first data set receiving or generating, by the computerized system, a second data set that comprises one or more cluster centroids associated with one or more internet of things cyberattacks; and related to behavior of multiple internet of things devices; determining relationships between outliers that belong to the first data set and the one or more cluster centroids; and determining whether the first data set is indicative of the one or more cyberattacks based on the relationships.
    Type: Grant
    Filed: September 29, 2019
    Date of Patent: December 6, 2022
    Assignee: ShieldIOT Ltd.
    Inventors: Ohad Levin, Dan Feldman
  • Patent number: 10176244
    Abstract: In one embodiment, processing location data collected with a mobile device having a positioning system includes accepting trajectory data representing successive geographic positions of the mobile device, where the positions are associated with corresponding times. A set of coordinate segments is determined to represent in the accepted trajectory data, such that the trajectory data represent repeated traversals of at least some of the coordinate segments. A textual characterization is associated with each segment of the determined set of coordinate segments, and then a representation of the trajectory data (for example, an electronic diary) is formed using the textual characterization of the coordinate segments and stored. In some examples, a text based query associated with the accepted trajectory data is accepted and a response is determined using the stored representation of the trajectory data.
    Type: Grant
    Filed: July 12, 2013
    Date of Patent: January 8, 2019
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniela Rus, Dan Feldman, Cynthia Rueyi Sung, Andrew Kiminari Sugaya
  • Patent number: 9286312
    Abstract: An approach to compression of a large (n point or samples) data set has a combination of one or more desirable technical properties: for a desired level of accuracy (?), the number of compressed points (a “coreset”) representing the original data is O(log n); the level of accuracy comprises a guaranteed bound expressed as multiple of error of an associated line simplification of the data set; for a desired level of accuracy and a complexity (e.g., number k of optimal line segments) of the associated line simplification, the computation time is O(n); and for a desired level of accuracy (c) and a complexity of the associated line simplification, the storage required for the computation is O(log n).
    Type: Grant
    Filed: April 12, 2013
    Date of Patent: March 15, 2016
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniela Rus, Dan Feldman
  • Publication number: 20140019450
    Abstract: In one embodiment, processing location data collected with a mobile device having a positioning system includes accepting trajectory data representing successive geographic positions of the mobile device, where the positions are associated with corresponding times. A set of coordinate segments is determined to represent in the accepted trajectory data, such that the trajectory data represent repeated traversals of at least some of the coordinate segments. A textual characterization is associated with each segment of the determined set of coordinate segments, and then a representation of the trajectory data (for example, an electronic diary) is formed using the textual characterization of the coordinate segments and stored. In some examples, a text based query associated with the accepted trajectory data is accepted and a response is determined using the stored representation of the trajectory data.
    Type: Application
    Filed: July 12, 2013
    Publication date: January 16, 2014
    Inventors: Daniela Rus, Dan Feldman, Cynthia Rueyi Sung, Andrew Kiminari Sugaya
  • Publication number: 20130275400
    Abstract: An approach to compression of a large (n point or samples) data set has a combination of one or more desirable technical properties: for a desired level of accuracy (?), the number of compressed points (a “coreset”) representing the original data is O(log n); the level of accuracy comprises a guaranteed bound expressed as multiple of error of an associated line simplification of the data set; for a desired level of accuracy and a complexity (e.g., number k of optimal line segments) of the associated line simplification, the computation time is O(n); and for a desired level of accuracy (c) and a complexity of the associated line simplification, the storage required for the computation is O(log n).
    Type: Application
    Filed: April 12, 2013
    Publication date: October 17, 2013
    Inventors: Daniela Rus, Dan Feldman