32 results about "Multitree" patented technology

The invention relates to a simulation method for a semiconductor device, electronic equipment and a computer readable storage medium. The method comprises the steps that a multi-way tree structure is constructed based on grid data of a gridded semiconductor device, the multi-way tree structure at least comprises a root node, a plurality of layers and a plurality of leaf nodes, and each leaf node represents a corresponding polyhedron in a plurality of polyhedrons in the gridded semiconductor device; in response to the determination of the first spatial position of the particle in the semiconductor device, determining a first search path from the root node to a first leaf node in the plurality of leaf nodes based on the corresponding relationship between each leaf node and the corresponding polyhedron; and in response to the particle moving from the first spatial position to a second spatial position within the semiconductor device, determining a second search path in the multi-way tree structure based on the first search path to determine a second leaf node representing the polyhedron where the second spatial position is located. According to the method, the ion implantation simulation performance is effectively improved.

The invention relates to the technical field of railway construction, in particular to a method, system and equipment for generating a route in a tight slope area, a medium and a program product. The method comprises the following steps: obtaining a road line selection design standard and a DEM grid elevation file of a research area; determining intelligent search parameters according to a road line selection design standard; generating a global feasible path tree from the starting point to the ending point; sequentially backtracking path nodes from an end point to a starting point, and sorting out a feasible three-dimensional path set; and generating a corresponding plane and longitudinal plane route scheme by using the three-dimensional node coordinates of the single path. According to the method, a global feasible path tree from the starting point to the ending point is constructed through a multi-way tree line search algorithm, a research area does not need to be traversed, the data processing amount is reduced, the scheme generation efficiency is improved, and generation of a feasible scheme can be ensured by constraining a road line selection design standard.

The application discloses a cardinality estimation method and device and a medium. The method encodes a to-be-predicted query statement and inputs the to-be-predicted query statement into a deep learning model trained based on historical data to predict a cardinality. If the predicted value exceeds a preset threshold, the predicted value is adopted as a final estimation result; if the predicted value does not exceed the preset threshold, an accurate cardinality calculated according to a multi-way tree forest structure constructed by database records is taken as the final estimation result. The application fully utilizes the advantages of a hybrid model, and improves the accuracy and reliability of cardinality estimation prediction.

The invention discloses a model rendering method and device, a computer program product and electronic equipment, and relates to the technical field of computers. The method comprises the steps of responding to drawing operation based on a Gaussian brush, wherein the Gaussian brush comprises a core distribution function and semantic parameters of the Gaussian brush; according to the drawing operation, a corresponding semantic Gaussian primitive is generated based on the core distribution function of the Gaussian brush and the semantic parameters, and the semantic Gaussian primitive at least comprises any one of a physical material, a logic label and a dynamic state vector; a multi-way tree is generated according to the semantic Gaussian primitives, nodes of the multi-way tree at least comprise bounding boxes corresponding to the nodes, child node pointer arrays of the nodes and hierarchical detail information, and leaf nodes of the multi-way tree at least comprise Gaussian cluster references; and rendering the semantic Gaussian primitives according to the multi-way tree to obtain a target model. The problems that in the prior art, the model rendering process is tedious, the data size is large, and game interaction cannot be carried out are solved.

The invention relates to the technical field of computers, and discloses a multi-way tree data structure construction method and device, a storage medium and a program product. The multi-way tree data structure construction method comprises the following steps: acquiring storage data and a corresponding node hash value; based on the storage data and the node hash value, calculating a leaf proof value by using a pre-acquired node polynomial; taking the index position of the leaf node as an interpolation point, and calculating an internal node commitment value and an internal proof value corresponding to each internal node through a node polynomial based on a polynomial commitment algorithm; taking the index position of the internal node as an interpolation point, and calculating a root node commitment value through a node polynomial based on a polynomial commitment algorithm; and constructing a multi-way tree data structure based on the leaf promise value, the internal node promise value, the internal promise value and the root node promise value which are obtained through calculation. According to the method provided by the embodiment of the invention, the storage space and the network bandwidth can be saved, the verification cost is reduced, and the verification speed is improved.

