49 results about "Asynchronous network" patented technology

The invention relates to an anti-quantum distributed asynchronous random beacon method and system. The method comprises: a distribution stage of executing an anti-quantum asynchronous verifiable secret sharing method; an asynchronous common subset protocol is executed, distribution nodes corresponding to received effective secret shares serve as input, and a node set i with the size of t is consensus; executing a reconstruction stage of the anti-quantum asynchronous verifiable secret sharing method, reconstructing the secret value of each node in the set I, and if the reconstructed secret value is invalid, rejecting the node from the set I; and outputting the XOR sum of the secret values of the nodes in the set I as a public random number. According to the method, distributed generation of public random numbers is supported, the single-point fault problem is avoided, the system security can be ensured in an asynchronous network, and quantum computer attacks can be resisted.

The invention discloses an efficient double-link block chain consensus method and device, equipment and a storage medium, and belongs to the field of information security. The method comprises an initialization stage, an input stage, a coding stage, a broadcasting stage and a consensus stage. According to the invention, the parallel design of a coding broadcast link and a consensus confirmation link is adopted, so that the occurrence frequency of transaction congestion is reduced; the integrity required by the asynchronous Byzantine consensus process is realized through three-step broadcasting, the updating problem of the post-quantum component does not need to be considered, and the security is higher; an asynchronous network and a Byzantine opponent model are adopted, so that malicious node attacks which do not exceed the total number of nodes can be tolerated on the premise of not setting a network time delay upper limit; in the encoding stage, the generation of the redundancy share through the RS erasure code can be realized by adopting preprocessing, the data redundancy expansion multiple in the broadcasting stage is far smaller than that of the same type of protocol, and the original transaction can be recovered by collecting part of effective shares in the consensus stage, so that the system time delay is effectively reduced, and the system throughput is improved.

The invention provides a multi-epoch observed quantity combined aircraft positioning method under an asynchronous network, and the method can achieve the positioning of a maneuvering aircraft under the asynchronous network. The method comprises the following steps: firstly, acquiring observed quantities of an epoch 1-T aircraft and M non-GNSS satellites to form a first sequential observed quantity tau; constructing a motion offset model and a clock model between epochs of the aircraft; substituting the motion offset model and the clock model into epoch i observed quantity expression between the aircraft and the satellite to obtain a mapping relation between the aircraft parameter and the clock parameter of the epoch 1 and the epoch i observed quantity; the aircraft parameters of the epoch 1 and the relative clock error and clock drift of the aircraft and each satellite are used as to-be-estimated parameters; determining a second sequential observed quantity tau'according to the to-be-estimated parameters and the mapping relation; constructing a positioning objective function for searching a to-be-estimated parameter which enables an error between tau'and tau to be minimum; and based on the positioning objective function, jointly estimating aircraft parameters and relative clock correction and clock drift of the aircraft and each satellite, and completing aircraft positioning calculation.

The invention provides an asynchronous communication system, method and device based on Netty and a medium, and belongs to the technical field of communication. The system comprises: an asynchronous network communication module, which is used for establishing asynchronous non-blocking network communication connection between a client and a server by using a Netty asynchronous non-blocking I / O model; the memory management module is used for carrying out allocation and recovery management on the memory in the communication process through a memory pool and object pool technology; the protocol adaptation module is used for adapting to different protocols through a self-defined codec and carrying out encoding and decoding processing on data of different protocols; and the back pressure control module is used for introducing a machine learning model, predicting the processing capability of the server and the request trend of the client, dynamically adjusting a semaphore threshold value or the length of a request queue, and realizing adaptive flow control. According to the invention, the communication efficiency is improved, the memory management is optimized, the protocol adaptation is flexible, and the adaptive flow control is realized, so that the performance and service adaptability of a communication system are enhanced.

