Abstract: A system and method for real-time transmission of a panoramic video, which propose a new grouping method and bitrate decision method specifically for a panoramic 360-degree video. The grouping method takes into account fields of view of different users, thus effectively reducing the bandwidth consumption of repeated video segments, while ensuring user fairness and making full use of network bandwidth resources when allocating resources. The system and method of the invention can maximize the long-term QoE of users under the condition of limited bandwidth, and avoid the problem that the existing schemes are complex and difficult to meet real-time requirements of users.

Abstract: The present invention provides a method, apparatus, electronic device and storage medium for computing power routing, wherein the method includes: receiving a packet which comprises an IP message; inserting network information of a first switching device in the IP message and re-encapsulating it to obtain an encapsulated packet; a second switching device collecting network information in the encapsulated packet and sending the network information to a controller; subscribing to computing power resource information and sending the information to the controller; constructing a global network topology diagram which includes multiple nodes; planning a general routing table for each node with the network information; planning a computing power routing table for each node with the network information and the computing power resource information; matching a destination routing path for the packet with a request type, wherein the path is determined according to the general routing table or the computing power.

Abstract: A low priority uplink information retransmission method, includes: in response to uplink control information (UCI) having a transmission conflict, a base station using scheduling information of high priority UCI to deliver identifier information of low priority UCI to be retransmitted by a terminal in the UCI having the transmission conflict.

Abstract: Disclosed are a decoding method and a decoding device. The decoding method includes: performing a permutation processing on a receiving sequence and a generator matrix to obtain a permuted receiving sequence and an intermediate generator matrix according to a reliability of each bit of the receiving sequence; performing a Gaussian elimination processing on the intermediate generator matrix to obtain a systematic generator matrix generator matrix; performing a hard-decision decoding on the permuted receiving sequence to obtain a hard-decision decoding sequence; in response to determining a preset decoding end condition is not achieved, selecting a target error pattern from an error pattern set; and generating a decoding result based on the target error pattern, the hard-decision decoding sequence, and the systematic generator matrix. The decoding method can ensure the decoding performance and reduce the decoding complexity.

Abstract: Disclosed are a decoding method and a decoding device. In the method, a received sequence and a generator matrix are processed to obtain a hard-decision information sequence and a hard-decision codeword; an error pattern is determined according to the hard-decision information sequence and the hard-decision codeword; then, the error pattern is post-processed and an optimal decoding sequence is output as a decoding result, wherein the optimal decoding sequence is a decoding sequence with a minimized Euclidean distance. According to the present disclosure, the complexity of the algorithm is reduced while the effective decoding performance can be ensured.

Abstract: Disclosed is a secret-key provisioning (SKP) method and device based on an optical line terminal (OLT), which can generate an SKP queue according to key requests received; generate at least one secret-key according to the SKP queue; and store the at least one secret-key in key pools (KPs) of corresponding ONUS. A non-transitory computer-readable storage medium is also disclosed.

Abstract: A method for multi-policy conflict avoidance in an autonomous network comprising: collecting network state information; acquiring a set of multiple policies to be verified; constructing a policy ordering space tree containing all multi-policy execution sequences; performing a depth-first traversal on the policy ordering space tree, extracting a multi-policy execution sequence to be verified, then constructing an initial simulation data plane, injecting each policy in the multi-policy execution sequence into the simulation data plane one by one in sequence, and storing a simulation data plane after each policy is inserted; detecting whether there is a conflict in the simulation data plane generated after each policy is executed, inferring dependencies among multiple policies in the conflict policy sequence, pruning the policy ordering space tree, to efficiently select and update the multi-policy execution sequence avoiding conflicts.

Abstract: The embodiments of the present application provide a method and apparatus for modulation recognition of signals based on cyclic residual network, the method comprises: obtaining a signal matrix of a to-be-recognized signal, and extracting real part information and imaginary part information of the signal matrix; generating, according to extracted real part information and imaginary part information, a real-and-imaginary-part feature matrix of the to-be-recognized signal; converting, according to a preset matrix conversion method, the real-and-imaginary-part feature matrix into an amplitude-and-phase feature matrix; and inputting the amplitude-and-phase feature matrix into a pre-trained cyclic residual network to obtain a modulation mode corresponding to the to-be-recognized signal.

Abstract: A coupled-line rat-race coupler includes four ports and four coupled-lines each composed of two metal lines. Two of the ports are respectively connected with the front ends of the two lines of the first coupled-line, and the other two ports are respectively connected with the front ends of the two lines of the second coupled-line. The two lines of the third coupled-line are short circuited and respectively connected with the back end of one line of the first coupled-line on one side and with the back end of one line of the second coupled-line on the other side. In the fourth coupled-line, one line is open at one end and short circuited at the other end with the other line, which is connected with one line of the first coupled-line and one line of the second coupled-line. The coupled-line rat-race coupler is characterized with smooth and stable output phase.

Abstract: The present disclosure relates to a distributed trusted sensing method and system for an integrated communication, sensing, and computation network, and relates to the field of wireless sensing technologies. First, a global model and an initial global parameter are transmitted to each edge node. Each edge node performs local training by using local data, to obtain a local model parameter, broadcasts the local model parameter through a corresponding miner, then assigns a weight to each local model parameter, to calculate a global parameter, and updates the global parameter through aggregation iteration. In the present disclosure, calculation is performed by using computation resources and data resources of each distributed edge node, thus saving the overall communication and computation resources.