The application provides a method for judging the feasibility of inclined three-dimensional printing of a shell model, comprising: slicing an STL model to be judged according to a given inclination angle, placing the inclined slice horizontally, and obtaining the contour data of the horizontal slice; respectively biasing each contour in each slice layer inward and outward, and performing Boolean intersection operation to obtain the multi-fork tree structure contour set of each contour; and judging whether the contour in each slice layer can be stacked in a certain connected region in the multi-fork tree structure contour set of the slice layer below, and further judging whether the model can be printed in an inclined manner. The judgment method of the application is aimed at the printing structure of a shell mold, can quickly judge the feasibility of inclined printing according to the mold slice information, can assist the operator of the printer to set the model placement posture, select a suitable slice angle, and reduce the printing trial and error cost; and the judgment method of the application has wide applicability, high efficiency and strong stability.

The invention relates to the technical field of railway signal safety control, and provides an interlocking product data analysis method, system and equipment, and the method comprises the steps: analyzing program language data in interlocking software, and obtaining a structural body type definition and a structural body variable; a multi-way tree is constructed according to the structural body type definition, and a multi-way tree model is optimized through node replacement; the optimized multi-way tree is adopted to carry out assignment analysis on the structural body variables, and structural body variable values are obtained; and verifying the obtained structural body variable value and input data, and outputting a verification result. According to the interlocking product data analysis method, system and equipment, structured analysis of interlocking program language data is realized by constructing the multi-way tree model and carrying out node replacement optimization, a complex data structure is efficiently processed, unanalyzed nodes are ensured to be correctly supplemented through a queue traversal and type replacement mechanism, and the data analysis efficiency is improved. And the integrity and accuracy of data analysis are improved.

This application provides a data query method, apparatus, device, and medium. By dividing the query term sequence into a first query term and a second query term, and determining the corresponding semantic nearest neighbor set and query condition probability for each second query term based on its prefix in the query term sequence, and combining the text content of the first query term, the query term sequence is matched with each stored term sequence indicated by the target multi-way tree. This significantly improves the hit rate and reuse rate of cached key-value vectors, effectively reuses key-value vectors of terms with the same or similar semantics but different expressions, and significantly reduces memory usage while ensuring generation quality and cache hit rate. This improves the overall efficiency and scalability of large language model inference, and achieves synergistic optimization of large language models in three dimensions: memory efficiency, throughput performance, and generation quality. It effectively reduces the problems of low cache hit rate, serious memory redundancy, and unstable generation quality in related technologies.

A method, apparatus, and computer product for scheduling Pauli-terms by selecting an order for the Pauli-terms, comprising: obtaining first and second ordered sets of Pauli-terms; obtaining first and second multitree data structures representing the first and second ordered sets, respectively; and determining whether or not the first and second ordered sets should be concatenated by: generating a third multitree data structure that represents all Pauli-terms of the first and second ordered sets; calculating a difference between a resource utilization score of the third multitree data structure and between resource utilization scores of the first and second multitree data structures; and based on the difference, determining whether or not the first and second ordered sets should be concatenated.

The invention discloses an unstructured data multi-way tree chain table storage method, which comprises the following steps of: 1, defining a data structure, and establishing a dynamic multi-way tree node structure; step 2, maintaining a target chain node, and maintaining an index relationship of the node through a directory chain table; step 3, node insertion adjustment: dynamically adjusting a pointing relation of a linked list pointer array during node insertion to form a multi-way tree topological structure; step 4, recombining pointers, and updating child node pointers of the target nodes to reconstruct a local hash table; 5, deleting and recovering the nodes, marking the nodes to be deleted as invalid nodes and recovering the storage space of the invalid nodes; step 6, carrying out data fault tolerance and recovery, and storing data by multiple copies to ensure data integrity; through the innovative unstructured data multi-way tree chain table storage method, efficient, flexible and reliable data management is achieved, a layered compression structure is adopted, memory mapping, pre-read caching and asynchronous persistence technologies are combined, and storage occupation is remarkably reduced.

