Abstract: Operations may include obtaining lists of inter-Network-Element connections (inter-NE connections) between connection points of different network elements included in a network and obtaining lists of internal connections of the network elements included in the list of inter-NE connections. The operations may also include generating, based on the lists of inter-NE connections and the lists of internal connections, a global list of connection points that correspond to the inter-NE connections and the internal connections. Moreover, the operations may include generating, based on the global list of connection points, a plurality of upstream connection chains and a plurality of downstream connection chains with respect to the internal connections. In addition, the operations may include generating a list of end-to-end circuits by combining the respective upstream connection chains and the respective downstream connection chains of each respective internal connection.

Abstract: An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.

Abstract: Systems and methods for identifying physical intelligent moving objects (IMOs); creating, for a first subset of the physical IMOs, digital representations in edge clouds of a distributed cloud computing environment, each digital representation representative of a physical IMO of the first subset of the physical IMOs; generating a cooperative network computing (CNC) platform that includes the digital representations of the first subset of the physical IMOs, each digital representation functioning as a CNC entity in the CNC platform for the corresponding physical IMO; identifying a CNC task of a first physical IMO of the plurality of physical IMOs; and performing, by a first digital representation of the representations that corresponds to the first physical IMO, the CNC task in the CNC platform, including accessing data associated with a second digital representation of the digital representations in the CNC platform to perform the CNC task at the first digital representation.

Abstract: An example method may include obtaining multiple symbols each associated with a different state in a quadrature amplitude modulation scheme used for transmission of a data signal. The method may further include determining a sequence of symbols of the multiple symbols for a first portion of the data signal. The determining may include selecting an index value from multiple index values for the first portion of the data signal. The determining may also include obtaining energy states of multiple sequences of the symbols using the energy levels of the symbols. The determining may further include obtaining a relationship between the energy levels of the symbols, the energy states of the multiple sequences of the symbols, and the multiple index values. The determining may further include selecting the sequence of symbols based on the relationship and the index value for the first portion of the data signal.

Abstract: A method may include obtaining an image of a scene from a first perspective, the image including an object, and detecting the object in the image using a machine learning process, where the object may be representative of a known shape with at least four vertices at a first set of points. The method may also include automatically predicting a second set of points corresponding to the at least four vertices of the object in a second perspective of the scene based on the known shape of the object. The method may additionally include constructing, without user input, a transformation matrix to transform a given image from the first perspective to the second perspective based on the first set of points and the second set of points.

Abstract: An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.

Abstract: Systems and methods for provisioning real-time three-dimensional maps, including: at a first processing stage: updating a three-dimensional map of an environment based on received point cloud data; extracting three-dimensional proposals of objects of the environment; projecting the three-dimensional proposals onto a two-dimensional image of the environment; generating two-dimensional proposals of the objects of the environment; at a second processing stage: detecting the objects of the environment from the two-dimensional image of the environment; generating two-dimensional bounding boxes of the objects of the environment; matching the two-dimensional bounding box with a particular two-dimensional proposal of the two-dimensional proposals; and labeling, for each two-dimensional proposal that is matched to a two-dimensional bounding box, the three-dimensional proposal corresponding to the two-dimensional proposal with semantic information associated with the two-dimensional bounding box that is matched to the

Abstract: Disclosed methods for network modernization include obtaining a list of end-to-end circuits carried in a circuit-switched network, calculating, for each circuit, an early retirement credit (ERC) score and a circuit load factor (CLF) score, selecting, dependent on the ERC and CLF scores, a circuit to migrate to a new network, adding the selected circuit to a circuit migration sequence, and removing the circuit from the list. The ERC score represents the number of circuit-switching units on which no circuits would be carried and that would remain in the network following its removal. The CLF score represents an average number of circuits that would be carried on each circuit-switching unit currently traversed by the circuit following its removal. When two circuits have the highest ERC score, the circuit with the lowest CLF score is selected for migration. The method is repeated until the list is empty.

