4results about How to "Reduce traversal" patented technology

The invention relates to the technical field of flow scheduling, in particular to an MSTD3S-based time-sensitive network flow optimization scheduling method, which comprises the following steps of: constructing an adjacent matrix based on switch network topology; constructing a feature matrix by using the node state features; extracting a node embedding representation matrix by using a GCN network; constructing a state vector by utilizing the characteristics of the to-be-scheduled flow, the source node embedding representation and the target node embedding representation; the state vector is input into an improved Actor-Critic network; the improved Actor-Critic network constructs a total reward function based on a scheduling success reward, a mapping score reward, a load balancing reward and a scheduling delay penalty, and performs CQF scheduling in the TSN by using the total reward function. The problem that an existing model cannot give consideration to scheduling time and scheduling quality at the same time is solved.

The present application relates to the technical field of code spraying path planning, and discloses a path planning method, device, equipment and medium for log pile code spraying, which comprises the following steps: collecting position information of the end face of each log in the log pile to be sprayed and corresponding diameter grade information; modeling the log pile to be sprayed into a dynamic layered network model; traversing the log nodes in the dynamic layered network model to generate a code spraying path; performing collision detection on the code spraying path, and optimizing the code spraying path according to the collision detection result; inputting the log code spraying sequence list corresponding to the optimized code spraying path to a code spraying device, and spraying codes according to the log code spraying sequence. The present application converts the log pile into a layered network model by combining the physical constraints of the log pile, traverses the log nodes, plans the code spraying path, embeds the collision detection logic, and dynamically optimizes the code spraying path, thereby replacing manual code spraying, reducing the time complexity of finding the optimal path, and improving the code spraying efficiency.

The application discloses a ray detection method and device, equipment and a storage medium, and relates to the technical field of computers. In the method, the minimum distance is the minimum hit distance corresponding to all virtual elements that have not been detected by the remaining nodes in the node queue. Accordingly, if the hit distance of the current virtual element is not greater than the hit distance of the second node, it indicates that the hit distance of the virtual element will not be greater than any virtual element subsequently detected from the node queue, that is, the virtual element is the virtual element closest to the starting point of the ray and is the virtual element most likely to meet the target event detection requirement. At this time, the virtual element is directly detected based on the detection requirement, and if the detection requirement is met, subsequent detection is terminated immediately, and there is no need to process other nodes with a farther hit distance in the node queue. Therefore, the method can significantly reduce invalid node traversal and intersection calculation, significantly improve the ray detection efficiency under the premise of ensuring the correctness of the detection result.

The application relates to the technical field of data processing, and discloses a quick sorting method and system for instant invoice of different specifications, which comprises the following steps: determining an order type based on order information, locking target inventory based on the order type, and triggering a three-way locking mechanism; horizontally and vertically counting the target inventory and performing inventory lending processing; screening the ticket state of the target inventory, and filtering out the to-be-sorted tickets with the ticket state of 'locked' and 'problem ticket' from the target inventory; detecting the allocation specification of the order information, and triggering the box opening logic if the allocation specification is the same; and sorting the target inventory based on the order information. Through specification level association and dynamic lending, the application solves the problems of insufficient sorting specification accuracy, low efficiency caused by separate database and table, large artificial checking workload, and delayed real-time data statistics in instant invoice sorting.