The present application relates to the technical field of block chains, and in particular to an asynchronous network consensus method and apparatus, an electronic device and a readable storage medium. The method comprises: receiving and verifying transaction proposals broadcasted by other consensus nodes in an asynchronous network, and broadcasting the transaction proposals to the other consensus nodes; on the basis of historical submission records of the transaction proposals, counting a reputation score corresponding to each consensus node in the asynchronous network; and on the basis of the reputation scores of the consensus nodes and a random source, determining a target transaction proposal to be submitted corresponding to a target consensus round. The reputation scores of the consensus nodes are counted by means of the historical submission records, and the random source in the asynchronous network takes into account the activity of the consensus nodes, improving the probability of correctly submitting proposals, improving the activity of an asynchronous consensus algorithm in a Byzantine fault-tolerant system of the asynchronous network, and shortening the consensus achievement duration.

The invention discloses a relay cross-chain method and system applied to block chain cross-chain, and belongs to the technical field of block chain interoperation. The method comprises the following steps that: in an anonymous committee election stage, a candidate node performs anonymous drawing by using an anonymous verifiable random function combined with a weight and a temporary identity key; in the key generation stage, an asynchronous distributed key generation protocol is adopted, a reliable broadcast protocol is combined, and a threshold signature private key share is generated on the premise that a complete private key does not need to be reconstructed; in a cross-chain consensus stage, a committee member generates a threshold signature share containing an identity bit vector, an aggregation node encrypts the bit vector by using an accountability public key and generates a zero-knowledge proof, and a binding relationship between an identity ciphertext and an aggregation signature is constructed. According to the invention, identity privacy protection of a whole cross-chain verification process is realized, and the problem of key generation deadlock in an asynchronous network environment is solved.

The invention relates to the technical field of single-photon communication, in particular to a high-speed transmission method and device for single-photon time counting sequence data. The invention aims to solve the problem of real-time transmission of massive single-photon time counting sequence data generated by a receiving end of a high-bit-rate single-photon communication system, and provides a novel high-speed transmission device for the single-photon time counting sequence data. Comprising a giant frame packing module and a virtual development port module which are arranged in a time counter, and a non-blocking asynchronous network I / O module, a receiving thread pool module, a receiving buffer queue module, a sorting thread module, a storage buffer queue module, a storage buffer queue module, a storage thread module and a hard disk which are arranged in a computer. A traditional single-thread blocking synchronous I / O data receiving and transmitting mode is broken through, the non-blocking asynchronous network I / O and the thread pool are adopted, the concurrent processing capacity of the multi-core CPU is utilized to the maximum extent, and the real-time performance and accuracy of data transmission under the high speed are remarkably improved.

Disclosed by the present disclosure are a blockchain consensus method and apparatus, in which the method comprises: broadcasting, by each blockchain replica node in an asynchronous network, a proposal message corresponding to the blockchain replica node in a current epoch corresponding to the blockchain replica node, forming a weak certificate corresponding to the blockchain replica node in the current epoch after collecting signature voting information fed back by f+1 blockchain replica nodes based on the proposal message, and entering a next epoch after collecting the proposal messages broadcasted by 2f+1 blockchain replica nodes in the current epoch; and performing a blockchain consensus for each blockchain replica node in the asynchronous network after receiving the weak certificates of the same epoch broadcasted by 2f+1 blockchain replica nodes. The present disclosure can effectively improve the consensus efficiency and the transaction throughput.

The invention provides an asynchronous data distribution method, computing equipment and a storage medium. The method comprises the steps that a first node applies an erasure code algorithm to original data to generate n data fragments; wherein the first node is any network node with original data; the first node applies an error correction code algorithm to the n data fragments to generate n verification fragments; the first node broadcasts the first specified data fragment and the first specified verification fragment to other nodes, and sends the n verification fragments to the corresponding network nodes according to the first corresponding relation, so that the second node determines original data according to the received multiple data fragments and multiple verification fragments; wherein the first corresponding relation is used for indicating the corresponding relation between the data fragment and the verification fragment and the network node; the second node is any network node without original data. According to the scheme, data can be efficiently and reliably distributed in an unreliable asynchronous network.

