Abstract: Described are techniques for disintegrating an entity into smaller entities. A graph (“first graph”) for the entity of records to be disintegrated is constructed, where each vertex of the first graph represents a record in the entity of records to be disintegrated. The edges in the first graph connecting records in the entity of records represent matching links between the records, where each edge is associated with a weight corresponding to a similarity score. Furthermore, two or more additional graphs representing two or more sub-entities of the entity of records to be disintegrated are constructed. Such graphs are constructed based on selecting edges with a maximum weight out of the edges connected between each pair of records in the first graph or based on the number of connections each record has with other records in the first graph exceeding a threshold value.

Abstract: Systems and methods are provided for custom online course based on matching content with a course syllabus by parsing a syllabus document submitted by a teacher into course segments and matches course resources with appropriate course segments. The course segments can be automatically placed into an online course structure. The appropriate course materials can then be automatically matched to each course segment. Teachers may then approve, edit, or delete course segments and their matched materials. This approval process may improve the syllabus parsing and content matching and content generation using machine-learning models, such as large language models.

Abstract: A method comprises advertising, by each of the at least two area border nodes of the IGP network comprising a first area and second area, an algorithm-specific metric associated with a destination node from the first set of nodes of the first area to a source node from the second set of nodes of the second area; calculating, by the source node, each inter-area path metric associated with a path including a respective area border node to reach the destination node; and determining, by the source node, an optimal path including one of the at least two area border nodes to reach the destination node based on each of the each calculated inter-area path metric.

Abstract: Described are techniques for disintegrating an entity into smaller entities. A graph (“first graph”) for the entity of records to be disintegrated is constructed, where each vertex of the first graph represents a record in the entity of records to be disintegrated. The edges in the first graph connecting records in the entity of records represent matching links between the records, where each edge is associated with a weight corresponding to a similarity score. Furthermore, two or more additional graphs representing two or more sub-entities of the entity of records to be disintegrated are constructed. Such graphs are constructed based on selecting edges with a maximum weight out of the edges connected between each pair of records in the first graph or based on the number of connections each record has with other records in the first graph exceeding a threshold value.

Abstract: Systems, methods and computer software are disclosed for resolving multiple contexts for a User Equipment (UE) in a wireless network. In one embodiment a method includes maintaining, for a coordinating node hosting a first Radio Access Technology (RAT) controller and a second RAT controller simultaneously, a centrally maintained database; determining, based on the contents of the centrally maintained database, when the UE is registering with the second RAT controller while currently registered with the first RAT controller; and sending, by the second RAT controller, a deregistration command to the first RAT controller the UE was registered with, wherein context is freed and wherein resources held at both the coordinating node and at a base station are freed.

Abstract: A method of optimal routing in an inter-area IGP network based on SR-MPLS Flex-Algorithm procedures, a source node, an area border node and a system thereof are disclosed. The method comprises advertising, by each of the at least two area border nodes of the IGP network comprising a first area and second area, an algorithm-specific metric associated with a destination node from the first set of nodes of the first area to a source node from the second set of nodes of the second area; calculating, by the source node, each inter-area path metric associated with a path including a respective area border node to reach the destination node; and determining, by the source node, an optimal path including one of the at least two area border nodes to reach the destination node based on each of the each calculated inter-area path metric.

Abstract: A method, system, and computer program product are configured to create a tuned data record matching model by adjusting values of one or more parameters in a data record matching model based on a second training data set labeled at a data record level, wherein the data record matching model is initially trained using a first training data set labeled at an attribute level.

Abstract: Systems, methods and computer software are disclosed for resolving multiple contexts for a User Equipment (UE) in a wireless network. In one embodiment a method includes maintaining, for a coordinating node hosting a first Radio Access Technology (RAT) controller and a second RAT controller simultaneously, a centrally maintained database; determining, based on the contents of the centrally maintained database, when the UE is registering with the second RAT controller while currently registered with the first RAT controller; and sending, by the second RAT controller, a deregistration command to the first RAT controller the UE was registered with, wherein context is freed and wherein resources held at both the coordinating node and at a base station are freed.

Abstract: A method for establishing a segment routing (SR) tunnel based on an Internet Protocol version 6 (IPv6) data plane using a Path Computation Element Communication Protocol (PCEP) includes generating, by a path computation element (PCE), a first PCEP message, wherein the first PCEP message comprises indicating information and segment identifier (SID), and wherein the indicating information indicates that the SID is an IPv6 prefix of a node in a tunnel; receiving, by a first path computation client (PCC), the first PCEP message from the PCE; and establishing, by the first PCC, a Segment Routing over IPv6 (SRv6) tunnel from the first PCC to a second PCC.

Abstract: Records linking is provided. Two records are selected from a plurality of records corresponding to a customer for pair-wise record comparison. It is determined whether the two records are included in different entities. A local auto-link-threshold value of the different entities is identified in response to determining that the two records are included in different entities. An attribute comparison is performed between the two records. A comparison score is generated based on the attribute comparison between the two records. It is determined whether the comparison score is greater than the local auto-link-threshold value of the different entities. The two records are linked in response to determining that the comparison score is greater than the local auto-link-threshold value of the different entities.

