196 results about "Tree node" patented technology

The invention provides an authentication document form generation method and system, and relates to the technical field of data processing, and the method comprises the steps: obtaining an authentication document; converting the authentication document into an XML (Extensible Markup Language) file so as to map authentication document data to an XML tree node of the XML file; standardizing the XML file through the global unique identifier and the tag system to obtain a standardized XML file; in combination with the standardized XML file, template candidate items conforming to different manageable data templates in the authentication document are extracted respectively; in combination with the template candidate item, mapping the authentication document to a target form; and establishing a bidirectional mapping relationship between the target form and the authentication document to realize bidirectional conversion between the target form and the authentication document and complete the form processing of the authentication document. Through establishment of the bidirectional mapping relation, synchronous updating of the form and the document content can be achieved, errors caused by manual operation are avoided, and automation, accuracy and practicability of document conversion are remarkably improved.

The invention relates to the technical field of natural language processing, and discloses a question retrieval method and system, electronic equipment and a storage medium. The method comprises the steps of performing semantic understanding and decomposition processing on an original question to obtain a plurality of candidate sub-questions; constructing an initial problem tree structure by taking the original problem as a root node and the candidate sub-problems as sub-nodes; rationality scores of the child nodes are determined, and the rationality scores represent rationality of candidate sub-problems corresponding to the child nodes; determining a relevance score between the nodes, the relevance score representing a semantic repetition condition between the nodes; based on the rationality score and the relevance score, optimizing the initial problem tree structure to obtain a target problem tree structure; and performing retrieval based on the target question tree structure to obtain answer data for the original question. By means of the method, rationality and relevance evaluation can be conducted on the problem tree nodes, and architectural disassembly and semantic hierarchical management of complex problems are achieved.

The invention discloses a dual-path three-dimensional point cloud compression reconstruction method fusing multi-scale geometric features. The method comprises the following steps: extracting representative skeleton anchor points from original point clouds by adopting farthest point sampling; predicting an octree node occupancy state by using an anchor encoder, and performing entropy coding to generate a skeleton bit stream; a skeleton condition feature encoder is introduced, probability distribution of local features is predicted by using skeleton context priori, cross-path context association is constructed, and a feature bit stream is generated; in the decoding stage, the sparse skeleton point set is restored from the skeleton bit stream, local features are recovered from the feature bit stream in combination with the skeleton structure context, fine-grained reconstruction is carried out on the point cloud through a geometric fusion point cloud up-sampling module, and finally the high-fidelity point cloud is obtained. According to the invention, the point cloud compression effect and reconstruction quality can be improved. The method can be widely applied to the point cloud field.

The invention discloses a real-time analysis and view editing method and system based on streaming data, and the method comprises the steps: receiving streaming data which comes from a large language model and is organized in an editing protocol format, carrying out the real-time lexical analysis of the streaming data, and decomposing the streaming data into a semantic unit sequence through a semantic pattern recognition technology; performing grammar analysis on the semantic unit sequence, and converting the semantic unit into a structured editing instruction for modifying an existing rendering tree node according to an instruction pattern recognition mechanism and a target object analysis mechanism; converting the structured editing instruction into an atomic instruction sequence executable by a rendering tree editing interface; and modifying the rendering tree in real time according to the atomic instruction sequence and triggering update rendering of the view. According to the method, the content generated by the AI is analyzed in real time by adopting a streaming output mechanism, so that a user can observe the generation process of the view in real time, local redrawing of the view is realized by using an editing protocol, and the view editing efficiency is greatly improved.

The invention discloses a modeling analysis and calculation optimization method for operator performance on an intelligent chip. The modeling analysis and calculation optimization method comprises the following steps: carrying out graph representation modeling on an intelligent chip hardware architecture and an interconnection mode; designing a link mechanism of operator loop tree nodes, so that operator loops are described and mapped in a hardware architecture model represented by a graph; and performing delay performance analysis on the single operators and the fusion operators in various combination forms by using a pipeline analysis method to obtain the performance of the operators under a hardware architecture, and further performing calculation optimization acceleration. By the adoption of the technical scheme, sufficient guidance can be provided for the initial stage of optimization of the hardware architecture, guidance is provided for optimization space exploration of operators, and therefore the calculation performance of intelligent chip hardware is improved.

