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

A method, apparatus, and computer product comprising: obtaining a multitree data structure that represents a plurality of ordered Pauli-terms, the plurality of ordered Pauli-terms representing an exponentiation module, wherein implementing a Pauli-term in a quantum circuit requires to implement a basis change stage and a parity summation stage, the multitree data structure comprises root nodes representing the plurality of Pauli-terms, leaf nodes representing qubits, and a non-leaf node; converting the multitree data structure to an ordered binary multitree that comprises an additional node; and synthesizing the quantum circuit based on the ordered binary multitree, whereby the quantum circuit comprises an implementation of the parity summation stage and an implementation of the basis change stage, whereby the quantum circuit implements at least one cancellation of a given CX gate of the parity summation stage.

The invention relates to a pruning optimization-based RAG reordering method for a tree structure document, belongs to the technical field of computer science and information processing, and relates to a pruning optimization-based RAG reordering method for a tree structure document in combination with a machine learning algorithm and a probability theory based on a pruning strategy and an RAG (Retrieval-Augmented Generation) technology. And carrying out node score calculation, pruning optimization and reordering processing on the multi-way tree structure document, so as to improve the reasoning efficiency and response speed of the large-scale language model in knowledge retrieval and generation tasks. The method is suitable for application scenes needing efficient document processing, quick response and high accuracy, such as search engines, intelligent question-answering systems and knowledge base management.

The invention relates to an earthwork allocation optimization method based on a combined problem model framework. The method comprises the following steps: obtaining construction node information, cost information and vehicle-mounted capacity information of to-be-processed earthwork; constructing a linear programming model based on the construction node information and the cost information by taking the minimum cost as a target, solving through a solver to obtain a static deployment scheme, and storing the static deployment scheme as a multi-way tree; constructing a travel salesman-like problem model based on construction node information, cost information and vehicle-mounted capacity information by taking a shortest path as a target, calling data in the multi-way tree, and solving through an ISABO algorithm to obtain a path allocation scheme; and the static allocation scheme and the path allocation scheme are combined and output, and allocation optimization of the to-be-processed earthwork is completed. According to the earth-rock deployment problem and construction optimization method for solving the complex problem based on the combination problem, the functional composition of the complex mathematical problem model is successfully deconstructed, and the difficulty of mathematical modeling is greatly reduced.

The invention discloses a license authorization management method for a software platform, which comprises the following steps of: storing files or data by adopting a multi-way tree type storage structure, granting a user permission of a corresponding node level according to different nodes of the multi-way tree type storage structure, generating a unique machine code according to the user permission and server hardware information, and storing the unique machine code into a server; performing digital signature on the machine code to generate a legal authorization file; finally, when the user accesses the corresponding node, performing authorization file verification, and judging whether the authorization file verification is passed or not; and the effect of browsing, viewing or modifying hierarchical management aiming at users with different permissions is realized.

According to the efficient matching method for the GIS multi-scale basic geographic space data, a multi-scale matching scheme based on geographic space database optimization is improved, firstly, a spatial database model based on a relational database and a spatial database engine is used as a method for storing the multi-scale basic geographic space data, and the method is high in storage speed and flexible in application; 2, establishing a new object selection method for multi-scale geographic space data matching, organizing a basic geographic entity in a data structure form of a multi-way tree based on a multi-scale semantic change rule of geographic space data, and establishing a category matching method for semantic change of the same element category of different proportional scales; a category matching relationship under a multi-scale condition is effectively constructed; and thirdly, an optimization scheme for multi-scale basic geographic space data matching is established, the matching effect is good, and the operation efficiency is high. Spatial data fusion can be efficiently realized, the spatial data quality is improved, and the map database updating efficiency is improved.

The invention discloses a data storage method and device of electronic equipment and a computer readable storage medium, and relates to the technical field of computers. A specific embodiment of the method comprises the following steps: in response to starting of the electronic equipment, establishing intermediate node data and root node data of a multi-way tree structure in a volatile memory according to data of a plurality of leaf nodes of the multi-way tree structure which is pre-persisted in a persistent memory; and generating auxiliary data of the leaf node in the persistent memory so as to execute a read operation or a write operation on the leaf node. According to the implementation mode, the volatile memory and the persistent memory can be combined to realize data persistence, and meanwhile, the access speed approximate to that of the volatile memory is kept.

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 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 invention provides a risk control scene-based multi-branch decision tree segmentation method and system, and the method comprises the steps: obtaining historical customer data from a credit institution, carrying out the processing and sampling of the data according to a business scene, and obtaining an original data set; based on the original data set, keeping the numerical variables unchanged, and processing character type and Boolean type predictive variables to obtain a processed data set; and based on the processed data set, performing multi-way tree segmentation on numerical variables, character type and Boolean type predictive variables according to a specified mode and a specified branch number. The data acquisition module is responsible for acquiring historical customer data from a credit institution and processing and sampling the data according to a business scene to obtain an original data set. The system comprises a data acquisition module, a data processing module and a segmentation execution module. Through the steps of data acquisition, preprocessing, modeling and the like, effective assessment and prediction of the customer credit risk are realized, and a scientific and reliable risk management means is provided for a credit institution.

