333 results about "Tree node" patented technology

The invention discloses a 3DTiles data storage method and a map data query method.The 3DTiles data storage method comprises the following steps that (1) an LOD hierarchy pyramid type hierarchy table is established, and an LOD range index is created; 2) generating a three-dimensional object into an agent point, and segmenting a tile according to a KD-tree structure to construct a three-dimensional KD-tree index tree; and 3) storing the data of the KD-tree leaf node into a GridFS of MongoDB multi-mode storage, mapping a file path into a unique hash value, writing the unique hash value into a corresponding node according to a KD-tree node storage structure, and creating a geographic spatial index. The method creatively solves the problems that file system management is difficult due to the fact that the number of files is large, a hierarchical structure based on a file directory is difficult to support efficient spatial range retrieval, and the spatial query response time is reduced to the millisecond level in combination with a three-dimensional KD-tree index and a MongoDB geographic spatial index.

Disclosed are a path planning method and apparatus, and a computer-readable storage medium. The path planning method may include: acquiring a motion space, a starting position, and an end position of a moving object, and information of an obstacle; constructing a first exploration tree starting from the starting position and constructing a second exploration tree starting from the end position in the motion space, the first exploration tree and the second exploration tree grow toward each other according to the information of the obstacle; and in response to a distance between a first tree node grown on the first exploration tree and a second tree node grown on the second exploration tree being not greater than a preset step length, connecting the first exploration tree and the second exploration tree to obtain a planned path of the moving object.

The invention relates to the technical field of electronic digital data processing, in particular to an operation state monitoring method and system for injection molding equipment, and the method comprises the steps: collecting a multi-dimensional operation parameter time sequence of the injection molding equipment at different moments, collecting parameters of the same dimension into data sets, and constructing an isolated tree based on each data set; after sorting tree nodes of the isolated tree according to a data average value, distributing a tree node sequence number for each item of data; the combination of the dimension parameters at the same moment is regarded as a data point, the distribution relation of any two data points on the isolated tree is compared, the same-group degree of the data points is calculated, and the data points with the same-group degree higher than a set threshold value are classified into the same group; calculating the abnormal degree of the data points; and if the abnormal degree exceeds a set threshold value, determining that the data point is an abnormal data point and giving an alarm at the same time. The problem that the accuracy and reliability of state detection are not high is solved.

The invention discloses a policy service recommendation method and system based on a large language model, and relates to the field of policy information, and the method comprises the steps: analyzing a policy file, extracting policy terms with a numbering structure, building a unique identifier, and forming a term node set; identifying explicit or implicit reference behaviors in terms, constructing a reference path, and generating a reference directed graph; constructing a clause mapping tree based on the target clauses; mapping tree nodes are extracted to form structured prompt information, and the structured prompt information is embedded into large language model input; generating a policy report paragraph containing clause reference content; and outputting the structured policy text with clause reference chain closure and recommending the structured policy text to the user. According to the method, the clear reference context combined with the user information can be provided for the large language model, the large language model is guided to generate a text with a reasonable structure and complete terms for recommendation, and the problem of inaccurate generation when an existing model processes a complex reference structure is solved.

The invention relates to the technical field of routing context connection, in particular to a zero-code visualization and automatic routing method for large-model servitization orchestration, which comprises the following steps of: analyzing a user session text, extracting a core entity and an intention dependency relationship, constructing an entity intention graph, compressing to generate a state snapshot, and distributing a global session ID (Identity); the method comprises the steps that a snapshot is bound to a distributed routing decision tree node and stored, cross-node state continuity is established, when a new request is received, the snapshot and new session semantics are fused, a routing weight offset correction decision table is calculated, and a routing decision logic flow is generated by dragging an interface configuration rule and strategy. The method improves the service matching degree, reduces the development threshold, and is suitable for agile construction of large-model collaborative application.

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 relates to a method for improving the reasoning ability of a large language model based on Monte Carlo tree search. The method comprises the following steps that S1, a mathematical question set and corresponding standard answers are preset; s2, taking each step for solving a mathematical problem as a tree node, and generating a Monte Carlo tree in the whole problem solving process; s3, generating training data based on Monte Carlo tree search; s4, scoring the generated training data; and S5, constructing a loss function according to scores obtained by scoring, optimizing the loss function and updating parameters of the large language model. The reasoning ability of the large language model can be improved.

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 relates to a database Schema version management method and device, computer equipment and a storage medium. The method comprises the following steps: responding to received target Schema tree structures sent by each user terminal, generating a combined target Schema tree structure according to each target Schema tree structure, and performing format conversion on the combined target Schema tree structure to obtain a modified Schema file; performing tree node traversal comparison according to the combined target Schema tree structure and the to-be-modified Schema tree structure to obtain corresponding distinguishing tree nodes; the distinguishing tree nodes are tree nodes on the combined target Schema tree structure which are different from the Schema tree structure to be modified; and determining a version modification type of the modified Schema file according to each distinguishing tree node, generating a semantic version identity identification number of the modified Schema file according to the version modification type, and storing the modified Schema file into a database according to the semantic version identity identification number. By adopting the method, the efficiency can be improved and version management chaos can be avoided.

