Patents by Inventor Marvin Baumgart

Marvin Baumgart 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: 11372898
    Abstract: Structure data is received from a database. The structured data may comprise data values and specifying relationships among the data values. A method is provided to include receiving selections of operations to be performed on the structured data and an order of the operations. The operations may include at least one permutation operation. The method may include determining a graphically displayable data format based on the selections of operations. The method may include representing the structured data and the relationships among the data values in the graphically displayable data format. The method may comprise performing operations according to the selections, including, permuting entries of the graphically displayable data format. The permuting may comprise bringing the entries of the graphically displayable data format into a logical order while maintaining the relationships. The method may also include displaying the entries for analysis after performing the operations.
    Type: Grant
    Filed: September 29, 2020
    Date of Patent: June 28, 2022
    Assignee: SAP SE
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart
  • Publication number: 20210011931
    Abstract: Structure data is received from a database. The structured data may comprise data values and specifying relationships among the data values. A method is provided to include receiving selections of operations to be performed on the structured data and an order of the operations. The operations may include at least one permutation operation. The method may include determining a graphically displayable data format based on the selections of operations. The method may include representing the structured data and the relationships among the data values in the graphically displayable data format. The method may comprise performing operations according to the selections, including, permuting entries of the graphically displayable data format. The permuting may comprise bringing the entries of the graphically displayable data format into a logical order while maintaining the relationships. The method may also include displaying the entries for analysis after performing the operations.
    Type: Application
    Filed: September 29, 2020
    Publication date: January 14, 2021
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart
  • Patent number: 10831787
    Abstract: Structure data is received from a database. The structured data may comprise data values and specifying relationships among the data values. A method is provided to include receiving selections of operations to be performed on the structured data and an order of the operations. The operations may include at least one permutation operation. The method may include determining a graphically displayable data format based on the selections of operations. The method may include representing the structured data and the relationships among the data values in the graphically displayable data format. The method may comprise performing operations according to the selections, including, permuting entries of the graphically displayable data format. The permuting may comprise bringing the entries of the graphically displayable data format into a logical order while maintaining the relationships. The method may also include displaying the entries for analysis after performing the operations.
    Type: Grant
    Filed: June 30, 2017
    Date of Patent: November 10, 2020
    Assignee: SAP SE
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart
  • Patent number: 10812533
    Abstract: String comparison, including comparing strings with a rule, can be time consuming, and strings may not be suitable for analysis using machine learning algorithms. The present disclosure provides positionally-encoded representations of strings, such as binary matrices or arrays, that provide an encoded representation of the string. The encoding, and decoding, can be facilitated by an encoding schema, such as an encoding schema stored in the memory of a computer device. The encoding schema associates particular characters with particular positions in an array. The positionally-encoded string representations can be used for security applications, such as to determine whether an authorization token that includes at least one string complies with an authorization rule. The authorization rule can be specified as a positionally-encoded representation that defines a set of strings that comply with the rule.
    Type: Grant
    Filed: July 3, 2019
    Date of Patent: October 20, 2020
    Assignee: SAP SE
    Inventors: Marvin Baumgart, Viktor Povalyayev, David C. Hu
  • Patent number: 10802831
    Abstract: A computer system is associated with a number of computers including at least one central processing unit (CPU). Managing of parallel processing on the computer system may comprise determining a scheduling limit to restrict a number of worker threads available for executing tasks on the computer system. The managing may further comprise executing a plurality of tasks on the computer system. An availability of a CPU associated with the computer system is determined based on whether a load of the CPU exceeds a first threshold. When the CPU is determined to be unavailable, the scheduling limit is reduced. A further task is scheduled for execution on one of the CPUs according to the reduced scheduling limit. The worker threads available to execute tasks on the computer system may be limited, such that the quantity of worker threads available for executing tasks does not exceed the scheduling limit.
    Type: Grant
    Filed: June 30, 2017
    Date of Patent: October 13, 2020
    Assignee: SAP SE
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart, Michael Maris
  • Publication number: 20190327274
    Abstract: String comparison, including comparing strings with a rule, can be time consuming, and strings may not be suitable for analysis using machine learning algorithms. The present disclosure provides positionally-encoded representations of strings, such as binary matrices or arrays, that provide an encoded representation of the string. The encoding, and decoding, can be facilitated by an encoding schema, such as an encoding schema stored in the memory of a computer device. The encoding schema associates particular characters with particular positions in an array. The positionally-encoded string representations can be used for security applications, such as to determine whether an authorization token that includes at least one string complies with an authorization rule. The authorization rule can be specified as a positionally-encoded representation that defines a set of strings that comply with the rule.
    Type: Application
    Filed: July 3, 2019
    Publication date: October 24, 2019
    Applicant: SAP SE
    Inventors: Marvin Baumgart, Viktor Povalyayev, David C. Hu
  • Patent number: 10375120
    Abstract: String comparison, including comparing strings with a rule, can be time consuming, and strings may not be suitable for analysis using machine learning algorithms. The present disclosure provides positionally-encoded representations of strings, such as binary matrices or arrays, that provide an encoded representation of the string. The encoding, and decoding, can be facilitated by an encoding schema, such as an encoding schema stored in the memory of a computer device. The encoding schema associates particular characters with particular positions in an array. The positionally-encoded string representations can be used for security applications, such as to determine whether an authorization token that includes at least one string complies with an authorization rule. The authorization rule can be specified as a positionally-encoded representation that defines a set of strings that comply with the rule.
    Type: Grant
    Filed: May 12, 2017
    Date of Patent: August 6, 2019
    Assignee: SAP SE
    Inventors: Marvin Baumgart, Viktor Povalyayev, David C. Hu
  • Publication number: 20190004815
    Abstract: A computer system is associated with a number of computers including at least one central processing unit (CPU). Managing of parallel processing on the computer system may comprise determining a scheduling limit to restrict a number of worker threads available for executing tasks on the computer system. The managing may further comprise executing a plurality of tasks on the computer system. An availability of a CPU associated with the computer system is determined based on whether a load of the CPU exceeds a first threshold. When the CPU is determined to be unavailable, the scheduling limit is reduced. A further task is scheduled for execution on one of the CPUs according to the reduced scheduling limit. The worker threads available to execute tasks on the computer system may be limited, such that the quantity of worker threads available for executing tasks does not exceed the scheduling limit.
    Type: Application
    Filed: June 30, 2017
    Publication date: January 3, 2019
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart, Michael Maris
  • Publication number: 20190005110
    Abstract: Structure data is received from a database. The structured data may comprise data values and specifying relationships among the data values. A method is provided to include receiving selections of operations to be performed on the structured data and an order of the operations. The operations may include at least one permutation operation. The method may include determining a graphically displayable data format based on the selections of operations. The method may include representing the structured data and the relationships among the data values in the graphically displayable data format. The method may comprise performing operations according to the selections, including, permuting entries of the graphically displayable data format. The permuting may comprise bringing the entries of the graphically displayable data format into a logical order while maintaining the relationships. The method may also include displaying the entries for analysis after performing the operations.
    Type: Application
    Filed: June 30, 2017
    Publication date: January 3, 2019
    Inventors: Viktor Povalyayev, David C. Hu, Marvin Baumgart
  • Publication number: 20180332082
    Abstract: String comparison, including comparing strings with a rule, can be time consuming, and strings may not be suitable for analysis using machine learning algorithms. The present disclosure provides positionally-encoded representations of strings, such as binary matrices or arrays, that provide an encoded representation of the string. The encoding, and decoding, can be facilitated by an encoding schema, such as an encoding schema stored in the memory of a computer device. The encoding schema associates particular characters with particular positions in an array. The positionally-encoded string representations can be used for security applications, such as to determine whether an authorization token that includes at least one string complies with an authorization rule. The authorization rule can be specified as a positionally-encoded representation that defines a set of strings that comply with the rule.
    Type: Application
    Filed: May 12, 2017
    Publication date: November 15, 2018
    Applicant: SAP SE
    Inventors: Marvin Baumgart, Viktor Povalyayev, David C. Hu