The application relates to the technical field of financial technology, and discloses a simulation data generation method, device and equipment and a computer readable storage medium. The simulation data generation method comprises the following steps: acquiring an interface document, wherein the interface document comprises attribute information of data elements; traversing each data element in the interface document in a recursive manner, and constructing a multi-way tree according to a serial number in the attribute information; traversing each node in the multi-way tree, and generating corresponding simulation data according to a type of a currently traversed node and a preset generation rule. The application can solve the problems that manual writing of simulation data is time-consuming and laborious and has low efficiency in the prior art.

The invention belongs to the technical field of data storage and retrieval, and discloses a method, equipment and medium for storing and retrieving hierarchical structure data, and the method for storing the hierarchical structure data comprises the following steps: acquiring original data with an up-down hierarchical relationship; converting the original data into a JSON format file; wherein the JSON format file reflects the tree-shaped hierarchical relationship of the multi-way tree through nesting of a parent object and a child object, nodes in the original data are represented by JSON objects, and data corresponding to leaf nodes in the original data are represented by character string arrays; performing binary serialization processing on the JSON format file to generate a binary storage data file; and fixedly storing the binary storage data file in a fixed address of a storage area of the embedded equipment. The method can adapt to hardware resources of embedded equipment, simplify program logic and realize efficient storage of hierarchical data, and has good universality and expansibility.

This application provides a method, apparatus, electronic device, and storage medium for constructing a network security ontology. The method includes: acquiring network security data corresponding to the construction requirements of the network security ontology, wherein the network security data includes at least structured network security data and unstructured network security data; constructing an initial multi-branch tree corresponding to the structured network security data based on the structured network security data; updating the initial multi-branch tree based on the unstructured network security data to obtain an updated target multi-branch tree; and generating a network security ontology file corresponding to the construction requirements of the network security ontology based on the target multi-branch tree. This overcomes the problems of existing technologies requiring manual construction, processing data from a single source, and handling data format compatibility issues, thereby improving the efficiency of generating ontology files.

This invention discloses a method and system for constructing a data structure for verifying the completeness of encrypted range retrieval results. The method involves calculating quantile arrays for each searchable dimension based on sampled data records; normalizing the value range of the data records to the interval [0,1] using the quantile arrays; calculating the number of levels required for the cube coding system; allocating data records to different cube units using the cube coding system; encrypting records belonging to the same cube unit using a key to generate a cube index; and constructing a verification data structure based on a multi-way tree structure, using each cube in the cube index as a leaf node of the multi-way tree, and building the multi-way tree layer by layer from bottom to top to form a complete verification data structure. This method constructs a verification data structure that can be used for verifying the completeness of encrypted range retrieval results with relatively low computational and storage overhead, solving the problems of excessive computational overhead and difficulty in handling large-scale datasets in existing methods.

The application relates to a multi-ary tree information serialization and deserialization method, device and computer readable storage medium. The method comprises the following steps: obtaining attribute information of a target multi-ary tree; applying for memory conforming to the attribute information of the target multi-ary tree; sequentially writing, into the memory, a required cache size of a serialization result of each node of the target multi-ary tree after serialization and a total node number of the target multi-ary tree; traversing each node of the target multi-ary tree in a preset traversal mode, and writing, into a remaining storage space of the memory, self data of each node of the target multi-ary tree according to a traversal order. The technical scheme can efficiently process multi-ary tree information.