A method, apparatus, and computer product for constructing a multitree data structure, comprising: obtaining Pauli-terms that are associated with qubits, each Pauli-term defines at least one active qubit, the Pauli-terms are ordered according to a defined order; generating an auxiliary graph that represents the Pauli-terms, the auxiliary graph comprising graph nodes that represent the Pauli-terms, the graph nodes are ordered consecutively according to the defined order, an interface between first and second consecutive graph nodes represents a set of active qubits that is active in first and second Pauli-terms, the first and second Pauli-terms are represented by the first and second consecutive graph nodes; and generating the multitree data structure based on the auxiliary graph.

The embodiment of the invention relates to a data attribution method and device, electronic equipment and a program product. The method comprises the steps that data in a text description form is obtained, an analysis tree is generated based on the data in the text description form and a preset dimension, and the analysis tree comprises at least one of node attribution data and whole tree attribution data. The method further comprises the step of cutting the analysis tree based on the first parameter and the second parameter to obtain cut data in a multi-way tree structure form. The method further includes normalizing and serializing the cut data in the form of the multi-way tree structure to generate normalized and serialized data, and presenting the normalized and serialized data in the form of text description. Further, the method includes generating, by a language model, an attribution summary for the data based on the normalized serialized data. Therefore, according to the scheme of the embodiment of the invention, attribution aiming at the data can be automatically performed for the user in mass data, and the attribution is presented in a concise character, so that the user experience is improved.

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.

A method, apparatus, and computer product comprising: obtaining a multitree data structure that represents a plurality of ordered Pauli-terms, the plurality of ordered Pauli-terms representing an exponentiation module, wherein implementing a Pauli- term in a quantum circuit requires to implement a basis change stage and a parity summation stage, the multitree data structure comprises root nodes representing the plurality of Pauli-terms, leaf nodes representing qubits, and a non-leaf node; converting the multitree data structure to an ordered binary multitree that comprises an additional node; and synthesizing the quantum circuit based on the ordered binary multitree, whereby the quantum circuit comprises an implementation of the parity summation stage and an implementation of the basis change stage, whereby the quantum circuit implements at least one cancellation of a given CX gate of the parity summation stage.

The invention belongs to the technical field of course arrangement of an education system, and discloses a multi-way tree path-based course arrangement method, which comprises the following steps of: S1, collecting course arrangement related data; s2, constructing a multi-way tree structure reflecting course arrangement constraints according to the collected course arrangement related data; s3, through a depth-first search or multi-way tree pruning strategy, searching a course arrangement satisfying a course arrangement constraint; and S4, representing the generated course arrangement scheme in a multi-way tree path form for a user to check and confirm. The method solves the problems that the complexity of a course arrangement system is increased due to the adoption of a genetic algorithm in an existing course arrangement method, and the course arrangement schedule is not converged after crossing and variation of the course schedule.

The embodiments of the present specification provide a report generation method and system, wherein the report generation method comprises: determining report generation parameters in response to a report generation request submitted for a target business; when the report generation request is a multi-report generation request, extracting multiple report tasks from a task database of the target business according to the report generation parameters; determining task dependencies corresponding to the multiple report tasks according to a preset task dependency graph, and arranging the multiple report tasks according to the task dependency to obtain a target multi-branch tree; traversing the target multi-branch tree, and generating at least two target reports corresponding to the report generation request according to the traversal result.

The invention discloses a marketing activity execution method and device, equipment and a storage medium, which are applied to the field of software development, and the method comprises the steps: constructing a multi-way tree comprising a root node layer, an event node layer and an event condition node layer; constructing a double linked list containing marketing event condition nodes based on the event condition logic relationship of the marketing activities; traversing in the multi-way tree based on the reported event, and matching from the event condition nodes to obtain a target event condition node; and determining the double linked list containing the target event condition node as a target double linked list, performing traversal trigger verification on a forward node and a backward node of the target event condition node in the target double linked list, and executing a marketing activity of the target double linked list based on a trigger verification result. According to the method and the system, the marketing activities are decoupled from each business platform, so that the unified configuration, management and maintenance of the marketing activities are realized, and the problems of high platform development cost, long period and difficulty in management and maintenance caused by tight coupling of the marketing activities and business systems are avoided.

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.

The present invention belongs to the technical field of grid meshing of numerical models in the geophysical field, and provides an electromagnetic field numerical simulation method, system and product based on multi - fork tree grid meshing. The technical solution is to mesh the calculation area of the geoelectric model; determine the electromagnetic field sampling positions in the grid according to the multi - fork tree grid layout after meshing the calculation area; when calculating the first - order partial derivative of the magnetic field at the interface where the adjacent grid sizes are not equal according to the sampling positions of the electromagnetic field in the calculation area, select the non - adjacent and existing discrete magnetic fields on both sides of the interface of the spatial sampling positions, so that the magnetic field partial derivative at the boundary of different - sized grids has second - order calculation accuracy; assemble the calculation equations of all discrete electric and magnetic fields in the calculation area, and solve to obtain the discrete electric and magnetic fields at the sampling points. By this method, the calculation accuracy is improved without reducing the calculation efficiency, ensuring that the calculation results have second - order accuracy.

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.

