62 results about "Tree architecture" patented technology

This application relates to the field of program repair processing technology, and in particular to an automatic program repair method and system based on a multi-level tree structure of a large language model. The method includes: using an information retrieval algorithm to retrieve a set of similar code examples corresponding to the program code to be repaired from a pre-defined code library; determining the model input content based on the set of similar code examples and the program code to be repaired; constructing a thought forest based on the model input content; performing error cause analysis based on the thought forest to obtain a set of high-confidence error causes; constructing a repair forest based on the set of high-confidence error causes; formulating repair strategies based on the repair forest to obtain a set of repair strategies; and performing autoregressive decoding operations based on the program code to be repaired, the set of similar code examples, and the set of repair strategies to obtain the patch code corresponding to the program code to be repaired. This application facilitates improvements in the accuracy and stability of the program repair process.

This invention discloses a method and system for managing and automatically formatting slide content based on a tree structure. By abstracting different types of materials such as text, images, tables, code snippets, and mathematical formulas into tree nodes with parent-child hierarchical relationships, users can freely add, delete, move, or mark nodes in a visual interface to achieve rapid merging or splitting of multi-level documents. The system then maps several nodes into multiple slides based on the node merging or splitting markers; and automatically formats the pages during the output stage, including overflow detection and font scaling, adaptive image proportioning, line wrapping for tables or code snippets, and format conversion of mathematical formulas. This approach significantly reduces the burden of manually adjusting text and images, maintains consistency and aesthetics in slide layout across different resolutions, and is suitable for multi-level, text-rich, and large-scale presentation document scenarios.

This application discloses a method, apparatus, device, storage medium, and program product for processing three-dimensional data, relating to the field of server technology. The method includes: in response to a distribution controller receiving a processing request for three-dimensional data, obtaining task identification information corresponding to the three-dimensional data from the processing request, the task identification information including at least a data type identifier and a tree structure identifier; determining, based on the tree structure identifier, whether the three-dimensional data requires tree structure loading processing; if so, invoking a tree structure traversal unit to load the three-dimensional data; and in response to the completion of three-dimensional data loading, determining the data type of the three-dimensional data based on the data type identifier, and invoking a neural rendering unit and / or an arithmetic calculation unit to process the three-dimensional data based on the data type. This method can improve the processing efficiency of three-dimensional data.

This invention provides a stylizable and deformation-resistant QR code encoding and recognition method based on topological coding, comprising: converting the binary string to be encoded into natural numbers using a bijective function and recursively decomposing it to generate a topological tree structure; determining the spatial allocation ratio based on the tile traces of each node in the topological tree; performing inward shrinking processing on the polygonal region carrying the QR code, recursively dividing it into non-overlapping closed sub-regions according to the ratio, mapping the hierarchical structure of the topological tree to a QR code with a nested structure and stylizing it; scanning the QR code image and performing preprocessing, extracting the boundary contours of the closed regions and constructing a global topological tree, enumerating multiple candidate topological trees and decoding them one by one, and filtering out the valid binary information as the recognition result after CRC verification. This invention achieves the deformation resistance of the QR code through the mapping of the topological tree structure and nested regions, and improves its visual effect and application flexibility through stylization processing.

This invention discloses a fully pipelined AES real-time encryption system for high-speed transmission, aiming to solve the technical bottlenecks of limited throughput and excessive processing latency in traditional encryption architectures in high-speed networks. The system mainly includes a data input buffer module, a fully pipelined encryption operation module, a round key pre-computation module, and a data output driver module. The core of this invention lies in the operator-level hardware reconstruction of the AES underlying algorithm: the S-box nonlinearity is replaced and embedded in the distributed ROM of the FPGA to achieve zero-clock-cycle asynchronous table lookup, and a carry-free XOR tree architecture based on the XTime operator is used to reconstruct column hybrid operations, eliminating deep carry propagation chains.