The application relates to the technical field of single-photon communication, in particular to a high-speed transmission method and device for single-photon time counting sequence data. The application aims to solve the real-time transmission problem of massive single-photon time counting sequence data generated by a receiving end of a high-code-rate single-photon communication system, and provides a new high-speed transmission device for single-photon time counting sequence data, which comprises a giant frame packet module arranged in a time counter, a virtual development port module and a non-blocking asynchronous network I / O module, a receiving thread pool module, a receiving buffer queue module, a sorting thread module, a storage buffer queue module, a storage buffer queue module, a storage thread module and a hard disk arranged in a computer. The application breaks through the traditional single-thread blocking synchronous I / O data transmission mode, adopts a non-blocking asynchronous network I / O and a thread pool, maximally utilizes the concurrent processing capacity of a multi-core CPU, and significantly improves the real-time performance and accuracy of data transmission at a high speed.

The application relates to a conflict prediction and avoidance method of CSMA data and TDMA data in an asynchronous network, and belongs to the technical field of communication. The method comprises the following steps: a master node creates or updates a neighboring master node information table according to received beacon frames of other networks; the master node coordinates the transmission of initial beacon frames or subsequent beacon frames between networks according to the neighboring master node information table; the master node adds the neighboring master node information table to the beacon frame and assembles the beacon frame; a slave node creates or updates the neighboring master node information table according to the received beacon frame; when the master node and the slave node detect a data frame to be transmitted, the master node and the slave node respectively transmit the beacon frame to other nodes in the conflict prediction and avoidance mode of the CSMA frame and the TDMA frame of the master node and the slave node. The application coordinates the transmission of TDMA frames of different networks, ensures that the asynchronous networks do not interfere with each other, reduces useless transmission, and saves network energy consumption.

The invention discloses a service request processing-oriented remote procedure calling method and device, equipment and a medium, and relates to the field of computer software, and the method comprises the steps of configuring a target maximum connection number of a plurality of remote procedure calling services in a plurality of working processes of a target client; creating a circular linked list about a plurality of remote procedure call services; the method comprises the following steps: after initialization operation of a plurality of remote procedure call services is completed, when a business request is processed, creating a corresponding sub-request, and determining a target remote procedure call service from the plurality of remote procedure call services based on a preset load balancing rule and a circular linked list; and when the idle connection exists in the connection pool of the target remote procedure call service, sending the sub-request by using the idle connection in the connection pool and the preset storage space bound with the connection based on the asynchronous network framework of the target client, and receiving the response of the sub-request. Therefore, the resource scheduling optimization of the asynchronous RPC client can be realized.

This invention relates to the field of computer processing technology, specifically providing a streaming media forwarding method, apparatus, and computer-readable storage medium. The method includes: sending first streaming media data to a forwarding device; receiving second streaming media data from a publishing device, wherein the first streaming media data is the previous streaming media data of the second streaming media data; upon completion of receiving the second streaming media data, generating a data reception completion event and sending it through the network layer to a preset publishing end, which, upon receiving the data reception completion event, places the second streaming media data into a preset forwarding queue; upon completion of sending the first streaming media data, generating a data transmission completion event and sending it through the network layer to a preset forwarding end, which, upon receiving the data transmission completion event, retrieves the second streaming media data from the forwarding queue; and sending the retrieved second streaming media data to the forwarding device. This invention fully utilizes asynchronous network events for streaming media forwarding, significantly reducing forwarding latency.

