Patents by Inventor Daniel Benson

Daniel Benson 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: 20240080207
    Abstract: The disclosure provides an approach for certificate management for cryptographic agility. Embodiments include receiving, by a cryptographic agility system, a cryptographic request related to an application. Embodiments include selecting, by the cryptographic agility system, a cryptographic technique based on contextual information associated with the cryptographic request. Embodiments include determining, by the cryptographic agility system, based on the cryptographic request, a certificate for authenticating a key related to the cryptographic technique. Embodiments include providing, by the cryptographic agility system, the certificate to an endpoint related to the cryptographic request for use in authenticating the key.
    Type: Application
    Filed: July 27, 2023
    Publication date: March 7, 2024
    Inventors: Marc Wayne BROTHERSON, Mark BENSON, Daniel James BEVERIDGE, Sean HUNTLEY, Akeem JENKINS, David OTT
  • Patent number: 11924343
    Abstract: The disclosure provides an approach for cryptographic agility. Embodiments include establishing, by a proxy component associated with a cryptographic agility system, a first secure connection with an application. Embodiments include receiving, by the proxy component, via the first secure connection, a communication from the application directed to an endpoint. Embodiments include selecting, by the cryptographic agility system, a cryptographic technique based on contextual information related to the communication. Embodiments include establishing, by the proxy component, a second secure connection with the endpoint based on the cryptographic technique. Embodiments include transmitting, by the proxy component, a secure communication to the endpoint via the second secure connection based on the communication.
    Type: Grant
    Filed: July 26, 2021
    Date of Patent: March 5, 2024
    Assignee: VMware, Inc.
    Inventors: Akeem Jenkins, Mark Benson, Daniel James Beveridge, Marc Wayne Brotherson, Sean Huntley, David Ott
  • Publication number: 20230368200
    Abstract: A virtual compute instance that is communicatively coupled to a storage device comprising a database. In an embodiment, a method queries an expense pre-approval application to obtain a set of expense documents from a first computer associated with a first account that is digitally linked to a credit line account and receives the set of expense documents. The expense pre-approval application may be one of a plurality of federated applications hosted using a multi-tenant distributed computing system that comprises the virtual compute instance. The method determines expense data comprising a type of expense document, time of spend, kind of expense, and a plurality of expense charges, for each document in the set of expense documents. Based on the type of document of each expense document in the set of expense documents, the method identifies a payment gateway among a plurality of payment gateways. Each payment gateway executes a plurality of programmatic payment rails that the first account can access.
    Type: Application
    Filed: May 10, 2023
    Publication date: November 16, 2023
    Inventors: Himica Kumar, Daniel Benson, Nikki Gupta, Mochen Liu, Terry Eaton, Ketan Darji, Thomas Klein, Mikin Faldu, Rohit Jalisatgi
  • Publication number: 20230351328
    Abstract: In one embodiment, a method can access an expense line for a travel expense for an enterprise. The expense line is the subject of a procurement action under a relevant contract. The method can use a first machine learning model, determining a category associated with the expense line. The method can evaluate the expense line using the category associated with the expense line and a table of categories that are procurable with references to related travel contracts. The method can determine a match between a description field of the expense line and description fields of historic invoice records associated with travel contracts. In response to determining the match, the method can execute a responsive action for the expense line, wherein the responsive action includes generating a notification to a user, marking the expense line, and initiating a workflow to apply the contract to the expense line.
    Type: Application
    Filed: March 28, 2023
    Publication date: November 2, 2023
    Inventors: Daniel Benson, Mochen Liu, Alison Guilbeaux-Brown, Doug Benson
  • Publication number: 20220405701
    Abstract: Systems and methods for improving a computing system comparing past post-approved transaction records to past pre-approved transaction records are described herein. In an embodiment, a server stores a first plurality of digital electronic records identifying a plurality of past post-approved transactions by a first entity and a second plurality of digital electronic records for the first entity identifying a plurality of past pre-approved transactions by the first entity. The server uses a first machine learning system to determine that a subset of the first plurality of digital electronic records which identify a subset of the plurality of past post-approved transactions correspond to one or more pre-identified categories and a second machine learning system to match one or more particular digital electronic records of the subset of the first plurality of digital electronic records with one or more records of the second plurality of digital electronic records.
    Type: Application
    Filed: August 23, 2022
    Publication date: December 22, 2022
    Inventors: Maggie Mae Joy, Daniel Benson, Fang-Kuey Chang, Kiran Ratnapu, Ankit Narang, Shoan Jain, Raghunandan Somaraju, Prasanna Kumar, Angela Welchel, Mikin Faldu, Dipeshkumar Vasantbhai Prajapati, Ketan Vasantkumar Darji, Rucha Apte
  • Patent number: 11449827
    Abstract: Systems and methods for improving a computing system comparing past post-approved transaction records to past pre-approved transaction records are described herein. In an embodiment, a server stores a first plurality of digital electronic records identifying a plurality of past post-approved transactions by a first entity and a second plurality of digital electronic records for the first entity identifying a plurality of past pre-approved transactions by the first entity. The server uses a first machine learning system to determine that a subset of the first plurality of digital electronic records which identify a subset of the plurality of past post-approved transactions correspond to one or more pre-identified categories and a second machine learning system to match one or more particular digital electronic records of the subset of the first plurality of digital electronic records with one or more records of the second plurality of digital electronic records.
    Type: Grant
    Filed: November 6, 2019
    Date of Patent: September 20, 2022
    Assignee: Coupa Software Incorporated
    Inventors: Maggie Mae Joy, Daniel Benson, Fang-Kuey Chang, Kiran Ratnapu, Ankit Narang, Shoan Jain, Raghunandan Somaraju, Prasanna Kumar, Angela Welchel, Mikin Faldu, Dipeshkumar Vasantbhai Prajapati, Ketan Vasantkumar Darji, Rucha Apte
  • Publication number: 20200380455
    Abstract: Systems and methods for improving a computing system comparing past post-approved transaction records to past pre-approved transaction records are described herein. In an embodiment, a server stores a first plurality of digital electronic records identifying a plurality of past post-approved transactions by a first entity and a second plurality of digital electronic records for the first entity identifying a plurality of past pre-approved transactions by the first entity. The server uses a first machine learning system to determine that a subset of the first plurality of digital electronic records which identify a subset of the plurality of past post-approved transactions correspond to one or more pre-identified categories and a second machine learning system to match one or more particular digital electronic records of the subset of the first plurality of digital electronic records with one or more records of the second plurality of digital electronic records.
    Type: Application
    Filed: November 6, 2019
    Publication date: December 3, 2020
    Inventors: Maggie Mae Joy, Daniel Benson, Fang-Kuey Chang, Kiran Ratnapu, Ankit Narang, Shoan Jain, Raghunandan Somaraju, Prasanna Kumar, Angela Welchel, Mikin Faldu, Dipeshkumar Vasantbhai Prajapati, Ketan Vasantkumar Darji, Rucha Apte
  • Publication number: 20130030908
    Abstract: Methods, systems, and apparatuses, including computer programs encoded on computer-readable media, for obtaining information regarding a plurality of conversion paths that each end with a conversion interaction, wherein each conversion path includes one or more user interactions that include a plurality of dimensional data related to the user interaction. For each conversion path, it is determined if the conversion path includes a particular user interaction, a first position of the particular user interaction, and the number of user interactions of the conversion path. The conversion paths are grouped based upon if the conversion path includes the particular user interaction. For each conversion path group, an average position of the particular user interaction and an average path length based upon the path length of the conversion paths is computed. Data regarding the average position of the particular user interaction and the average path length is provided.
    Type: Application
    Filed: July 28, 2011
    Publication date: January 31, 2013
    Inventors: Jason S. Gessner, Matthias Blume, Jacob Matthews, Daniel Benson
  • Patent number: 8004539
    Abstract: Systems, methods and computer program code for improved graphical parameter definition may comprise, (i) receiving, by a graphical editing tool, a command associated with a graphical editing operation directed to performing a transformation to a graphical object, wherein the transformation is associated with changing a value of a first parameter of the graphical object, (ii) displaying, by the graphical editing tool, a transformation object associated with the transformation, wherein the transformation object comprises a second parameter comprising a value associated with the transformation, and wherein the value of the first parameter of the graphical object is related to the value of the second parameter, (iii) receiving, by the graphical editing tool, an indication associated with defining the transformation object as a new parameter of the graphical object, and (iv) defining, by the graphical editing tool, the transformation object as the new parameter of the graphical object.
    Type: Grant
    Filed: April 20, 2005
    Date of Patent: August 23, 2011
    Assignee: Siemens Aktiengesellschaft
    Inventors: Richard McDaniel, Daniel Benson
  • Patent number: 7061865
    Abstract: Data switching systems for use in ATM and other packet and cell switching networks can more smoothly switch data if incoming data packets to be switched are re-ordered to avoid overwhelming an output port with too many consecutive packets to a particular destination. An apparatus and method for simply re-ordering data samples in a non-consecutive manner is computationally efficient and effective.
    Type: Grant
    Filed: December 12, 2001
    Date of Patent: June 13, 2006
    Assignee: Tellabs Operations, Inc.
    Inventors: Robert Bradford Magill, Kent Daniel Benson, Terry Jon Hrabik
  • Publication number: 20060082597
    Abstract: Systems, methods and computer program code for improved graphical parameter definition may comprise, (i) receiving, by a graphical editing tool, a command associated with a graphical editing operation directed to performing a transformation to a graphical object, wherein the transformation is associated with changing a value of a first parameter of the graphical object, (ii) displaying, by the graphical editing tool, a transformation object associated with the transformation, wherein the transformation object comprises a second parameter comprising a value associated with the transformation, and wherein the value of the first parameter of the graphical object is related to the value of the second parameter, (iii) receiving, by the graphical editing tool, an indication associated with defining the transformation object as a new parameter of the graphical object, and (iv) defining, by the graphical editing tool, the transformation object as the new parameter of the graphical object.
    Type: Application
    Filed: April 20, 2005
    Publication date: April 20, 2006
    Inventors: Richard McDaniel, Daniel Benson
  • Publication number: 20060079982
    Abstract: A method of analyzing a manufacturing system. The manufacturing system includes a plurality of manufacturing resources. A set of orders is currently appointed for processing by the manufacturing system. Each order of the set of orders requires performance of at least one task. Each task is to be performed by at least a respective one of the manufacturing resources. The method includes determining stochastic parameters for each task of the plurality of tasks. The method also includes calculating a loading profile for at least one of the manufacturing resources that is allocated to at least one of the plurality of tasks. The loading profile function is a function of time and represents a probability that the manufacturing resource is occupied at a given time. The calculation is based at least in part on the stochastic parameters of the tasks.
    Type: Application
    Filed: March 18, 2005
    Publication date: April 13, 2006
    Inventors: Mark Giebels, Daniel Benson
  • Publication number: 20060079979
    Abstract: A method of analyzing a manufacturing system. The manufacturing system includes a plurality of manufacturing resources. A set of orders is currently appointed for processing by the manufacturing system. Each order of the set of orders requires performance of at least one task. Each task is to be performed by at least a respective one of the manufacturing resources. The method includes determining stochastic parameters for each task of the plurality of tasks. The method also includes calculating a stochastic waiting time for at least one selected task of the plurality of tasks. The calculation is based at least in part on the stochastic parameters of the tasks.
    Type: Application
    Filed: March 18, 2005
    Publication date: April 13, 2006
    Inventors: Mark Giebels, Daniel Benson
  • Publication number: 20020044563
    Abstract: Data switching systems for use in ATM and other packet and cell switching networks can more smoothly switch data if incoming data packets to be switched are re-ordered to avoid overwhelming an output port with too many consecutive packets to a particular destination. An apparatus and method for simply re-ordering data samples in a nonconsecutive manner is computationally efficient and effective.
    Type: Application
    Filed: December 12, 2001
    Publication date: April 18, 2002
    Applicant: Tellabs Operations, Inc.
    Inventors: Robert Bradford Magill, Kent Daniel Benson, Terry Jon Hrabik
  • Patent number: 6343066
    Abstract: Data switching systems for use in ATM and other packet and cell switching networks can more smoothly switch data if incoming data packets to be switched are re-ordered to avoid overwhelming an output port with too many consecutive packets to a particular destination. An apparatus and method for simply re-ordering data samples in a non-consecutive manner is computationally efficient and effective.
    Type: Grant
    Filed: March 9, 2001
    Date of Patent: January 29, 2002
    Assignee: Tellabs Operations, Inc.
    Inventors: Robert Bradford Magill, Kent Daniel Benson, Terry Jon Hrabik
  • Publication number: 20010048690
    Abstract: Data switching systems for use in ATM and other packet and cell switching networks can more smoothly switch data if incoming data packets to be switched are re-ordered to avoid overwhelming an output port with too many consecutive packets to a particular destination. An apparatus and method for simply re-ordering data samples in a non-consecutive manner is computationally efficient and effective.
    Type: Application
    Filed: March 9, 2001
    Publication date: December 6, 2001
    Inventors: Robert Bradford Magill, Kent Daniel Benson, Terry Jon Hrabik