The invention discloses a dynamic octree mapping method and system based on probability semantic fusion and a storage medium, and mainly solves the problem that a traditional octree map lacks semantic information and cannot support an advanced cognitive task. According to the implementation scheme, the method comprises the following steps: acquiring an RGB image, depth information and pose data through a sensor; extracting pixel-level semantic probability distribution by using a pre-trained semantic segmentation network; geometric information in the perception data is projected to a three-dimensional space based on the pose, and a three-dimensional observation point with semantic information is formed; performing ray projection on octree nodes, respectively updating geometric occupancy states of penetrated non-end-point nodes, and synchronously updating geometric occupancy states and semantic belief distribution of end-point surface nodes by using three-dimensional observation point data; semantic information is continuously optimized through Bayesian probability fusion, and dynamic pruning and map optimization are realized based on semantic entropy. According to the method, the map storage efficiency and the calculation speed can be remarkably improved while refined and real-time updated geometric and semantic information is given. The method can be used for map construction and storage of visual SLAM positioning, and fine three-dimensional object modeling and environment information description.

A tree-structured world state storage method, a recovery method, and a computer device. The storage method comprises: with respect to generated / updated tree nodes, according to a logical page structure obtained by division, generating corresponding memory pages, the memory pages being used for representing content of all corresponding tree nodes in the logical pages, wherein the logical pages are results obtained by aggregating several upper and lower adjacent tree nodes according to a node association relationship of the tree structure, each logical page contains at least one tree node, and the tree nodes in different logical pages are mutually exclusive; on the basis of changes in the contents of all the tree nodes in consecutive versions of the logical pages, generating base pages and delta pages; and persisting the base pages and the delta pages in one database without distinguishing between a currentDB and a historyDB.

The invention discloses a medical drug knowledge RAG optimization method based on a Trie tree, and relates to the field of artificial intelligence and medical drug information processing. The method comprises the following steps: constructing a dual Trie tree knowledge base in the field of medical drugs (a term Trie tree: storing drug / disease / medication attribute terms and ATC / ICD-11 codes; the content Trie tree is used for storing medicine specification hierarchical content and efficacy weight), carrying out preprocessing segmentation on a medical medicine ultra-long text and associating Trie node attributes, and adopting multi-stage retrieval of Trie prefix matching and BioBERT semantic retrieval to recall knowledge blocks; the context (father node-chapter overview, child node-refining rule and brother node-security association information) is expanded based on the hierarchical relationship of the nodes of the Trie tree, finally a response with accurate reference (drug name + ATC code + specification chapter) is generated, and drug conflict is avoided through consistency check. The medical drug knowledge retrieval accuracy and response safety are improved, and the method is suitable for scenes such as intelligent medication consultation and clinical medication aid decision making.

The invention provides a rapid demand customization method based on scene unit identification and context fusion, which comprises the following steps: S1, carrying out coarse-grained intention identification to obtain a first-level coarse-grained intention label; s2, acquiring multi-source context data in a corresponding time range to form a standardized context data set; s3, processing the standardized context data set to obtain structured scene data and a locked demand path; s4, complementing missing parameters through intention tree node mapping and automatic filling logic, and generating a complete structured demand configuration template; s5, generating an optimal component combination and a low-code configuration template; and S6, generating an interpretable description and a recommendation reason based on the optimal component combination, and displaying the interpretable description and the recommendation reason to a user in combination with a low-code configuration template. According to the method, intelligent tracking, dynamic response and automatic recommendation of the whole process of the demand are realized in an industrial MOM scene, so that production management is more refined and efficient.

The present disclosure relates to a mesh reconstruction method, a device and a storage medium. The mesh reconstruction method includes constructing a data structure according to three-dimensional scanning data and a preset mesh side length. Node information of a target tree node among a plurality of tree nodes included in the data structure is determined. A level of a mesh to be extracted of the target tree node is determined according to the target data. Once a scalar field of the target tree node is calculated according to the node information of a neighboring tree node corresponding to the target tree node and the node information of the target tree node, a reconstructed mesh model is obtained according to the scalar field.

Provided in the present invention is a multi-level equipment cross-platform fault knowledge recommendation and adaptive transfer method, comprising: constructing an association relationship between product structure tree nodes and a fault knowledge base; calculating the similarity between first-level nodes of a start-domain product structure tree and a target-domain product structure tree, so as to obtain a similar first-level node pair set; calculating the similarity between child node sets of a similar parent node pair, and outputting a similar second-level node pair set; repeating the previous steps on a next-level node until a terminal node is reached, and outputting a final similar node pair set; calculating the fault case knowledge similarity between every two nodes in the similar node pair set, and excluding, from the similar node pair set, node pairs having relatively low similarities; and selecting a fault knowledge type that needs to be transferred, acquiring and copying, from node pairs having relatively high similarities, fault knowledge data of a start domain, modifying into a target domain a node to which related data is bound, and writing the related data into a database. The present invention can solve the problem of rapid transfer of fault knowledge between different items in avionics equipment.