The application relates to the technical field of artificial intelligence chips, and particularly discloses an addition tree architecture supporting DNN sparse sensing and an implementation method thereof. The architecture comprises an index and data reordering module, a reconfigurable sparse addition array, an address mapping module, a partial sum storage area and an interface control unit thereof. The dynamic accumulation of random sparse data is realized by indexing and reordering the sparse multiplication results and adopting an adder array activated only when the indexes are consistent. The architecture removes the local accumulators in the traditional processing units, supports the parallel operation of calculation and accumulation decoupling, effectively improves the hardware utilization and accumulation efficiency, is suitable for the efficient addition accumulation of various neural network layers such as convolution, full connection and normalization, and has the advantages of strong structure universality, high energy efficiency ratio and low area overhead.

The application provides an embedded model-oriented test case generation method, which comprises the following steps: initializing a plurality of branches in a branch tree structure of a test model to obtain a plurality of solving tasks; the solving task comprises a starting state of the test model, the branch and a priority of the branch; inserting each solving task into a priority solving task queue based on the priority of each branch; and generating a target test case corresponding to a target solving task based on a target solving task with the highest priority in the priority solving task queue. Through the priority solving task queue obtained based on each branch in the branch tree structure of the test model, the target test case corresponding to the target solving task can be generated based on the target solving task with the highest priority in the priority solving task queue, thereby improving the generation efficiency of the test case.

The application discloses an automatic driving behavior decision-making method based on double heuristic tree search, and belongs to the technical field of automatic driving.The method is as follows: actions are abstracted as a combination of lateral lane-changing decision and longitudinal acceleration-deceleration decision, a decision time domain and a decision tree depth are set, and an initial behavior decision tree is constructed; a heuristic search strategy is designed by fusing field knowledge priori and data-driven priori, a reference action sequence is generated to guide the search process; a decision tree pruning mechanism based on field knowledge is proposed, and the tree structure is dynamically reconstructed with the last period optimal decision as a root node; the comprehensive cost of the candidate decision sequence after pruning is evaluated, and the sequence with the minimum cost is selected as the optimal decision sequence.The application effectively solves the technical problems of high computational complexity, poor real-time performance and insufficient decision rationality of traditional methods in a long decision time domain by constructing a semantic action decision tree and fusing a double heuristic guide and a field knowledge pruning mechanism.

A video encoding / decoding method and device disclosed herein determine the current block through block division based on a tree structure and sub-sample the current block to form one or more sub-blocks from the current block, and can encode / decode the sub-blocks belonging to the current block according to a prescribed scan order.

Disclosed herein is an apparatus and method for performing robot task planning based on a large language model. The method may include setting a tree structure in which a natural language goal for the entire task to be performed by a robot is set as an execution node, generating a query corresponding to the natural language goal of the execution node in the tree structure, and selecting and performing, in response to the generated query, either an action (ACT) type for performing a physical action of the robot based on a large language model or an expansion (EXPAND) type for setting subgoals.

This application relates to a document generation method, apparatus, device, storage medium, and program product. The method includes: constructing an outline generation prompt text based on a first tree structure composed of the file paths of various technical documents of a target project; generating an outline based on the outline generation prompt text using a large language model to obtain the outline of the technical document for the target project and the chapter description information of each initial chapter in the outline; recursively splitting each initial chapter according to the chapter description information to obtain the chapter content of each sub-chapter under each initial chapter; and generating the technical document for the target project based on the outline and the chapter content of each sub-chapter under each initial chapter. This method can improve the accuracy of generating technical documents for the target project.

The application discloses a community search method for a graph federation, constructs a federated graph index through confusion encryption security, realizes equivalent plaintext calculation on ciphertext, completes index construction offline and completes fast retrieval online, and greatly improves the query efficiency and scalability of the federated community search under the premise of strictly guaranteeing the local graph structure privacy of each data party. Based on the uniqueness and inclusiveness of the federated k-core, the application efficiently calculates according to a predetermined tree structure, greatly improves the efficiency; by combining the domination vector and the minimum bounding rectangle, the R-Tree index about the k-vector is constructed, the efficient search is realized, and the storage cost is reduced; by traversing the equivalent relationship model between the connected components and the R-Tree index and aggregating the k-shell, the final community is obtained by decrypting and restoring the vertex set, and a reliable implementation scheme is provided for the efficient and safe community search task in the graph federation privacy data collaboration scene.