Abstract: Operations may include obtaining lists of inter-Network-Element connections (inter-NE connections) between connection points of different network elements included in a network and obtaining lists of internal connections of the network elements included in the list of inter-NE connections. The operations may also include generating, based on the lists of inter-NE connections and the lists of internal connections, a global list of connection points that correspond to the inter-NE connections and the internal connections. Moreover, the operations may include generating, based on the global list of connection points, a plurality of upstream connection chains and a plurality of downstream connection chains with respect to the internal connections. In addition, the operations may include generating a list of end-to-end circuits by combining the respective upstream connection chains and the respective downstream connection chains of each respective internal connection.

Abstract: Systems and methods for allocating edge computing resources may receive a predicted user route defining multiple wireless access points available along the route at respective time points and an assured delay constraint, determine, for each wireless access point, datacenters in the network meeting the assured delay constraint when accessed through the wireless access point, and construct an auxiliary graph dependent on the predicted user route and the determined datacenters. Each determined datacenter is represented by at least one node in the graph and each path in the graph defines a sequence of datacenters and a corresponding sequence of wireless access points through which they are accessible. A lowest cost path in the graph is determined and the sequences of datacenters and wireless access points defined by the lowest cost path are provided to a resource orchestrator that allocates edge computing resources for a mobile user traversing the predicted user route.

Abstract: Disclosed methods for network modernization include obtaining a list of end-to-end circuits carried in a circuit-switched network, calculating, for each circuit, an early retirement credit (ERC) score and a circuit load factor (CLF) score, selecting, dependent on the ERC and CLF scores, a circuit to migrate to a new network, adding the selected circuit to a circuit migration sequence, and removing the circuit from the list. The ERC score represents the number of circuit-switching units on which no circuits would be carried and that would remain in the network following its removal. The CLF score represents an average number of circuits that would be carried on each circuit-switching unit currently traversed by the circuit following its removal. When two circuits have the highest ERC score, the circuit with the lowest CLF score is selected for migration. The method is repeated until the list is empty.

Abstract: Systems and methods for constellation shaping using low rate loss bit-level distribution matchers include receiving blocks of input bits and, for each input block of a predetermined size, assigning a respective codeword of a predetermined output block size. The number of bits of a given bit value in the codeword is dependent on a predetermined target probability distribution. A one-to-one mapping exists between each possible combination of input bits and a codeword for input blocks containing the combination. Some codewords include a number of bits having the given bit value that is different than the predetermined target probability distribution, but an average number of bits having the given bit value in the available codewords meets the predetermined target probability distribution. The disclosed methods result in more available codewords and a lower rate loss than in bit-level distribution matchers with a constant modulus, while achieving similar shaping.

Abstract: A method may include publishing metadata to a blockchain, the metadata describing a training task associated with a global machine-learning model and computational resource requirements for performing the training task. The method may include receiving a request to participate in training the global machine-learning model from one or more clients based on a relevance of a respective local dataset of each of the clients to the training task and a suitability of the clients to the computational resource requirements for performing the training task. The method may include obtaining local model updates in which each respective local model corresponds to a respective client and each respective local model update is generated based on training the global machine-learning model with each of the local datasets. The method may include aggregating the plurality of local model updates and generating an updated global machine-learning model based on the aggregated local model update.

Abstract: A method may include publishing metadata to a blockchain, the metadata describing a training task associated with a global machine-learning model and computational resource requirements for performing the training task. The method may include receiving a request to participate in training the global machine-learning model from one or more clients based on a relevance of a respective local dataset of each of the clients to the training task and a suitability of the clients to the computational resource requirements for performing the training task. The method may include obtaining local model updates in which each respective local model corresponds to a respective client and each respective local model update is generated based on training the global machine-learning model with each of the local datasets. The method may include aggregating the plurality of local model updates and generating an updated global machine-learning model based on the aggregated local model update.

