Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The present invention provides compounds of Formula I or II: wherein R1, R1b, R2, R3, R4, R5, R6 and R7 are defined herein. The compounds of Formula (I) or (II) and pharmaceutical compositions thereof are useful for the treatment of B-Raf-associated diseases.

Abstract: 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.

Abstract: A method for network analysis includes determining an initial set of demands upon the resources of a network, determining a new set of demands upon the resources of the network, apply a policy for assigning a demand of the new set of demands to a demand of the initial set of demands, create a dependency for the assignment of the demand of the new set of demands to the demand of the initial set of demands, construct a sub-graph including the dependency, and incorporate the sub-graph into a resource-oriented-dependency graph. Each demand includes a quantification.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The present invention discloses an asymmetric PCR amplification method, its special primer and application, aims to provide a simple, effective PCR amplification for preparation of single-stranded product. The asymmetric PCR primer of the invention comprises some PCR primer pairs, in which an unrelated nucleic acids sequence to target sequence to be detected is added onto 5?-terminal of one primer. The asymmetric PCR amplification provided includes the steps: 1) preparative denaturing; 2) repetitiously denaturing, primers annealing, extending cycles as the first stage of PCR amplification; 3) repetitiously denaturing, primer extending cycles as the second stage of PCR amplification, wherein an unrelated nucleic acids sequence to target sequence to be detected is added onto 5?-terminal of one PCR primer of each pair in extension.

Abstract: 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.

Abstract: 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. The method further includes provisioning a set of universal transceivers of a plurality of universal transceivers for a particular client interface card of the plurality of client interface cards such that the combined bandwidth of the set of universal transceivers is greater than or equal to the base transmission rate of the particular client interface card. The method also includes reserving one or more shared universal transceivers of the plurality of universal transceivers for the particular client interface card, when a transmission rate of the particular client interface card exceeds the base transmission rate of the particular client interface card.

Abstract: 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.

Abstract: Systems and methods for determining multiple paths in a multi-domain network are provided. In some embodiments, 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.

Abstract: 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.

Abstract: 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.

Abstract: In a trajectory correction method and apparatus for k-space data points in magnetic resonance imaging, a magnetic resonance data acquisition unit is operated to execute a sampling sequence to obtain k-space to be corrected. Empirical points are selected used to divide k-space to be corrected into a central region and a peripheral region. The trajectories of the data points in the central region and the peripheral region are corrected and the sampling sequence is executed again, with the corrected trajectories, to obtain corrected k-space.

Abstract: 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.

Abstract: 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.

Abstract: 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.