Patents by Inventor Aravind Srinivasan

Aravind Srinivasan 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: 8209132
    Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins and saccharides attached to lipids. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information from the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation. Such methods are also provided. Methods are further provided to assess production processes, to assess the purity of samples containing glycoconjugates, and to select glycoconjugates with the desired glycosylation.
    Type: Grant
    Filed: November 20, 2009
    Date of Patent: June 26, 2012
    Assignees: Momenta Pharmaceuticals, Inc., Massachusetts Institute of Technology
    Inventors: Carlos Bosques, Nishla Keiser, Aravind Srinivasan, Rahul Raman, Karthik Viswanathan, Ram Sasisekharan, Pankaj Gandhe, Sasi Raguram
  • Patent number: 8176051
    Abstract: A system and method for searching a bytestream or other string in a case insensitive manner. In a preferred embodiment, the present invention includes an ASCII tree that associated both upper and lower case letters of an incoming header key (or other symbols) with nodes. When enough nodes are gathered, a target word is found.
    Type: Grant
    Filed: May 27, 2004
    Date of Patent: May 8, 2012
    Assignee: International Business Machines Corporation
    Inventors: Erik John Burckart, Madhu K. Chetuparambil, Rohit Dilip Kelapure, Jeffrey A. Lee, Aravind Srinivasan, Kevin Edward Vaughan
  • Patent number: 8141042
    Abstract: A computer-implementable method, system and computer-usable medium for extending the portability of code to a limited-class environment are disclosed. In a preferred embodiment, the method includes the steps of: identifying any full-version-only objects that are not in a reduced-version of a language, wherein the reduced-version of the language comprises a reduced portion of objects that are in a full-version of the language; associating a full-version-only object with a set of one or more objects in the reduced-version of the language, wherein the full-version-only object is functionally equivalent to the set of one or more objects in the reduced-version of the language; identifying any full-version-only objects in a software program; and creating a reduced-version of the software program by replacing any identified full-version-only objects with a functionally equivalent set of one or more objects from the reduced-version of the language.
    Type: Grant
    Filed: March 6, 2007
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Zhi Gan, Ying Chun Guo, Rahul Kurane, Aravind Srinivasan
  • Patent number: 8000904
    Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information regarding the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation on protein function. Such methods are also provided. Methods are also provided to assess protein production processes, to assess the purity of proteins produced, and to select proteins with the desired glycosylation.
    Type: Grant
    Filed: October 6, 2009
    Date of Patent: August 16, 2011
    Assignees: Momenta Pharmaceuticals, Inc., Massachusetts Institute of Technology
    Inventors: Nishla Keiser, Carlos Bosques, Ram Sasisekharan, Pankaj Gandhe, Sasi Raguram, Aravind Srinivasan
  • Patent number: 7774380
    Abstract: The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.
    Type: Grant
    Filed: December 21, 2007
    Date of Patent: August 10, 2010
    Assignee: International Business Machines Corporation
    Inventors: Thomas C. Burke, Annapureddy S. Reddy, Aravind Srinivasan
  • Publication number: 20100144553
    Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins and saccharides attached to lipids. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information from the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation. Such methods are also provided. Methods are further provided to assess production processes, to assess the purity of samples containing glycoconjugates, and to select glycoconjugates with the desired glycosylation.
    Type: Application
    Filed: November 20, 2009
    Publication date: June 10, 2010
    Applicants: MASSACHUSETTS INSTITUTE OF TECHNOLOGY, MOMENTA PHARMACEUTICALS, INC.
    Inventors: Carlos Bosques, Nishla Keiser, Aravind Srinivasan, Rahul Raman, Karthik Viswanathan, Ram Sasisekharan, Pankaj Gandhe, Sasi Raguram
  • Publication number: 20100136599
    Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information regarding the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation on protein function. Such methods are also provided. Methods are also provided to assess protein production processes, to assess the purity of proteins produced, and to select proteins with the desired glycosylation.
    Type: Application
    Filed: October 6, 2009
    Publication date: June 3, 2010
    Applicants: Massachusetts Institute of Technology, Momenta Pharmaceuticals, Inc.
    Inventors: Pankaj Gandhe, Sasi Raguram, Carlos Bosques, Nishla Keiser, Aravind Srinivasan, Ram Sasisekharan
  • Publication number: 20100061990
    Abstract: The present invention provides a system for analyzing interactions between glycans and interaction partners that bind to them. The present invention also provides HA polypeptides that bind to umbrella-topology glycans, and reagents and methods relating thereto.
    Type: Application
    Filed: August 14, 2007
    Publication date: March 11, 2010
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Ram Sasisekharan, Karthik Viswanathan, Aarthi Chandrasekaran, Rahul Raman, Aravind Srinivasan, S. Raguram, Viswanathan Sasisekharan
  • Publication number: 20100004195
    Abstract: The present invention provides umbrella-topology glycan decoys. The present invention provides systems and methods treating influenza infection utilizing inventive umbrella-topology glycan decoys. The present invention provides methods for identifying novel umbrella-topology glycan decoys.
    Type: Application
    Filed: January 2, 2009
    Publication date: January 7, 2010
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Ram Sasisekharan, Karthik Viswanathan, Aarthi Chandrasekaran, Rahul Raman, Aravind Srinivasan, S. Raguram, Viswanathan Sasisekharan
  • Publication number: 20090269342
    Abstract: The present invention provides a system for analyzing interactions between glycans and interaction partners that bind to them. The present invention also provides HA polypeptides that bind to umbrella-topology glycans, and reagents and methods relating thereto.
    Type: Application
    Filed: January 2, 2009
    Publication date: October 29, 2009
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Ram Sasisekharan, Karthik Viswanathan, Aarthi Chandrasekaran, Rahul Raman, Aravind Srinivasan, S. Raguram, Viswanathan Sasisekharan
  • Publication number: 20090164485
    Abstract: The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.
    Type: Application
    Filed: December 21, 2007
    Publication date: June 25, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: THOMAS C. BURKE, ANNAPUREDDY S. REDDY, ARAVIND SRINIVASAN
  • Patent number: 7543069
    Abstract: Session state affinity is maintained in a workload balancing system that includes a hypertext transfer protocol (HTTP) routing server and a plurality of application servers. The application servers maintain backup session state information for a first session to a first server of the plurality of application servers at fewer than all of the plurality of application servers, detect the unavailability of the first application server at an application server of the plurality of application servers other than the first application and determine a second server that continues the first session. An identification of the second server and the first session is sent from an application server of the plurality of application servers to a HTTP routing server responsive to detecting the unavailability of the first server.
    Type: Grant
    Filed: October 18, 2004
    Date of Patent: June 2, 2009
    Assignee: International Business Machines Corporation
    Inventors: Srinivas Hasti, Gabriel Garcia Montero, Aravind Srinivasan, Renganathan Sundararaman, Kevin Edward Vaughan
  • Patent number: 7523171
    Abstract: A mechanism by which URLs are progressively hashed character by character and clauses of the URL are used to traverse a tree data structure for matching of the URL to resources/rules is provided. The hash code for a single character is appended to a prior hash code for a preceding character in the URL portion. At the time that the entire portion of the URL is hashed, as determined based on the presence of a delimiter character, the particular node in a tree data structure associated with the resulting hash code is identifiable within a hash table of a current node of the tree data structure. Each node in the tree data structure includes a multidimensional hash table for a portion of a URL. The multidimensional hash table is established and grown in a manner that ensures there are no hash collisions.
    Type: Grant
    Filed: September 9, 2003
    Date of Patent: April 21, 2009
    Assignee: International Business Machines Corporation
    Inventors: Erik John Burckart, Aravind Srinivasan
  • Publication number: 20090081193
    Abstract: The present invention provides a system for analyzing interactions between glycans and interaction partners that bind to them. The present invention also provides HA polypeptides that bind to umbrella-topology glycans, and reagents and methods relating thereto.
    Type: Application
    Filed: January 3, 2008
    Publication date: March 26, 2009
    Applicant: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
    Inventors: Ram Sasisekharan, Karthik Viswanathan, Aarthi Chandrasekaran, Rahul Raman, Aravind Srinivasan, S. Raguram, Viswanathan Sasisekharan
  • Publication number: 20080241918
    Abstract: The present invention provides a system for analyzing interactions between glycans and interaction partners that bind to them. The present invention also provides HA polypeptides that bind to umbrella-topology glycans, and reagents and methods relating thereto.
    Type: Application
    Filed: August 14, 2007
    Publication date: October 2, 2008
    Inventors: Ram Sasisekharan, Karthik Viswanathan, Aarthi Chandrasekaran, Rahul Raman, Aravind Srinivasan, S. Raguram, Viswanathan Sasisekharan
  • Patent number: 7427497
    Abstract: Disclosed herein is a microfluidics device that can be used to prepare natural products and their analogs. The device comprises the enzymes of a biosynthetic pathway immobilized thereon and a means for sequentially directing a starting material and each ensuing reaction product to the enzymes of the biosynthetic pathway in the order corresponding to the steps of the biosynthetic pathway. The device can thus be used to prepare the natural product using the natural starting material of the biosynthetic pathway or analogs of the natural product using an unnatural starting material. Alternatively, artificial pathways can be created by immobilizing an appropriate selection of enzymes on the device in an order whereby each subsequent enzyme can catalyze a reaction with the product of the prior enzyme. Novel chemical entities can be prepared from these artificial pathways.
    Type: Grant
    Filed: November 1, 2002
    Date of Patent: September 23, 2008
    Assignees: Rensselaer Polytechnic Institute, Darpa, The Regents of the University of California
    Inventors: Jonathan S. Dordick, Aravind Srinivasan, Jungbae Kim, David H. Sherman, Douglas S. Clark
  • Publication number: 20080222607
    Abstract: A computer-implementable method, system and computer-usable medium for extending the portability of code to a limited-class environment are disclosed. In a preferred embodiment, the method includes the steps of: identifying any full-version-only objects that are not in a reduced-version of a language, wherein the reduced-version of the language comprises a reduced portion of objects that are in a full-version of the language; associating a full-version-only object with a set of one or more objects in the reduced-version of the language, wherein the full-version-only object is functionally equivalent to the set of one or more objects in the reduced-version of the language; identifying any full-version-only objects in a software program; and creating a reduced-version of the software program by replacing any identified full-version-only objects with a functionally equivalent set of one or more objects from the reduced-version of the language.
    Type: Application
    Filed: March 6, 2007
    Publication date: September 11, 2008
    Inventors: Zhi Gan, Ying Chun Guo, Rahul Kurane, Aravind Srinivasan
  • Publication number: 20080028086
    Abstract: A Fragment Aggregator utilizes an application independent surrogate to dispatch fragments and receive responses between isolated web applications. Clients send web application requests to the surrogate, which forwards the request to an isolated web application. When a web application requires other isolated web applications to execute the request, the web application responds to the request with a deferred response. The deferred response includes request fragments for the other isolated web applications. The Fragment Aggregator dispatches the fragments to the other isolated web applications. After receiving responses from the isolated web applications, the Fragment Aggregator combines the response and sends them to the client.
    Type: Application
    Filed: July 27, 2006
    Publication date: January 31, 2008
    Inventors: Madhu K. Chetuparambil, Srinivas Hasti, Stephan Hesmer, Todd E. Kaplinger, Subbarao Meduri, Maxim A. Moldenhauer, Aravind Srinivasan
  • Publication number: 20080016194
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to edgified content delivery and provide a method, system and computer program product for dispatching of request fragments from a response aggregating surrogate. In one embodiment, an edgified content distribution data processing system can include an origin server configured to server markup specified pages formed from dynamically arranged fragments and a surrogate server communicatively linked to the origin server over a computer communications network and acting as a surrogate at an edge of the network on behalf of the origin server. A dependency engine can be coupled to the surrogate server and can include program code enabled to group the fragments according to interdependencies among the fragments and to load fragment groups in sequence to satisfy the interdependencies.
    Type: Application
    Filed: July 17, 2006
    Publication date: January 17, 2008
    Applicant: International Business Machines Corporation
    Inventors: Madhu Chetuparambil, Srinivas Hasti, Stephan Hesmer, Todd E. Kaplinger, Subbarao K. Meduri, Maxim A. Moldenhauer, Aravind Srinivasan
  • Patent number: 7280526
    Abstract: Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value.
    Type: Grant
    Filed: January 17, 2002
    Date of Patent: October 9, 2007
    Assignee: Lucent Technologies Inc.
    Inventors: Lisa Karen Fleischer, Iraj Saniee, Frederick Bruce Shepherd, Aravind Srinivasan