The invention provides an online game state synchronization system and method based on block chain asynchronous network service, and the system comprises the following components: a client which is constructed by adopting a Unity game engine and is responsible for the rendering of a game scene, the user interaction and the visual presentation of a local state; the network service layer adopts a Node.js running environment, integrates an Express framework and an ethers.js library, serves as a security agent intermediary between a client and a block chain network, and is responsible for transaction signature construction, transaction broadcast transmission, data format conversion and provision of a standardized RESTful application programming interface; the intelligent contract is compiled by adopting a Solidiity language, is deployed in an Ethereum test network or a main network, and is used as a unique authoritative storage and logic execution carrier of an on-chain state; according to the system, the influence of block chain confirmation delay on player experience can be effectively relieved, the traceability and non-tampering performance of data are guaranteed, and the system is suitable for asynchronous cooperation type multi-player online game scenes.

This invention discloses an asynchronous network consensus method and system based on a reputation model, belonging to the field of consensus algorithm technology. It aims to solve the problems of low efficiency, high latency, and frequent leader election failures in asynchronous network environments. The method is divided into a broadcast phase and a consensus phase: In the broadcast phase, broadcast nodes encode erasure codes into message fragments and distribute them; receiving nodes verify these fragments and store them in the corresponding priority queues. In the consensus phase, each node generates a binary value vector based on its priority queue and distributes it across the network. A leader is elected based on the reputation value calculated by each node. An asynchronous binary consensus protocol is used to reach a consensus on the leader's validity, determining a multi-value Byzantine consensus result. Finally, the original message is requested and restored from the node indicated by the result. Erasure coding reduces communication overhead, and the reputation model reduces the number of consensus failures, improving system throughput, reducing latency, and enhancing stability and efficiency in asynchronous network environments.

A lighting control system (1) comprises at least one input device (2) configured to provide user-derived, status and / or environmental information to the lighting-control system responsive to a query command (10a) and / or at least one control gear (3) configured to provide power to one or more light sources and to provide status information to the lighting-control system responsive to a query command (10a). Further, it comprises an application controller (4) configured to receive the user-derived and / or environmental information or the status information, and configured to issue a query command (10a) in order to obtain the information or depending on the information obtained. There is further provided a reverse bridge (5), which is configured to communicate with the application controller (2) via a wired network bus (6) operated using a synchronous network protocol, which may conform with IEC 62386-101. The reverse bridge (5) is further configured to communicate with the at least one input device (2) and / or the control gear (3) via a network (7) operated using an asynchronous network protocol, which may conform with IEC 62386-104. The reverse bridge (5) is configured to enable bidirectional communication between the application controller (4) and the at least one input device (2) and / or the control gear (3).

The invention provides a non-interactive threshold signature scheme under an asynchronous BFT block chain. An existing threshold signature scheme generally depends on multiple rounds of interaction, verification of signature fragments and zero-knowledge proof depends on an interaction mode, communication overhead in an asynchronous network environment is large, the robustness requirement cannot be met in the signature process, and a protocol needs to be restarted under the condition that signature verification fails. Therefore, according to the scheme, a non-interactive mode is adopted for communication in each process, each node can still enter the next stage without waiting for the response of other nodes when sending and broadcasting the communication information, the number of communication rounds is remarkably reduced, and the method can adapt to a high-delay asynchronous network. By arranging the signature aggregator, when the honest signature node number meeting the threshold value exists, the aggregator can generate a signature, node verification errors can be tolerated, and the robustness requirement is met. Therefore, the scheme can adapt to an asynchronous block chain network environment, and has the characteristics of high robustness, high fault tolerance and non-interaction.

This invention provides an asynchronous network station sorting method based on the arrival time of frequency hopping signals, comprising the following steps: buffering the classified set of frequency hopping descriptors with the same hopping rate; precisely estimating the frequency hopping period; obtaining the starting point of the frequency hopping sequence after analysis; initially obtaining a set of network station frequency hopping signals that meet the conditions; correcting the network station frequency set; and outputting the network station results. This method can utilize the characteristics of the arrival time of frequency hopping signals for sorting. The "initial acquisition of the network station frequency hopping signal set" performs coarse classification of the network stations, and the "correction of the network station frequency set" further refines the network station frequency set, improving the sorting accuracy. Since the arrival time of the frequency hopping signal is one of the most fundamental parameters of the frequency hopping signal, this method has strong stability and is applicable to different frequency hopping signals. The arrival time of the frequency hopping signal is acquired in real time, giving this method excellent real-time performance. This method only requires estimation of the frequency hopping period and the starting point of the hopping sequence, resulting in relatively low computational complexity.

