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).
-
Patent number: 10580164Abstract: 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: GrantFiled: April 5, 2018Date of Patent: March 3, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Ganesan Ramalingam, Ramachandran Ramjee, Romil Bhardwaj, Gopi Krishna Tummala
-
Publication number: 20190311494Abstract: 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: ApplicationFiled: April 5, 2018Publication date: October 10, 2019Applicant: Microsoft Technology Licensing, LLCInventors: Ganesan RAMALINGAM, Ramachandran RAMJEE, Romil BHARDWAJ, Gopi Krishna TUMMALA
-
Patent number: 9383970Abstract: 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: GrantFiled: August 13, 2009Date of Patent: July 5, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Joseph M. Joy, Balasubramanyan Ashok, Ganesan Ramalingam, Sriram K. Rajamani
-
Patent number: 8538909Abstract: 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: GrantFiled: December 17, 2010Date of Patent: September 17, 2013Assignee: Microsoft CorporationInventors: Venkatesh-Prasad Ranganath, Piyush Goyal, Pradip Harindran Vallathol, Ganesan Ramalingam
-
Publication number: 20120331471Abstract: 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: ApplicationFiled: June 27, 2011Publication date: December 27, 2012Applicant: MICROSOFT CORPORATIONInventors: Ganesan Ramalingam, Kapil Vaswani
-
Patent number: 8280899Abstract: 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: GrantFiled: October 14, 2009Date of Patent: October 2, 2012Assignee: Microsoft CorporationInventors: David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
-
Publication number: 20120159263Abstract: 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: ApplicationFiled: December 17, 2010Publication date: June 21, 2012Applicant: Microsoft CorporationInventors: Venkatesh-Prasad Ranganath, Piyush Goyal, Pradip Harindran Vallathol, Ganesan Ramalingam
-
Patent number: 7941616Abstract: 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: GrantFiled: October 21, 2008Date of Patent: May 10, 2011Assignee: Microsoft CorporationInventors: Sriram Rajamani, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
-
Publication number: 20110087700Abstract: 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: ApplicationFiled: October 14, 2009Publication date: April 14, 2011Applicant: MICROSOFT CORPORATIONInventors: David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
-
Publication number: 20110040808Abstract: 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: ApplicationFiled: August 13, 2009Publication date: February 17, 2011Applicant: Microsoft CorporationInventors: Joseph M. Joy, Balasubramanyan Ashok, Ganesan Ramalingam, Sriram K. Rajamani
-
Publication number: 20100169618Abstract: 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: ApplicationFiled: December 30, 2008Publication date: July 1, 2010Applicant: Microsoft CorporationInventors: Ganesan Ramalingam, Sriram Rajamani, Venkatesh-Prasad Ranganath, Kapil Vaswani, Jyotirmoy Vinay Deshmukh
-
Publication number: 20100100690Abstract: 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: ApplicationFiled: October 21, 2008Publication date: April 22, 2010Applicant: MICROSOFT CORPORATIONInventors: Sriram Rajamani, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
-
Patent number: 7509298Abstract: 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: GrantFiled: March 31, 2006Date of Patent: March 24, 2009Assignee: International Business Machines CorporationInventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
-
Publication number: 20080222069Abstract: 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: ApplicationFiled: May 22, 2008Publication date: September 11, 2008Applicant: International Business Machines CorporationInventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
-
Publication number: 20080222206Abstract: 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: ApplicationFiled: May 22, 2008Publication date: September 11, 2008Applicant: International Business Machines CorporationInventors: Satish Chandra, John H. Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
-
Publication number: 20070240109Abstract: 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: ApplicationFiled: March 31, 2006Publication date: October 11, 2007Applicant: International Business Machines CorporationInventors: Satish Chandra, John Field, Raghavan Komondoor, Ganesan Ramalingam, Saurabh Sinha
-
Patent number: 6636866Abstract: 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: GrantFiled: July 31, 2000Date of Patent: October 21, 2003Assignee: International Business Machines CorporationInventor: Ganesan Ramalingam
-
Patent number: 6301700Abstract: Given a class hierarchy (a collection of classes and inheritance relations among them) and a program P that uses the hierarchy, a slice of the class hierarchy is computed with respect to the program by eliminating from the hierarchy those data members, member functions, classes, and inheritance relations that are unnecessary for ensuring that the semantics of P is maintained.Type: GrantFiled: April 7, 1999Date of Patent: October 9, 2001Assignee: International Business Machines CorporationInventors: Jong-Deok Choi, John H. Field, Ganesan Ramalingam, Frank Tip
-
Patent number: 6279149Abstract: An efficient program analysis method is provided for lazily decomposing aggregates (such as records and arrays) into simpler components based on the access patterns specific to a given program. This process allows us both to identify implicit aggregate structure not evident from declarative information in the program, and to simplify the representation of declared aggregates when references are made only to a subset of their components. The method can be exploited to yield: (i) a fast type analysis method applicable to program maintenance applications (such as date usage inference for the Year 2000 problem); and (ii) an efficient method for atomization of aggregates. More specifically, aggregate atomization decomposes all of the data that can be manipulated by the program into a set of disjoint atoms such that each data reference can be modeled as one or more references to atoms without loss of semantic information.Type: GrantFiled: September 24, 1998Date of Patent: August 21, 2001Assignee: International Business Machines CorporationInventors: John H. Field, Ganesan Ramalingam, Frank Tip
-
Patent number: 6179491Abstract: Given a class hierarchy (a collection of classes and inheritance relations among them) and a program P that uses the hierarchy, a slice of the class hierarchy is computed with respect to the program by eliminating from the hierarchy those data members, member functions, classes, and inheritance relations that are unnecessary for ensuring that the semantics of P is maintained.Type: GrantFiled: February 5, 1997Date of Patent: January 30, 2001Assignee: International Business Machines CorporationInventors: Jong-Deok Choi, John H. Field, Ganesan Ramalingam, Frank Tip