Example implementations include a system to generate a user object, with a data processing system comprising memory and one or more processors to identify a role attribute of a user object, a geography attribute of the user object, and a temporal attribute of the user object, determine, based on the role attribute, the geography attribute, and the temporal attribute, a benefits group corresponding to the user object, generate a dynamic association of the user object to the benefits group, the dynamic association from the role attribute, the geography attribute, and the temporal attribute, and modifiable in response to a modification of one or more of the role attribute, the geography attribute, and the temporal attribute, and generate a dynamic tree structure from the dynamic association, the tree structure modifiable in response to the modification of one or more of the role attribute, the geography attribute, and the temporal attribute.

This invention relates to the field of R&D management technology, and discloses a method, apparatus, device, and medium for converting mind maps to tables. The method includes: parsing a mind map file to form a node tree structure; establishing a mapping relationship between the node tree structure and table fields; traversing branch paths and extracting text in reverse to generate data entries containing path fields, name fields, step fields, and result fields; detecting the tag attributes of nodes at a specified level to generate priority identifiers; generating an output file name and writing the data entries and priority identifiers into a table file. This invention can be applied to business scenarios such as fintech and healthcare. By mapping the node tree structure to table fields and extracting text in reverse from branch paths, it achieves automatic conversion between mind maps and tables, reducing manual processing and improving the accuracy of field correspondence.

The application provides a resource query method and device, electronic equipment and storage medium; the method comprises the following steps: acquiring a query statement, wherein the query statement is used for querying at least one type of resource on a container orchestration platform; a syntax tree structure corresponding to the query statement is constructed, wherein a node in the syntax tree structure is used for representing a clause corresponding to the query statement; the syntax tree structure is converted into at least one application programming interface request; resource data associated with the at least one type of resource is acquired based on the at least one application programming interface request; and aggregation is performed on the resource data to obtain a query result corresponding to the query statement. Through the application, a unified query interface can be provided to access different types of data sources, thereby realizing joint query across resource types, reducing the complexity of resource query, and reducing the use threshold without the need to learn multiple tools.

A kind of mathematical formula parsing and code generation method based on abstract syntax tree, for the pseudo code of input file description control algorithm in the process of satellite-borne software development coding, with syntax tree structure as intermediate carrier, carries out independent identification, analysis, code generation, through the identification and analysis of the logic of control algorithm of mixed LaTeX syntax and C language syntax, code identification and processing are carried out with the inconsistent situation of C language function call with C language function call, which is represented by matrix operation, and the operation result is passed into the operation function in the form of pointer.

This invention relates to the field of document corrector technology, and discloses a document corrector evaluation method, apparatus, computer device, and storage medium. First, an error-level injection operation is performed on the original annotated document to obtain an erroneously annotated document. Then, the document corrector uses the erroneously annotated document for correction processing to obtain an output document. Next, text line-by-line processing is performed on the original annotated document and the output document to obtain line-level matching index data, quantifying the effect of line-level content restoration. Document structure parsing is performed on the original annotated document and the output document to obtain tree structure similarity, reflecting the degree of restoration of the document's hierarchical structure. Finally, based on the line-level matching index data and the tree structure similarity, the correction quality evaluation result of the document corrector is determined, thereby achieving a comprehensive performance evaluation of the document corrector in both line-level content and hierarchical structure dimensions, improving the comprehensiveness and accuracy of document corrector performance evaluation.

This application provides a source code modification method, apparatus, and electronic device based on a large model, relating to the field of software development technology. The source code modification method based on a large model includes: responding to receiving an interactive operation on a first page element of a target object; determining a first tree node in the source code abstract syntax tree structure of the target object corresponding to the first page element; and obtaining the first source code location information carried by the first tree node; obtaining the associated source code file corresponding to the first tree node based on a pre-constructed source code file relationship graph and the first source code location information; obtaining modification intent information corresponding to the first page element; generating a modification semantic description corresponding to the first page element based on the modification intent information; and inputting the modification intent information, modification semantic description, and associated source code file into a pre-trained large model to modify the associated source code file through the large model. This application can improve the comprehensiveness and accuracy of source code modification based on a large model.