One or more embodiments of the invention provide a memory access method and apparatus, a computing device, a memory device and a system. The separated memory system comprises a memory device, a tree index is deployed, the tree index comprises a plurality of leaf nodes, one or more key value entries are stored in each leaf node, each leaf node comprises a plurality of hash buckets, one or more key value entries can be stored in each hash bucket, and the access method is applied to the computing device. Comprising the following steps: when a to-be-accessed tree node is a target leaf node, determining a target hash bucket according to a target key accessed this time; reading the target hash bucket from the target leaf node to the local; under the condition that the current access is the write access, storing the target key and the target value corresponding to the target key into a target hash bucket, and writing the target hash bucket into a target leaf node after the storage is completed; and searching a target value corresponding to the target key based on the key value entry stored in the target hash bucket under the condition that the access is read access.

The invention relates to the field of data processing technologies and financial science and technology, and provides an HQL statement detection method which comprises the steps that an HQL statement to be detected is analyzed to generate an abstract syntax tree and optimized, and an execution plan is generated according to the optimized syntax tree; performing operation step decomposition on the execution plan according to task process stages, and generating a performance analysis syntax tree corresponding to the HQL statement by taking operation steps obtained after decomposition as syntax tree nodes; querying a database according to a query object contained in the operation steps in the performance analysis syntax tree to obtain a related database table of the HQL statement, and calculating data of the related database table and data of the operation steps of the performance analysis syntax tree to obtain numerical values of a plurality of preset data indexes of the HQL statement; and calculating the score of the HQL statement according to the numerical value of the preset data index and a preset data index scoring algorithm, and generating a detection report of the HQL statement. According to the HQL statement detection method, the quality of the HQL statement can be automatically evaluated according to a unified rule.

Various embodiments include a workflow generation method. An example includes: receiving a behavior tree construction operation entered on a graphical user interface (GUI) by a user, including an addition operation and a line connection operation performed on behavior tree nodes comprising function block nodes, one behavior tree is used for representing one workflow of service operations to be executed by resources in one workcell, and the function block nodes are used for implementing the service operations in the workflow; instantiating the behavior tree nodes and establishing connection relationships among the nodes in response to the construction operation, wherein some or all of the instantiated function block nodes are associated with resources for executing corresponding service operations; and generating a behavior tree corresponding to one workflow using the connection relationships among the tree nodes.

The invention discloses an electronic archive hierarchical management method based on a Merkle tree, and belongs to the field of personal user electronic archive management. According to the method, for sensitive files in a user file, an encrypted file is generated, a hash value is calculated, the encrypted file is uploaded to an IPFS distributed storage system, an identifier with unique content is generated, a secondary encryption result of the identifier and an encryption key is written into a block chain, a user decentralized identifier is used as a root node, and a hierarchical Merkle tree structure is dynamically constructed through an intelligent contract; for the non-sensitive data in the user file, calculating a hash value of the non-sensitive data, and storing the hash value and the metadata in a regional chain together; when a verification request is initiated, the identifier recorded in the node is compared with the hash value of the IPFS storage file, after consistency is verified, the Merkle tree node is allowed to be accessed and modified, the on-chain storage cost is reduced, the data tamper-proof capability and verification efficiency are improved, and dynamic authority control and cross-chain hash anchoring are supported.

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 provides a multi-subject joint variety yield prediction method and system for protecting data privacy, and is applied to the technical field of variety yield prediction.The method comprises the steps that a local optimal division feature with the minimum difference degree in a local division feature set is determined as a global optimal division feature; acquiring a ciphertext sample set of left and right sub-trees transmitted by the target client corresponding to the global optimal division feature; broadcasting the ciphertext sample sets of the left and right sub-trees to other clients in the plurality of local clients, so that the other clients generate tree nodes with the same structure as the target client; constructing a plurality of decision trees according to preset parameters until the federal isomorphic forest model is constructed; based on the federal isomorphic forest model, predicting the to-be-predicted test sets in the plurality of local clients to obtain a yield prediction result of the target variety; according to the invention, combined variety yield prediction can be carried out under the condition that multiple subjects do not disclose or share own data.

