Patents by Inventor Gaurav Batra

Gaurav Batra 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: 11977563
    Abstract: The techniques described herein relate to constructing and using seed audiences. In an embodiment, a method includes loading, by a processing device, a user event sequence, the user event sequence including a plurality of user events and a plurality of corresponding conversions; generating, by the processing device, a plurality of conversion neighborhoods based on the user event sequence, a given conversion neighborhood in the plurality of conversion neighborhood including at least one conversion rule and a set of user events from the plurality of user events; annotating, by the processing device, each conversion neighborhood in the plurality of conversion neighborhoods with categorical labels; and generating, by the processing device, seed audiences for each conversion neighborhood, a given seed audience including a ranked list of user events for each conversion rule associated with the conversion neighborhood.
    Type: Grant
    Filed: April 8, 2022
    Date of Patent: May 7, 2024
    Assignee: YAHOO ASSETS LLC
    Inventors: Chander Iyer, Xiao Bai, Ritest Agrawal, Gaurav Batra, An Jiang, Narayan Bhamidipati
  • Publication number: 20230325412
    Abstract: The techniques described herein relate to constructing and using seed audiences. In an embodiment, a method includes loading, by a processing device, a user event sequence, the user event sequence including a plurality of user events and a plurality of corresponding conversions; generating, by the processing device, a plurality of conversion neighborhoods based on the user event sequence, a given conversion neighborhood in the plurality of conversion neighborhood including at least one conversion rule and a set of user events from the plurality of user events; annotating, by the processing device, each conversion neighborhood in the plurality of conversion neighborhoods with categorical labels; and generating, by the processing device, seed audiences for each conversion neighborhood, a given seed audience including a ranked list of user events for each conversion rule associated with the conversion neighborhood.
    Type: Application
    Filed: April 8, 2022
    Publication date: October 12, 2023
    Inventors: Chander IYER, Xiao BAI, Ritest AGRAWAL, Gaurav BATRA, An JIANG, Narayan BHAMIDIPATI
  • Publication number: 20230260001
    Abstract: One or more systems and/or methods for product similarity detection and recommendation are provided. Users may view articles and/or other content that includes images depicting products that may be of interest to the users. These images are processed using image processing functionality such as computer vision to identify the products depicted by the images. A vector embedding model is used to generate product vector representations of the products. Catalog items that are available from a catalog to supplement the articles and other content may be processed to generate catalog item vector representations. When content (an article) with an image depicting a product is to be displayed to the user, similarity between a product vector representation of the product and the catalog item vector representations is determined in order to identify and display catalog items depicting products that are similar to the product depicted by the image in the content.
    Type: Application
    Filed: February 14, 2022
    Publication date: August 17, 2023
    Inventors: Paloma de Juan, Ritesh Kumar Shyam Sund Agrawal, Sricharanya Venkataramani, Eric McVoy Dodds, Gaurav Batra, Simao Herdade
  • Patent number: 11455264
    Abstract: During a memory reallocation process, it is determined that a set of memory pages being reallocated are each enabled for a Direct Memory Access (DMA) operation. Prior to writing initial data to the set of memory pages, a pre-access delay is performed concurrently for each memory page in the set of memory pages.
    Type: Grant
    Filed: August 10, 2020
    Date of Patent: September 27, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jaime Jaloma, Mark Rogers, Arnold Flores, Gaurav Batra
  • Publication number: 20220043764
    Abstract: During a memory reallocation process, it is determined that a set of memory pages being reallocated are each enabled for a Direct Memory Access (DMA) operation. Prior to writing initial data to the set of memory pages, a pre-access delay is performed concurrently for each memory page in the set of memory pages.
    Type: Application
    Filed: August 10, 2020
    Publication date: February 10, 2022
    Applicant: International Business Machines Corporation
    Inventors: Jaime Jaloma, Mark Rogers, Arnold Flores, Gaurav Batra
  • Publication number: 20210306883
    Abstract: A computer implemented method includes obtaining voice over Internet Protocol (VoIP) communication quality data for a communication associated with a user device communicating via an access point. The communication is associated with quality data. For each communication, the quality data is segmented into a plurality of segments each corresponding to a respective segment of the communication. For each segment, the method includes determining a score for the segment indicative of an evaluation of an overall quality of the segment, and associating the score with the user device and the access point. The method also includes determining a performance for the user device user device and for the access point based on the scores associated with the user device and the access point.
    Type: Application
    Filed: March 23, 2021
    Publication date: September 30, 2021
    Applicant: Spectralink Corporation
    Inventors: Elliott Ellison, Gaurav Batra, Andrew Gouin, Vivek Madhavan, Frank Carpenter, Christophe Durand
  • Patent number: 10324720
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Grant
    Filed: March 3, 2016
    Date of Patent: June 18, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Patent number: 10275248
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Grant
    Filed: December 7, 2015
    Date of Patent: April 30, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Patent number: 10261703
    Abstract: Sharing read-only data among virtual machines (VM) using an attached coherent accelerator processor interface (CAPI) enabled flash storage (CeFS) is provided. The method includes mapping a file, by a virtual machine monitor, from the CeFS into a range of common memory in the virtual machine monitor. The VM shares the mapped file with at least one other VM at a range of common memory in their address spaces. A redirect-on-write filesystem (RoWFS) is created on the VM and the at least one other VM, whereby the RoWFS includes a read-only copy and a private copy of a linear memory map of the mapped file. A data page is read using the copy of the linear memory map, and the data page is modified using the private copy of the linear memory map.
    Type: Grant
    Filed: December 10, 2015
    Date of Patent: April 16, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gaurav Batra, Anil Kumar K. Damodaran, Douglas Griffith, Amarendar N. Sulu
  • Publication number: 20180189738
    Abstract: Representative embodiments disclose mechanisms to route electronic communications for supervisory review. Users of a messaging system are assigned appropriate permissions to create and manage supervisory review policies, access supervisory review mailboxes to perform supervisory review actions, run reports and other activities associated with supervisory review. Supervisory review policies are pushed out to a supervisory review agent through a policy sync service and the supervisory review agent tests incoming and outgoing messages against the policy. Each policy selects electronic communications and routes the communication to an associated supervisory review mailbox or folder. Additional assistants can receive other electronic communications (social media, chat, voicemail, etc.) and route them to the supervisory review mailbox if the communication meets one or more policies.
    Type: Application
    Filed: March 15, 2017
    Publication date: July 5, 2018
    Inventors: Sanjay Ramaswamy, Kamal Anupama Janardhan, Daran Cai, Julian A. Zbogar-Smith, Nakul Garg, Samuel J. Shelton, Daniel J. Popper, Gaurav Batra, Subhayan Sen, Jinhao Li, Kannan Dhanasekaran, Xiaocheng Teng
  • Patent number: 10001925
    Abstract: A method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Grant
    Filed: June 10, 2015
    Date of Patent: June 19, 2018
    Assignee: International Business Machines Corporation
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20170168736
    Abstract: Sharing read-only data among virtual machines (VM) using an attached coherent accelerator processor interface (CAPI) enabled flash storage (CeFS) is provided. The method includes mapping a file, by a virtual machine monitor, from the CeFS into a range of common memory in the virtual machine monitor. The VM shares the mapped file with at least one other VM at a range of common memory in their address spaces. A redirect-on-write filesystem (RoWFS) is created on the VM and the at least one other VM, whereby the RoWFS includes a read-only copy and a private copy of a linear memory map of the mapped file. A data page is read using the copy of the linear memory map, and the data page is modified using the private copy of the linear memory map.
    Type: Application
    Filed: December 10, 2015
    Publication date: June 15, 2017
    Inventors: Gaurav Batra, Anil Kumar K. Damodaran, Douglas Griffith, Amarendar N. Sulu
  • Publication number: 20170161168
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Application
    Filed: March 3, 2016
    Publication date: June 8, 2017
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Publication number: 20170161072
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Application
    Filed: December 7, 2015
    Publication date: June 8, 2017
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Patent number: 9483184
    Abstract: A system and method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Grant
    Filed: December 19, 2014
    Date of Patent: November 1, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20160179400
    Abstract: A method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Application
    Filed: June 10, 2015
    Publication date: June 23, 2016
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20160179396
    Abstract: A system and method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Application
    Filed: December 19, 2014
    Publication date: June 23, 2016
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20150332280
    Abstract: A compliant auditing architecture is implemented such that a uniform experience of collecting, storing, and interacting with audit data may be provided for various compliance scenarios. A user action to be audited may be detected through a user interface of an auditing application, and a protocol service of the application may generate an audit event corresponding to the user action. The protocol service may transmit audit data associated with the audit event to a local queue of a datacenter for short-term storage, and an upload service hosted by the datacenter may upload the audit data from the local queue, and transmit the audit data to a data store for long-term storage. In response to a request from an administrator, the stored audit data may be converted to a format compatible with one or more compliance interfaces, and transmitted to the administrator through the interfaces for querying and/or reporting.
    Type: Application
    Filed: November 19, 2014
    Publication date: November 19, 2015
    Inventors: Ketaki Arun Deshpande, Gaurav Batra, Arman Centeno Reyes, Serguei V. Martchenko, Sara Louise Manning Dawson
  • Patent number: 8140890
    Abstract: Apparatus, method and program product for relocating Bad Block Relocation Directory (BBRD) on a disk storage pre-allocate a number of areas for BBRD in different locations of the disk storage. The locations for the BBRD are calculated based upon the size of the disk and BBRD count. If the update of BBRD fails due to defective media at the location to be updated, that location is abandon and the next pre-allocated location is used. A copy of the BBRD is stored in RAM and maintained by the kernel. By so doing, when a bad block in the BBRD is detected the kernel causes the BBRD to be written in a good one of the locations reserved for BBRD. When the number of alternate BBRD locations used hits a pre-defined threshold, this indicates a situation where many sections of the disk are going bad and the disk needs replacement. If all BBRD locations are used, the disk is presumed bad and all future I/O activities to the disk is suspended.
    Type: Grant
    Filed: December 29, 2009
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Glen Edmond Chalemin, Gaurav Batra, Anil Kumar Kaniveedu Damodaran
  • Publication number: 20110161731
    Abstract: Apparatus, method and program product for relocating Bad Block Relocation Directory (BBRD) on a disk storage pre-allocate a number of areas for BBRD in different locations of the disk storage. The locations for the BBRD are calculated based upon the size of the disk and BBRD count. If the update of BBRD fails due to defective media at the location to be updated, that location is abandon and the next pre-allocated location is used. A copy of the BBRD is stored in RAM and maintained by the kernel. By so doing, when a bad block in the BBRD is detected the kernel causes the BBRD to be written in a good one of the locations reserved for BBRD. When the number of alternate BBRD locations used hits a pre-defined threshold, this indicates a situation where many sections of the disk are going bad and the disk needs replacement. If all BBRD locations are used, the disk is presumed bad and all future I/O activities to the disk is suspended.
    Type: Application
    Filed: December 29, 2009
    Publication date: June 30, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Glen Edmond Chalemin, Gaurav Batra, Anil Kumar Kaniveedu Damodaran