Patents by Inventor Sandeep Gupta

Sandeep Gupta 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: 20200162312
    Abstract: A system and method to intelligently formulate automation strategies for technology infrastructure operations are disclosed. The system and method include analyzing infrastructure issue data from support tickets and predicting automation solutions. A cost-benefit analysis is then performed on the automation solutions. Solutions can be ranked and recommended according to the cost-benefit analysis.
    Type: Application
    Filed: December 31, 2018
    Publication date: May 21, 2020
    Inventors: Ramkumar Balasubramanian, Sandeep Bhutani, Chandrasekhar Pilla, Shallu Gupta, Sekhar Naga Venkata Maddula
  • Publication number: 20200151268
    Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
    Type: Application
    Filed: November 8, 2018
    Publication date: May 14, 2020
    Inventors: Robert T. Johnson, Abhishek Gupta, Jorge Guerra Delgado, Ittai Abraham, Richard P. Spillane, Srinath Premachandran, Sandeep Rangaswamy, Kapil Chowksey
  • Publication number: 20200151634
    Abstract: Apparatus and associated methods relate to scheduling service provider and service consumer interactions based on determining service consumer scores, service provider scores, and service time slot scores predicting outcomes for provider service to a consumer in a time slot, and automatically adapting demand and supply matched as functions of the scores. In an illustrative example, the service consumer may be a client. The service provider may be, for example, a professional offering service in an available time slot. In some examples, individual client, provider, and time slot scores may be calculated as functions of predictive variables associated with a client population and the provider practice environment. In some embodiments, scores may be probability estimates of show, no-show, delay, or cancellation.
    Type: Application
    Filed: November 10, 2019
    Publication date: May 14, 2020
    Applicant: EasyManage Health
    Inventors: Fitih Cinnor, Nayeem Ahmed, Sandeep Gupta
  • Patent number: 10640779
    Abstract: An Engineered Transgene Integration Platform (ETIP) is described that can be inserted randomly or at targeted locations in plant genomes to facilitate rapid selection and detection of a GOI that is perfectly targeted (both the 5? and 3? ends) at the ETIP genomic location. One element in the subject disclosure is the introduction of specific double stranded breaks within the ETIP. In some embodiments, an ETIP is described using zinc finger nuclease binding sites, but may utilize other targeting technologies such as meganucleases, CRISPRs, TALs, or leucine zippers. Also described are compositions of, and methods for producing, transgenic plants wherein the donor or payload DNA expresses one or more products of an exogenous nucleic acid sequence (e.g. protein or RNA) that has been stably-integrated into an ETIP in a plant cell. In embodiments, the ETIP facilitates testing of gene candidates and plant expression vectors from ideation through Development phases.
    Type: Grant
    Filed: September 6, 2013
    Date of Patent: May 5, 2020
    Assignee: Dow AgroSciences LLC
    Inventors: Noel Cogan, John Forster, Matthew Hayden, Tim Sawbridge, German Spangenberg, Steven R. Webb, Manju Gupta, W. Mike Ainley, Matthew J. Henry, John Mason, Sandeep Kumar, Stephen Novak
  • Patent number: 10623373
    Abstract: Methods and apparatus to provide a distributed firewall in a network are disclosed. An example method includes identifying, at a control plane, a network traffic rule to implement in a network, and determining a first firewall of a distributed firewall in the network to enforce the network traffic rule. Example methods also configure a first software-defined network node to route network traffic to the first firewall. The first firewall is instantiated by a first firewall instance at a second software-defined network node and by a second firewall instance at a third software-defined network node. In response to determining at least some of the network traffic forwarded by the first software-defined network node to the second and third software-defined network nodes is being dropped at the first and second firewall instances, example methods also cause the first software-defined network node to implement a third firewall instance.
    Type: Grant
    Filed: May 12, 2017
    Date of Patent: April 14, 2020
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Dustin Grant, Sandeep Gupta, Sridhar Narahari, Michael J. Satterlee
  • Publication number: 20200108203
    Abstract: Methods and systems for utilizing co-simulation of a physical model and a self-adaptive predictive controller using hybrid automata are described. For example, there is disclosed a self-adaptive predictive control system to generate an initial patient model with initial patient model settings (k1, k2, . . . , kn) and execute a program that takes as input, the initial patient model settings as configuration parameters that specify at least a plurality of initial states. Such a system further receives new patient inputs and generates hybrid automata as a variation of the initial states by applying the new patient inputs to the initial patient model. The system further derives reachable states from the hybrid automata and outputs all reachable states computed. The system further detects changes and responsively generates a new patient predictive model with new parameter settings (k?1, k?2, . . . , k?n), iteratively repeating until a termination criterion is satisfied. Other related embodiments are disclosed.
    Type: Application
    Filed: October 4, 2019
    Publication date: April 9, 2020
    Inventors: Imane Lamrani, Ayan Banerjee, Sandeep Gupta
  • Publication number: 20200089788
    Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
    Type: Application
    Filed: September 18, 2018
    Publication date: March 19, 2020
    Inventors: Robert T. Johnson, Ittai Abraham, Abhishek Gupta, Richard P. Spillane, Srinath Premachandran, Jorge Guerra Delgado, Sandeep Rangaswamy, Kapil Chowksey
  • Publication number: 20200085865
    Abstract: A seal formulation for forming a physical barrier in the teat canal of a non-human animal comprises zinc oxide in a gel base. The seal formulation contains at least 40% by weight of the zinc oxide.
    Type: Application
    Filed: November 21, 2019
    Publication date: March 19, 2020
    Inventors: Francisco Javier MOLINS ALBANELL, Brendan Gerard SMITH, Sandeep GUPTA
  • Patent number: 10579284
    Abstract: A computer-implemented method according to one embodiment includes identifying an erasure code storage policy for an unified file and object storage system, determining a plurality of storage disks associated with the erasure code storage policy, retrieving disk health parameters for each of the plurality of storage disks, identifying a number of available outer partition storage blocks for each of the plurality of storage disks, and determining a number of erasure code fragments to be stored for a file within the unified file and object storage system before initiating an objectization process on the file, utilizing the disk health parameters for each of the plurality of storage disks and the number of available outer partition storage blocks for each of the plurality of storage disks.
    Type: Grant
    Filed: June 2, 2017
    Date of Patent: March 3, 2020
    Assignee: International Business Machines Corporation
    Inventors: Sasikanth Eda, Prayas Gupta, Poornima Gupte, Sandeep R. Patil
  • Patent number: 10575788
    Abstract: Methods and systems are described for sensing and recovery of a biological signal using generative-model-based compressive sensing. A transformation is applied to sparsify the quasi-periodic signal removing morphology parameters and leaving temporal parameters. The sparsified signal is sampled and the sampled signal data is transmitted to a base station. A homotopy recovery algorithm is applied to the received sampled signal data by the base station to recover the temporal parameters of the biological signal. Generative modelling is applied using previously captured morphology parameters to generate a reconstructed signal. Finally, the reconstructed signal is adjusted and scaled based on the recovered temporal parameters to provide a reconstructed signal that is diagnostically equivalent to the original biological signal.
    Type: Grant
    Filed: October 18, 2017
    Date of Patent: March 3, 2020
    Assignee: ARIZONA BOARD OF REGENTS ON BEHALF OF ARIZONA STATE UNIVERSITY
    Inventors: Sandeep Gupta, Ayan Banerjee
  • Publication number: 20200042608
    Abstract: Implementations are provided herein for optimizing the usage of cluster resources in a cluster of nodes operating as a distributed file system. A node relative capacity table can be generated that inventories the total capacity of each node within the cluster of nodes. Each node can then be dynamically monitored for usage of node resources. A node available capacity table can be dynamically populated with the amount of available capacity each node has for compute, memory usage, and network bandwidth. When clients connect to the distributed file system, they can be directed to have their requests serviced by nodes with greater available capacity based on policy.
    Type: Application
    Filed: August 1, 2018
    Publication date: February 6, 2020
    Applicant: EMC IP Holding Company LLC
    Inventors: Jai GAHLOT, Shiv KUMAR, Amit CHAUHAN, Sandeep CHAVAN, Kaushik GUPTA
  • Publication number: 20200012735
    Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
    Type: Application
    Filed: July 6, 2018
    Publication date: January 9, 2020
    Inventors: Robert T Johnson, Ittai Abraham, Abhishek Gupta, Richard P Spillane, Sandeep Rangaswamy, Jorge Guerra Delgado, Srinath Premachandran, Kapil Chowksey
  • Publication number: 20190377502
    Abstract: A computer-implemented method according to one embodiment includes identifying an erasure code storage policy for an unified file and object storage system, determining a plurality of storage disks associated with the erasure code storage policy, retrieving disk health parameters for each of the plurality of storage disks, identifying a number of available outer partition storage blocks for each of the plurality of storage disks, and determining a number of erasure code fragments to be stored for a file within the unified file and object storage system before initiating an objectization process on the file, utilizing the disk health parameters for each of the plurality of storage disks and the number of available outer partition storage blocks for each of the plurality of storage disks.
    Type: Application
    Filed: August 21, 2019
    Publication date: December 12, 2019
    Inventors: Sasikanth Eda, Prayas Gupta, Poornima Gupte, Sandeep R. Patil
  • Publication number: 20190373006
    Abstract: A cloud security system and method implements cloud activity threat detection using analysis of cloud usage user behavior. In particular, the cloud security system and method implements threat detection for users, cloud service providers, or tenants (enterprises) of the cloud security system who are new or unknown to the cloud security system and therefore lacking sufficient cloud activity data to generate an accurate behavior model for effective threat detection. In accordance with embodiments of the present invention, the cloud security system and method performs user behavior analysis to generate generalized user behavior models for user groups, where each user group includes users with similar cloud usage behavior. The user behavior models of the user groups are assigned to users with sparse cloud activity data. In this manner, the cloud security system and method of the present invention ensures effective threat detection by using accurate and reliable user behavior models.
    Type: Application
    Filed: May 13, 2019
    Publication date: December 5, 2019
    Inventors: Sandeep Chandana, Santosh Raghuram Kumar, Sekhar Sarukkai, Satyanarayana Vummidi, Madhavi Kavathekar, Vinay Gupta
  • Publication number: 20190370239
    Abstract: Embodiments herein are directed towards systems and methods for performing range lookups in B?-trees. One example method involves receiving a request to return key-value pairs within a range of keys from the B?-tree. The B?-tree includes a plurality of nodes, each node being associated with a buffer that stores key-value pairs. The method further involves determining a fractional size of the range of keys. The method further involves, for each level of the B?-tree, obtaining from within one or more buffers of one or more nodes of the level, a set of key-value pairs within the range of keys up to a size equal to the fractional size and transferring the set of key-value pairs to a result data structure. The method further involves sorting and merging all key-value pairs in the result data structure and returning the result data structure in response to the request.
    Type: Application
    Filed: June 5, 2018
    Publication date: December 5, 2019
    Inventors: Abhishek GUPTA, Richard P. SPILLANE, Rob JOHNSON, Wenguang WANG, Kapil CHOWKSEY, Jorge GUERRA DELGADO, Sandeep RANGASWAMY, Srinath PREMACHANDRAN
  • Publication number: 20190360295
    Abstract: A control system and method for a blowout preventer (BOP) system in an oil rig is provided. An input module generates control inputs for required components of the blowout preventer system, and transmits the control inputs simultaneously as an operational input and a numerical input, where the operational input is transmitted to the required component of the blowout preventer system. A synchronized model is coupled to the input module to receive the numerical input, and to replicate an operation of the blowout preventer system based on the numerical input. The synchronized model also generates one or more model outputs based on the replication of the operation of the blowout preventer system.
    Type: Application
    Filed: August 3, 2017
    Publication date: November 28, 2019
    Applicant: General Electric Company
    Inventors: Parag Mantri, John S. Holmes, Muralikrishna Rangharajhan, Sriram Sundar, Shweta Gupta, Sandeep Dhar
  • Publication number: 20190340292
    Abstract: Techniques for providing snapshots of logical devices may include: receiving a first request to create a first snapshot of a logical device; responsive to the first request, performing first processing including storing first information in a cache slot, the first information identifying the first snapshot and the logical device used as a source of the first snapshot; receiving a second request to activate one or more snapshots, including the first snapshot, identified by information stored in the cache slot; and responsive to receiving the second request, performing second processing including initiating execution of an asynchronous process that performs snapshot activation processing for the one or more snapshots identified by the cache slot.
    Type: Application
    Filed: May 2, 2018
    Publication date: November 7, 2019
    Applicant: EMC IP Holding Company LLC
    Inventors: Sandeep Chandrashekhara, Michael Ferrari, George F. Lettery, Nicholas W. Von Hein, Shruti Gupta
  • Publication number: 20190331765
    Abstract: A radar hardware accelerator (HWA) includes a fast Fourier transform (FFT) engine including a pre-processing block for providing interference mitigation and/or multiplying a radar data sample stream received from ADC buffers within a split accelerator local memory that also includes output buffers by a pre-programmed complex scalar or a specified sample from an internal look-up table (LUT) to generate pre-processed samples. A windowing plus FFT block (windowed FFT block) is for multiply the pre-processed samples by a window vector and then processing by an FFT block for performing a FFT to generate Fourier transformed samples. A post-processing block is for computing a magnitude of the Fourier transformed samples and performing a data compression operation for generating post-processed radar data. The pre-processing block, windowed FFT block and post-processing block are connected in one streaming series data path.
    Type: Application
    Filed: June 14, 2019
    Publication date: October 31, 2019
    Inventors: Sandeep Rao, Karthik Ramasubramanian, Indu Prathapan, Raghu Ganesan, Pankaj Gupta
  • Publication number: 20190311047
    Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.
    Type: Application
    Filed: April 6, 2018
    Publication date: October 10, 2019
    Inventors: Jorge GUERRA DELGADO, Richard P. SPILLANE, Kapil CHOWKSEY, Sandeep RANGASWAMY, Abhishek GUPTA, Srinath PREMACHANDRAN
  • Patent number: 10430166
    Abstract: Disclosed are various approaches for injecting resources into wrapped applications. A computing device first obtains a compiled version of a target application package. The computing device then decompiles the compiled version of the target application package to generate a source code version of the target application package. Then, the computing device combines the source code version of the target application package with management component source code. Next, the computing device generates an application resource index. Subsequently, the computing device, modifies the management component source code based at least in part on the application resource index. Finally, the computing device compiles the combined source code version of the target application package and the management component source code to generate a managed application package.
    Type: Grant
    Filed: September 7, 2016
    Date of Patent: October 1, 2019
    Assignee: AIRWATCH LLC
    Inventors: Sandeep Naga Kaipu, Xinpi Du, Supriya Saha, Dipanshu Gupta, Chaoting Xuan