Patents by Inventor Jonathan JI

Jonathan JI 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: 20250022012
    Abstract: The present teaching relates to method, system, medium, and implementations for setting a dynamic bid floor. To conduct a bidding process for an ad opportunity to display an ad at a current placement venue, a dynamic bid floor is determined in a non-parametric manner to maximize revenue based on bid-floor (BF)/revenue dependency information. The dynamic bid floor is used to control the bidding process. A winning bid is selected from multiple bids received during the bidding and a corresponding winning advertisement is displayed at the placement venue.
    Type: Application
    Filed: July 13, 2023
    Publication date: January 16, 2025
    Inventors: Boris Kapchits, Miguel Alcobendas, Jonathan Ji
  • Patent number: 11442792
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Grant
    Filed: December 15, 2020
    Date of Patent: September 13, 2022
    Assignee: Yahoo Assets LLC
    Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
  • Patent number: 11221890
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Grant
    Filed: November 21, 2018
    Date of Patent: January 11, 2022
    Assignee: Verizon Media Inc.
    Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
  • Publication number: 20210365300
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Application
    Filed: November 21, 2018
    Publication date: November 25, 2021
    Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG
  • Patent number: 11080099
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Grant
    Filed: November 21, 2018
    Date of Patent: August 3, 2021
    Assignee: Verizon Media Inc.
    Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
  • Publication number: 20210103478
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Application
    Filed: December 15, 2020
    Publication date: April 8, 2021
    Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG
  • Patent number: 10728185
    Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.
    Type: Grant
    Filed: December 31, 2018
    Date of Patent: July 28, 2020
    Assignee: CAPITAL ONE SERVICES, LLC
    Inventors: Japan Bhatt, Maten Mathew Navarifar, Jonathan Ji-Ching Lee, Bhuvaneswari Balasubramanian, Vijaya Kumar Pasam, Spencer Pierce Martin
  • Publication number: 20200159594
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Application
    Filed: November 21, 2018
    Publication date: May 21, 2020
    Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chui SONG
  • Publication number: 20190158434
    Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.
    Type: Application
    Filed: December 31, 2018
    Publication date: May 23, 2019
    Inventors: Japan Bhatt, Maten Mathew Navarifar, Jonathan Ji-Ching Lee, Bhuvaneswari Balasubramanian, Vijaya Kumar Pasam, Spencer Pierce Martin
  • Patent number: 10212104
    Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.
    Type: Grant
    Filed: November 17, 2017
    Date of Patent: February 19, 2019
    Assignee: CAPITAL ONE SERVICES, LLC
    Inventors: Japan Bhatt, Maten Mathew Navarifar, Jonathan Ji-Ching Lee, Bhuvaneswari Balasubramanian, Vijaya Kumar Pasam, Spencer Pierce Martin
  • Patent number: 10162830
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Grant
    Filed: June 22, 2016
    Date of Patent: December 25, 2018
    Assignee: Oath (Americas) Inc.
    Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
  • Publication number: 20170371892
    Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.
    Type: Application
    Filed: June 22, 2016
    Publication date: December 28, 2017
    Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG