8 results about "Sequential computation" patented technology

The invention discloses a lightweight rapid serialization method for high-throughput scientific data, which comprises the following steps of: 1) defining a uniform data model for each line station, including a common header field, a state specific field and a line station exclusive field; the common header field records the same information contained in each line station, the state specific field describes the data generation state of the line station, and the line station exclusive field describes the customization attribute contained in the data stream in different data generation states; 2) each line station processes the generated data according to the data model, generates a data stream model and serializes the data stream model, and a generator calculates the initial offset and the number of occupied bytes of each field in a binary stream according to the type, length and sequence of the fields; for a pre-distributed continuous buffer area, generating field write-in logic positioned according to offset, converting each field value into a byte stream according to the data type of the field value, and writing the byte stream into a corresponding position of the buffer area; and splicing the code of the binary data of each field to obtain serialized data.

This performs memory planning for code generation, determining the code for computation in the neural network. [Solution] The method provides sequential computation steps for a neural network, determines the size of the input data block and the size of the output data block for each computation step, and calculates memory planning conditions for each predetermined computation step in which the input data block in the memory area is at least partially contained within the output data block. The conditions indicate that the memory area allocated to the output data block of the computation step preceding the predetermined computation step is contained within the memory area of ​​the output data block of the predetermined computation step. The method also performs memory planning for each computation step, taking the calculated conditions into consideration, to set the memory areas of the respective input data block and output data block in main memory.

The application discloses a method and device for controlling triangle mesh rendering order, and belongs to the technical field of computer graphics and two-dimensional skeleton skinning animation. The method comprises the following steps: loading a triangle mesh model and obtaining an initial rendering order thereof; displaying the current rendering order in a preview area of a graphical user interface in a visualized manner in real time; receiving a sequence adjustment operation generated by a user based on linear, circular or manual interactive tools through a control area; responding to the operation to calculate and update the rendering order of each triangle in real time; and outputting the updated order to drive rendering or export an index file. The device comprises model loading, preview display, interactive receiving, sequence calculation and sequence output modules. The application realizes visualized and interactive adjustment of the rendering order, has the advantages of intuitiveness, flexibility, real-time and non-intrusiveness, and significantly improves the efficiency of graphical debugging and rendering effect optimization.

The application discloses a programming assistance method and device based on generative AI and a medium, relates to the technical field of intelligent programming, and comprises the following steps: sorting a state fragment set and establishing a unified scanning sequence, calculating the connection value between a function item state fragment and an interface item state fragment, determining the uniquely connected interface item state fragment and mode item state fragment, and then generating a target trajectory set, a constraint chain set, and corresponding slot set and reference fragment set; constructing a training sample and training a code generation model according to the target trajectory set, the constraint chain set, the slot set and the reference fragment set, generating a candidate patch set through the trained code generation model, performing consistency checking on each candidate patch and forming a consistency record set; and the application improves the pertinence and localizability of programming assistance by determining the uniquely connected interface item state fragment and mode item state fragment.

The embodiment of the invention provides a salary project calculation method and a related device, which are used for improving the convenience and accuracy of target salary project calculation. The method provided by the embodiment of the invention comprises the following steps: if the calculation of a target salary item is triggered, traversing the in-degree of each node in an abstract syntax tree to obtain a target node of which the in-degree is zero, and inserting the target node into a queue; for the target node, traversing a next-level child node of the target node in the abstract syntax tree, and subtracting one from the in-degree of the next-level child node to obtain the updated in-degree of the next-level child node; if the updated in-degree of the next-level child node is zero, inserting the next-level child node into the queue, determining the next-level child node as a target node, and returning to execute the step of traversing the next-level child node of the target node in the abstract syntax tree for the target node until each node is inserted into the queue, obtaining a plurality of nodes arranged according to a first sequence; and calculating the value of the target salary item according to the first sequence.

The application provides a data processing method, system, device and storage medium, relates to the technical field of data processing, and comprises the following steps: receiving a plurality of task creation requests sent by a business system, creating a plurality of business tasks; generating a first processing order of the plurality of business tasks in combination with the processing priorities and the association indexes of the business tasks; adjusting the first processing order according to the resource occupation amounts of the business tasks, and generating a second processing order; calculating delay risk indexes of the business tasks, adjusting the second processing order according to the delay risk indexes, and generating a target processing order; the delay risk index is used for representing the degree of influence of the processing delay of each business task on the business; and the plurality of business tasks are processed in the target processing order through a preset global task listener. The application has the technical effect that the scheduling efficiency in a complex business scenario is improved, and therefore the overall performance of the system is improved.

A parsing unit parses database calls from a first list of programs to generate a second list of programs specifying tables that are read or written by each program from the first list. A control unit determines, from the second list of programs, if any first programs do not read data written by other programs from the second list of programs. The control unit inserts the first programs at a beginning of a first table. Next, the control unit determines, if any programs still in the second list of programs only read data written by programs in the first table. These programs are inserted in the first table after the first programs. After this step has been performed multiple times, any programs remaining in the second list of programs are inserted at the end of the first table. Finally, programs from the first table are executed in order.

The application relates to the technical field of computers, and provides a correctness verification method, device and equipment of a large text sequence BWT and a medium. The method comprises the following steps: blocking a character string X and a suffix array thereof, recursively calling block induction sorting to contract the character string X until the characters in the contracted character string X1 are unique; in the backtracking stage of the recursion 0 layer, the order of S* type suffixes of the character string X is calculated according to the suffix array of X1, and the hash value of the descending S* type suffix sequence is calculated; according to the order of the S* type suffixes of the character string X, the L type and S type suffix predecessor character sequence and the hash value thereof of each block are calculated; the L* type suffix order and the hash value of each block of the L type BWT sequence are calculated by using a small top heap; the S* type suffix sequence and the hash value of each block of the S type BWT sequence are calculated by using a large top heap; and the two types of BWT sequences are combined, and the final verification result is output, so that the time and space overheads of BWT correctness verification are reduced.