Abstract: A method is disclosed for providing distributed paging optimization, the method comprising: connecting a group of radio access network nodes, each supporting multiple small cells, to a gateway which acts as a virtual core network to the multiple small cells and acts as an eNodeB virtualizing the multiple small cells toward a core network; sending, by the gateway, in response to a paging request from the core network, a plurality of recommended cell IDs or base stations using a private information element (IE) in a paging request; and sending paging requests in response to the paging request from the core network to only the plurality of cell IDs or base stations recommended by the gateway.

Abstract: A method and apparatus for path computation includes generating a path computation element communication protocol (PCEP) message, whereby the PCEP message comprises a characteristic associated with a level of protection of a Protection Label Switch path (LSP) with a Working LSP; and transmitting the PCEP message for path computation.

Abstract: A method for establishing indirect and/or dual connectivity between virtualized 5G gENBs and virtualized 4G eNodeBs for dynamic X2 is disclosed. In one embodiment a method includes virtualizing, with a HetNet Gateway (HNG), BBUs and home eNodeBs over a standard S1 interface; establishing the HNG as a macro interfacing an EPC on 3GPP standard interfaces; communicating with an MME over the S1 interface for control plane signaling; and communicating with SAEGW over a standard GTPU interface for a data plane.

Abstract: Systems, methods and computer software are disclosed for resolving multiple contexts for a User Equipment (UE) in a wireless network. In one embodiment a method includes maintaining, for a coordinating node hosting a first Radio Access Technology (RAT) controller and a second RAT controller simultaneously, a centrally maintained database; determining, based on the contents of the centrally maintained database, when the UE is registering with the second RAT controller while currently registered with the first RAT controller; and sending, by the second RAT controller, a deregistration command to the first RAT controller the UE was registered with, wherein context is freed and wherein resources held at both the coordinating node and at a base station are freed.

Abstract: A system is disclosed to enhance HNG X2GW node in a way so that it supports the optimized S1-X2 Handovers with loosely coupled SON module. X2GW module in HNG interworks with SON module to provide interface for/towards SON module to update the information required for X2 association management. On receiving cell information from CWS, SON updates the X2GW with additional parameters required for creating/updating X2 association. When SON receives UE measurement report from CWS, it updates the same to X2GW with neighbor information to take further action. For S1-X2 handover where SON has not notified X2GW of neighbor relation between CWS and Macro eNodeB, HNG continues sending Handover over S1. X2GW views SON as a DB which holds Cell Neighbor Related information and keeps updating x2 learnt neighbours using well defined API's towards SON.

Abstract: A method, computer readable media and system for providing X2 Gateway (GW) multi-cell support, comprising: are presented. In one embodiment a method includes providing a system having a Virtual Radio Unit (VRU) in communication with a Het Net Gateway (coordinating server); exchanging non-content X2 request messages between the VRU and the coordinating server; exchanging non-content X2 response messages between the VRU and the coordinating server; and wherein the non-content X2 request messages and the X2 response messages are used to communicate multiple cells served by the VRU to the coordinating server.

Abstract: A method for establishing a segment routing (SR) tunnel based on an Internet Protocol version 6 (IPv6) data plane using a Path Computation Element Communication Protocol (PCEP) includes generating, by a path computation element (PCE), a first PCEP message, wherein the first PCEP message comprises indicating information and segment identifier (SID), and wherein the indicating information indicates that the SID is an IPv6 prefix of a node in a tunnel; receiving, by a first path computation client (PCC), the first PCEP message from the PCE; and establishing, by the first PCC, a Segment Routing over IPv6 (SRv6) tunnel from the first PCC to a second PCC.

Abstract: Methods, systems and computer readable media are disclosed for providing optimized X2 cell reporting. In one embodiment a method includes selecting a subset of virtualized BaseBand Units (vBBU) vnodes to a macro peer that have either reported the X2 peer eNB as a neighbor, or host a cell that the X2 peer eNodeB (eNB) has reported as a neighbor while advertising the neighboring cells towards macro; and advertising cells of this subset of vBBU vnodes as served-cells in X2-Setup Request/Response towards a macro.

Abstract: A method for establishing Segment Routing (SR) tunnel based on Internet Protocol version 6 (IPv6) data-plane using a path computation element communication protocol (PCEP) includes generating, by a path computation element (PCE), a first PCEP message, wherein the first PCEP message comprises indicating information and segment identifier (SID), and wherein the indicating information indicates that the SID is an IPv6 prefix of a node in a tunnel. A first path computation client (PCC) receives a first PCEP message from a PCE and the first PCC establishes an SR for IPv6 forwarding plane (SRv6) tunnel from the first PCC to a second PCC.

Abstract: A multilevel clustered data set for multidimensional vectors is created by defining a plurality of clusters based on each of the signed dimensions of the vectors, each dimension functioning as an axis. Vectors are assigned to each cluster by measuring cosine similarity between a vector and each axis. Sub-clusters are defined as ranges of cosine similarity values within a cluster, and each vector is assigned into the appropriate range based on their cosine similarity value with the axis of the cluster. Searching for a matching vector to a new vector is efficiently achieved in near-constant time by measuring cosine similarity for the new vector with each axis to identify the closest cluster, reusing the cosine similarity of the new vector and axis to determine which sub-cluster corresponds to the appropriate range of values, and then comparing each vector within the sub-cluster until a match is found or ruled out.