Patent application number | Description | Published |
20090253744 | Acylated piperidine derivatives as melanocortin-4 receptor modulators - Certain novel N-acylated spiropiperidine derivatives are ligands of the human melanocortin receptor(s) and, in particular, are selective ligands of the human melanocortin-4 receptor (MC-4R). They are therefore useful for the treatment, control, or prevention of diseases and disorders responsive to the modulation of MC-4R, such as obesity, diabetes, nicotine addiction, alcoholism, sexual dysfunction, including erectile dysfunction and female sexual dysfunction. | 10-08-2009 |
20090325990 | ACYLATED SPIROPIPERIDINE DERIVATIVES AS MELANOCORTIN-4 RECEPTOR MODULATORS - Certain novel N-acylated spiropiperidine derivatives are ligands of the human melanocortin receptor(s) and, in particular, are selective ligands of the human melanocortin-4 receptor (MC-4R). They are therefore useful for the treatment, control, or prevention of diseases and disorders responsive to the modulation of MC-4R, such as obesity, diabetes, nicotine addiction, alcoholism, sexual dysfunction, including erectile dysfunction and female sexual dysfunction. | 12-31-2009 |
20100160306 | Acylated Piperidine Derivatives as Melanocortin-4 Receptor Agonists - Certain novel 4 alkyl substituted N acylated piperidine derivatives are ligands of the human melanocortin receptor(s) and, in particular, are selective ligands of the human melanocortin-4 receptor (MC-4R). They are therefore useful for the treatment, control, or prevention of diseases and disorders responsive to the modulation of MC-4R, such as obesity, diabetes, nicotine addiction, alcoholism, sexual dysfunction, including erectile dysfunction and female sexual dysfunction. | 06-24-2010 |
Patent application number | Description | Published |
20090138238 | Sequential fixed-point quantile estimation - Disclosed are method and apparatus for calculating a quantile estimate of a data stream. A quantile estimate is calculated iteratively by calculating a first quantile estimate and then calculating a second quantile estimate by adding a first update increment to the first estimate. A first observation sample is acquired. A first quantile estimate and a first standard deviation estimate are set to the sample quantile and the sample standard deviation of the first observation sample. A second observation sample is then acquired. A second standard deviation estimate is calculated based at least in part on the first standard deviation estimate and the sample standard deviation of the second observation sample. A first update increment is calculated based at least in part on the second observation sample and based at least in part on the product of the second standard deviation estimate times a log odds ratio function. | 05-28-2009 |
20100121980 | METHOD OF GENERATING ROUND ROBIN SERVICE ORDER LISTS FOR IMPROVING SERVICE PERFORMANCE DURING SERVER FAILURES - A network communication node includes a request distribution manager that combines a plurality of permutations of sequences for routing requests to a plurality of servers. The request distribution managers also generates instructions for routing the requests to the plurality of servers, based on the combination of the plurality of permutations. The network communication node also includes a router that routes the requests to the plurality of servers based on the instructions. | 05-13-2010 |
20100157789 | RANDOMIZED BACKUP ROUTING - A method of routing a call in a network includes receiving the call at a switching node; selecting a primary route to a destination of the call; determining that the primary route is unavailable; randomly selecting, by the switching node, at least one of a plurality of predetermined backup routes for the primary route; and routing the call to the destination over one of the selected backup routes. | 06-24-2010 |
20100157816 | Method and System for Evaluating Network Connectivity In Rule-Based Applications - A computer readable storage medium includes a set of instructions executable by a processor. The instructions are operable to assign a unique identifier to each of a plurality of node subsets of a network, the node subsets being created by damage to the network; assign one or more of the identifiers to each of a plurality of components of the damaged network based on a connectivity to the one or more of the node subsets and corresponding identifiers of the node subsets; assign one or more of the identifiers to each of one or more node types of the plurality of components by assigning each of the node types all of the identifiers of any of the components of the node type; and evaluate a first connectivity between a first one of the components and a second one of the components by determining whether they share at least one of the identifiers. | 06-24-2010 |
20100157842 | Method and System for Discovering Isolated Network Fragments - A computer readable storage medium includes a set of instructions executable by a processor. The instructions are operable to receive a node indication for each of a plurality of undamaged backbone nodes of a communication network; receive a link indication for each of a plurality of backbone links connected between undamaged backbone nodes of the communication network; and assign a fragment identifier to each of a plurality of backbone fragments, each of the backbone fragments comprising one or more of the backbone nodes, wherein the one or more backbone nodes comprising each backbone fragment indicates connectivity between the one or more backbone nodes. | 06-24-2010 |
20100165838 | METHOD AND APPARATUS FOR IMPROVING DATA THROUGHPUT IN A NETWORK - A method and apparatus for improving data throughput in a network are disclosed. For example, the method receives at least one packet from a first device, and generates an acknowledgement message for verifying a receipt of the at least one packet, wherein the acknowledgement message comprises a precedence value that indicates that the acknowledgement message is to be handled with a priority in accordance with the precedence value. The method sends the acknowledgement message to the first device. | 07-01-2010 |
20110149949 | METHOD AND APPARATUS FOR CLEARING HANG CALLS - A method, computer readable medium and apparatus for clearing hang calls in a communication network are disclosed. For example, the method detects a failure of an adjacent call stateful network element in a signaling path, identifies one or more calls that are affected by the failure of the adjacent call stateful network element, tests a media path of the one or more calls for activity and clears the one or more calls that are affected by the failure of the adjacent call stateful network element if the media path of the one or more calls is inactive. | 06-23-2011 |
20110158083 | Determining Connectivity in a Failed Network - The disclosed technology, in one embodiment, involves a method that improves the execution speed of graph algorithms that are commonly used by network service providers for network analysis and/or design. The disclosed technology can be use to provide significant efficiency improvements when applied to networks that are separated into several isolated fragments (“fragmented networks”) due to severe damage that may be caused by either natural disaster (such as hurricanes or earthquakes), or planned adversary attacks. In one embodiment of the disclosed technology, a graph algorithm, that is used to determine a characteristic of the network, is not applied directly to the whole network/graph. Instead, the graph algorithm is applied to isolated network/graph fragments that are identified, for example, by using a fragment discovery algorithm. The graph algorithm is then applied to one or more relevant fragments. The results may be combined to obtain a network wide result. | 06-30-2011 |
20120159233 | METHOD OF GENERATING ROUND ROBIN SERVICE ORDER LISTS FOR IMPROVING SERVICE PERFORMANCE DURING SERVER FAILURES - A method controls the routing of service requests to a plurality of servers using a first routing distribution algorithm. The method includes waiting a first period of time for a designated server to respond to a service request, transmitting the service request to the designated server a second time, and waiting a second period to time for the designated server to respond to the service request assigned to the designated server, the second period of time being longer than the first period of time. The method also includes determining that the designated server has failed, rerouting the service request to a different server, and routing the service requests to the plurality of servers using a second routing distribution algorithm. | 06-21-2012 |