The invention provides an asynchronous network search method, system and device for a frequency hopping ad hoc network and a medium. The method comprises the following steps: determining a network scale M of the frequency hopping ad hoc network and a time error N between network nodes; determining a corresponding synchronous frequency point Ftod in combination with the original data key PK and a preset operation rule, and returning to the first N-1 minutes to obtain N synchronous frequency points; uniformly setting N + 1 synchronous time slots in each subframe through the time error N, and selecting a continuous time slot between two synchronous time slots as an asynchronous network detection time slot; and based on the asynchronous network detection time slot, sending and receiving of broadcast messages are carried out by using the synchronous frequency point, and asynchronous network discovery and time synchronization are completed. According to the method, through time error and synchronization frequency point design, efficient network discovery and time synchronization are realized, different scene requirements can be adapted, time delay fluctuation is reduced through a detection and backspacing mechanism, and network real-time performance and stability are improved.

The embodiment of the invention provides a phase difference measurement method of an asynchronous network, electronic equipment and a storage medium. The method for measuring the phase difference of the asynchronous network comprises the following steps of: determining a data transmission reference duration of preset data transmitted by a first network element in a preset data transmission path as a whole network measurement reference duration; based on the data transmission reference duration of the first network element, sequentially determining the data transmission reference duration of the (i + 1) th network element according to the data transmission reference duration of the ith network element in the data transmission path; obtaining a phase difference between the (i + 1) th network element and the whole network measurement reference duration according to the data transmission reference duration and the actual transmission duration of the (i + 1) th network element; and determining the phase difference of the data transmission path according to the phase difference corresponding to each network element. According to the scheme of the embodiment, the PD difference between the first network element and the last network element can be directly obtained through simple processing, phase difference calculation of the cross-multi-hop asynchronous network is achieved, and a technical basis is provided for frequency offset estimation and clock recovery of the cross-multi-hop asynchronous network.

In some implementations, a system is provided for asynchronously performing and monitoring cybersecurity investigations. A scheduler selects event detection jobs to be performed during a specified time interval, and provides the selected event detection jobs to an orchestrator. For each event detection job, the orchestrator executes a corresponding event detection job worker instance. Performing the event detection job includes querying at least one event data log for event data that represents events that have occurred over a specified time range, processing the event data to generate a detected security metric, and in response to the detected security metric meeting a threshold value, publishing a cybersecurity alert to a cybersecurity investigation result repository. A response system subscribes to the cybersecurity investigation result repository to identify cybersecurity alerts that have been published to the repository, and in response to identifying a cybersecurity alert, performs a security response.

The invention belongs to the technical field of communication countermeasure, and discloses an asynchronous network station sorting method based on take-off time of a frequency hopping signal, which specifically comprises the following steps of: receiving the frequency hopping signal of a single channel, extracting an I-path signal and a Q-path signal, and generating a complex signal; performing short-time Fourier transform on the complex signal, and converting the complex signal into a time-frequency energy distribution matrix in a spectrogram form; estimating the number of network stations based on the time-frequency energy distribution matrix; performing signal enhancement processing on the time-frequency energy distribution matrix; performing focusing analysis on the enhanced time-frequency energy distribution matrix, extracting effective time-frequency data, extracting a frequency set and generating a frequency slice; extracting a multi-hop signal from the frequency slice, calculating residence time and determining a take-off moment; through single-channel receiving and time-frequency analysis technologies and in cooperation with an innovative take-off moment feature extraction method, efficient and reliable asynchronous network table sorting is achieved, and the problem that in the prior art, effective sorting can only be achieved by depending on a multi-channel receiving system is effectively solved.

