Abstract: Provided are ROR1 binding molecules, including anti-ROR1 antibodies, including antibody fragments such as variable heavy chain (VH) regions, single-chain fragments, and chimeric receptors including the antibodies, such as chimeric antigen receptors (CARs). In some embodiments, the antibodies specifically bind to ROR1. Among the antibodies are human antibodies, including those that compete for binding to ROR1 with reference antibodies, such as a non-human reference antibody. Also provided are genetically engineered cells expressing the chimeric receptors, and uses of the binding molecules and cells adoptive cell therapy.

Abstract: Separating and isolating multiple network stacks in a network element may enable a network element to simultaneously operate within multiple forwarding planes respectively corresponding to the multiple network stacks. In addition to the network stack, other protocols and routing tools may also be instantiated for each desired forwarding plane. The different instantiations of the network stacks may be executed in parallel in respective memory spaces that are distinct and separate. In this manner, each forwarding plane may operate independently on the network element from other forwarding planes.

Abstract: Separating and isolating multiple network stacks in a network element may enable a network element to simultaneously operate within multiple forwarding planes respectively corresponding to the multiple network stacks. In addition to the network stack, other protocols and routing tools may also be instantiated for each desired forwarding plane. The different instantiations of the network stacks may be executed in parallel in respective memory spaces that are distinct and separate. In this manner, each forwarding plane may operate independently on the network element from other forwarding planes.

Abstract: A method and system for determining a path between nodes in a network are disclosed. In accordance with an embodiment of the present disclosure, a system for determining a path between nodes in a network comprises a destination node and a link aggregation group (LAG) that includes a first link and a second link. The system further comprises a source node communicatively coupled to the destination node by the LAG where the source node, the LAG and the destination node form a path. The source node is operable to determine a link availability status for each of the first and second links using a layer-2 protection scheme. The source node is further operable to monitor the path for connectivity based on the link availability status using a layer-3 protection scheme.

Abstract: According to one embodiment, a network element may include one or more network interfaces and a master control unit communicatively coupled to the one or more network interfaces. The one or more network interfaces may include in the aggregate, a plurality of physical ports configured as member ports of a link aggregation group. The master control unit may be configured to maintain a routing table, such routing table including information regarding which of the plurality of physical ports of the link aggregation group is designated as an active port for management traffic egressing via the link aggregation group, wherein the active port carries a communication channel for the management traffic segregated from carrier traffic, and communicate the routing table to each of the one or more network interfaces.

Abstract: According to one embodiment, a network element may include one or more network interfaces and a master control unit communicatively coupled to the one or more network interfaces. The one or more network interfaces may include in the aggregate, a plurality of physical ports configured as member ports of a link aggregation group. The master control unit may be configured to maintain a routing table, such routing table including information regarding which of the plurality of physical ports of the link aggregation group is designated as an active port for management traffic egressing via the link aggregation group, wherein the active port carries a communication channel for the management traffic segregated from carrier traffic, and communicate the routing table to each of the one or more network interfaces.

Abstract: A method and system for determining a path between nodes in a network are disclosed. In accordance with an embodiment of the present disclosure, a system for determining a path between nodes in a network comprises a destination node and a link aggregation group (LAG) that includes a first link and a second link. The system further comprises a source node communicatively coupled to the destination node by the LAG where the source node, the LAG and the destination node form a path. The source node is operable to determine a link availability status for each of the first and second links using a layer-2 protection scheme. The source node is further operable to monitor the path for connectivity based on the link availability status using a layer-3 protection scheme.

Abstract: A debugger is used in an environment of optimized compiling to track both user-defined and synthesized variables so that the values of these variables at selected programmer counter addresses can be either determined or set. The tracking is primarily accomplished by the generation of various interrelated tables including a Type Scope Table, a Name Space Table, an Expression Table, a Location Range Tab and a Variable Table. These tables define the existence of variable at defined program counter ranges and provide the algebraic definitions for the synthesized variables. A programmer can efficiently debug a program produced with optimized compiling through the operations of determining variable values and setting variable values.

Abstract: Debugging of computer programs is necessary for the development of the programs as well as for maintaining the operation of the programs. Symbolic debugging requires the ability to relate the current position in the object code program to the corresponding position in the source code. In the absence of compiler optimization, correlating the source and object code elements is a straightforward procedure. However, when the object code has been optimized, the relation between the source code constructs and object code instructions can become convoluted and complex. A correlation technique for optimized code is disclosed which maps the source constructs (source units) through each of the optimization operations by use of compilation nodes and associated source units to build a table which relates ranges of object instructions to the source units which produced the object instructions.