Patents by Inventor Ganesan Ramalingam

Ganesan Ramalingam 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: 20250068710
    Abstract: A system and method for controlling the display of sensitive information in a home work environment is provided. The method comprises: providing a work computing device including a first processor for executing a web-based computer application accessible over a network for displaying information contained in at least one data field; and providing an administrative computing device in communication with the work computing device including a second processor configured to execute computer executable instructions for designating the data field as either restricted or unrestricted. When the data field is designated as restricted, the computer executable instructions mask the information contained in the data field so that the information is not viewable on a display of the work computing device. The system and method also provide for the selective unmasking of the masked information using the work computing device, with data associated with the unmasking being communicated to the administrative computing device.
    Type: Application
    Filed: November 8, 2024
    Publication date: February 27, 2025
    Applicant: Sutherland Global Services Inc.
    Inventors: Manikhandan Venugopal, Shaikh Ashif, Ganesan Ramalingam, Amin A. Sarfraz, Kumar T. Suresh
  • Patent number: 12210661
    Abstract: A method for monitoring and controlling usage of a remote work computing device is provided. The work computing device is in communication with a first computing device over a network, and comprises a display including a field of view (FOV) and a camera directed at the FOV. The method comprises: providing a first memory for storing a feature/attribute of an unauthorized object; capturing a digital image using the camera including a first object in the FOV; identifying a feature/attribute of the first object; and comparing the feature/attribute of the first object with the feature/attribute of the unauthorized object. When the feature/attribute of the first object matches the feature/attribute of the unauthorized object, a notification is communicated to the first computing device including the captured digital image, the display is prevented from being viewed from the FOV, and/or a task manager window is captured and communicated to the first computing device.
    Type: Grant
    Filed: November 23, 2021
    Date of Patent: January 28, 2025
    Assignee: Sutherland Global Services Inc.
    Inventors: Manikhandan Venugopal, P. Ezhumalai, A Malathi, M Marimuthu, Priya S. Mohana, Anandan Prabu, Subramaniyam Preethi, Ganesan Ramalingam, Amin A. Sarfraz, Ajith Sathiya, K Siddharthan, Kumar T. Suresh, Nathan Vickram
  • Patent number: 12147511
    Abstract: A system and method for controlling the display of sensitive information in a home work environment is provided. The method comprises: providing a work computing device including a first processor for executing a web-based computer application accessible over a network for displaying information contained in at least one data field; and providing an administrative computing device in communication with the work computing device including a second processor configured to execute computer executable instructions for designating the data field as either restricted or unrestricted. When the data field is designated as restricted, the computer executable instructions mask the information contained in the data field so that the information is not viewable on a display of the work computing device. The system and method also provide for the selective unmasking of the masked information using the work computing device, with data associated with the unmasking being communicated to the administrative computing device.
    Type: Grant
    Filed: November 23, 2021
    Date of Patent: November 19, 2024
    Assignee: Sutherland Global Services Inc.
    Inventors: Manikhandan Venugopal, Shaikh Ashif, Ganesan Ramalingam, Amin A. Sarfraz, Kumar T. Suresh
  • Patent number: 10580164
    Abstract: This document relates to camera calibration. One example uses real-world distances and image coordinates of object features in images to determine multiple candidate camera calibrations for a camera.
    Type: Grant
    Filed: April 5, 2018
    Date of Patent: March 3, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Ganesan Ramalingam, Ramachandran Ramjee, Romil Bhardwaj, Gopi Krishna Tummala
  • Publication number: 20190311494
    Abstract: This document relates to camera calibration. One example uses real-world distances and image coordinates of object features in images to determine multiple candidate camera calibrations for a camera.
    Type: Application
    Filed: April 5, 2018
    Publication date: October 10, 2019
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Ganesan RAMALINGAM, Ramachandran RAMJEE, Romil BHARDWAJ, Gopi Krishna TUMMALA
  • Patent number: 9383970
    Abstract: A platform that facilitates software application development, maintenance, and support includes a storage component that receives structured and unstructured data pertaining to at least one application subject to development, maintenance, or support and causes the structured and unstructured data to be stored in a distributed fashion over a plurality of accessible data repositories. The storage component causes the structured and unstructured data to be stored in the data repositories such that the structured and unstructured data is accessible through utilization of a common access format. An executor component executes an analytical process over the structured and unstructured data and generates a first dataset, wherein the storage component causes the first dataset to be stored in at least one of the plurality of accessible data repositories in a format that is accessible by front end analysis applications.
    Type: Grant
    Filed: August 13, 2009
    Date of Patent: July 5, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Joseph M. Joy, Balasubramanyan Ashok, Ganesan Ramalingam, Sriram K. Rajamani
  • Patent number: 8538909
    Abstract: A temporal rule-based feature extraction system and method for extracting features from temporal-based rules satisfied by a trace. Once a temporal-based rule is found that is satisfied by the trace, then embodiments of the temporal rule-based feature extraction system and method leverage that rule to either use as a feature or to extract additional features. The extracted feature then is used to characterize the trace. Embodiments of the system include a feature definition module, which defines features based on the temporal-based rules satisfied by a trace, and a similarity measure module, which defines a similarity measure for the defined features. The defined features include both extrinsic features, which are based on extrinsic properties of the rule, and intrinsic features, which are based on intrinsic properties of the rule. The similarity module generates similarity measures that indicate the similarity of two traces.
    Type: Grant
    Filed: December 17, 2010
    Date of Patent: September 17, 2013
    Assignee: Microsoft Corporation
    Inventors: Venkatesh-Prasad Ranganath, Piyush Goyal, Pradip Harindran Vallathol, Ganesan Ramalingam
  • Publication number: 20120331471
    Abstract: The claimed subject matter provides a method for executing molecular transactions on a distributed platform. The method includes generating a first unique identifier for executing a molecular transaction. The molecular transaction includes a first atomic action. The method further includes persisting a first work list record. The first work list record includes the first unique identifier and a step number for the first atomic action. Additionally, the method includes retrieving, by a first worker process of a runtime, the first work list record. The method also includes executing, by the first worker process, the first atomic action in response to determining that a first successful completion record for the first atomic action does not exist. Further, the method includes persisting, by the first worker process, the first successful completion record for the first atomic action in response to a successful execution of the first atomic action.
    Type: Application
    Filed: June 27, 2011
    Publication date: December 27, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Ganesan Ramalingam, Kapil Vaswani
  • Patent number: 8280899
    Abstract: An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. A data mining algorithm is executed over abstracted, quantified events to ascertain a correlation between the event and another event.
    Type: Grant
    Filed: October 14, 2009
    Date of Patent: October 2, 2012
    Assignee: Microsoft Corporation
    Inventors: David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
  • Publication number: 20120159263
    Abstract: A temporal rule-based feature extraction system and method for extracting features from temporal-based rules satisfied by a trace. Once a temporal-based rule is found that is satisfied by the trace, then embodiments of the temporal rule-based feature extraction system and method leverage that rule to either use as a feature or to extract additional features. The extracted feature then is used to characterize the trace. Embodiments of the system include a feature definition module, which defines features based on the temporal-based rules satisfied by a trace, and a similarity measure module, which defines a similarity measure for the defined features. The defined features include both extrinsic features, which are based on extrinsic properties of the rule, and intrinsic features, which are based on intrinsic properties of the rule. The similarity module generates similarity measures that indicate the similarity of two traces.
    Type: Application
    Filed: December 17, 2010
    Publication date: June 21, 2012
    Applicant: Microsoft Corporation
    Inventors: Venkatesh-Prasad Ranganath, Piyush Goyal, Pradip Harindran Vallathol, Ganesan Ramalingam
  • Patent number: 7941616
    Abstract: Locks are used to protect variables. All variables protected by a lock are allocated on a page associated with a lock. When a thread (called the owner) acquires the lock, a local copy of the memory page containing the variable is created, the original memory page is protected, and all access of the variable in the owner thread is directed to the local copy. Upon releasing the lock, the changes from the local copy are carried over to the memory page and the memory page is unprotected. Any concurrent access of the variable by non-owner threads triggers an exception handler (due to the protection mechanism) and delays such an access until after the owner thread has finished accessing the variable.
    Type: Grant
    Filed: October 21, 2008
    Date of Patent: May 10, 2011
    Assignee: Microsoft Corporation
    Inventors: Sriram Rajamani, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
  • Publication number: 20110087700
    Abstract: An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. A data mining algorithm is executed over abstracted, quantified events to ascertain a correlation between the event and another event.
    Type: Application
    Filed: October 14, 2009
    Publication date: April 14, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
  • Publication number: 20110040808
    Abstract: A platform that facilitates software application development, maintenance, and support includes a storage component that receives structured and unstructured data pertaining to at least one application subject to development, maintenance, or support and causes the structured and unstructured data to be stored in a distributed fashion over a plurality of accessible data repositories. The storage component causes the structured and unstructured data to be stored in the data repositories such that the structured and unstructured data is accessible through utilization of a common access format. An executor component executes an analytical process over the structured and unstructured data and generates a first dataset, wherein the storage component causes the first dataset to be stored in at least one of the plurality of accessible data repositories in a format that is accessible by front end analysis applications.
    Type: Application
    Filed: August 13, 2009
    Publication date: February 17, 2011
    Applicant: Microsoft Corporation
    Inventors: Joseph M. Joy, Balasubramanyan Ashok, Ganesan Ramalingam, Sriram K. Rajamani
  • Publication number: 20100169618
    Abstract: The claimed subject matter provides a system and/or a method that facilitates ensuring non-interference between multiple threads that access a shared resource. An interface can receive a portion of sequential code, wherein the portion of sequential code includes a property that is maintained and relied upon when invoked and executed by a sequential client. A synthesizer component can leverage a sequential proof related to the portion of sequential code in order to derive a concurrency control mechanism for a portion of concurrency code that maintains the property when invoked by a concurrent client, wherein the sequential proof identifies a concurrent interference at an execution point that is tolerable for the concurrent client.
    Type: Application
    Filed: December 30, 2008
    Publication date: July 1, 2010
    Applicant: Microsoft Corporation
    Inventors: Ganesan Ramalingam, Sriram Rajamani, Venkatesh-Prasad Ranganath, Kapil Vaswani, Jyotirmoy Vinay Deshmukh
  • Publication number: 20100100690
    Abstract: Locks are used to protect variables. All variables protected by a lock are allocated on a page associated with a lock. When a thread (called the owner) acquires the lock, a local copy of the memory page containing the variable is created, the original memory page is protected, and all access of the variable in the owner thread is directed to the local copy. Upon releasing the lock, the changes from the local copy are carried over to the memory page and the memory page is unprotected. Any concurrent access of the variable by non-owner threads triggers an exception handler (due to the protection mechanism) and delays such an access until after the owner thread has finished accessing the variable.
    Type: Application
    Filed: October 21, 2008
    Publication date: April 22, 2010
    Applicant: MICROSOFT CORPORATION
    Inventors: Sriram Rajamani, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
  • Patent number: 7509298
    Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.
    Type: Grant
    Filed: March 31, 2006
    Date of Patent: March 24, 2009
    Assignee: International Business Machines Corporation
    Inventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
  • Publication number: 20080222069
    Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.
    Type: Application
    Filed: May 22, 2008
    Publication date: September 11, 2008
    Applicant: International Business Machines Corporation
    Inventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
  • Publication number: 20080222206
    Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.
    Type: Application
    Filed: May 22, 2008
    Publication date: September 11, 2008
    Applicant: International Business Machines Corporation
    Inventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
  • Publication number: 20070240109
    Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.
    Type: Application
    Filed: March 31, 2006
    Publication date: October 11, 2007
    Applicant: International Business Machines Corporation
    Inventors: Satish Chandra, John Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
  • Patent number: 6636866
    Abstract: A method and system for optimizing the representation of objects in an object-oriented programming language to reduce the memory requirement during the execution of the program, includes identifying the lifetimes of the various members of objects belonging to various classes. Next, the method uses the lifetime information to generate representations of objects belonging to these collections. Memory requirements are optimized by having members which do not have overlapping lifetimes share the same memory location.
    Type: Grant
    Filed: July 31, 2000
    Date of Patent: October 21, 2003
    Assignee: International Business Machines Corporation
    Inventor: Ganesan Ramalingam