Patent application number | Description | Published |
20100003246 | Novel heterocyclic compounds and uses therof - New substituted heterocyclic compounds, compositions containing them, and methods of using them for the inhibition of Raf kinase activity are provided. The new compounds and compositions may be used either alone or in combination with at least one additional agent for the treatment of a Raf kinase mediated disorder, such as cancer. | 01-07-2010 |
20100029605 | COMPOUNDS AND COMPOSITIONS AS PROTEIN KINASE INHIBITORS - The invention provides a novel class of compounds, pharmaceutical compositions comprising such compounds and methods of using such compounds to treat or prevent diseases or disorders associated with abnormal or deregulated kinase activity, particularly diseases or disorders that involve abnormal activation of the Abl, ARG, BCR-Abl, BRK, EphB, Fms, Fyn, KDR, c-Kit, LCK, PDGF-R, b-Raf, c-Raf, SAPK2, Src, Tie2 and TrkB kinases. | 02-04-2010 |
20110098280 | 2,4-PYRIMIDINEDIAMINES USEFUL IN THE TREATMENT OF NEOPLASTIC DISEASES, INFLAMMATORY AND IMMUNE SYSTEM DISORDERS - Novel pyrimidine derivatives of formula I | 04-28-2011 |
20120225899 | Compounds and Compositions as Protein Kinase Inhibitors - The present invention provides compounds of Formula I or II: | 09-06-2012 |
20130210818 | Novel Heterocyclic Compounds and Uses Thereof - New substituted heterocyclic compounds, compositions containing them, and methods of using them for the inhibition of Raf kinase activity are provided. The new compounds and compositions may be used either alone or in combination with at least one additional agent for the treatment of a Raf kinase mediated disorder, such as cancer. | 08-15-2013 |
Patent application number | Description | Published |
20100329120 | Determining Disjoint Paths With An Optimized Number Of Regenerators - According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators. | 12-30-2010 |
20110080846 | Determining Paths In A Network With Asymmetric Switches - According to particular embodiments, determining paths in a network with asymmetric switches includes receiving a graph representing the network. Each asymmetric switch has defined degree connectivity between one or more pairs of degrees of the asymmetric switch. The graph is transformed to yield a transformed graph that accounts for the asymmetric switches. A routing process is applied to the transformed graph to yield one or more paths through the network. | 04-07-2011 |
20110167183 | Minimizing Interconnections In A Multi-Shelf Switching System - In certain embodiments, minimizing interconnections in a multi-shelf switching system includes receiving a map describing the switching system, where the switching system comprises shelves and input/output (I/O) points. The map is transformed to yield a graph comprising nodes and edges. A node represents an I/O point, and a node weight represents a number of interface cards of the I/O point represented by the node. An edge between a node pair represents traffic demand between the I/O points represented by the node pair, and an edge weight represents the amount of the traffic demand represented by the edge. The graph is partitioned to yield a groups that minimize interconnection traffic among the shelves, where each group represents a shelf of the multi-shelf switching system. | 07-07-2011 |
20110206374 | System and Method for Demand Aggregation in Optical Networks Employing Shared Ring Protection - In accordance with embodiments of the present disclosure, a method for demand aggregation is provided. The method may include routing demands in a ring network such that a length for each routed demand does not exceed a route length maximum, and a load imbalance at each node in the ring network is minimized. The method may also include maximizing optical line card sharing by assigning routed demands sharing common ends to the same wavelength. | 08-25-2011 |
20110242995 | SYSTEMS AND METHODS FOR MULTI-DOMAIN ROUTING - Systems and methods for multi-domain routing are provided. In some embodiments, a method for determining a path calculation from a source node to a destination node over a multi-domain network is provided. The method may include steps for receiving a predetermined sequence of domains for communicating information from the source node to the destination node, determining a link type for each of a plurality of links in the predetermined sequence of domains, modifying the link type of one or more of the plurality of links such that the plurality of links are unidirectional links towards a destination node, and determining a path along the predetermined sequence of domains based on the modified plurality of links. | 10-06-2011 |
20110243030 | SYSTEMS AND METHODS FOR DETERMINING PROTECTION PATHS IN A MULTI-DOMAIN NETWORK - Systems and methods for determining multiple paths in a multi-domain network are provided. In some embodiment, a method for determining multiple paths in a network is provided. The method may include determining a first path between a source node and a destination node and determining a second path disjoint from the first path. In some embodiments, to determine the second path includes determining which ingress nodes are available in a domain that includes the destination node, where the available ingress nodes are not part of the first path, and implementing a disjoint path algorithm for each of the available ingress nodes. To determine the first path includes implementing forward path calculations. | 10-06-2011 |
20120093507 | Dynamic Circuit Adjustment - A system and method are provided for dynamically reconfiguring an optical circuit between a first node and a second node of a communication network. The system and method may include establishing a scheduling window for receiving a plurality of optical traffic demands, classifying the plurality of optical traffic demands into at least a set of bandwidth adjustable demands and a set of fixed bandwidth demands, provisioning a first set of provisioned wavelengths from the plurality of wavelengths to carry the set of fixed bandwidth demands during the scheduling window, allocating the bandwidth remaining on the first set of provisioned wavelengths to the set of bandwidth adjustable demands, and if necessary, provisioning a second set of provisioned wavelengths from the plurality of wavelengths to carry the bandwidth required by the set of bandwidth adjustable demands that could not be allocated to the first set of provisioned wavelengths. | 04-19-2012 |
20120117269 | SYSTEMS AND METHODS FOR MULTI-LAYER TRAFFIC GROOMING - A method may include constructing an auxiliary graph for a network comprising a plurality of network elements, the network elements having an Internet Protocol layer, a lower layer, and a wavelength layer, the auxiliary graph including a plurality of directed edges, the plurality of directed edges indicative of connectivity of components of the plurality of network elements. The method may further include: (i) deleting directed edges from the auxiliary graph whose available bandwidth is lower than the required bandwidth of a selected demand; (ii) finding a path for the demand on the auxiliary graph via remaining directed edges; (iii) deleting at least one directed edge of the auxiliary graph on the wavelength layer along the path; (iv) adding lower layer lightpath edges to the auxiliary graph for a lower layer lightpath for the path; and (v) converting lower layer lightpaths to Internet Protocol lightpaths if a conversion condition is satisfied. | 05-10-2012 |
20120263455 | METHOD AND SYSTEM FOR CALCULATING SPECTRUM GRANULARITY IN FLEXIBLE GRID OPTICAL NETWORKS - In accordance with embodiments of the present disclosure, a method may include determining individual spectrum requirements for each of a plurality of signals to be communicated in an optical network, wherein a first signal of the plurality of signals has a first spectrum requirement and a second signal of the plurality of signals has a second spectrum requirement. The method may also include calculating a minimum spectrum granularity based on the individual spectrum requirements. The method may further include assigning each particular signal a channel spectrum equal to an integer multiple of the minimum spectrum granularity. | 10-18-2012 |
20120301140 | Methods for Efficient Transmission in OTN Networks - In accordance with some embodiments of the present disclosure a method for shared mesh protection in an optical transport network comprises provisioning a route for each of a plurality of working demands through the optical transport network. The method further comprises provisioning a route for backup demands corresponding to each of the plurality of working demands. The method additionally comprises packing into a single optical data unit a first backup demand corresponding to a first of the plurality of working demands and a second backup demand corresponding to a second of the plurality of working demands, wherein the first and second of the plurality of working demands share at least one common link in the optical transport network. The method also comprises unpacking the first and second backup demands from the optical data unit. | 11-29-2012 |
20120328286 | System and Method for Calculating Utilization Entropy - A system and method are provided for monitoring traffic in a network comprising a plurality of links, wherein each of the plurality of links comprises a plurality of neighboring pairs of slots. The system and method may include identifying a first usage status and a second usage status, calculating a utilization entropy value based at least on the difference between the first and second usage status, iteratively calculating a set of utilization entropy values for a portion of the network, and calculating an overall utilization entropy value for the portion of the network under analysis based at least on a statistical analysis of the set of utilization entropy values. | 12-27-2012 |
20130089317 | METHOD AND SYSTEM FOR HYBRID MULTI-LAYER MESH RESTORATION IN A COMMUNICATION NETWORK - In accordance with embodiments of the present disclosure, a method may include sorting potential optical layer link failures in a network in an increasing order of failed traffic amount. The method may further include, for each potential optical link failure in increasing order of failed traffic amount: determining the additional higher layer link capacity required on existing higher layer links associated with the potential optical link failure using higher layer restoration of the potential optical link failure; determining the additional optical layer capacity required for restoring the existing higher layer links associated with the potential optical link failure using optical layer restoration; and selecting one of the higher layer and the optical layer as a restoration layer for restoration of the existing higher layer links associated with the potential optical link failure based on the determined additional higher layer link capacity and the determined additional optical layer capacity. | 04-11-2013 |
20130272693 | SYSTEM AND METHOD FOR SHARED MESH RESTORATION IN OPTICAL NETWORKS - A method for shared mesh restoration includes configuring a switch to allow sharing of a plurality of backup line cards across a plurality of node degrees associated with a reconfigurable optical add/drop multiplexer (ROADM). The switch is communicatively coupled to the ROADM. The method further includes configuring a number of backup line cards coupled to the switch. The number of backup line cards is based on determining a number of active backup lightpaths for each of a plurality of network failures associated with each of the plurality of node degrees of the ROADM, identifying which node degree and failure has the largest number of active backup lightpaths for all of the plurality of node degrees of the ROADM and for each of the plurality of network failures, and determining the number of backup line cards to configure based on the identified largest number of active backup lightpaths. | 10-17-2013 |
20140052419 | PROBABILITY-BASED REGENERATOR SITE ANALYSIS - An optical network analysis tool includes a computer-readable storage medium having computer-readable instructions stored thereon. The computer-readable instructions are executable by a computing device to perform operations. The operations include generating a simulated network that models an optical network. The simulated network includes regenerator candidate sites. The operations may also include conducting an analysis of the optical network. The analysis includes introducing a multiple signals transmitted between source/destination pairs and recording a number of times each of the regenerator candidate sites are selected as a regenerator site while applying each of a set of data traffic conditions in the simulated network. The operations may also include statistically analyzing the number of times each of the regenerator candidate sites is selected to generate statistically analyzed information and presenting the statistically analyzed information. | 02-20-2014 |
20140099102 | SYSTEMS AND METHODS FOR STATISTICAL SHARING IN OPTICAL COMMUNICATIONS NETWORKS - A method of statistical sharing in an optical communications network is disclosed. The method includes identifying a peak transmission rate and a base transmission rate for each of a plurality of client interface cards of an optical node. | 04-10-2014 |
20140099118 | SYSTEMS AND METHODS FOR ROUTING AND WAVELENGTH ASSIGNMENT FOR NETWORK VIRTUALIZATION - A method for routing and wavelength assignment for optical network resources required for a plurality of virtual network requests includes receiving the plurality of virtual network requests. The method further includes determining a number of virtual links for each virtual network request. The method includes sorting the plurality of virtual network requests based on the number of virtual links, and selecting a virtual network request from the plurality of virtual network requests and setting a number of allowable spans. Additionally, the method includes determining whether a valid virtual node mapping exists for the virtual network request on any of a plurality of wavelengths based on the allowable spans, and based on determining that no valid virtual node mapping exists on any of the plurality of wavelengths, incrementing the number of allowable spans. | 04-10-2014 |
20140215032 | SYSTEMS AND METHODS OF NETWORK RECONFIGURATION - The present disclosure may include a method of reconfiguring a network. The method includes collecting a plurality of network demands, each of the plurality of network demands having a possible resource release by rerouting the network demand from its current path to a new path. The method further includes selecting a subset of the plurality of network demands that, if rerouted, has the highest resource release without resource contention. The method additionally includes rerouting the subset of the plurality of network demands, and, in response to rerouting the subset of the plurality of network demands, releasing resources no longer used by rerouted demands. The present disclosure may further include associated systems and apparatuses. | 07-31-2014 |
20140308040 | OPTICAL PATH COMPUTATION BASED ON A REACHABILITY MATRIX - Methods and systems for optical path computation based on a reachability matrix may rely on matrix multiplication to determine a number and respective network locations of regenerators for establishing an end-to-end reachable path in an optical network between a source node and a destination node. The reachability matrix may specify directly reachable optical paths between nodes in the optical network. | 10-16-2014 |
20140317257 | RISK MITIGATION IN DATA CENTER NETWORKS - A method employing resource orchestration algorithms may find a fewest number of working data centers (DCs) to guarantee K-connect survivability using an overlay network representing a physical optical network. The overlay network may not include certain topological features of the physical optical network. A risk-based algorithm may result in fewer working DCs for K-connect survivability. A delay-based algorithm may be more suitable for delay-sensitive cloud applications. | 10-23-2014 |
20150104172 | FLEXIBLE VIRTUAL OPTICAL NETWORK PROVISIONING USING DISTANCE-ADAPTIVE MODULATION - Flexible VON provisioning may include calculating a candidate mapping pattern to satisfy a virtual optical network (VON) demand based on virtual-to-physical node mapping choices. A distance-adaptive routing and spectral slot assignment evaluation of the candidate mapping pattern may be performed. When the VON demand is satisfied by the candidate mapping pattern, the candidate mapping pattern may be added to a valid mapping patterns list. A final mapping pattern may be selected from the valid mapping patterns list, the final mapping pattern having one of a lowest slot layer and a smallest overall slot usage on the valid mapping patterns list. Then, network resources may be reserved based on the final mapping pattern selected to service the VON demand. | 04-16-2015 |
20150295673 | EFFICIENT UTILIZATION OF TRANSCEIVERS FOR SHARED RESTORATION IN FLEXIBLE GRID OPTICAL NETWORKS - Optical transceiver sharing methods may be based on different ROADM node architectures for shared restoration in flexible grid optical networks. A ROADM node architecture with a pool of transceivers may improve transceiver utilization for backup optical paths, compared to a conventional ROADM node architecture. Sharing of transceivers in the pool for working and backup optical paths may further improve transceiver utilization. The methods disclosed herein may be used for multiple bit rates and different modulation formats. | 10-15-2015 |
20150295761 | OBJECT-ORIENTED NETWORK VIRTUALIZATION - Object-oriented network virtualization may involve creating and operating virtual network objects (VNO) using a software-programmed networking operating system (SPN OS). A VNO may be a complete representation of a virtual network service provided under the SPN OS. A VNO may have a unique identity and properties, along with an internal set of methods for executing functionality encapsulated by the VNO. A VNO may exhibit persistence and autonomous control to enable improved virtual network services. | 10-15-2015 |
20160065461 | RISK MITIGATION IN DATA CENTER NETWORKS USING VIRTUAL MACHINE SHARING - A method employing resource orchestration algorithms may find a fewest number of working data centers (DCs) to guarantee K-connect survivability and a fewest number of virtual machines (VMs) among the DCs using an overlay network representing a physical optical network. The overlay network may exclude certain topological features of the physical optical network. An intra-request VM sharing method may share VMs among DCs allocated for an aggregation request. An intra-request VM sharing method may share VMs among DCs represented in the overlay network and among multiple aggregation requests. | 03-03-2016 |
Patent application number | Description | Published |
20100205075 | LARGE-SCALE ITEM AFFINITY DETERMINATION USING A MAP REDUCE PLATFORM - Pair-wise item affinity is based on transaction records. Each transaction record includes an indication of a bucket and an indication of an item transacted corresponding to that bucket. The method comprises a Phase | 08-12-2010 |
20110029464 | SUPPLEMENTING A TRAINED MODEL USING INCREMENTAL DATA IN MAKING ITEM RECOMMENDATIONS - Incremental training data is used to supplement a trained model to provide personalized recommendations for a user. The personalized recommendations can be made by taking into account the user's behavior, such as, without limitation, the user's short and long term web page interactions, to identify item recommendations. A trained model is generated from training data indicative of the web page interaction data collected from a plurality of users. Incremental training data indicative of other web page interaction data can be used to supplement the trained model, or in place of the trained model. Incremental training data can be indicative of user behavior collected more recently than the data used to train the model, for example. | 02-03-2011 |
20110208708 | Systems and Methods for Finding Keyword Relationships Using Wisdoms from Multiple Sources - Systems and methods for finding related terms based on three different sources are disclosed. Generally, a first plurality of distances is determined based on one or more received terms and a first plurality of terms derived from an algorithmic search list. A second plurality of distances is determined based on the one or more received terms and a second plurality of terms derived from a sponsored search list. A third plurality of distances is determined based on the one or more received terms and a third plurality of terms derived from search logs. The first, second, and third pluralities of distances are combined to derive a fourth plurality of distances. Finally, a plurality of related terms related to the one or more received terms is generated based on the fourth plurality of distances. | 08-25-2011 |
20110264511 | ONLINE SERVING THRESHOLD AND DELIVERY POLICY ADJUSTMENT - The present invention provides techniques for use in association with online advertising, relating to use of serving thresholds, associated with predicted click through rates, and delivery policies, associated with advertising inventory serving and distribution. An offline-trained machine learning-based model may be utilized in advertising serving decision-making in connection with serving opportunities. However, serving thresholds and delivery policies, for use in association with the model in serving decision-making, may be adjusted online, such as in real-time or near real-time, based on information obtained online affecting factors such as predicted click through rates and advertising inventory distribution. | 10-27-2011 |
20130024318 | SUPPLEMENTING A TRAINED MODEL USING INCREMENTAL DATA IN MAKING ITEM RECOMMENDATIONS - Incremental training data is used to supplement a trained model to provide personalized recommendations for a user. The personalized recommendations can be made by taking into account the user's behavior, such as, without limitation, the user's short and long term web page interactions, to identify item recommendations. A trained model is generated from training data indicative of the web page interaction data collected from a plurality of users. Incremental training data indicative of other web page interaction data can be used to supplement the trained model, or in place of the trained model. Incremental training data can be indicative of user behavior collected more recently than the data used to train the model, for example. | 01-24-2013 |
Patent application number | Description | Published |
20130342204 | MAGNETIC RESONANCE IMAGING METHOD - In a magnetic resonance imaging method and apparatus, navigation data are collected in a navigation acquisition timeslot of a scanning sequence. A determination as to whether to accept or reject echo data that are subsequently collected in multiple echo acquisition timeslots is made. If the phase relationship of the navigation data and the reference data in k-space is greater than or equal to the reference value, the collected echo data are accepted and if the aforementioned phase in k-space is less than the reference value, the collected echo data will be rejected, and sequential scanning will be performed again, and the navigation data again will be collected using the navigation acquisition timeslot, and the aforementioned determination is repeated. | 12-26-2013 |
20140005969 | TRAJECTORY CORRECTION METHOD AND APPARATUS FOR K-SPACE DATA IN MAGNETIC RESONANCE IMAGING | 01-02-2014 |
20150309150 | IMAGE RECONSTRUCTION METHOD AND DEVICE FOR A MAGNETIC RESONANCE IMAGING SYSTEM - In an image reconstruction method and device for a magnetic resonance imaging system, a magnetic resonance scan is performed at least one scan position according to at least one scan protocol, to acquire at least a set of one scan protocol simultaneously acquired data. At least one magnetic resonance image is reconstructed based on the set of scan protocol simultaneously acquired data and a shared receiving coil calibration matrix. By sharing the receiving coil calibration matrix in different parallel scan processing operations, the amount of work is significantly reduced while improving working efficiency, and imaging quality can also be significantly improved in the case of scan sequences with echo chain acquisition. | 10-29-2015 |
20150355301 | MAGNETIC RESONANCE IMAGING METHOD AND APPARATUS - In an MRI method and apparatus a 3D dual echo magnetic resonance scan is performed to acquire two sets of k-space data corresponding to the two echoes, respectively. A 2D CAIPIRINHA undersampling method as applied to the two sets of k-space data to extract two sets of sampling data, respectively. The two sets of sampling data are used to reconstruct two initial magnetic resonance images. A final magnetic resonance image is synthesized from the two initial magnetic resonance images. Because staggering is carried out in the PE or SL direction when the 2D CAIPIRINHA undersampling method is applied to a 3D scan sequence, aliasing in parallel imaging can be controlled, so that a greater area in the center of the field of view (FOV) is undisturbed by aliasing. At the same time, coil sensitivity is increased, enabling further acceleration. Thirdly, the 2D CAIPIRINHA undersampling method generally uses a small acceleration factor, thereby ensuring a high signal to noise ratio. | 12-10-2015 |
20160033607 | MAGNETIC RESONANCE IMAGING METHOD AND APPARATUS - In a magnetic resonance imaging method and apparatus, the scanner is operated with a multi-echo sequence in order to acquire k-space data of a multi-echo magnetic resonance signal, and the k-space data are used to reconstruct a magnetic resonance image. The multi-echo magnetic resonance signal is an asymmetric multi-echo magnetic resonance signal, and the asymmetric multi-echo magnetic resonance signal includes N asymmetric echo magnetic resonance signals, wherein N is greater than or equal to 2. Asymmetric echo magnetic resonance signals can be acquired in a dual-echo steady-state sequence, so that scanning time is reduced and the degree of comfort of a subject is improved because the magnetization process reaches a steady state quickly so the magnetic resonance signal is less affected by inhomogeneities that may exist in the basic magnetic field or a gradient magnetic field, and the intensity of the magnetic resonance signal is increased. | 02-04-2016 |
Patent application number | Description | Published |
20150126490 | AMINOHETEROARYL BENZAMIDES AS KINASE INHIBITORS - The present invention provides a compound of Formula (I) or a salt thereof; | 05-07-2015 |
20150249391 | DC-DC CONVERTER AND DC-DC CONVERTER SYSTEM THEREOF - The present disclosure discloses a DC-DC converter and a DC-DC converter system thereof. The DC-DC converter includes: a power conversion circuit; and a current detection circuit for detecting current flowing into or flowing out of the power conversion circuit, which includes: an inductor coupled to the power conversion circuit; a detection module including an induction winding and an impedance component electrically connected in series, the detection module and the inductor being connected in parallel; and an output module coupled to two ends of the impedance component for generating a current detection signal reflecting the current flowing into or flowing out of the power conversion circuit. | 09-03-2015 |
20150249395 | DC to DC Converter and DC to DC Conversion System - The present disclosure discloses a DC/DC converter and a DC/DC conversion system. The DC/DC converter includes a transformer, a primary power circuit, a secondary bridge synchronous rectifying circuit, an output inductor and a control circuit. The primary power circuit receives an input voltage, and deliver a symmetrical power flow to a secondary side of the transformer during positive and negative switching cycles, and a magnetic flux in the transformer core is balanced through the above symmetrical power flow. The rectifying circuit is coupled to a secondary winding of the transformer. The control circuit provides primary and secondary driving signals to the primary power circuit and the rectifying circuit, respectively. When an output voltage of the primary power circuit is zero, the control circuit controls the first, the second, the third and the fourth switches to be conductive. | 09-03-2015 |
20150249396 | DC/DC CONVERTER AND CONTROL METHOD THEREOF - A DC/DC converter and a control method thereof are disclosed. The DC/DC converter comprises: an output voltage regulation circuit configured to regulate an output voltage of the DC/DC converter, so as to output a duty cycle regulation signal; a PWM generator electrically coupled to the output voltage regulation circuit and configured to generate a first duty cycle signal according to a first clock signal and the duty cycle regulation signal; a detection circuit configured to output a control signal according to a second clock signal and a feedback signal, wherein the feedback signal is configured to detect whether or not the transient change of an input voltage of the DC/DC converter occurs; and a CBC regulation circuit electrically coupled to the PWM generator and the detection circuit, and configured to receive the first duty cycle signal and the control signal and output a second duty cycle signal. | 09-03-2015 |
20150303814 | DIRECT CURRENT TO DIRECT CURRENT POWER SUPPLY APPARATUS - Disclosed herein is a DC/DC power supply apparatus, which includes a plurality of power boards, a control board and a main board. The plurality of power boards are coupled in parallel with one another, and each power board includes a carrier circuit board and a power device disposed on the carrier circuit board. The control board includes a feedback control circuit and a PWM generator circuit; the feedback control circuit is configured to receive one or more feedback signals from the power boards; the PWM generator circuit outputs a PWM control signal to the power boards based on the feedback signal. The main board is electrically coupled to the power boards and the control board. | 10-22-2015 |