The invention discloses a data burying point and analysis method and system for cross-platform dynamic configuration, and relates to the technical field of data burying point, a server determines a candidate parameter set of burying point configuration based on an event model, performs optimization through a swarm intelligence algorithm, generates dynamic burying point configuration including a target control topological neighborhood feature vector, and transmits the dynamic burying point configuration to a server; issuing to a terminal; the terminal calculates the geometric structure similarity between view tree nodes and topological neighborhood feature vectors, and binds the nodes exceeding a threshold value as a buried point trigger source; when a burying point trigger source is activated, obtaining an operation sequence of a current context and sampling strategy generation event data, injecting a logic precursor identifier and a statistical weight factor, and sending the data to a server through local caching and batch reporting; and the server performs logic causal rearrangement, constructs a statistical analysis model to identify a statistical weight factor, executes inverse probability weighted calculation and outputs an unbiased analysis result, so that the problem of burying point failure caused by version iteration is solved, and the robustness and adaptability of burying point configuration are improved.

This invention discloses a lightweight BIM data transfer method based on 3DE, comprising the following steps: S1, acquiring components; S2, acquiring structure tree nodes and updating the transfer; S3, acquiring components and generating hierarchical folders; S4, acquiring lightweight geometric files and material map files, and associating the lightweight geometric files and material map files; S5, acquiring lightweight attribute files, and associating the lightweight geometric files and lightweight attribute files; S6, compressing and outputting lightweight data files. This invention solves the problem of information loss during BIM lightweight transfer caused by traditional single-feature lightweight methods, and ensures the accuracy of the association between geometric information, material maps, and attribute information of the transferred model, as well as the consistency of coordinate information and structural organization of the transferred model, thereby improving the quality and efficiency of BIM lightweight transfer.

The invention provides a full life cycle carbon emission evaluation method based on a transformer substation prediction model, and the method comprises the steps: building an operation structure tree based on the distribution characteristics and function relevance of a physical entity object of a transformer substation by taking a carbon emission entity object of each full life cycle stage as a tree node; mapping physical attributes and dynamic data of each carbon emission entity object to a digital twin platform based on node levels in the operation structure tree to obtain virtual nodes; associating the dynamic data of the virtual node with the static data of each full life cycle stage based on the node identifier in the running structure tree to obtain a full life cycle data chain; based on the associated data of each tree node in the full-life-cycle data chain, calculating a carbon emission result in each full-life-cycle stage; and according to a father-child node relationship of the running structure tree, upwards aggregating carbon emission results of lower-level nodes of each tree node to obtain a total carbon emission evaluation amount. According to the invention, the accuracy of a carbon emission evaluation result is improved.

The invention provides a document chapter jumping method and device, equipment and a storage medium, and the method comprises the steps: preprocessing a target document to be opened by electronic equipment, and obtaining a structured text of the target document; performing structure recognition on the structured text, and constructing a chapter tree structure of the structured text; generating positioning index information for each tree node in the chapter tree structure; when the electronic equipment opens the target document, an interactive sidebar is generated on a display interface, and the interactive sidebar is used for displaying the chapter tree-shaped structure; and when detecting that any tree node in the chapter tree structure is triggered on the interactive sidebar, based on the positioning index information of any tree node, skipping to display chapter content under the hierarchical chapter title corresponding to any tree node on the display interface. The method can support the rapid jumping to the specified chapter content, and improves the teaching rhythm of teachers.

A mining method performed by node devices connected to a blockchain network, comprises: a step in which a specific node device acquires a transaction including a first block having a first block number and a first trie node related to specific state data of the blockchain network, and state change data for changing the state of a specific account; a step in which the specific node device generates a second block including a second trie node and a second block number, the second trie node being generated based on the transaction and the first trie node; and a step in which, if the hash value of a second node corresponding to a state path-being a path from a specific leaf node corresponding to the specific account to a specific root node-among one or more second nodes included in the second trie node satisfies a predetermined criterion.

The invention relates to the technical field of computers, in particular to a test case generalization method for automobile network and data security, which comprises the following steps: collecting and preprocessing multi-source heterogeneous data, fusing the data to construct a dynamic risk feature model to extract an attack vector, and constructing a layered scene space based on real-time topology of a vehicle-mounted network; a two-channel generalization engine is utilized, unknown threat scene cases are generated by means of a structure causal model, and variation is injected into nodes of a protocol syntax tree to generate fuzzy test cases so as to enrich case types; a reinforcement learning framework is introduced to dynamically optimize a test path, and a closed-loop feedback mechanism is adopted to expand high-risk scene nodes, so that the multi-source heterogeneous data processing capability is effectively improved, the unknown threat simulation capability is enhanced, the test efficiency is improved, and the problem that a test method in the prior art is incomplete in multi-source heterogeneous data processing and poor in reliability is solved. The technical problems of influence on subsequent analysis accuracy, single test case generation type, lack of unknown threat simulation and low test efficiency in the prior art are solved.

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.