Provided are an encoding method, a decoding method, a point cloud encoder, a point cloud decoder, a bitstream, and a storage medium. The decoding method comprises: decoding first identification information on the basis of a first probability model, wherein the first identification information is used for indicating whether the current node contains duplicated points; and if the first identification information indicates that the current node contains duplicated points, determining the number of duplicated points contained in the current node. The first probability model satisfies at least one of the following: an initial value of the first probability model being not equal to a first value, which corresponds to the probability of an MPS being equal to the probability of an LPS; and the first probability model being different from a second probability model, the second probability model corresponding to second identification information. The first identification information is used for indicating whether a node using DCM contains duplicated points, and the second identification information is used for indicating whether a leaf node of a multi-way tree contains duplicated points. Alternatively, the first identification information is used for indicating whether the leaf node of the multi-way tree contains duplicated points, and the second identification information is used for indicating whether the node using the DCM contains duplicated points.

The invention provides a graph data integrity protection method which can be applied to the technical field of big data and databases. The graph data integrity protection method comprises the following steps: recording structure information of target graph data by utilizing a multi-way tree structure based on a target filter; storing a private key for signature, a root node in the multi-way tree structure and a current child node which is not full of information in a trusted storage area, and storing other child nodes which are full of information in the multi-way tree structure in a non-trusted storage area; performing Hash operation on other child nodes in the multi-way tree structure, and storing an operation result on a root node of the multi-way tree structure; and performing integrity protection on the change operation of the target graph data by using the multi-way tree structure after the Hash operation, and performing integrity protection verification on the query operation of the target graph data by using the private key and the multi-way tree structure after the Hash operation. The invention further provides a graph data integrity protection device and equipment, a storage medium and a program product.

The invention relates to a BMS software design system based on a hierarchical state machine, state division and state hierarchical division are carried out according to product requirements and hardware schemes of a BMS, S1, a current BMS system based on the hierarchical state machine forms a data structure of a multi-way tree by taking a top-layer state as a root node, child nodes except leaf nodes and the root node are all in a composite state, and the top-layer state and the root node are combined; the state on the leaf node is a simple state; the BMS software design system based on the hierarchical state machine, provided by the invention, has remarkable beneficial effects in the aspects of simplifying system design and maintenance, improving system flexibility and adaptability, enhancing fault diagnosis and protection capability, improving system integration and test efficiency, optimizing an energy management strategy and the like; and the method has important significance for promoting the development and application of the BMS technology.

The present invention relates to a multi-tree vehicle business logic analysis method based on abstract components. The method firstly realizes the separation of the analysis framework and the analysis case through the abstract modular interface design, so that the cases and the cases and the analysis framework are not coupled and isolated from each other, which is convenient for adding, deleting and modifying the analysis logic; then, the vehicle business logic calculation and vehicle fault diagnosis and positioning are realized through the designed binary tree and multi-tree. Compared with the prior art, the present invention has the advantages of clear module architecture, low coupling of business logic, high scalability, convenient engineering configuration, etc.

The invention discloses a user question rewriting method and system oriented to multi-round questions and answers of a large-scale dialogue system, and is used for the technical field of information processing. Comprising the following steps: acquiring user input; inputting the current questions into the judgment model to obtain questions with subjects or questions without subjects; mounting questions with subjects to child nodes of the multi-way tree, mounting questions without subjects to grandchild nodes of the multi-way tree, and mounting historical questions to child nodes or grandchild nodes of the multi-way tree to obtain a mounted multi-way tree; wherein the mounted multi-way tree comprises a root node, a plurality of child nodes and a plurality of grandchild nodes; the plurality of sub-nodes belong to the root node, and the plurality of sub-nodes ask questions for different themes respectively; the plurality of grandchild nodes belong to one or more child nodes, and the plurality of grandchild nodes respectively ask different theme-free questions; and sorting the grandchild nodes in each child node to obtain a related theme-free question cluster so as to form a plurality of question lists with subjects and backgrounds.

The embodiments of the present application provide a method, device, electronic device and computer-readable medium for executing SQL instructions, which relate to the field of databases. The method includes: converting the original binary tree structure of the logical connection operator corresponding to the received first SQL instruction to obtain the dense connection operator corresponding to the first SQL instruction and the multi-tree structure of the dense connection operator; grouping the data tables connected by the dense connection operator to obtain the grouping results of the data tables; based on the grouping results, converting the multi-tree structure of the dense connection operator corresponding to the first SQL instruction to obtain the standard binary tree structure of the logical connection operator corresponding to the first SQL instruction, wherein the standard binary tree structure is used to determine the logical connection operator that can be pushed down to the node execution of the distributed database. Through the embodiments of the present application, the execution efficiency of the first SQL instruction can be significantly improved.