Patents by Inventor Vikram Yadav

Vikram Yadav 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: 20230409906
    Abstract: Methods and systems for using machine learning to identify extremely rare events in high-dimensional space are disclosed. A method includes: identifying, by a computing device, a plurality of derived attributes using an external data source; selecting, by the computing device, a plurality of key performance indicators from the plurality of derived attributes using a neural network and based on an extremely rare event being modeled; constructing, by the computing device, a linear model using the plurality of key performance indicators; and predicting, by the computing device, occurrences of the extremely rare event using the linear model.
    Type: Application
    Filed: September 6, 2023
    Publication date: December 21, 2023
    Inventors: Sanket Jain, Kumar Apurva, Vikram Yadav
  • Patent number: 11797840
    Abstract: Methods and systems for using machine learning to identify extremely rare events in high-dimensional space are disclosed. A method includes: identifying, by a computing device, a plurality of derived attributes using an external data source; selecting, by the computing device, a plurality of key performance indicators from the plurality of derived attributes using a neural network and based on an extremely rare event being modeled; constructing, by the computing device, a linear model using the plurality of key performance indicators; and predicting, by the computing device, occurrences of the extremely rare event using the linear model.
    Type: Grant
    Filed: November 28, 2018
    Date of Patent: October 24, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sanket Jain, Kumar Apurva, Vikram Yadav
  • Patent number: 11416322
    Abstract: A method and associated systems use DVFS performance-scaling technology to satisfy quality-of-service performance requirements when recovering a job that had been scheduled to run on a failed virtual machine. A Buffer Time specifies a duration of time remaining, at the time of failure, for the job to complete in order to satisfy the quality-of-service requirements. Depending on relative durations of time required to repair the failed virtual machine, to perform the job on an unscaled active-mode virtual machine, and to transfer the job to another virtual machine, the system determines whether to repair the failed virtual machine or to transfer the job. If the latter, the system then determines whether to select a destination virtual machine provisioned on a DVFS-compliant platform and, if so, the system scales the DVFS-compliant platform's performance to a level sufficient to complete the job within the Buffer Time.
    Type: Grant
    Filed: May 10, 2019
    Date of Patent: August 16, 2022
    Assignee: International Business Machines Corporation
    Inventors: Rajesh Kumar Saxena, Vikram Yadav
  • Patent number: 11175940
    Abstract: Managing execution of a job in a computing environment. A method establishes, for a job to be executed in the computing environment, an execution plan for processing the job. The execution plan identifies computationally intensive tasks of the job and data intensive tasks of the job. The method selects a virtual machine of the computing environment to process the identified computationally intensive tasks of the job and identified data intensive tasks of the job. The method assigns the identified computationally intensive tasks of the job for foreground processing of the virtual machine and assigns the identified data intensive tasks of the job for background processing of the virtual machine. Execution of the job executes the identified computationally intensive tasks of the job in foreground processing of the virtual machine and executes the identified data intensive tasks of the job in background processing of the virtual machine.
    Type: Grant
    Filed: May 17, 2019
    Date of Patent: November 16, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gopal K. Bhageria, Rajesh K. Saxena, Vikram Yadav
  • Patent number: 11120224
    Abstract: Mechanisms are provided to implement an efficient translating mechanism to efficiently translating social media posts. A source language to be used to translate the social media post is identified based on words within the social media post. A highest classification is identified and the social media post is translated from the source language to a target language using a translation level associated with the highest classification. In the translation, each word and its related meaning in the target language are identified from a multi-language data structure; each word is categorized into its associated part of speech; a sentence is generated in the target language; and natural language processing is performed on each sentence in the target language to identity the existence of ambiguous connotations. Responsive to each sentence failing have any ambiguous connotations, a social medial post is generated in the target language utilizing the generated sentences.
    Type: Grant
    Filed: September 14, 2018
    Date of Patent: September 14, 2021
    Assignee: International Business Machines Corporation
    Inventors: Pooja Malik, Vikram Yadav, Gopal Bhageria, Sandeep Sukhija
  • Patent number: 11010195
    Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: assigning resources of a K-tier resource pool to a certain job residing in a job queue, wherein the certain job residing in the job queue features job coupling characterized by an independent job and a dependent job which for completion depends on an output of the independent job, wherein the K-tier resource pool includes at least one foreground virtual machine (VM) having a first central processing unit (CPU) priority and at least one background virtual machine (VM) having a second CPU priority, wherein the first CPU priority is higher than the second CPU priority, wherein the assigning resources of the K-tier resource pool to the certain job includes assigning one or more foreground VM to the independent job and assigning one or more background VM to the dependent job.
    Type: Grant
    Filed: July 19, 2019
    Date of Patent: May 18, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Vikram Yadav, Rajesh Kumar Saxena, Gopal Bhageria, Harish Bharti
  • Patent number: 11003492
    Abstract: A method and system for reassigning failed jobs. It is determined that a job queue of a virtual network is overloaded. Each job is set in the job queue to be processed in a scalable mode of operation as a function of the job queue being overloaded. A job is apportioned in the job queue to a virtual machine in the virtual network operating in the scalable mode of operation. The job queued by the virtual machine fails to be completed. A probability of failing to complete the job by the virtual machine is computed. It is determined, as a function of the probability of failing to complete the job, whether to complete the job queued by the virtual machine or transfer the job to a queue of a second virtual machine operating in a dynamic voltage and frequency scaling (DVFS) mode or an active mode.
    Type: Grant
    Filed: May 28, 2019
    Date of Patent: May 11, 2021
    Assignee: International Business Machines Corporation
    Inventors: Pooja Malik, Vikram Yadav
  • Publication number: 20210019179
    Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: assigning resources of a K-tier resource pool to a certain job residing in a job queue, wherein the certain job residing in the job queue features job coupling characterized by an independent job and a dependent job which for completion depends on an output of the independent job, wherein the K-tier resource pool includes at least one foreground virtual machine (VM) having a first central processing unit (CPU) priority and at least one background virtual machine (VM) having a second CPU priority, wherein the first CPU priority is higher than the second CPU priority, wherein the assigning resources of the K-tier resource pool to the certain job includes assigning one or more foreground VM to the independent job and assigning one or more background VM to the dependent job.
    Type: Application
    Filed: July 19, 2019
    Publication date: January 21, 2021
    Inventors: Vikram YADAV, Rajesh Kumar SAXENA, Gopal BHAGERIA, Harish BHARTI
  • Patent number: 10761887
    Abstract: Method of allocating tasks in a computing environment including: receiving a software application having tasks for processing; splitting the software application into the tasks; selecting a task for processing in a first computing environment without encryption, a second computing environment with homomorphic encryption or a third computing environment without encryption based on the following algorithm: analyzing the tasks for the presence of a security marker indicating a security level of the tasks; when there is no security marker, selecting the task for processing in the least costly of first computing environment without encryption or the third computing environment without encryption; and when the security marker is present and the processing of the task involves any computation, selecting the task for processing in the least costly of the second computing environment with homomorphic encryption or the third computing environment.
    Type: Grant
    Filed: July 12, 2019
    Date of Patent: September 1, 2020
    Assignee: International Business Machines Corporation
    Inventors: Gopal K. Bhageria, Pooja Malik, Sathya Santhar, Vikram Yadav
  • Patent number: 10691488
    Abstract: A method and system for allocating data processing jobs between public and private cloud based on various SLA and cost factors associated to each job, and particularly, job allocation using minimal cost association by applying logistic regression. Jobs are analyzed based on various factors such as compute and operational intensity, kind of environment, I/O operations bandwidth, costs involved to deploy in private and public cloud and all these parameters are balanced to arrive at minimized cost. Methods are implemented for receiving input data representing a current request to run a job on a virtual machine, associated job characteristics, features associated with VMs running on a public networked or private networked host computing environment, and features associated with the host computing environment.
    Type: Grant
    Filed: December 1, 2017
    Date of Patent: June 23, 2020
    Assignee: International Business Machines Corporation
    Inventors: Sathya Santhar, Gopal Bhageria, Pooja Malik, Vikram Yadav
  • Publication number: 20200167634
    Abstract: Methods and systems for using machine learning to identify extremely rare events in high-dimensional space are disclosed. A method includes: identifying, by a computing device, a plurality of derived attributes using an external data source; selecting, by the computing device, a plurality of key performance indicators from the plurality of derived attributes using a neural network and based on an extremely rare event being modeled; constructing, by the computing device, a linear model using the plurality of key performance indicators; and predicting, by the computing device, occurrences of the extremely rare event using the linear model.
    Type: Application
    Filed: November 28, 2018
    Publication date: May 28, 2020
    Inventors: Sanket Jain, Kumar Apurva, Vikram Yadav
  • Publication number: 20200089763
    Abstract: Mechanisms are provided to implement an efficient translating mechanism to efficiently translating social media posts. A source language to be used to translate the social media post is identified based on words within the social media post. A highest classification is identified and the social media post is translated from the source language to a target language using a translation level associated with the highest classification. In the translation, each word and its related meaning in the target language are identified from a multi-language data structure; each word is categorized into its associated part of speech; a sentence is generated in the target language; and natural language processing is performed on each sentence in the target language to identity the existence of ambiguous connotations. Responsive to each sentence failing have any ambiguous connotations, a social medial post is generated in the target language utilizing the generated sentences.
    Type: Application
    Filed: September 14, 2018
    Publication date: March 19, 2020
    Inventors: Pooja Malik, Vikram Yadav, Gopal Bhageria, Sandeep Sukhija
  • Publication number: 20190340007
    Abstract: A method and system for reassigning failed jobs. It is determined that a job queue of a virtual network is overloaded. Each job is set in the job queue to be processed in a scalable mode of operation as a function of the job queue being overloaded. A job is apportioned in the job queue to a virtual machine in the virtual network operating in the scalable mode of operation. The job queued by the virtual machine fails to be completed. A probability of failing to complete the job by the virtual machine is computed. It is determined, as a function of the probability of failing to complete the job, whether to complete the job queued by the virtual machine or transfer the job to a queue of a second virtual machine operating in a dynamic voltage and frequency scaling (DVFS) mode or an active mode.
    Type: Application
    Filed: May 28, 2019
    Publication date: November 7, 2019
    Inventors: Pooja Malik, Vikram Yadav
  • Publication number: 20190332431
    Abstract: Method of allocating tasks in a computing environment including: receiving a software application having tasks for processing; splitting the software application into the tasks; selecting a task for processing in a first computing environment without encryption, a second computing environment with homomorphic encryption or a third computing environment without encryption based on the following algorithm: analyzing the tasks for the presence of a security marker indicating a security level of the tasks; when there is no security marker, selecting the task for processing in the least costly of first computing environment without encryption or the third computing environment without encryption; and when the security marker is present and the processing of the task involves any computation, selecting the task for processing in the least costly of the second computing environment with homomorphic encryption or the third computing environment.
    Type: Application
    Filed: July 12, 2019
    Publication date: October 31, 2019
    Inventors: Gopal K. Bhageria, Pooja Malik, Sathya Santhar, Vikram Yadav
  • Patent number: 10423449
    Abstract: Method of allocating tasks in a computing environment including: receiving a software application having tasks for processing; splitting the software application into the tasks; selecting a task for processing in a first computing environment without encryption, a second computing environment with homomorphic encryption or a third computing environment without encryption based on the following algorithm: analyzing the tasks for the presence of a security marker indicating a security level of the tasks; when there is no security marker, selecting the task for processing in the least costly of first computing environment without encryption or the third computing environment without encryption; and when the security marker is medium or high and the processing of the task involves any computation, selecting the task for processing in the least costly of the second computing environment with homomorphic encryption or the third computing environment.
    Type: Grant
    Filed: November 20, 2017
    Date of Patent: September 24, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gopal K. Bhageria, Pooja Malik, Sathya Santhar, Vikram Yadav
  • Publication number: 20190272189
    Abstract: Managing execution of a job in a computing environment. A method establishes, for a job to be executed in the computing environment, an execution plan for processing the job. The execution plan identifies computationally intensive tasks of the job and data intensive tasks of the job. The method selects a virtual machine of the computing environment to process the identified computationally intensive tasks of the job and identified data intensive tasks of the job. The method assigns the identified computationally intensive tasks of the job for foreground processing of the virtual machine and assigns the identified data intensive tasks of the job for background processing of the virtual machine. Execution of the job executes the identified computationally intensive tasks of the job in foreground processing of the virtual machine and executes the identified data intensive tasks of the job in background processing of the virtual machine.
    Type: Application
    Filed: May 17, 2019
    Publication date: September 5, 2019
    Inventors: Gopal K. Bhageria, Rajesh K. Saxena, Vikram Yadav
  • Publication number: 20190272208
    Abstract: A method and associated systems use DVFS performance-scaling technology to satisfy quality-of-service performance requirements when recovering a job that had been scheduled to run on a failed virtual machine. A Buffer Time specifies a duration of time remaining, at the time of failure, for the job to complete in order to satisfy the quality-of-service requirements. Depending on relative durations of time required to repair the failed virtual machine, to perform the job on an unscaled active-mode virtual machine, and to transfer the job to another virtual machine, the system determines whether to repair the failed virtual machine or to transfer the job. If the latter, the system then determines whether to select a destination virtual machine provisioned on a DVFS-compliant platform and, if so, the system scales the DVFS-compliant platform's performance to a level sufficient to complete the job within the Buffer Time.
    Type: Application
    Filed: May 10, 2019
    Publication date: September 5, 2019
    Inventors: Rajesh Kumar Saxena, Vikram Yadav
  • Patent number: 10379898
    Abstract: Systems, methods and tools for managing the job queues of virtual machines, maintaining a low energy profile and a quality of service within the contractual service agreement. The systems migrate jobs to a new VM queue when a assigned VM has failed. The systems employ machine learning techniques to make decisions whether or not to reallocate the job to a VM running in an active mode (non-scalable mode) or a VM operating under a dynamic voltage and frequency scaling (DVFS) mode. The systems reconcile job failures, transfer and/or complete jobs using the network of VMs without degrading the service quality, maintaining a lower power consumption policy through scalable modes, including idle, busy, sleep, DVFS gradient and DVFS maximum modes, improving the overall reliability of the data center by switching the jobs to scalable nodes, increasing the recoverability of the systems in the virtualized environments.
    Type: Grant
    Filed: March 24, 2017
    Date of Patent: August 13, 2019
    Assignee: International Business Machines Corporation
    Inventors: Pooja Malik, Vikram Yadav
  • Patent number: 10379923
    Abstract: A method and associated systems use DVFS performance-scaling technology to satisfy quality-of-service performance requirements when recovering a job that had been scheduled to run on a failed virtual machine. A Buffer Time specifies a duration of time remaining, at the time of failure, for the job to complete in order to satisfy the quality-of-service requirements. Depending on relative durations of time required to repair the failed virtual machine, to perform the job on an unsealed active-mode virtual machine, and to transfer the job to another virtual machine, the system determines whether to repair the failed virtual machine or to transfer the job. If the latter, the system then determines whether to select a destination virtual machine provisioned on a DVFS-compliant platform and, if so, the system scales the DVFS-compliant platform's performance to a level sufficient to complete the job within the Buffer Time.
    Type: Grant
    Filed: September 15, 2017
    Date of Patent: August 13, 2019
    Assignee: International Business Machines Corporation
    Inventors: Rajesh Kumar Saxena, Vikram Yadav
  • Patent number: 10372479
    Abstract: Managing execution of a job in a computing environment. A method establishes, for a job to be executed in the computing environment, an execution plan for processing the job. The execution plan identifies computationally intensive tasks of the job and data intensive tasks of the job. The method selects a virtual machine of the computing environment to process the identified computationally intensive tasks of the job and identified data intensive tasks of the job. The method assigns the identified computationally intensive tasks of the job for foreground processing of the virtual machine and assigns the identified data intensive tasks of the job for background processing of the virtual machine. Execution of the job executes the identified computationally intensive tasks of the job in foreground processing of the virtual machine and executes the identified data intensive tasks of the job in background processing of the virtual machine.
    Type: Grant
    Filed: August 9, 2017
    Date of Patent: August 6, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gopal K. Bhageria, Rajesh K. Saxena, Vikram Yadav