The embodiment of the invention discloses a data log storage method and device based on a multi-way tree, equipment and a medium. A specific embodiment of the method comprises the steps of obtaining a prediction log set and a processing log set in response to a received block chain storage request; performing relevance grouping on each prediction task to obtain a prediction task group set; performing relevance grouping on each data processing operation to obtain a data processing operation group set; generating a target multi-way tree; for each prediction task group, generating first summary node information; for each data processing operation group, generating second summary node information; and storing the tree structure information, the root node, the first summary node information set and the second summary node information set corresponding to the target multi-way tree to the target block chain. According to the implementation mode, the target data set is stored in the target block chain corresponding to the target multi-way tree, so that efficient and accurate maintenance of the data in the data warehouse can be realized.

The application provides a geometric object screening method and device, equipment and a storage medium, and relates to the technical field of data processing. The method comprises determining a target geometric object, the target geometric object comprising a first geometric object representing a query range and a second geometric object to be detected whether it meets the query range; determining an approximate object corresponding to the target geometric object, the approximate object comprising a first approximate object corresponding to the first geometric object and / or a second approximate object corresponding to the second geometric object, and the data structure of the approximate object being a multi-way tree, a node on the multi-way tree corresponding to a spatial block in the spatial range of the approximate object; and screening the second geometric object according to the first approximate object and / or the second approximate object to reduce the geometric objects in the second geometric object that do not meet the query range. Thus, the screening of the geometric object is realized by using the approximate object, and the precision of the screening of the geometric object is improved.

The application provides a method, device and medium for naming topological elements based on copy type features, which comprises the following steps: initializing a result container based on a multi-ary tree structure of multiple reference features, wherein the reference features are copy type features or non-copy type features; traversing a copy matrix of each reference feature layer by layer based on the multi-ary tree structure to obtain matrix chain information, and saving the matrix chain information to the result container; traversing the result container layer by layer to remove the matrix chain information; traversing each matrix chain of the result container layer by layer, and constructing a modeling entity corresponding to the copy type feature according to the corresponding matrix chain information and feature parameters of the reference feature; and determining the element name of each topological element of the modeling entity according to the modeling process of the modeling entity. According to the technical scheme of the embodiment of the application, the multi-ary tree structure of multiple reference features is taken as the basis, the naming maintenance and management requirements of the topological elements are met, and the automatic naming of the topological elements can be realized, so that the naming efficiency is improved.

The invention discloses a distributed hash table method and device based on multi-way tree fusion geographic information. Establishing a four-layer multi-way tree structure comprising a national department ND layer, a province PR layer, a city CI layer and a county CO layer based on the geographic position and administrative membership relationship of each node; designing a node ID coding rule based on administrative level information and a random entropy value, and calculating and generating 160-bit node IDs through an SHA1 Hash algorithm; based on the hierarchy of the multi-way tree structure and the node ID logic distance of each node, constructing a mixed addressing table containing G buckets and K buckets; and based on segmented coding of node IDs and the mixed addressing table, determining an addressing level by comparing SegIDs of a target node and a local node in a segmented manner, and realizing positioning and data routing of the target node in combination with binary tree traversal. According to the scheme, the problems of delay and bandwidth consumption caused by the fact that geographic administrative division is not considered in a traditional DHT can be solved.

The application belongs to the field of multi-fork tree virtual network construction, and discloses a multi-fork tree virtual network construction method on a single host, comprising the following steps: S1: abstract definition of a multi-fork tree virtual network node, definition of a network attribute set of the multi-fork tree virtual network node based on a logical node model; S2: standard encapsulation of atomic actions, decomposition of a multi-fork tree virtual network creation process into minimum granularity indivisible operations, i.e. atomic actions, based on a preset atomic action library; S3: topology arrangement and heterogeneous node configuration generation based on layer sequence traversal, completion of multi-fork tree virtual network topology generation by inputting an atomic action list and executing atomic actions on corresponding nodes; and S4: instantiation execution of the multi-fork tree virtual network and mounting on underlying resources, conversion of the corresponding configuration of step S3 into entity resources in a host kernel by a virtual instantiation engine. Thus, the application realizes construction of a large-scale, high-fidelity and easily reconfigurable multi-level tree-shaped virtual network.