Abstract: Systems and methods for provisioning real-time three-dimensional maps, including: at a first processing stage: updating a three-dimensional map of an environment based on received point cloud data; extracting three-dimensional proposals of objects of the environment; projecting the three-dimensional proposals onto a two-dimensional image of the environment; generating two-dimensional proposals of the objects of the environment; at a second processing stage: detecting the objects of the environment from the two-dimensional image of the environment; generating two-dimensional bounding boxes of the objects of the environment; matching the two-dimensional bounding box with a particular two-dimensional proposal of the two-dimensional proposals; and labeling, for each two-dimensional proposal that is matched to a two-dimensional bounding box, the three-dimensional proposal corresponding to the two-dimensional proposal with semantic information associated with the two-dimensional bounding box that is matched to the

Abstract: Systems and methods for transmitting, within a time slot, i) first eMBB resource blocks to a first UE and ii) second eMBB resource blocks to a second UE; during transmission of the first and the second eMBB resource blocks to the first and the second UE, respectively, at a first scheduled check point: identifying i) first URLLC resource blocks to be transmitted to a third UE and ii) second URLLC resource blocks to be transmitted to a fourth UE; identifying i) a first transmission deadline for transmitting the first URLLC resource blocks to the third UE and ii) a second transmission deadline for transmitting the second URLLC resource blocks to the fourth UE; generating a transmission queue for the first URLLC resource blocks and the second URLLC resource blocks; and selecting, based on the transmission queue, the second URLLC resource blocks for transmission to the fourth UE.

Abstract: Systems and methods for mapping service function chains to physical network resources include receiving a service function chain request specifying multiple service functions including a service access point, generating a service graph including service links between consecutive service functions, receiving resource information describing capabilities of physical network resources and a topology of the physical network, generating a resource graph including infra links between pairs of connected physical network resources, creating, dependent on the service graph and the resource graph, multiple solutions for mapping the service functions to the physical network resources, and outputting one or more mapping solutions. Each of generating the service graph, generating the resource graph, and creating the mapping solutions may be performed by one or instances of respective microservices that operate in parallel.

Abstract: Systems and methods for constellation shaping using low rate loss bit-level distribution matchers include receiving blocks of input bits and, for each input block of a predetermined size, assigning a respective codeword of a predetermined output block size. The number of bits of a given bit value in the codeword is dependent on a predetermined target probability distribution. A one-to-one mapping exists between each possible combination of input bits and a codeword for input blocks containing the combination. Some codewords include a number of bits having the given bit value that is different than the predetermined target probability distribution, but an average number of bits having the given bit value in the available codewords meets the predetermined target probability distribution. The disclosed methods result in more available codewords and a lower rate loss than in bit-level distribution matchers with a constant modulus, while achieving similar shaping.

Abstract: An intersection management system (IMS) may receive one or more traversing requests from one or more Connected Autonomous Vehicles (CAVs). The IMS may determine a solution space for each of the one or more traversing requests in a space-time resource model of the intersection, find a CAV trajectory allocation in the space-time resource model for each of the one or more traversing requests. The IMS may send an approved reservation to each CAV corresponding to each of the one or more CAV trajectory allocations that have been found. Each of the one or more CAVs may, when an approved reservation corresponding to the CAV may have been received from the IMS, move through the intersection zone as specified in the approved reservation.

Abstract: An optical transmitter for probabilistic shaping and symbol rate optimization includes one or more matcher elements, each configured to assign respective probabilities to symbols represented in received binary data dependent on a target probability distribution and to output a respective shaped bit sequence. The optical transmitter further includes a single systematic error correction encoder configured to add parity bits collectively across the shaped bit sequences and to output a combined shaped bit sequence including data representing the shaped bit sequences and the added parity bits. The optical transmitter also includes multiple mapping elements, each configured to generate a respective codeword for each symbol represented in a portion of the combined shaped bit sequence, a serial-to-parallel converter to provide portions of the combined shaped bit sequence to the mapping elements, and a multiplexer to combine binary data representing the codewords for transmission using subcarrier multiplexing.