Abstract: The present invention provides a computing power scheduling method, apparatus, electronic devices and storage medium, the method comprising: a computing power node and an access terminal send computing power information to a switch using L4 network protocol; the switch uploads the computing power information to a distributed SDN subcontroller; the distributed SDN subcontroller collects switch state information and network quality information from the switch using in-band network telemetry technology; the distributed SDN sub-controller collects switch state information and network quality information from the switch using in-band network telemetry; the distributed SDN sub-controller uploads the computing power information, switch state information and network quality information to the SDN master controller; the SDN master controller determines the computing power scheduling policy based on the computing power information, switch state information, network quality information and master controller information

Abstract: A multiple access method includes: obtaining, by a user equipment (UE), first source information; extracting a semantic feature of the first source information to obtain a first semantic feature sequence; performing a joint source-channel coding on the first semantic feature sequence to obtain a first semantic information sequence; mapping the first semantic information sequence into preset time-frequency resources of an uplink multiple access channel; and transmitting the first semantic information sequence through the uplink multiple access channel.

Abstract: A multi-view fine-grained identification method, apparatus, electronic device and medium. By applying the technical scheme of the application, an initial classification model can be trained by using a sample data set consisting of multi-view images of a plurality of multi-view samples. Thus, an efficient fine-grained identification model can be obtained, and this model can actively select the next view image of the same sample for image identification. On the one hand, by aggregating information of multi-view images of the same sample, the limitation of traditional fine-grained image identification methods that only rely on a single picture to provide clues for discrimination is solved. On the other hand, by predicting view images for discrimination, identification efficiency based on multi-view fine-grained identification is improved.

Abstract: The present disclosure relates to a distributed trusted sensing method and system for an integrated communication, sensing, and computation network, and relates to the field of wireless sensing technologies. First, a global model and an initial global parameter are transmitted to each edge node. Each edge node performs local training by using local data, to obtain a local model parameter, broadcasts the local model parameter through a corresponding miner, then assigns a weight to each local model parameter, to calculate a global parameter, and updates the global parameter through aggregation iteration. In the present disclosure, calculation is performed by using computation resources and data resources of each distributed edge node, thus saving the overall communication and computation resources.

Abstract: Disclosed are a method and apparatus for task scheduling based on deep reinforcement learning and a device. The method comprises: obtaining multiple target subtasks to be scheduled; building target state data corresponding to the multiple target subtasks, wherein the target state data comprises a first set, a second set, a third set, and a fourth set; inputting the target state data into a pre-trained task scheduling model, to obtain a scheduling result of each target subtask; wherein, the scheduling result of each target subtask comprises a probability that the target subtask is scheduled to each target node; for each target subtask, determining a target node to which the target subtask is to be scheduled based on the scheduling result of the target subtask, and scheduling the target subtask to the determined target node.

Abstract: The present application discloses a few-shot image recognition method and apparatus, a device, and a storage medium. The method includes: obtaining to-be-recognized images, and constructing an image episode according to the to-be-recognized image, the image episode including a support set and a query set; inputting the image episode into a pre-trained image recognition model, the image recognition model being a few-shot image recognition model based on hard episode training; and calculating a similarity between an image in the query set and each class in the support set according to the image recognition model, and determining the class of to-be-recognized images in the query set according to the similarity.

Abstract: A data processing method includes determining, by a base station, a distribution characteristic of a local dataset of at least one user equipment (UE), and scheduling, by the base station, based on the distribution characteristic of the local dataset, a target UE from the at least one UE for participating in federated learning.

Abstract: The present application discloses a backoff method and apparatus in a transmission process, a device, a system, and a storage medium, which relate to the field of communication technology. The method includes: a transmitting device performing LBT in an unlicensed frequency band; the transmitting device transmitting an RTS to a receiving device when the LBT has been successfully performed, the RTS including a first backoff time period; the transmitting device transmitting, after having received a CTS transmitted by the receiving device, a C-CTS to the receiving device, the C-CTS including a second backoff time period.

Abstract: Aspects of the invention can provide a method for configuring a discontinuous reception (DRX) parameter, which method is applied to a base station. The method can include, according to first discontinuous reception (DRX) transmission feature data, configuring a discontinuous reception (DRX) parameter for a terminal, wherein the first discontinuous reception (DRX) transmission feature data is discontinuous reception (DRX) transmission feature data for discontinuous reception (DRX) transmission performed by the terminal at historical moments.

Abstract: A routing method includes: determining a path quality between a first node and each of second nodes in a service to be transmitted through a path quality evaluation model; where, the second node is one next-hop node of the first node; and the path quality evaluation model is constructed according to a signal-to-noise ratio SNR and an ambient temperature change; determining an optimal next-hop node from second nodes according to the path quality; updating a Q table of the first node according to the optimal next-hop node; taking the optimal next-hop node as a new first node; returning to the step of determining a path quality between a first node and each of second nodes until the new first node is a destination node of the service to be transmitted; and determining a transmission path of the service to be transmitted according to the Q table.