Patents by Inventor Leonid Leibman

Leonid Leibman 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).

  • Publication number: 20200007563
    Abstract: Described are systems and methods for detecting an anomaly among a plurality of components operating in a system. In some embodiments, a method includes monitoring a plurality of metrics for the plurality of components across a plurality of time periods. For each time period, the plurality of components is clustered into a plurality of clusters based on measurement information corresponding to the plurality of metrics received for the time period. For each component, a plurality of correspondences is determined between the clusters in which the component is grouped for a plurality of pairs of adjacent time periods. Then, whether each component is operating anomalously can be determined based on the plurality of determined correspondences.
    Type: Application
    Filed: June 29, 2018
    Publication date: January 2, 2020
    Applicant: The MITRE Corporation
    Inventors: Leonid LEIBMAN, Michael S. DOWNS
  • Patent number: 9043272
    Abstract: A system for determining the start of a match of a regular expression has a special state table which contains start state entries and terminal state entries; a plurality of start state registers for storing offset information indicative of the start of a match of the regular expression; a deterministic finite state automaton (DFA) next state table which, given the current state and an input character, returns the next state. The DFA next state table includes a settable indicator for any next state table entry which indicates whether to perform a lookup into the special state table. A compiler loads values into the special state table based on the regular expression.
    Type: Grant
    Filed: September 18, 2007
    Date of Patent: May 26, 2015
    Assignee: INSIDE SECURE
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Patent number: 7461370
    Abstract: A system for processing regular expressions containing one or more sub-expressions. Information regarding one or more regular expressions, each containing one or more sub-expressions, is stored. Data is compared to the stored information regarding expressions in only a single pass through the data. From the comparison, for any stored expression, the location within the data of the beginning and end of each sub-expression, and the end of the regular expression, are determined. From such determination, the presence within the data of any one or more stored regular expressions containing one or more sub-expressions is identified.
    Type: Grant
    Filed: February 7, 2003
    Date of Patent: December 2, 2008
    Assignee: SafeNet, Inc.
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Publication number: 20080077587
    Abstract: A system for determining the start of a match of a regular expression has a special state table which contains start state entries and terminal state entries; a plurality of start state registers for storing offset information indicative of the start of a match of the regular expression; a deterministic finite state automaton (DFA) next state table which, given the current state and an input character, returns the next state. The DFA next state table includes a settable indicator for any next state table entry which indicates whether to perform a lookup into the special state table. A compiler loads values into the special state table based on the regular expression.
    Type: Application
    Filed: September 18, 2007
    Publication date: March 27, 2008
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Patent number: 7305391
    Abstract: A method for determining the start of a match of a regular expression using the special state table, the set of start state registers and the DFA next state table, includes the step of determining from the regular expression each start-of-match start state and each end-of-match terminal state. For each start state, a start state entry is loaded into the special state table. For each terminal state, a terminal state entry is loaded into each special state table. The next state table is used to return the next state from the current state and an input character. When a start state is encountered, the current offset from the beginning of the input character string is loaded into the start state register. When a terminal state is encountered, the terminal state entry is retrieved from the special state table, and the value of the start state register corresponding to the rule number of the terminal entry in the special state table is further retrieved.
    Type: Grant
    Filed: February 6, 2004
    Date of Patent: December 4, 2007
    Assignee: SafeNet, Inc.
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Patent number: 7240040
    Abstract: A method for generating look-up tables for a high speed multi-bit Real-time Deterministic Finite state Automaton (hereinafter RDFA). The method begins with a DFA generated in accordance with the prior art. For each state in the DFA, and for each of the bytes recognized in parallel the following occurs. First an n-closure list is generated. An n-closure list is a list of states reachable in n-transitions from the current state. Next an alphabet transition list is generated for each state. An “alphabet transition list” is a list of the transitions out of a particular state for each of the characters in an alphabet. Finally, the transitions are grouped into classes. That is, the transitions that go to the same state are grouped into the same class. Each class is used to identify the next state. The result is a state machine that has less states than the original DFA.
    Type: Grant
    Filed: August 8, 2002
    Date of Patent: July 3, 2007
    Assignee: Safenet, Inc.
    Inventors: Daniel Wyschogrod, Alain Arnaud, David Eric Berman Lees, Leonid Leibman
  • Patent number: 6856981
    Abstract: A system and method in accordance with the present invention determines in real-time the portions of a set of characters from a data or character stream which satisfies one or more predetermined regular expressions. A Real-time Deterministic Finite state Automaton (RDFA) ensures that the set of characters is processed at high speeds with relatively small memory requirements. An optimized state machine models the regular expression(s) and state related alphabet lookup and next state tables are generated. Characters from the data stream are processed in parallel using the alphabet lookup and next state tables, to determine whether to transition to a next state or a terminal state, until the regular expression is satisfied or processing is terminated. Additional means may be implemented to determine a next action from satisfaction of the regular expression.
    Type: Grant
    Filed: December 3, 2001
    Date of Patent: February 15, 2005
    Assignee: SafeNet, Inc.
    Inventors: Daniel Wyschogrod, Alain Arnaud, David Eric Berman Lees, Leonid Leibman
  • Publication number: 20040162826
    Abstract: A system for determining the start of a match of a regular expression includes a special state table that contains start entries and terminal entries, and a set of start state registers for holding offset information. The system further includes a DFA next state table that, given the current state and an input character, returns the next state. A settable indicator is included in the DFA next state table corresponding to each next state table entry which indicates whether to perform a lookup in the special state table. A compiler loads values into the special state table based on the regular expression. A method for determining the start of a match of a regular expression using the special state table, the set of start state registers and the DFA next state table, includes the step of determining from the regular expression each start-of-match start state and each end-of-match terminal state. For each start state, a start state entry is loaded into the special state table.
    Type: Application
    Filed: February 6, 2004
    Publication date: August 19, 2004
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Publication number: 20030163803
    Abstract: A system for processing regular expressions containing one or more sub-expressions. Information regarding one or more regular expressions, each containing one or more sub-expressions, is stored. Data is compared to the stored information regarding expressions in only a single pass through the data. From the comparison, for any stored expression, the location within the data of the beginning and end of each sub-expression, and the end of the regular expression, are determined. From such determination, the presence within the data of any one or more stored regular expressions containing one or more sub-expressions is identified.
    Type: Application
    Filed: February 7, 2003
    Publication date: August 28, 2003
    Inventors: Daniel Wyschogrod, Leonid Leibman
  • Publication number: 20030065800
    Abstract: A method for generating look-up tables for a high speed multi-bit Real-time Deterministic Finite state Automaton (hereinafter RDFA). The method begins with a DFA generated in accordance with the prior art. For each state in the DFA, and for each of the bytes recognized in parallel the following occurs. First an n-closure list is generated. An n-closure list is a list of states reachable in n-transitions from the current state. Next an alphabet transition list is generated for each state. An “alphabet transition list” is a list of the transitions out of a particular state for each of the characters in an alphabet. Finally, the transitions are grouped into classes. That is, the transitions that go to the same state are grouped into the same class. Each class is used to identify the next state. The result is a state machine that has less states than the original DFA.
    Type: Application
    Filed: August 8, 2002
    Publication date: April 3, 2003
    Applicant: Raqia Networks Inc.
    Inventors: Daniel Wyschogrod, Alain Arnaud, David Eric Berman Lees, Leonid Leibman
  • Publication number: 20030051043
    Abstract: A system and method in accordance with the present invention determines in real-time the portions of a set of characters from a data or character stream which satisfies one or more predetermined regular expressions. A Real-time Deterministic Einite state Automaton (RDFA) ensures that the set of characters is processed at high speeds with relatively small memory requirements. An optimized state machine models the regular expression(s) and state related alphabet lookup and next state tables are generated. Characters from the data stream are processed in parallel using the alphabet lookup and next state tables, to determine whether to transition to a next state or a terminal state, until the regular expression is satisfied or processing is terminated. Additional means may be implemented to determine a next action from satisfaction of the regular expression.
    Type: Application
    Filed: December 3, 2001
    Publication date: March 13, 2003
    Applicant: Raqia Networks Inc.
    Inventors: Daniel Wyschogrod, Alain Arnaud, David Eric Berman Lees, Leonid Leibman