This invention provides a method for reading data stored in a tree data structure, such as a B+ tree, using near data processing (NDP) in a cloud-native database. According to an embodiment, the expected LSN is used for NDP page reads on a primary compute node (e.g., a primary SQL node). When the primary compute node (e.g., a primary SQL node) reads a regular page, the maximum expected LSN of that regular page (e.g., the latest page version number) is used. The embodiment utilizes the expected LSN and page locking features, where the correct version of a page can be obtained by combining the expected LSN associated with the page with the page locking, and consistent tree structure readings can be achieved, resulting in good read / write concurrency.

The application provides a time series data interaction progressive visualization method and system, which converts original data into a hierarchical maximum-minimum tree structure representation mode by using maximum-minimum aggregation and difference operation; according to the visualization requirement, a target layer is selected from the maximum-minimum tree structure, and a breadth search is performed on the maximum-minimum tree structure from the layer; according to the time range relationship between the tree node and the column pixel, corresponding nodes and child nodes are traversed, and the obtained maximum-minimum tree structure is updated and visualized during the traversal process. The application combines the time series data representation mode based on the maximum-minimum tree structure and the incremental query visualization generation based on the tree structure, realizes the progressive generation of accurate visualization, and can provide various smooth interaction modes, and can effectively meet the demand of large-scale time series data interactive visualization.

The application relates to a traveling wave device distribution and fault positioning method suitable for a load transfer operation mode, and belongs to the technical field of power system fault ranging. The method comprises the following steps: obtaining a branch forest under a normal operation mode based on a line topological structure; obtaining a branch forest under a load transfer operation mode according to load transfer operations of two tie lines; if the topological tree structure and leaf nodes under the same node of the two branch forests change, the traveling wave devices are preferentially arranged at the leaf nodes appearing in both of the two different topological trees under the same node, otherwise the weight coefficients of branches in the topological tree structure are calculated, and the traveling wave devices are arranged at the branch nodes with high weight coefficients; when a single-phase ground fault occurs on the line, the distances of the traveling wave devices to the fault point are calculated, fault section tracing is carried out, and the position of the ground fault point is determined. The technical problem that the prior art cannot adapt to the new topological structure after the load transfer is solved.

The application provides a task scheduling optimization method and system based on a decision tree algorithm, and relates to the technical field of computer task scheduling. First, the growth basis of the task scheduling decision tree is initialized, the multidimensional growth direction is determined, and the initial growth node is set. Then, the node expansion is performed based on the multidimensional direction, the data is extracted from different systems to generate the subnode, and the exclusive scheduling judgment rule is constructed. Then, the association link between the real-time scheduling feedback and the decision tree is established. The decision tree structure is iteratively optimized based on the feedback data. The attribute data of the task to be scheduled is input into the optimized decision tree to generate a multidimensional adaptive scheduling scheme. Finally, the task scheduling execution instruction is generated based on the scheme and is sent to the task execution control system. The application can comprehensively consider multidimensional factors, and improve the task scheduling efficiency and reliability.

The application discloses a kind of metadata request concurrent control method and system for distributed block storage, first according to the attribute information and service logic information of distributed block storage system metadata, metadata is grouped, and the root node between the sub-level tree structure based on grouping is obtained Service logic information establishes to obtain metadata structure tree, then based on metadata structure tree, tree-shaped lock mechanism is constructed, and fine-grained lock management is realized;For the time point and RPC request type of each user RPC request, transaction ID is created for request, by analyzing the user RPC request corresponding to each transaction ID, the specific node that request needs to process is determined, then from the total control node of tree-shaped lock, all relevant root node paths are traversed downwards, and locking operation is performed step by step, to ensure the availability of metadata service, the fine-grained characteristics of tree-shaped lock allow concurrent execution of requests on different sub-trees, improve the concurrency and throughput of metadata service.

Different implementations are described, particularly implementations for video encoding and decoding based on wherein the partitioning tree structure is partially shared between luma and chroma blocks are presented. According to an implementation, a single partitioning tree structure is shared between luma and chroma blocks from a root node of the partitioning tree down to a switching node and a dual partitioning tree structure is determined for luma and chroma blocks from the switching node down to a leaf node of the partitioning tree. Thus, this implementation optimizes the coding efficiency by allowing separated trees for smaller blocks, while limiting the complexity of decoding pipeline.

