54 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.

The invention discloses a data storage method and a data storage device for multiple types of indexes, the data storage method comprises a first data storage structure, and the first data storage structure comprises a head identification section used for writing type data representing a file coding mode; the key data section bit is used for sequentially writing keys of KV key value pairs, constructing the keys into a multi-way tree, sequentially numbering each node, recording the serial number of the current key on a corresponding leaf node when a certain key is added, and then performing hierarchical traversal of the multi-way tree to obtain a complete bitmap, label and leaf-value, the bitmap records the father-child node relationship of the whole multi-way tree, and the label records the father-child node relationship of the whole multi-way tree. The labs are used for enabling nodes of the whole multi-way tree to correspond to specific characters for matching, and the leaf-value is used for calculating the value after complete matching from a root node to a leaf node; the value data section (value-block) is used for sequentially and correspondingly storing values according to the sequence of the keys; and the value index section (value-index) is used for storing the offset of each value in the file in sequence.

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 application provides a multi-target ambiguity resolution and redundancy reduction method based on a multi-ary tree recursive model, comprising the following steps: step 1, according to a device repetition period parameter, a residual difference table is established for each two relatively prime repetition periods; step 2, after an apparent distance difference is obtained according to an apparent distance and a table is looked up to obtain an ambiguity, a target real distance is determined; step 3, according to the residual difference table, a matrix type staggered index two-dimensional table is established for a target index, a distance true value and a related repetition frequency index; and step 4, according to the established matrix type staggered index two-dimensional table, a method for obtaining multi-visibility of a target based on a multi-ary tree recursive model is adopted to perform a high-to-low fast search for multi-visibility of a target for all distance unit targets of each repetition period until the target is determined. The application effectively reduces redundancy of multi-target ambiguity resolution and improves processing speed.

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.

This application discloses an encoding and decoding control method and apparatus. The encoding control method of this application includes: obtaining a current node to be processed in a target queue, the target queue including nodes whose corresponding space blocks in the constructed tree structure are occupied; obtaining a first mode identifier of the current node to be processed; if the first mode identifier is a first identifier, and if the nodes that have been processed continuously meet a first condition, performing multi-way tree placeholder code encoding on the current node to be processed; wherein, the first condition includes: the mode identifier of the nodes that have been processed continuously is the first identifier and the number of nodes that have been processed continuously is less than a first threshold.

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 provides a blockchain smart contract service framework design method based on a hash multi-way tree and an application system, relates to the technical field of blockchain smart contracts, and forms a hash multi-way tree on the blockchain by connecting a plurality of node smart contracts to each other with each node smart contract as a tree node, realizes the construction of a blockchain smart contract framework based on the hash multi-way tree, realizes the scalability and the integrated multi-way tree structure on the blockchain, internally builds an access mechanism based on roles and permissions for each tree node of the hash multi-way tree, checks whether a user has specific roles and permissions, sets a user access interface externally, provides a serialization engine and a deserialization engine, realizes two functional domains of data management and contract management, and can effectively improve the scalability, compatibility, access speed, maintainability, data confidentiality and data integrity of a DApp.

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 invention discloses a method and apparatus for full-text retrieval and displaying retrieval results. The method includes: extracting the directory structure of the text to be retrieved, storing the directory structure in the form of a multi-branch tree; each node in the tree corresponds to an entry in the directory structure; traversing the multi-branch tree in a breadth-first search manner to obtain the text content between adjacent nodes; establishing a full-text index corresponding to the text to be retrieved based on the text content between adjacent nodes; rasterizing the text to be retrieved and adding a visible digital watermark to each image; obtaining search keywords; performing a full-text retrieval of the text to be retrieved based on the full-text index; and outputting an image corresponding to the retrieval results. The method of this invention displays the portion containing the retrieval results according to structured information, rasterizes the retrieval results, and adds a watermark.

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.

An embodiment of the present invention discloses a method and device for obtaining liquidation rules. The method includes: in response to obtaining a liquidation type rule configuration instruction, displaying a rule input page to guide a user to fill in parameter information of the liquidation type; in response to obtaining a configuration completion instruction through the rule input page, obtaining the configured multi-tree parameters; obtaining a rule determinant based on the multi-tree parameters; using the rule determinant as a liquidation rule for the liquidation type, and storing the rule determinant in a database. The technical solution disclosed in the embodiment of the present invention improves the efficiency of entering liquidation rules, saves the manpower and time costs of entering liquidation rules, and obtains the rule determinant based on the configured multi-tree parameters and stores the rule determinant as the liquidation rule for the liquidation type, thereby reducing the storage resources occupied by the database and improving the storage efficiency of the database.

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 invention provides a topological element naming method and device based on copy class features and a medium, and the method comprises the steps that a result container is initialized based on a multi-way tree structure of multiple reference features, and the reference features are copy class features or non-copy class features; based on a multi-way tree structure, traversing the copy matrix of each reference feature layer by layer to obtain matrix chain information, and storing the matrix chain information in a result container; traversing the result container layer by layer, and carrying out duplicate removal processing on matrix chain information; traversing each matrix chain of the result container layer by layer, and constructing a modeling entity corresponding to the copy feature according to the corresponding matrix chain information and the feature parameter of the reference feature; and determining the element name of each topological element of the modeling entity in the modeling process of the modeling entity. According to the technical scheme of the embodiment of the invention, on the basis of the multi-way tree structure of the reference features, the naming maintenance management requirements of the topological elements are met, and automatic naming of the topological elements can be realized, so that the naming efficiency is improved.

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 provides a file detection method and device, electronic equipment, a storage medium and a program product. The method comprises the steps that file data of the vehicle-mounted system are obtained, the file data are stored in a multi-way tree structure, and the multi-way tree structure comprises a plurality of nodes; for each node of the multi-way tree structure, executing the following processing: marking the node state of the node as a to-be-detected state under the condition that the node in the file data meets a to-be-detected condition; adding the node in the to-be-detected state to the tail of a detection queue; according to a detection sequence in the detection queue, calling a detection thread to detect each node in the to-be-detected state in sequence to obtain a detection result; and under the condition that the detection result is data change, updating the multi-way tree structure based on the detection result. According to the invention, the file detection efficiency can be 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 embodiment of the invention discloses a block chain data processing method and device, equipment and a storage medium, and is applied to a block chain technology. The method comprises the following steps: receiving a synchronization request for a block chain; reading a first hash sub-chain associated with the first path from a first multi-way tree hash chain in the first block according to the first path information; reading block metadata of the first block from the first block, and reading a transaction corresponding to the first path from the first block according to the first path information; and synchronizing the block metadata of the first block, the first hash sub-chain and the transaction corresponding to the first path to a synchronization node device, the synchronization node device being used for verifying the validity of the transaction corresponding to the first path to obtain a verification result, and when the verification result indicates that the transaction corresponding to the first path has validity, sending the transaction to the first block. And storing the transactions corresponding to the first path. According to the invention, the consumption of network bandwidth can be reduced, and the waste of the storage space of the synchronous node equipment is avoided.