The invention belongs to the technical field of network security protocols, and particularly relates to an asynchronous distributed random number protocol based on a producer-consumer model and reliable broadcast. The asynchronous distributed random number protocol provided by the invention is constructed under a producer-consumer model, and comprises a producer process, a consumer process and a removal process which run among a plurality of distributed nodes under an asynchronous network environment; each node in the producer process continuously produces a new PVSS commitment and reaches a consensus for the PVSS commitment through a BRB protocol; in the consumer process, each node continuously elects a leader and reveals a secret value hidden in the PVSS commitment generated by the leader at the earliest, and a consensus is achieved for the distributed random number in the round through a BRB-like protocol; and the removal process is responsible for removing the fault node. The method has low communication overhead and calculation cost and extremely high throughput, can be adapted to a real network environment, and can be widely applied to various distributed scenes such as secure multi-party calculation and anonymous communication.

The invention discloses an event-driven asynchronous network distributed parameter estimation method based on M estimation. The method mainly comprises the following steps: A, constructing a distributed measurement model; b, calculating a local error ei (n); c, constructing an M estimation cost function; d, setting a random step size to describe the uncertainty of the nodes; e, adaptively updating the intermediate estimation hi (n + 1); f, setting an event driving mechanism, and judging a satisfaction condition of an event driving condition; g, setting a random combination coefficient to describe the uncertainty of the connection between the nodes; h, aggregating the intermediate estimations of the neighbor nodes to obtain updated parameter estimations wi (n + 1); and I, iterating, and repeating the steps from A to H until the distributed parameter estimation is finished. According to the method, interference of non-Gaussian noise can be overcome in an asynchronous network environment, each node only carries out information interaction at the event triggering moment, and the distributed parameter estimation capability with lower communication consumption is achieved.

The invention discloses an autonomous access method and system based on protocol security state machine mirroring and programmable deterministic arbitration, and belongs to the technical field of 6G air-space-ground integrated networks. According to the invention, on the basis of a preorder patent zero-signaling deterministic communication framework, cross-base-station / cross-satellite autonomous deterministic mobility management is realized. The core innovation comprises: a PSSM mirror image establishment and three-party cooperation mechanism: a terminal pre-establishes a logic synchronization state machine mirror image at a target base station, and participates in deterministic arbitration with a virtual local user identity; the invention discloses an open-loop synchronization method based on geometric positioning, which solves the problem of accurate mapping of physical time in an asynchronous network environment. A programmable deterministic arbitration function supports dynamic configuration and online updating of various strategies such as rotation fairness, static priority and the like, and continuous adjustability (1.0 ms-75.5 ms) of deterministic time delay guarantee capability is realized; the terminal side carries out parallel double-track resource calculation and autonomous monitoring on the protocol, and the signaling overhead in the switching execution stage is zero; different levels of hard delay guarantees are provided for different service flows of the same terminal according to a differential switching strategy; a state out-of-step detection and rapid recovery mechanism is adopted, and millisecond-level recovery capability is realized; and batch pre-configuration and global optimization support synchronous switching of massive terminals. According to the invention, a complete theoretical framework and an engineering path are provided for realizing 6G network endogenous deterministic mobility management.

The embodiment of the specification discloses a kind of knowledge base document concurrent processing method, equipment and medium, it is related to distributed computing technical field, method includes: receiving multiple concurrent user requests by asynchronous network interface, generating unique request identifier for each concurrent user request, and return asynchronous acceptance response to client, concurrent user request and unique request identifier are published to message queue;Multiple user requests are batched pulled from message queue, determine request batch, based on each user request in request batch, determine the unique hash digest corresponding to each user, to unique hash digest, carry out query in preset multi-level cache system, determine cache query result;When cache query result is cache miss, request batch is dispatched to GPU computing unit to execute model inference calculation, determine model inference result data, to store model inference calculation result data to multi-level cache system, and it is returned to client by long connection protocol stream.