The present application relates to the technical field of digital signal processing, and proposes a terahertz wireless transmission carrier phase recovery system and method based on tree structure Parzen estimation optimization, which comprises a blind phase estimation module, used for setting multiple test phases, calculating the decision error under each test phase, and obtaining the original phase estimation value of the current signal; a cyclic slip unwrapping module, used for selecting the continuous branch of the current original phase estimation value according to the phase estimation result of the previous moment, eliminating phase mutation, inhibiting cyclic slip, and completing phase compensation; and a parameter optimization module based on tree structure Parzen estimation, used for optimizing the test phase number and the sliding window length in the blind phase search according to the performance index after the carrier phase recovery, and obtaining the final carrier phase recovery parameter. The present application realizes low-complexity and strong-robustness carrier phase recovery, and significantly improves the stability of the terahertz wireless transmission system under strong phase noise.

Embodiments of the present application provide a data processing method and device based on a line segment tree structure, equipment and medium, the method comprises: after the oracle contract receives the first transaction request sent by the business contract, the first request condition corresponding to the first condition hash value is obtained based on the first transaction request, and the condition hash value matched with the first condition hash value is found in the line segment tree structure of the on-chain storage space. If not found, the oracle contract is called to send the first off-chain query request for the first request condition to the off-chain oracle, so that the oracle returns the first off-chain business data to the oracle contract. The received first off-chain business data is taken as the first business data by calling the oracle contract, and the first business data and the first condition hash value are updated to the tree node associated with the first request condition in the on-chain storage space. By using the embodiments of the present application, the utilization rate of off-chain data can be improved, and the waste of storage resources can be avoided.

This invention discloses a high-frequency RFID tag identification method based on a hybrid branch tree, comprising: Step 1, obtaining the cardinality of tags to be identified in the current radio frequency field; Step 2, dynamically selecting the optimal branch query configuration and execution sequence based on the estimated tag cardinality and a preset decision model; Step 3, sending an inventory command according to the configuration determined in Step 2; Step 4, receiving tag responses and judging the time slot status; if a conflict occurs, recursively executing Step 2 to Step 3 for the child nodes generated in the conflicting time slot until all tags are successfully identified; This method, through a hybrid branch tree architecture, cardinality estimation algorithm, and adaptive switching mechanism, can not only significantly reduce the total time slot overhead and identification time while adapting to various dynamic tag environments from extremely sparse to extremely dense, but also is fully compatible with the ISO 15693 standard protocol and can be directly deployed in commercial RFID systems without modifying existing tag hardware.

The application provides a blockchain-based electronic evidence full-life-cycle storage and traceability method and system, and relates to the technical field of blockchains.The steps of the application involve metadata collection, initial storage, incremental storage, operation chain construction, traceability request analysis, target block positioning and smart contract verification, etc.Through Byzantine consensus, Merkle tree structure and judicial node participation, the application realizes the full-process chain-based reliable recording of evidence from generation to verification, and enables the electronic evidence to have the capabilities of right confirmation, tamper prevention, traceability and judicial acceptance.

The application relates to a hierarchical addition tree structure module with fine-grained accurate reconfigurable approximate calculation, comprising a multi-data input module, an adder tree structure generation module, a calculation and result output module; the multi-data input module receives addends and defines approximate adder calculation, and receives user required precision configuration; the adder tree structure generation module input end receives addition numbers; after initialization, the number of addition tree layers will be transmitted to the approximate adder tree structure module to complete generation of the fine-grained accurate reconfigurable approximate adder module; the calculation and result output module performs approximate addition operation on the approximate adder generated in the previous stage to complete the final approximate calculation task, and controls the precision required by each layer in the approximate calculation process. The application realizes approximate addition calculation on a data vector, higher energy efficiency and appropriate precision, and solves the problem that the existing approximate adder configuration scheme cannot cope with data vector calculation.

A computer system and method for financial management and estate planning. The system provides data aggregation for both financial and non-financial assets to create a “virtual vault” from which the owner can view all information about his / her portfolio. In some embodiments, the system provides a tree visualization of the portfolio, which allows a structured organization that provides both a high level view and the ability to drill down to an in-depth analysis. In some cases, the system provides segmented permissions in which restricted access could be granted based on module and / or asset in the tree visualization.