5results about How to "Avoid hunger" patented technology

The application provides a vulnerability repair method and system, and relates to the technical field of network security vulnerability verification and enterprise vulnerability management. The application obtains a task containing a vulnerability identifier, asset information and to-be-verified repair content, processes the task in parallel according to a pipeline split according to business execution steps, and configures a resource pool matching external dependencies for each stage; a stage fingerprint is generated when the task is transferred, a result is reused when a subtask is executed, otherwise the execution is scheduled according to vulnerability harm, asset importance and threat intelligence, and the vulnerability repair is completed according to the verification result. The application solves the problems of low throughput of the existing general pipeline, slow response of high-priority tasks, and easy starvation of low-priority tasks, and achieves the effect of collaborative optimization of throughput improvement, emergency task response acceleration and low-priority task starvation prevention without changing the original business and hardware.

The invention discloses a DQN-based network-on-chip arbitration intelligent optimization method, and belongs to the field of computer system structure network-on-chip interconnection. In an application task execution process, data packet arrival information of an input port of an on-chip network router is collected in real time, time density characteristics and fluctuation characteristics reflecting traffic intensity and time sequence fluctuation characteristics are extracted, and operation state information such as a router cache utilization rate, a port competition degree and an injection rate is combined, so that the data packet arrival information of the input port of the on-chip network router is obtained. And multi-dimensional state description of the router is constructed. A plurality of candidate basic arbitration strategies are preset, a deep Q network reinforcement learning model is adopted, and dynamic selection is carried out among the candidate arbitration strategies according to real-time router state information, so that a better arbitration strategy is selected under the constraint of communication delay and power consumption. Through continuous interactive learning with a network-on-chip operation environment, the method can adaptively match arbitration strategies under different load and flow scenes, effectively reduce communication delay and tail delay, and improve communication efficiency and energy efficiency of the network-on-chip.

This invention relates to a heterogeneous store-and-forward switching method and system for multi-port CAN Ethernet. The method includes: uniformly setting each physical port as a logical port; in an interrupt service routine, appending a source port identifier and internal formatting to the received lightweight packets and storing them in a receive buffer queue; in the device's main loop, retrieving packets from the receive buffer queue, delaying device management frames in the packets to a security context, and executing a forwarding process for the remaining frames; in the forwarding process, matching the source port with a forwarding rule set to generate an output port bitmap, and then calling the matching sending backend to construct a forwarding path according to each target port type in the output port bitmap; dividing the maintenance tasks of the switching device into time slices, executing them in rotation during each main loop cycle, and limiting the duration of each execution. This invention achieves efficient and reliable store-and-forward switching for multi-port CAN Ethernet heterogeneous networks under harsh environments.

The application discloses a method and device for sharing resource access, a server and a medium, and relates to the field of servers. The method comprises the following steps: when a current resource is in an occupied state and a current operation meets preset requirements, the current operation is added to a priority queue; the waiting time of each operation in the priority queue is obtained; the order of the operation with the waiting time exceeding a waiting threshold in the priority queue is improved, and an updated priority queue is obtained; and when the current resource is in a non-occupied state, the operations access the current resource according to the updated priority queue. In the method, the order of the operation with the waiting time exceeding the threshold in the priority queue is improved, so that the starvation problem of the operation with the waiting time exceeding the threshold when waiting for accessing the current resource is solved; in addition, the operations access the current resource according to the priority queue, so that the operation with a high priority accesses the current resource preferentially, and the reliability of the enterprise physical infrastructure management platform in synchronously accessing the shared resource is improved.

This invention belongs to the field of mobile communication technology and discloses a service flow scheduling method for high-speed rail millimeter-wave communication scenarios assisted by unmanned aerial vehicles (UAVs). By configuring system parameters such as node location and link parameters, it acquires information such as mobile relay location, candidate link status, and service requirements in real time. It calculates the propagation distance based on the node and mobile relay locations, and uses link parameters to obtain the average load per time slot within a frame. Then, it calculates the minimum number of time slots required for each mobile relay to complete the service through candidate links. Links exceeding the remaining budget of the resource pool are then eliminated to form a feasible candidate set. This scheme can accurately select effective links, avoid resource conflicts and underutilization, and ensure reasonable resource allocation. Based on a scoring system, it selects the optimal link and dynamically updates the candidate set, taking into account both service priority and starvation status. This avoids the problem of high-priority services being squeezed out and weak link services being starved. Furthermore, frame-level cyclic scheduling reduces algorithm complexity and meets the real-time scheduling requirements of high-speed rail scenarios.