The present disclosure relates to resource allocation for device-to-device (D2D) synchronization signal transmission and user equipment (UE) behavior. Techniques are disclosed to improve resource allocation for time synchronization and inter-cell D2D discovery between UEs connected to an asynchronous network deployment. In addition, transmission rules are provided for the network, where a discovery resource pool is allocated in a frequency division multiplexing (FDM) manner. There can be an overlap between resources allocated for the discovery resource pool and resources allocated for D2D synchronization signals (D2DSS) in a first subframe of the transmission resource pool. Non-overlapping PRBs in the discovery resource pool can be allocated for WAN transmission or D2D discovery transmission. In the case of FDM allocation of the discovery resource pool, a measurement result such as a reference signal received power or a path loss can be made for the UE. The measurement result can be compared to a threshold to determine whether the UE will transmit a D2DSS.

The invention provides a deterministic communication state seamless switching method and system and a deterministic communication state seamless access method and system for an asynchronous cellular network, and belongs to the technical field of 5G-Advanced / 6G mobility management. In order to solve the problems of time sequence breakage, resource mismatch and arbitration interruption of deterministic communication state transition in an asynchronous network, the invention provides a logic time axis cluster and main logic axis migration concept. The network side determines an earliest available resource for the main logic axis service of the target cell through iterative arbitration, and issues a configuration including a switching execution time window; and the user equipment keeps the logic state continuous by adopting a pause-queuing mechanism, completes switching in a time window and recovers deterministic transmission. Meanwhile, the invention provides an enhanced deterministic random access method, each user computes exclusive access resources through absolute time commitment of network broadcast, the base station adopts two-step deterministic arbitration to solve collision and provides a deterministic retry sequence for failed users, and bounded time delay access is realized. According to the invention, the full-process end-to-end hard deterministic service from initial access, service transmission to cross-cell switching is realized, and the interruption time and the signaling overhead are obviously reduced.

The application discloses a kind of federal learning methods based on high availability non-interactive security aggregation scheme, its characteristics are based on the security aggregation method of pairing mask, through asynchronous public subset consensus algorithm, it is realized on distributed server cluster non-interactive high availability security aggregation federal learning, specifically includes: (A) initialization stage (B) aggregation stage epoch 0, first round, user;(C) aggregation stage epoch 0, first round, server;(D) aggregation stage epoch 0, second round, user;(E) aggregation stage epoch 0, second round, server;(F) aggregation stage epoch k (k>0), user and (G) aggregation stage epoch k (k>0), server etc.Steps.The application has high availability security aggregation, small amount of calculation, resists malicious adversary and other advantages compared with prior art, realizes the privacy protection of gradient information, and guarantees the correctness of federal learning training result, is established in the asynchronous network model closest to real network model, with higher practical application value.

This invention relates to the field of data processing and information transmission, and discloses a method, system, and medium for incremental mining and dynamic updating of media resources, comprising the following steps: The invention acquires incremental activity logs from a financial business system; it invokes a data exploration agent to perform rule matching, mines target business tags that meet thresholds, and determines popularity weights; based on these tags, it triggers a media generation agent to call a large model interface to generate candidate media resources; it performs compliance review and transfer of the resources through a collaborative routing module, and obtains confirmation logs; it writes the resources into a media library and dynamically updates the front-end panel according to the popularity weights. This invention drives large model generation through underlying data aggregation and quantification of weights, and combines pixel-level anti-counterfeiting watermarking and asynchronous network routing mechanisms to construct a system-level compliance closed loop, effectively solving the technical problems of traditional methods such as high reliance on manual labor, delayed updates, and low security in transfer.