Patents by Inventor Ramesh A

Ramesh A 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: 20110167156
    Abstract: Multiple transaction components that comprise a transaction are correlated using a GUID generated at a browser application. The transaction components may occur asynchronously or synchronously between a network browser and one or more applications. An identifier is generated for a set of network browser requests corresponding to a single user input or some other event and the identifier is included in each request. Server traffic and the servers processing the request are monitored and data which includes the identifier is generated. Data for the transaction with multiple transaction components is reported using the GUID associated with the transaction.
    Type: Application
    Filed: March 16, 2011
    Publication date: July 7, 2011
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Ramesh Mani, Brian Zuzga, Ling Thio
  • Publication number: 20110164690
    Abstract: A receiver system and method for determining the location of a device in a wireless network having a plurality of transmitters is provided. The method includes receiving a signal at the device, transforming the received signal into a time-domain signal having a characteristic, and computing a range of the device from each of the plurality of transmitters based on the characteristic. Additionally, the method includes determining the location of the device based on the computed ranges. In certain embodiments, the characteristic may be a time of arrival, time difference of arrival, or a signal strength, and the wireless network is a DTV broadcasting network.
    Type: Application
    Filed: July 2, 2010
    Publication date: July 7, 2011
    Applicant: MaxLinear, Inc.
    Inventors: Sridhar Ramesh, Curtis Ling
  • Patent number: 7972555
    Abstract: Methods for fabricating compressible object are described. These compressible objects may be utilized in drilling mud and with a drilling system to manage the density of the drilling mud. The method includes selecting an architecture for a compressible object; selecting a wall material for the compressible object; and fabricating the compressible object, wherein the compressible object has a shell that encloses an interior region, and has an internal pressure (i) greater than about 200 pounds per square inch at atmospheric pressure and (ii) selected for a predetermined external pressure, wherein external pressures that exceed the internal pressure reduce the volume of the compressible object.
    Type: Grant
    Filed: October 16, 2008
    Date of Patent: July 5, 2011
    Assignee: ExxonMobil Upstream Research Company
    Inventors: Richard S. Polizzotti, Dennis George Peiffer, Ramesh Gupta, Norman M. Pokutylowicz, Barbara Carstensen, Michael J. Luton, Paul Matthew Spiecker
  • Patent number: 7974106
    Abstract: Systems, methods and devices for power generation systems are described. In particular, embodiments of the invention relate to the architecture of power conditioning systems for use with fuel cells and methods used therein. More particularly, embodiments of the present invention relate to methods and systems usable to reduce ripple currents in fuel cells.
    Type: Grant
    Filed: May 7, 2007
    Date of Patent: July 5, 2011
    Assignee: Bloom Energy Corporation
    Inventors: Ranganathan Gurunathan, Ramesh Srinivasan, Pavana Kumar
  • Publication number: 20110161169
    Abstract: One or more attributes of a user are determined. A given advertisement for an product or service, such as a product or a service, is selected from a number of advertisements for the product or service, based on the attributes of the user. The given advertisement for the product or service that is selected is then electronically displayed, for viewing by the user.
    Type: Application
    Filed: December 24, 2009
    Publication date: June 30, 2011
    Inventors: Sandeep Ramesh, Dwip N. Banerjee, Sachin C. Punadikar, Vipin Rathor
  • Publication number: 20110161785
    Abstract: A method is provided for transmitting a digital signal between at least two transmitters and at least one receiver, using a concatenation of at least two codes. The method includes a first encoding step, in the transmitters, which outputs at least two first code words; a first transmission step of the first code words, via at least two distinct transmission channels; a receiving step, in at least one relay device, of at least two of the first code words, known as intermediate code words; a step of intertwining at least one part of the bits of the intermediate code words that outputs the intertwined bits; a second step of encoding the intertwined bits, in the relay(s), which outputs at least one second code word, taking into consideration the intermediate code words; a second step of transmitting the second code word(s) through the relay device(s), so as to enable, in the receiver(s), an iterative decoding, taking into account the first code words, and then a redundancy formed by the second code word(s).
    Type: Application
    Filed: March 31, 2009
    Publication date: June 30, 2011
    Applicants: FRANCE TELECOM, INSTITUT TELECOM/TELECOM BRETAGNE
    Inventors: Ramesh Pyndiah, Andrzej Kabat, Karine Amis, Frédéric Guilloud
  • Publication number: 20110161470
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Application
    Filed: March 7, 2011
    Publication date: June 30, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
  • Publication number: 20110161121
    Abstract: A method, system, and article for management of travel and travel related matters. Both a source and a designation are selected, together with the associated departure and arrival information and the mode of transportation. A geographic region affected by a health related event is identified, and then employed to determine if a craft in support of the selected travel has been or is intended to be in the identified region. Exposure to the identified health related event may be mitigated by supporting an amendment to the mode of transportation.
    Type: Application
    Filed: December 25, 2009
    Publication date: June 30, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Abhinay R. Nagpal, Sandeep Ramesh Patil, Dhaval K. Shah, Yan W. Stein
  • Publication number: 20110156684
    Abstract: A DC-DC converter system having at least one DC-DC converter operating in either a PWM mode or a PFM mode is provided. The DC-DC converter system includes a state machine configured to control the switching between the PWM mode and PFM mode. The state machine determines whether an inductor current provided by the DC-DC converter reaches a first specified value for a selective number of clock cycles so switching between the PWM mode and PFM mode is to occur. A pulse generator circuit is connected to the state machine and being configured to provide the appropriate switching period for the PWM mode and the PFM mode at the time of switching. The pulse generator circuit is shared amongst the PWM mode or PFM mode and utilizes a master clock for its operations.
    Type: Application
    Filed: December 24, 2009
    Publication date: June 30, 2011
    Inventors: José Barreiro da Silva, Rajul Ramesh Shah, Patrick Stanley Riehl
  • Patent number: 7969323
    Abstract: An instrumented component (18, 19) for use in various operating environments such as within a combustion turbine engine (10). The component (18, 19) may have a substrate, a sensor (50, 94, 134) connected with the substrate for sensing a condition of the component (18, 19) during operation of the combustion turbine (10) and a connector (52, 92, 140) attached to the substrate and in communication with the sensor (50, 94, 134) for routing a data signal from the sensor (50, 94, 134) to a termination location (53). The component (18, 19) may include a wireless telemetry device (54, 76, 96) in communication with the connector (52, 92, 140) for wirelessly transmitting the data signal. Recesses (114, 116) may be formed with a root portion (112, 132) of components (18, 19) within which wireless telemetry device (54, 76, 96) may be affixed.
    Type: Grant
    Filed: September 14, 2006
    Date of Patent: June 28, 2011
    Assignee: Siemens Energy, Inc.
    Inventors: David J. Mitchell, Anand A. Kulkarni, Ramesh Subramanian, Edward R. Roesch
  • Patent number: 7970970
    Abstract: In one embodiment, a switch is configured to be coupled to an interconnect. The switch comprises a plurality of storage locations and an arbiter control circuit coupled to the plurality of storage locations. The plurality of storage locations are configured to store a plurality of requests transmitted by a plurality of agents. The arbiter control circuit is configured to arbitrate among the plurality of requests stored in the plurality of storage locations. A selected request is the winner of the arbitration, and the switch is configured to transmit the selected request from one of the plurality of storage locations onto the interconnect. In another embodiment, a system comprises a plurality of agents, an interconnect, and the switch coupled to the plurality of agents and the interconnect. In another embodiment, a method is contemplated.
    Type: Grant
    Filed: May 26, 2010
    Date of Patent: June 28, 2011
    Assignee: Apple Inc.
    Inventors: Sridhar P. Subramanian, James B. Keller, Ruchi Wadhawan, George Kong Yiu, Ramesh Gunna
  • Patent number: 7970861
    Abstract: Systems, methods, and computer storage media for load balancing at a client device in a distributed computing environment based on a dynamic validity duration and utilization metrics of one or more data stores are provided. The client device selects a data store from a plurality of data stores that each maintains a copy of a datum. The selection of data stores by a client is based on utilization metrics of the data stores. The utilization metrics are stored at the client. A data store determines if a request for a particular datum may be fulfilled within a validity period associated with a request from the client. The validity period is dynamically changed by the client across multiple requests to aid in the load balancing process. Additionally, a gossip protocol may be used to propagate utilization metrics of a plurality of data stores across the system.
    Type: Grant
    Filed: November 18, 2009
    Date of Patent: June 28, 2011
    Assignee: Microsoft Corporation
    Inventors: Huseyin Simitci, Aaron W. Ogus, Ramesh Shankar
  • Patent number: 7970905
    Abstract: A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins.
    Type: Grant
    Filed: July 3, 2008
    Date of Patent: June 28, 2011
    Assignee: International Business Machines Corporation
    Inventors: Ramesh Baskaran, Sameep Mehta, Anindya Neogi, Vinayaka D. Pandit, Gyana Ranjan Parija, Akshat Verma
  • Patent number: 7968485
    Abstract: There is described a Ceramic Powder, a Ceramic Layer and a Layer System of Two Pyrochlore Phases and Oxides. Besides a good thermal insulation property, thermal insulation layer systems must also have a long lifetime of the thermal insulation layer. The layer system has a ceramic layer, which comprises a mixture of two pyrochlore phases.
    Type: Grant
    Filed: May 6, 2008
    Date of Patent: June 28, 2011
    Assignee: Siemens Aktiengesellschaft
    Inventor: Ramesh Subramanian
  • Publication number: 20110153737
    Abstract: A capability is provided for decomposing a P2P network into a plurality of sub-networks and, further, for using the decomposed P2P network. A P2P network is decomposed to form a plurality of sub-networks, where each of the sub-networks is a P2P network. A P2P network may be decomposed into sub-networks based on one or more decomposition criteria (e.g., geographic location, community of interest, and the like, as well as various combinations thereof). The decomposition of the P2P network is encoded in a network map. A node may use the network map to join the decomposed P2P network. A node may join one, some, or all of the sub-networks. The sub-networks of a decomposed P2P network may be arranged in any suitable number of hierarchical levels.
    Type: Application
    Filed: December 17, 2009
    Publication date: June 23, 2011
    Inventors: Thomas P. Chu, Ramesh Nagarajan
  • Publication number: 20110154031
    Abstract: A file server receives a request from a client to mount an encrypted file system. The file server informs the client that the requested file system is encrypted and, in turn, receives a session ticket from the client that includes a security protocol mounting selection. The file server decrypts the client's user's encrypted private key, and then decrypts the requested encrypted file system using the private key. In turn, the file server sends the decrypted file system to the client over a secure channel, which is based upon the security protocol mounting selection. In one embodiment, a key distribution center server receives a request from the client for the client's user to access the encrypted file system at the file server. The key distribution center server retrieves an intermediate key; includes the intermediate key in a session ticket; and sends the session ticket to the client.
    Type: Application
    Filed: December 21, 2009
    Publication date: June 23, 2011
    Applicant: International Business Machines Corporation
    Inventors: Dwip N. Banerjee, Sachin Chandrakant Punadikar, Sandeep Ramesh Patil, Ravi A. Shankar
  • Publication number: 20110153634
    Abstract: A capability is provided for supporting a service location capability in a peer-to-peer network (P2P), such as a Chord network or other P2P network. In one embodiment, a method for locating a service within a P2P network is provided. The P2P network includes a plurality of nodes, including a target node which performs the method for locating the service within the P2P network. The target node includes a search table including a plurality of entries identifying a respective plurality of nodes of the P2P network. The method includes detecting a request to search for the service within the P2P network and initiating, toward at least one of the nodes of the search table, a service search request. The service search request is a request to identify at least one node of the P2P network that supports the service. The service search request includes information indicative of the service and a search range for use by the node receiving the service search request.
    Type: Application
    Filed: December 17, 2009
    Publication date: June 23, 2011
    Inventors: Thomas P. Chu, Ramesh Nagarajan
  • Publication number: 20110149992
    Abstract: An apparatus for imposing preferences on broadcast/multicast service for an end-user is described herein. The apparatus includes a first tuner that receives a first set of data transmitted from a currently selected broadcast/multicast station, wherein the first set of data includes time, station identification, and program information; a second tuner that receives a second set of data from a plurality of broadcast/multicast stations, wherein the second set of data includes individually, for each broadcast/multicast station that is available, time, station identification, and program information; a decoder that decodes the first and second sets of data received by the first and second tuners and sends this decoded data to a decision engine for further processing; and a persona database that stores a plurality of user preference profiles.
    Type: Application
    Filed: December 18, 2009
    Publication date: June 23, 2011
    Inventors: Ranjan Sharma, Ramesh Pattabhiraman
  • Publication number: 20110147004
    Abstract: Method for adapting a template to a target data set. The template may be used to remove noise from, or interpret noise in, the target data set. The target data set is transformed (550) using a selected complex-valued, directional, multi-resolution transform (‘CDMT’) satisfying the Hubert transform property at least approximately. An initial template is selected, and it is transformed (551) using the same CDMT. Then the transformed template is adapted (560) to the transformed target data by adjusting the template's expansion coefficients within allowed ranges of adjustment so as to better match the expansion coefficients of the target data set. Multiple templates may be simultaneously adapted to better fit the noise or other component of the data that it may be desired to represent by template.
    Type: Application
    Filed: August 28, 2008
    Publication date: June 23, 2011
    Inventors: Ramesh Neelamani, Anatoly Baumstein, Warren S. Ross
  • Patent number: D640554
    Type: Grant
    Filed: June 30, 2010
    Date of Patent: June 28, 2011
    Inventor: Ramesh Krishnamoorthy