The invention provides a distributed drainage basin model multi-flux parallel computing method. The method comprises the following steps: S1, performing multi-way tree coding on mutually independent computing units according to parallel features of a distributed drainage basin model; s2, creating a parallel computing system according to the total process number, wherein the parallel computing system comprises a master control process which is globally and uniquely responsible for task allocation regulation and control, a plurality of computing processes which are responsible for physical processes and a plurality of transfer processes which are responsible for data transmission among computing units; s3, the main control process sequentially distributes the calculation tasks of all the units to the calculation process according to the multi-way tree codes; s4, the calculation process receives the task and receives upstream data from the transfer process, and calculation is started after unpacking; s5, after the calculation process task is completed, a result is packaged and transmitted to the transfer process; and S6, repeating the steps S3-S5 until all the calculation units are calculated. According to the method, the multi-flux parallel computing method for any distributed drainage basin model discrete in a tree structure is realized.

The invention relates to the technical field of business process scheduling, and discloses a multi-way tree-based automatic breakpoint continuous running business process scheduling system, which comprises a multi-way tree scheduling module and a multi-way tree node actuator module which interact with a state bus through an instruction, the multi-way tree scheduling module constructs a process model based on a multi-way tree structure, takes a root node as an entrance, and realizes multi-branch process circulation by associating child nodes through mutually exclusive execution conditions with priorities; a built-in node monitor monitors an execution state, and a re-execution is automatically triggered when the node is interrupted; the multi-way tree node executor module decouples scheduling and service execution through a process engine adapter, and a node executor subscribes to an instruction and feeds back a result. According to the scheme, flexible scheduling, automatic breakpoint continuous running and low-coupling operation and maintenance of the business process can be realized, the method is adaptive to complex and changeable business scenes, and the process execution reliability and the operation and maintenance efficiency are improved.

The application discloses a method, system and device for converting ladder diagram language into ST language, comprising the following steps: S1, obtaining XML text of the ladder diagram language; S2, parsing the text of the ladder diagram language to obtain a multi-way tree; S3, traversing all first-level nodes of the multi-way tree, and after eliminating nodes irrelevant to the generation of the ST language, composing an element tree list; S4, formulating a sorting rule, sorting the element tree list according to the sorting rule to obtain a new list; and S5, traversing the new list, and calculating an expression of the ST language according to the type of a current node and the connection condition of the current node. The application can realize one-to-one correspondence between the ladder diagram elements and the ST code lines, facilitate static analysis and error checking of the code, and increase the portability of the project.

The invention relates to the technical field of railway signal safety control, and provides a data verification method, system and equipment for an interlocking product, which comprises the following steps of: analyzing an interlocking engineering data configuration file, extracting a data type definition and a variable definition, constructing a type multi-way tree and a data multi-way tree, and verifying the data type definition and the variable definition. The method comprises the following steps of: performing progressive hierarchical expansion on multi-dimensional array nodes in a data multi-way tree, traversing non-leaf nodes through a stack, constructing child nodes according to dimensions for nodes with array marks according to structure body types and variable names of the nodes until expansion is completed, verifying the expanded data multi-way tree and standard design data, and outputting a verification result. According to the data verification method, system and equipment for the interlocking product, the verification accuracy and efficiency are improved by progressively expanding the multi-dimensional array nodes, and the reliability of interlocking data configuration is guaranteed.

The invention belongs to the technical field of secret communication, and discloses a group key negotiation method based on quantum key distribution and a multi-way tree structure, which is suitable for safe and efficient group communication. The method comprises the following steps: constructing a group communication node into a multi-way tree structure, establishing a safe QKD key between a child node and a father node by using a QKD technology, generating an intermediate key through key operation of an intermediate node and the child node, encrypting and uploading the intermediate key to the father node by using a quantum key, and finally decrypting and generating a group key by a root node. And the information is transmitted to all nodes layer by layer through a secure channel. By optimizing the bifurcation factor of the multi-way tree, the calculation and communication overhead of the center node is remarkably reduced, and the requirements of groups of different scales are met. In addition, a bifurcation factor optimization calculation model is provided to minimize key negotiation time and improve performance. For scenes where new members join and old members leave, key updating and synchronizing mechanisms are provided respectively, and the security and consistency of group keys are ensured.

