Patent application number | Description | Published |
20100003736 | Polynucleotides encoding novel PCSK9 variants - The present invention provides novel polynucleotides encoding PCSK9b and PCSK9c polypeptides, fragments and homologues thereof. Also provided are vectors, host cells, antibodies, and recombinant and synthetic methods for producing said polypeptides. The invention further relates to diagnostic and therapeutic methods for applying these novel PCSK9b and PCSK9c polypeptides to the diagnosis, treatment, and/or prevention of various diseases and/or disorders related to these polypeptides. The invention further relates to screening methods for identifying agonists and antagonists of the polynucleotides and polypeptides of the present invention. | 01-07-2010 |
20110076742 | POLYNUCLEOTIDES ENCODING NOVEL PCSK9 VARIANTS - The present invention provides novel polynucleotides encoding PCSK9b and PCSK9c polypeptides, fragments and homologues thereof. Also provided are vectors, host cells, antibodies, and recombinant and synthetic methods for producing said polypeptides. The invention further relates to diagnostic and therapeutic methods for applying these novel PCSK9b and PCSK9c polypeptides to the diagnosis, treatment, and/or prevention of various diseases and/or disorders related to these polypeptides. The invention further relates to screening methods for identifying agonists and antagonists of the polynucleotides and polypeptides of the present invention. | 03-31-2011 |
20120129237 | POLYNUCLEOTIDES ENCODING NOVEL PCSK9 VARIANTS - The present invention provides novel polynucleotides encoding PCSK9b and PCSK9c polypeptides, fragments and homologues thereof. Also provided are vectors, host cells, antibodies, and recombinant and synthetic methods for producing said polypeptides. The invention further relates to diagnostic and therapeutic methods for applying these novel PCSK9b and PCSK9c polypeptides to the diagnosis, treatment, and/or prevention of various diseases and/or disorders related to these polypeptides. The invention further relates to screening methods for identifying agonists and antagonists of the polynucleotides and polypeptides of the present invention. | 05-24-2012 |
20130108612 | POLYNUCLEOTIDES ENCODING NOVEL PCSK9 VARIANTS | 05-02-2013 |
20140161808 | ANTIBODIES THAT BIND NOVEL PCSK9 VARIANTS - The present invention provides novel polynucleotides encoding PCSK9b and PCSK9c polypeptides, fragments and homologues thereof. Also provided are vectors, host cells, antibodies, and recombinant and synthetic methods for producing said polypeptides. The invention further relates to diagnostic and therapeutic methods for applying these novel PCSK9b and PCSK9c polypeptides to the diagnosis, treatment, and/or prevention of various diseases and/or disorders related to these polypeptides. The invention further relates to screening methods for identifying agonists and antagonists of the polynucleotides and polypeptides of the present invention. | 06-12-2014 |
Patent application number | Description | Published |
20090290508 | Method for optimizing network "Point of Presence" locations - A methodology for optimizing the placement of network “Points of Presence” (POPs) across the carrier's entire network (i.e., a “global” solution”) utilizes carefully constructed customer clustering and simulated annealing methodology to create a cost-efficient solution. The customer base is first partitioned into a plurality of clusters such that the customers within each cluster are closer to its centroid than the centroid of any other cluster (e.g., applying the k-means clustering algorithm or any other suitable method of partitioning the customer base). A linear algorithm process is used to minimize the costs associated with the number of placement of POPs within each cluster. A simulated annealing (SA) process is then used to iterate the entire set of potential POP locations until a compact, steady-state solution is achieved (or, alternatively, until a given number of iterations has been performed). In a preferred embodiment, a number of iterations are performed at each “temperature” in the simulating annealing process to further improve the result (this iterative process referred to in the art as “intensification”). | 11-26-2009 |
20110085467 | Method and Apparatus for Clustering Based Optimal Fiber Ring Deployment - A computer readable storage medium stores a set of instructions executable by a processor. The instructions are operable to receive a data set including data corresponding to a set of nodes, the data corresponding to each of the nodes including a node prize, a node cost, and a node value that is the difference between the node prize and the node cost; select one or more of the nodes for inclusion in a cluster, the cluster comprising the one or more of the nodes, two or more external links from nodes in the cluster to a network, and one or more internal links between nodes if the cluster comprises two or more nodes, each of the internal links having an internal link cost, each of the external links having an external link cost; and determine a plan for incorporating the one or more nodes in the cluster into the network, the incorporating comprising building the cluster by building the two or more external links and the one or more internal links. | 04-14-2011 |
20110149761 | Technique for determining transport capacity required to achieve controllable worst case throughput - A link in a communications network is provisioned with a particular bandwidth capacity determined as a function of a “sub-par customer data fraction.” The sub-par data fraction is given by a) the amount of data transferred under sub-par condition divided by b) the total data transferred, where “sub-par condition” means that data is transferred below a given target bit rate. | 06-23-2011 |
20120082114 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range. | 04-05-2012 |
20120082115 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A FIXED WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area for mobility traffic and fixed wireless traffic, a physical characteristic of an antenna in the geographical area, and a type of connectivity at a customer premise, determines a busy time data traffic from the network traffic data for both the fixed wireless traffic and the mobility traffic, determines, for the cell, a cell range from the physical characteristic of the antenna and the type of connectivity at the customer premise, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range, wherein the average throughput comprises a throughput for serving both the mobility traffic and the fixed wireless traffic. | 04-05-2012 |
20120113965 | METHOD AND APPARATUS FOR LOCATING A WI-FI HOTSPOT FOR OFFLOADING WIRELESS TRAFFIC - A method and apparatus for locating a Wi-Fi hotspot for offloading wireless traffic from a cellular network are disclosed. For example, the method obtains network traffic data for the second type of wireless access network for a geographical area, and obtains a list of sectors in the geographical area. The method selects at least one sector from the list of sectors to be relieved, and determines a geographical range for the at least one sector. The method then obtains at least one hotspot of the first type of wireless access network within the geographical range, wherein the at least one hotspot is a potential location for offloading the wireless traffic from the second type of wireless access network. | 05-10-2012 |
20120127871 | METHOD AND APPARATUS FOR FORECASTING BUSY HOUR TRAFFIC FOR A WIRELESS NETWORK - A method and apparatus for forecasting busy hour traffic for a network are disclosed. For example, the method obtains actual traffic data for a seed time frame for each of one or more sectors in a given market and marketing projections for one or more forecast time frames for the given market, and determines a market traffic actual measure for the given market from the actual traffic data. The method obtains market traffic estimates from one or more previous runs, and updates the one or more market traffic estimates for the one or more forecast time frames beyond the seed time frame to obtain one or more updated market traffic estimates, wherein the updated market traffic estimates are used for forecasting the busy hour traffic data for each of the one or more forecast time frames beyond the seed time frame. | 05-24-2012 |
20120134294 | METHOD AND APPARATUS FOR PLANNING RADIO NETWORK CONTROLLERS IN A WIRELESS NETWORK - A method and apparatus for providing planning of a plurality of radio network controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one radio network controller parameter in accordance with the input data. The method determines if the limit for the at least one radio network controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one radio controller parameter is exceeded. | 05-31-2012 |
20120140627 | METHOD AND APPARATUS FOR PLANNING SERVING GENERAL PACKET RADIO SERVICE SUPPORT NODES IN A WIRELESS NETWORK - A method and apparatus for providing planning of a plurality of serving general packet radio service support nodes in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one serving general packet radio service support node parameter in accordance with the input data. The method determines if the limit for the at least one serving general packet radio service support node parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one serving general packet radio service support node parameter is exceeded. | 06-07-2012 |
20120140643 | METHOD AND APPARATUS FOR AUTOMATIC ESTIMATION OF TRAFFIC REASSIGNMENT - A method and apparatus for providing an estimation of traffic reassignment for a network are disclosed. For example, the method and apparatus provide an automatic estimation of traffic reassignment for a wireless network. | 06-07-2012 |
20120140674 | METHOD AND APPARATUS FOR PLANNING BASE STATION CONTROLLERS IN A WIRELESS NETWORK - A method and apparatus for providing planning of a plurality of base station controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one base station controller parameter in accordance with the input data. The method determines if the limit for the at least one base station controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one base station controller parameter is exceeded. | 06-07-2012 |
20120142360 | METHOD AND APPARATUS FOR PLANNING MOBILE SWITCHING CENTERS IN A WIRELESS NETWORK - A method and apparatus for providing planning of a plurality of mobile switching centers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one mobile switching center parameter in accordance with the input data. The method determines if the limit for the at least one mobile switching center parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one mobile switching center parameter is exceeded. | 06-07-2012 |
20120151035 | METHOD AND APPARATUS FOR WIRELESS NETWORK PERFORMANCE DIAGNOSTICS VIA USER EQUIPMENT - A method, computer readable medium for diagnosing wireless network performance via a customer endpoint device are disclosed. For example, the method receives a request to perform a wireless network performance diagnostic test that is initiated by a customer endpoint device, establishes a session with the customer endpoint device, performs the wireless network performance diagnostic test in response to the request via the session using a packet generated by the customer endpoint device and provides diagnostic test data gathered from the wireless network performance diagnostic test to the customer endpoint device. | 06-14-2012 |
20130109398 | METHOD AND APPARATUS FOR PLANNING MOBILE SWITCHING CENTERS IN A WIRELESS NETWORK | 05-02-2013 |
20130163432 | Technique for Determining Transport Capacity Required to Achieve Controllable Worst Case Throughput - A link in a communications network is provisioned with a particular bandwidth capacity determined as a function of a “sub-par customer data fraction. ” The sub-par data fraction is given by a) the amount of data transferred under sub-par condition divided by b) the total data transferred, where “sub-par condition” means that data is transferred below a given target bit rate. | 06-27-2013 |
20140029521 | CODE PLANNING FOR WIRELESS COMMUNICATIONS - Scrambling code conflicts can be mitigated by primary scrambling code reuse that minimizing a potential interference Primary scrambling codes are applied to a first set of cells located in a portion of the network being considered. A second set of cells are evaluated for primary scrambling code reuse based on a distance parameter and/or a coverage area. If the distance parameter is greater than a defined distance, primary scrambling code reuse can be applied. If all distance parameters evaluated are less than the distance parameter, a length of the distance parameter is reduced and the distance between cells is reevaluated. | 01-30-2014 |
20140031053 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A FIXED WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area for mobility traffic and fixed wireless traffic, a physical characteristic of an antenna in the geographical area, and a type of connectivity at a customer premise, determines a busy time data traffic from the network traffic data for both the fixed wireless traffic and the mobility traffic, determines, for the cell, a cell range from the physical characteristic of the antenna and the type of connectivity at the customer premise, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range, wherein the average throughput comprises a throughput for serving both the mobility traffic and the fixed wireless traffic. | 01-30-2014 |
20140141788 | METRO CELL PLANNING - Dynamic metro cell location planning is provided within the wireless communication coverage area of a macro cell. Metro cell location planning can include obtaining performance parameters associated with the macro cell and evaluating coverage parameters of the macro cell. Metro cell location planning can also include selecting, based on the performance parameters and the coverage parameters, a location within a wireless communication coverage area of the macro cell for placement of the metro cell. The selected location can be conveyed to a user and/or entity for deployment of the metro cells. Metro cells can be used by a carrier to fill a coverage hole and/or to offload capacity hot-spots within the network. | 05-22-2014 |
20140148144 | METHOD AND APPARATUS FOR PLANNING BASE STATION CONTROLLERS IN A WIRELESS NETWORK - A method and apparatus for providing planning of a plurality of base station controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one base station controller parameter in accordance with the input data. The method determines if the limit for the at least one base station controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one base station controller parameter is exceeded. | 05-29-2014 |
20140257987 | METHOD AND SYSTEM FOR A PERSONALIZED CONTENT DISSEMINATION PLATFORM - The disclosure provides a method and corresponding system for personalizing and disbursing content material in an automated fashion based on differing characteristics or profiles of the recipients. The system includes a database of potential recipients with key characteristics such as location data, revenue, product ownership, customer status, tenure with the company/organization, payment status, credit rating, whether they have recently responded to other material, and the like. Dissemination media include email communications, collaterals, brochures, textual materials, image and video information, and any similar media, where the contents of the communication material is customized based on the key characteristics profiles of the recipients and driven by a set of business rules that can be adapted to fit various scenarios. | 09-11-2014 |
20140378153 | METHOD AND APPARATUS FOR PLANNING RADIO FREQUENCY SPECTRUM IN A WIRELESS NETWORK - A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range. | 12-25-2014 |
20150148059 | TIME DISTANCE OF ARRIVAL BASED MOBILE DEVICE LOCATION DETECTION WITH DISTURBANCE SCRUTINY - Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device. | 05-28-2015 |