The invention discloses a Restful API fuzzy test method and system based on tree structure generation parameters, and the method comprises the steps: obtaining Restful API document data, carrying out the analysis and recognition processing, and generating a Restful API request sequence; mapping processing is carried out on request parameters in the Restful API request sequence, and a parameter tree is constructed; performing parameter value calculation on nodes in the parameter tree through a parameter value generation function to obtain parameter values of the nodes of the parameter tree; performing parameter structure variation based on the parameter tree node parameter values to obtain a parameter tree with rich parameter variants; and requesting and verifying the parameter tree with rich parameter variants, outputting a vulnerability report, and completing Restful API fuzz testing. According to the Restful API fuzz testing method, a complex parameter structure can be efficiently processed, so that comprehensive and efficient Restful API fuzz testing is realized. The Restful API fuzzy testing method and system based on the tree structure generation parameters can be widely applied to the technical field of Web security.

The invention discloses a multi-level two-state content management method and system based on an unreal engine, and the method comprises the steps: defining a level identification rule, employing a point separator to represent the father-son relationship between levels, dynamically generating tree-shaped nodes based on the level identification, and enabling each node to have corresponding node information, the node information comprises a hierarchical identification character string or a GameTag identification state provided by an unreal engine, an activation state of a current node, a global state mark of a child node and a child node reference list; and generating or matching nodes step by step by recursively analyzing a hierarchical identification character string or a GameTag identification state provided by an unreal engine to form a complete tree hierarchical structure. According to the method and the system, efficient management and dynamic expansion of multi-level double-state contents are realized, cross-project multiplexing is supported, and the method and the system are suitable for digital twin application development in a complex service scene.

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 relates to a document recognition method and device, electronic equipment and a storage medium. The method comprises the steps that a target document and title information of the target document are acquired; performing hierarchical analysis on the title information, and establishing a directed acyclic graph corresponding to the target document according to a hierarchical analysis result; based on the directed acyclic graph, a tree diagram corresponding to the target document is constructed, and each node of the tree diagram correspondingly records a document title of the target document; and according to the corresponding relationship between each node in the tree diagram and the document title, obtaining the document content of the target document by using the tree node of the tree diagram as an index. According to the method, the tree diagram corresponding to the document is constructed according to the support relationship, and the clear hierarchical structure is analyzed through the tree diagram, so that a document management system with the hierarchical structure is formed, the analysis requirements of different types of documents are met, and the legal content retrieval and analysis efficiency is remarkably 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 invention relates to a paging request and preloading combined tree data rendering method, which belongs to the field of data processing systems, and comprises the following steps of: initially loading and only rendering top layer node information of the outermost layer; when a next-level node request of a user is received, rolling along with the user or clicking an expansion node, and then loading and rendering corresponding deep-level sub-node data; monitoring the crossing degree of the tree node and the visual parent container, judging whether a next paging request is triggered or not, and realizing preloading of the tree node in combination with the microtask queue; gradually rendering a corresponding number of tree-shaped DOM nodes until a preset maximum number of DOM nodes is reached, and calculating and updating a node list to be rendered; corresponding DOM nodes are searched and taken out from WeakMap cache objects according to the filtered data sources, and after a relation structure is assembled, rendering is conducted, and a new tree is constructed. According to the method, the tree data is requested to be rendered in batches in a paging request mode, and the interface response speed and the rendering speed of an initialized tree interface are increased.

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 processing method and device, equipment, a storage medium and a product, the method is applied to integrated circuit electronic design automation software, and the method comprises the following steps: obtaining a digital circuit design file; analyzing the digital circuit design file to generate a corresponding netlist data structure; responding to an object query request sent by a user, accessing the netlist data structure, and searching a data item matched with a target query object specified by the user in the netlist data structure; based on the data item matched with the target query object specified by the user and found in the netlist data structure, the object query result is generated, the netlist data structure is adopted as a data processing basis for object query, hierarchical recursive traversal does not need to be carried out, branch relations among multi-way tree nodes do not need to be processed, and the data query efficiency is improved. And the query efficiency is obviously improved.

The invention provides a mobile robot path planning method and device, electronic equipment and a storage medium, and belongs to the technical field of robot motion control path planning, and the method comprises the steps: constructing a first hyper-ellipsoid based on the real-time progress of bidirectional rapid exploration random tree exploration, adaptively adjusting the sampling probability of the first hyper-ellipsoid according to the size of the first hyper-ellipsoid, and randomly sampling to obtain a first sampling point; expanding the bidirectional rapid exploration random tree; after expansion, if direct connection cannot be realized and the number of tree nodes of the reverse tree is greater than the number of tree nodes of the forward tree, the forward tree and the reverse tree are mutually exchanged and then the step 1 is executed until the forward tree and the reverse tree can be directly connected, and the forward tree and the reverse tree are combined to obtain an initial path solution; and calculating the time consumed by the end of the loop, and if the time is not less than a time threshold, outputting the initial path solution as an optimal solution. The technical problem that in the prior art, the path planning efficiency is low when a complex environment is processed is effectively solved.

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.