The invention belongs to the field of multi-way tree virtual network construction, and discloses a multi-way tree virtual network construction method on a single host, which comprises the following steps: S1, abstracted definition of multi-way tree virtual network nodes: completing network attribute set definition of the multi-way tree virtual network nodes based on a logic node model; s2, standardized packaging of atomic actions: based on a preset atomic action library, decomposing a multi-way tree virtual network creation process into inseparable operations with minimum granularity, namely atomic actions; s3, topology arrangement and heterogeneous node configuration generation based on layer sequence traversal: completing multi-way tree virtual network topology generation by inputting an atomic action list and executing atomic actions on corresponding nodes; s4, instantiation execution and bottom layer resource mounting of the multi-way tree virtual network are carried out, and corresponding configuration in the step S3 is converted into entity resources in a host machine kernel through a virtual instantiation engine. Therefore, the construction of a large-scale, high-fidelity and easy-to-reconstruct multi-stage tree-shaped virtual network is realized.

This application relates to a method, apparatus, computer device, and storage medium for generating Chinese characters. The method includes: obtaining more than one component and at least one shape structure corresponding to the Chinese character to be generated; generating a multi-branch tree corresponding to the Chinese character based on the component and shape structure; leaf nodes of the multi-branch tree corresponding to each component, and non-leaf nodes corresponding to each shape structure; determining at least one tuple in the multi-branch tree based on the parent-child relationships between nodes; each tuple including one parent node and at least two child nodes; traversing the tuples sequentially from the leaf nodes to the root node of the multi-branch tree and performing encoding processing on the traversed tuples until the root node is reached, thereby obtaining a Chinese character representation; obtaining a target font representation corresponding to a target font style, and generating the target Chinese character based on the Chinese character representation and the target font representation. This method can improve the efficiency of Chinese character generation.

Coding schemes for coding a spatially sampled information signal using sub-division and coding schemes for coding a sub-division or a multitree structure are described, wherein representative embodiments relate to picture and / or video coding applications.

The application discloses a kind of based on State Grid GIM model's visual loading tuning method and device, obtain all equipment models in GIM model and the first dependent relationship between equipment model, to save the first dependent relationship between equipment model with first multi-tree, generate glb model corresponding to equipment model, the bounding box and geometric metric error of glb model are merged to generate tile data corresponding to glb model, obtain the second dependent relationship between glb model, to save the second dependent relationship between all or part glb model with second multi-tree, glb model and corresponding tile data are combined, generate 3D Tiles model corresponding to GIM model, 3D Tiles model is published and visualized.The application converts GIM model into 3D Tiles model suitable for large-scale heterogeneous three-dimensional geographic space data streaming transmission and rendering, significantly improves the loading efficiency and interactive performance of Web end three-dimensional scene.

One or more embodiments of the present specification provide a multi-table joint query method and device, electronic equipment and storage medium. The method is applied to a data warehouse; the data warehouse stores a joint relation tree organized in the form of a multi-way tree; the joint relation tree includes leaf nodes for representing each physical table in a plurality of physical tables participating in multi-party computing, and non-leaf nodes for representing joint operations performed on the physical tables represented by the plurality of leaf nodes connected thereto; the method includes: receiving a query requirement for at least part of the plurality of physical tables, the query requirement indicating at least part of the physical tables and a specified query order; in response to the query requirement, traversing the leaf nodes corresponding to the at least part of the physical tables in the joint relation tree in the specified query order, and performing the joint operation corresponding to the non-leaf node connected to the physical table corresponding to each traversed leaf node on the physical table to obtain a multi-table joint query result.