The invention provides a real-time cargo loading decision-making method based on a tree structure and reinforcement learning. The real-time cargo loading decision-making method comprises the steps of constructing a buffer area module, a temporary backup space module, a DRL position planner, a tree structure moving sequence planner and a removal punishment mechanism. The remaining space and the current state are initialized, the tree structure is initialized, and the current state is a root node; recursively expanding nodes, judging whether to enter a removal stage, if not, selecting goods in the buffer area and the temporary backup as candidates, and if yes, acquiring a removable goods set to obtain candidate goods; calling a DRL position planner for candidate goods, expanding tree nodes and continuing recursion, judging whether the maximum depth is reached or not, if not, returning to recursion and expanding the nodes, and if yes, calculating accumulated rewards and future expectations of the nodes; and searching a state node with the highest space utilization rate, and calling a tree structure moving sequence planner and a removing penalty mechanism to generate an optimal action sequence. The space utilization rate of the container is increased.

A method for reading a world state of a tree structure, and a computer device. The method comprises: receiving a read state key and a version; on the basis of the state key and the version, matching a version and a page ID in a page identifier of a memory page in lexicographic order, and after matching, if the memory page comprises at least two layers of tree nodes, continuing to match a version and a node ID of a tree node below the uppermost layer of tree nodes in lexicographic order until a leaf node is found, the page ID comprising lexicographic content from a root node of the tree structure to an upper-layer tree node in the memory page, and the node ID comprising lexicographic content from the root node to the tree node; and reading a state in the leaf node.

The invention discloses a distributed file system oriented to consumer-level equipment and a data security management method of the distributed file system, and belongs to the technical field of computer systems. The system comprises a virtual namespace management module used for maintaining a virtual namespace tree formed by combining a local main namespace tree and a remote snapshot sub-tree; the access control and encryption module is used for executing access control based on the attribute set of the virtual namespace tree nodes; and the data processing pipeline module is used for partitioning the file and realizing pipeline operation of transmission and decryption through independent data flow and control flow channels. According to the invention, the access control and the encryption strategy are tightly coupled based on the unified attribute set, so that file re-encryption is not needed when the authority is changed, and the system flexibility is improved; and the security operation delay is hidden through data partitioning and pipeline processing, so that the file access efficiency is improved, and the problem of balance among security, flexibility and high efficiency of the distributed file system of the consumption equipment is effectively solved.

This invention relates to the field of blockchain technology and discloses a Merkle tree hardware acceleration system for blockchain data verification. The system includes a control module for coordinating and controlling various modules; an address generator for generating addresses of sibling and parent nodes in the Merkle tree based on the indices of the input leaf nodes; a storage unit for storing the leaf, internal, and root node data of the Merkle tree; a computation module for performing data concatenation, hashing, and comparison on the Merkle tree nodes based on the addresses provided by the address generator, and generating intermediate and verification results; and a buffer for temporarily storing node data read from the storage unit and intermediate results output by the computation module. This invention designs a hardware acceleration architecture tailored to the structural characteristics of Merkle trees, improving the computational efficiency of blockchain data verification, achieving low-power operation, and is suitable for the performance requirements of various blockchain application scenarios.

The application discloses a minimum community search method, device and system and a storage medium, and is applied to the field of minimum community search, and comprises the following steps: receiving an adjacent index and a core tree index which are encrypted by a BGN algorithm and are sent by a data end; wherein the data end constructs a corresponding Bloom filter array for each tree node in the core tree index; when receiving a query trapdoor token generated by a client, locating an initial community in the core tree index according to the Bloom filter array; generating a target community based on the initial community and the adjacent index by using an array comparison protocol; and sending the target community to the client, so that the client decrypts the target community to obtain a target result. The method avoids the privacy leakage problem caused by the minimum community search in a cloud server in the prior art by encrypting the minimum community search, and protects data security.

The intelligent vehicle obstacle avoidance path planning method based on improved RRT and back-end optimization strategy comprises the following steps: 1, optimizing the RRT algorithm sampling space, adding a heuristic strategy to expand the RRT tree node; 2, detecting the vehicle nonholonomic constraint of the expanded node, and screening the node meeting the drivability; 3, assigning the attribute cost and expansion cost to the node in the RRT tree, and reallocating the parent node for the newly expanded node until the target point; 4, generating an initial path by reverse search, and constructing a "driving corridor" and an approximate convex space based on the initial path; 5, considering the path smoothness, curvature continuity and other costs, and solving the optimal path in the convex space range combined with multiple constraint conditions. The method is suitable for the intelligent vehicle autonomous obstacle avoidance path planning problem of the Ackerman steering mechanism intelligent vehicle driving at low speed in the Frenet coordinate system, and can quickly generate a smooth and safe local obstacle avoidance path.

The embodiment of the invention discloses a data processing method and device, computer equipment and a storage medium. The method comprises the following steps: acquiring a uniform resource locator set corresponding to a plurality of application programming interfaces; dividing each uniform resource locator in the uniform resource locator set according to the separators to obtain a plurality of locator fragments; determining a query character in the plurality of locator segments, and replacing the query character with a preset character to obtain a plurality of target locator segments; determining an arrangement level of each target locator fragment corresponding to each uniform resource locator; and according to a hierarchy sequence of the arrangement hierarchies, sequentially generating mode tree nodes under each hierarchy in each hierarchy according to the common intersection part of each target locator fragment of the corresponding hierarchy, and constructing a mode tree corresponding to the uniform resource locator through the mode tree nodes. Therefore, by analyzing the mode tree, the application programming interface can be quickly searched and managed, and the management efficiency of the application programming interface is improved.

The invention provides a user interface testing method which can be applied to the technical field of artificial intelligence, and relates to application of a large model in the fields of information security and financial science and technology. The user interface testing method comprises the steps that on the basis of a pre-constructed user interface component model library, intention inference is conducted on initial abstract syntax tree nodes of codes to be tested, target abstract syntax tree nodes are obtained, the target abstract syntax tree nodes comprise variable fields, user interface component type fields and service intention fields, and the variable fields are selected from the variable fields, the user interface component type fields and the service intention fields; the business intention field represents the business meaning of the user interface level; based on the target abstract syntax tree node and the to-be-tested code, testing the target user interface, and outputting a test result; and under the condition that the test fails, constructing an execution snapshot graph based on the target abstract syntax tree node and the test data in the test result to obtain a repair scheme. The invention further provides a user interface testing device and equipment, a storage medium and a program product.

The embodiment of the invention provides a text processing method and device, computer equipment and a readable storage medium, and is applied to scenes such as artificial intelligence, smart traffic, aided driving and texts, and the method comprises the following steps: selecting a selection node meeting an extension condition in a search tree constructed for a preset instruction text; performing text expansion on the selection instruction text in the selection node and the instruction text in the ancestor node of the selection node to obtain an expanded instruction text, and adding an expanded node in the search tree according to the expanded instruction text; updating the search tree added with the extension nodes according to the extension nodes to obtain an updated search tree; when the updated search tree meets a termination condition, obtaining an associated instruction text from tree nodes of the updated search tree; the association instruction text and the preset instruction text are used for guiding the voice control system to perform voice control. According to the invention, the diversity of instruction texts can be improved, and the voice control accuracy of the voice control system is improved.

The invention discloses a method, a system, equipment and a medium for determining underground coal mine ventilation volume, and relates to the technical field of coal mine ventilation management.The method comprises the steps that when a minimum loop is searched, the priority weight of each remaining branch is determined with the level of a breadth-first spanning tree of a tree node as a weight factor, searching is started from the remaining branch with the minimum weight, and a plurality of loops are constructed; extracting a closed loop with the least residual branches; meanwhile, dynamic weights are set according to the number of remaining branches, the loop with the minimum sum of the weights of the remaining branches is selected as the minimum loop, and it is ensured that the calculated roadway air volume is consistent with the actual value. In addition, the air flow direction is judged through the edge relation, the air volume symbol is adjusted, the abnormal direction is corrected, and the calculated air flow direction fits the reality.

A method for constructing a tree structure-based world state, and a computer device. The method comprises: receiving a state key-value; on the basis of a construction rule of a tree structure, generating / updating leaf nodes of the tree structure corresponding to the state key-value; on the basis of content in each leaf node, calculating a hash value of the leaf node, and on the basis of the hash value of the leaf node and a state key, generating or updating an upper-level tree node until a root node of a tree; and updating the version of the generated / updated tree node in a corresponding memory page on the basis of a divided logical page structure, wherein the memory page is used for representing the content of all the corresponding tree nodes in a logical page, the logical page comprises a page identifier, and the page identifier comprises the lexicographical order content and version of the upper-level tree node in the logical page.