59 results about "Tree traversal" patented technology

The invention is suitable for the technical field of data query, and provides an index query method and device, electronic equipment and a storage medium, and the index query method comprises the following steps: obtaining a first type of query language statement input by a user; performing grammar analysis on the first type of query language statement based on a predefined grammar rule to generate a corresponding analysis tree; traversing the analytic tree, identifying a query target in the first type of query language statement, and constructing a query semantic object based on the query target, the query target including one or more of an index and a physical table; and according to the query semantic object, generating a second type of query language statement corresponding to the first type of query language statement for an underlying data system to perform index query. According to the scheme, by introducing the query semantic object and supporting mixed recognition and processing of the index and the physical table, the problems that in an existing query mode, flexibility is insufficient, dynamic parameters cannot be expressed, and multi-source joint query cannot be supported are solved.

The invention relates to the technical field of data backup, and discloses an iOS device data backup and recovery method and system, and the method comprises the steps: carrying out the SSL certificate verification and EscrowBag key authentication of an iOS device, and obtaining a data path list; according to the data path list, parallel scanning of APFS file system B-Tree traversal, NAND flash memory page reading and SQLite WAL log analysis is carried out on the iOS device storage partition, and an original data set is obtained; performing integrity evaluation based on the original data set to obtain an effective data set and constructing a virtual file index; the data selection list of the user is confirmed based on the virtual file index, safety recovery is executed, and a data recovery result is returned. The SQLite page Cell reconstruction and fragment file signature matching technology is combined, intelligent repair and quality prediction can be conducted on damaged data, the user experience and operation efficiency are improved, and the user experience is improved. And the security and the reliability in the data recovery process are ensured.

The invention relates to the technical field of code generation, in particular to a communication code generation method based on an XML configuration file and a storage medium, and aims to improve the code development efficiency. The communication code generation method based on the XML configuration file comprises the steps that the XML configuration file is converted into a DOM tree with a hierarchical relation through an XML parser; traversing nodes of the DOM tree, and converting the DOM tree into an abstract syntax tree; based on the abstract syntax tree, statically checking register address conflicts, reference validity, data type compatibility and protocol constraints; traversing the abstract syntax tree to generate a Modbus communication code; and outputting the Modbus communication code as a structured source code file according to the grammar rule of the target language. According to the method, the manual coding workload is greatly reduced, and the development efficiency is improved.

The context-aware optimization method includes training a context model by determining whether to split each node in the context by identifying a first subset of virtual context to evaluate by identifying a second subset of virtual contexts to evaluate and obtaining an encoding cost of splitting of the context model for each virtual context in the second subset and identifying the first subset of virtual contexts to evaluate by selecting a predetermined number of virtual contexts from the second subset based on the encoding cost such that the predetermined number of virtual contexts with lowest encoding cost are selected. The modified tree-traversal method includes encoding a mask or performing a speculative-based method. The modified entropy coding method includes representing data into an array of bits, using multiple coders to process each bit in the array and combining the output from the multiple coders into a data range.

The invention discloses a database desensitization method and device, equipment, a storage medium and a computer program product, and relates to the technical field of data processing.The method comprises the steps that in response to a query request for a target database, database query statements in the query request are analyzed, and an abstract syntax tree is constructed based on the database query statements; converting the abstract syntax tree into a target syntax tree; traversing nodes of the target syntax tree, and recursively determining a sensitive attribute inheritance relationship among the nodes of the target syntax tree from bottom to top so as to pre-judge a sensitive field of a target result set obtained after the database query statement is pre-executed; and desensitizing the sensitive field based on a preset desensitization rule, and returning a desensitization result set to the query requester. According to the invention, the desensitization efficiency can be improved, and accurate desensitization can be realized.

The embodiment of the invention provides a webpage automatic configuration method and device, equipment, a storage medium and a program product, and relates to the field of artificial intelligence. The method comprises the steps that in response to an operation of uploading a configuration file by a user, webpage data of a target webpage are determined, and the target webpage is used for indicating a webpage displayed after the configuration file is analyzed; determining a tree structure corresponding to the webpage data; determining a target root node in the tree structure, wherein the target root node comprises a plurality of adjacent and continuous sub-trees with similar structures in the tree structure; and traversing nodes under the target root node, determining an operation node mapped as a target operation control in the target webpage, and executing a target operation on the corresponding target operation control through the operation node. The method can improve the efficiency, reduce the cost, reduce manual operation steps and error risks through automatic analysis and positioning, adapt to webpage changes and enhance the flexibility and reliability of automatic operation.

The invention provides an incremental backup method and system based on a file system operation log. The incremental backup method comprises the steps that whether current backup is first backup or not is judged; performing full-directory scanning on the backup target, reading the content of the target file, performing hash de-duplication on the data of the variable-length block target based on the content, storing the obtained block data and index information into the storage equipment, and ending the operation; reading data and an index of a preorder backup, synthesizing a complete directory view after the last backup, reading an operation sequence log which is actively recorded by a file system and aims at a target directory, and combining and constructing a modification tree; and traversing and accessing the modification information recorded in the modification tree, reading the data of the file and the block file which need to be backed up again, carrying out hash de-duplication, storing the obtained data to the storage equipment, and ending the operation. According to the method, the opportunity of incremental backup is freely selected through the method that the file system actively records the operation sequence log aiming at the target directory, and the flexibility of incremental backup is improved.

The application provides an intelligent decision-making method and system based on a draw mode, and a computer device. The method comprises the following steps: analyzing current hand information according to mahjong winning rules, recursively expanding a draw node by using effective cards required by analyzed tzu cards and pung cards, and establishing a winning combination tree; traversing the winning combination tree to obtain multiple winning paths corresponding to the current hand information; comprehensively calculating an expected value of the card information according to a winning score of each winning path, a draw probability of draw information corresponding to each node under each winning path, and a draw weight; and selecting card information corresponding to the maximum expected value to make a decision on card playing. The intelligent decision-making method based on the draw mode can quickly make an intelligent decision without sufficient user combat data for training support, greatly saves computing resources, and has high applicability.

The invention discloses a signal detection method and device, electronic equipment and a storage medium, and relates to the technical field of wireless communication. The method comprises the following steps: determining an MIMO system transmission model according to a channel matrix, a sending signal vector, a receiving signal vector and a noise vector, converting into an acyclic hierarchical structure based on the MIMO system transmission model, and dynamically generating a search tree; traversing all the to-be-expanded nodes in the search tree, determining the global value of each to-be-expanded node, and determining the to-be-expanded nodes according to the global value; generating all sub-nodes of a path where the node to be expanded is located, determining a target confidence message transmitted to the node to be expanded by the sub-nodes, and updating upwards to the root node step by step along the path until an updating condition is met; and determining the node which terminates updating as a target node, transmitting an updating message to a descendant node of the target node, circularly traversing all nodes to be expanded in the search tree until a termination condition is met, and outputting a symbol sequence corresponding to a target path as an original data symbol.

The application provides a code templating generation method and system based on an annotation markup language, and relates to the technical field of code development. The generation method comprises the following steps: creating a project framework template; constructing a meta object; reading a global template file; parsing annotation marks in the global template file to form a global template syntax tree; executing the global template syntax tree to traverse a code template file; reading the code template file; parsing annotation marks in the code template file to form a code template syntax tree; executing the code template syntax tree to generate code; creating a code file and writing the code; and the generation system comprises a meta object, an annotation markup language, a framework template specification, a meta object controller, a generator, a dialect controller, a file reader, an annotation markup language parser and an annotation markup language executor. The application has the beneficial effects that a project framework template is provided, unified research and development standards are provided, the efficiency and quality of code writing are improved, and the application is suitable for various computer languages.

The application relates to the technical field of data backup, and discloses a backup and recovery method and system for iOS device data, wherein the method comprises the following steps: performing SSL certificate verification and EscrowBag key authentication on an iOS device to obtain a data path list; performing parallel scanning of APFS file system B-Tree traversal, NAND flash page reading and SQLite WAL log analysis on an iOS device storage partition according to the data path list to obtain an original data set; performing integrity evaluation based on the original data set to obtain an effective data set and construct a virtual file index; confirming a user's data selection list based on the virtual file index and performing safe recovery to return a data recovery result; and the application combines SQLite page Cell reconstruction and fragment file signature matching technology, can intelligently repair and quality predict damaged data, improves user experience and operation efficiency, and ensures the safety and reliability in the data recovery process.

The invention discloses a game red dot management method and system, and the method comprises the following steps: S1, constructing a tree-shaped red dot logic model, organizing all red dot nodes in a game into a hierarchical structure, and defining the father-son relationship between the nodes, the nodes including leaf nodes and composite nodes; s2, adopting a double-queue framing processing mechanism, classifying updating tasks into an expensive red dot queue and a common red dot queue according to node calculation cost, and processing nodes in the queues in batches according to a preset interval through a timer, in each frame, no more than 2 nodes are extracted from an expensive red dot queue, and no more than 12 nodes are extracted from a common red dot queue for state calculation and propagation. According to the method, all red dots in the game are organized into a hierarchical structure, the father-son relation is achieved, and the state of any node is efficiently calculated through a tree traversal algorithm.

The invention relates to the technical field of operating system fault analysis, and provides an operating system fault detection method based on time sequence prediction and root cause analysis, which comprises the following steps: constructing a KPI tree based on system data and log data; traversing the KPI tree, executing the associated data acquisition command for each node, and updating an abnormal state identifier based on a real-time system performance index; in response to the abnormal state identifier, mapping the abnormal indexes in the KPI tree to a topological graph through a KPI-topological mapping dictionary, the topological graph representing an association relationship between physical components of the system; positioning an abnormal component in the topological graph based on mapping and outputting an abnormal dependency chain, using a BCC tool to hook a kernel function related to an abnormal index, collecting kernel call stack information, and performing root cause analysis based on the collected kernel call stack information; and a time sequence prediction model is used to predict system indexes, an early warning mechanism is triggered based on a prediction result, and the time sequence prediction model fuses dynamic characteristics based on a multi-scale recurrent neural network.

The context-aware optimization method includes training a context model by determining whether to split each node in the context by identifying a first subset of virtual context to evaluate by identifying a second subset of virtual contexts to evaluate and obtaining an encoding cost of splitting of the context model for each virtual context in the second subset and identifying the first subset of virtual contexts to evaluate by selecting a predetermined number of virtual contexts from the second subset based on the encoding cost such that the predetermined number of virtual contexts with lowest encoding cost are selected. The modified tree-traversal method includes encoding a mask or performing a speculative-based method. The modified entropy coding method includes representing data into an array of bits, using multiple coders to process each bit in the array and combining the output from the multiple coders into a data range.

The invention discloses an AI code generation optimization method and system, and belongs to the technical field of software development, and the method specifically comprises the steps: obtaining a micro-service path prefix and API grouping list data, determining an artificial code through noise reduction hash comparison in combination with a code feature dictionary, and automatically generating a method name according to user selection and annotation; interface details are obtained for API groups corresponding to the method names, API access paths are generated, the interface details are sorted to generate a code snippet mapping table, and interface performance is automatically analyzed in combination with burying point data; generating an abstract syntax tree according to the mapping table, traversing and replacing nodes meeting conditions, and generating AI code configuration details; according to the configuration details, annotation is added for the method to generate an API code, parameter verification, service logic and return result processing codes are added, and a complete AI code is formed through integration; adding exception handling logic for the complete AI code and writing the exception handling logic into a file; and the code generation efficiency and quality are improved.

The invention provides a Merkle batch proof generation method and device, equipment and a storage medium, and relates to the technical field of data processing. According to the method, the batch query requests are received and the target leaf nodes are positioned, so that the to-be-verified data items can be accurately focused, and the overhead of full-tree traversal is avoided; a target leaf node is positioned in a pre-constructed Hash Merkle tree, and a witness tree is constructed, so that a complete structured data basis is provided for path analysis. By traversing the witness tree and identifying the shared sub-paths of the sub-fork paths, and combining the shared sub-paths to construct the collision tree, redundant nodes in the verification path can be effectively identified and eliminated, and extreme compression of the verification path is realized. According to the structured batch certification generated based on the witness tree and the collision tree, on the premise of ensuring verification integrity, communication overhead and computing resource consumption are reduced, and generation and verification efficiency of data certification in a financial high-frequency transaction verification or medical batch auditing scene is improved.

A network device may receive parameters for a probe packet, and may generate the probe packet based on the parameters. The network device may provide the probe packet to multiple ingress packet forwarding components, and may generate probe packet copies at the multiple ingress packet forwarding components. The network device may generate ingress route metadata for the probe packet copies via filters provided in the multiple ingress packet forwarding components, and may provide the probe packet copies to multiple egress packet forwarding components. The network device may generate egress route metadata for the probe packet copies via filters provided in the multiple egress packet forwarding components, and may provide the probe packet copies, the ingress route metadata, and the egress route metadata to an application. The network device may utilize the application to generate a report, and may provide the report for analysis.

The invention discloses a query method and device for removing redundant connection, electronic equipment, a medium and a product. The method comprises the steps that for a query statement with redundant connection, FROM clauses are converted into a first relation tree, non-leaf nodes represent connection, and leaf nodes represent a common table; on the basis of the first relation tree, recursively lowering a screening condition and a WHERE condition of the FROM clause to obtain a second relation tree; traversing each node in the second relation tree, and processing redundant child nodes of the current node according to a column required by a father node of the current node to obtain a third relation tree; and generating and executing a physical execution plan for the third relation tree to obtain a query result. According to the technical scheme, the screening condition and the WHERE condition of the FROM clause are recursively released by utilizing the relational tree, and then redundant child nodes are gradually processed by traversing the nodes in the relational tree to remove unwanted columns, so that redundant connection is removed, and the query efficiency is improved.

This invention relates to the field of data processing technology and discloses a method and system for order management in customized rice cake production. The method includes: generating a corresponding production task set based on the resource and process parameter dependencies of the order; encapsulating the process sequence and production resources in the task set into the root node of the order; extracting its unassigned processes; enumerating available resources to construct a resource state tree; traversing the path from the root node to the leaf node in the tree; accumulating the time cost of each node to obtain the total cost; selecting the path with the minimum total time cost as the optimal path node sequence; updating the order status accordingly; and finally outputting the order's driving management data. This process optimizes production scheduling through dynamic matching of resources and processes; this invention can improve the management accuracy and production execution efficiency of customized rice cake production orders.

The application provides a query expression automatic generation device for a search system, characterized by the following steps: selecting a training data set; preprocessing a query word; determining a query domain; generating a query condition; and constructing a query word tree according to the query condition, the query domain and information of an information source. The query expression automatic generation device for the search system can automatically learn and group by using a machine in the construction process of the query word tree, can realize automation, can construct a query expression based on the query word tree, can convert the construction problem of the query expression into a tree traversal problem, and greatly simplifies operation.

The invention belongs to the field of CPG file generation, and particularly relates to a project-level CPG file generation method, system and device and a storage medium, and the method comprises the steps: generating an abstract syntax tree according to a screened file set, traversing nodes for generating action ranges in the abstract syntax tree, and obtaining a node relationship; establishing a dependency edge according to the abstract syntax tree and the node relationship; processing a branch structure, a loop structure and a jump structure according to the abstract syntax tree to obtain a control flow edge; traversing the abstract syntax tree and establishing a dependency edge, otherwise, storing the position of the calling block and the calling information into an import function table, establishing a calling edge, and obtaining a single CPG file according to the calling edge, the dependency edge, the control flow edge and the basic block; and generating a project-level CPG file according to the abstract syntax tree generation file index in combination with the single CPG file. The method has the advantages that structured data support is provided for static analysis of a large-scale Lua project, and the static analysis efficiency can be greatly improved.

The present invention discloses a method, system and computing device for automatic detection of malicious code for smart contracts, relates to the field of security analysis technology, and solves the technical problem that the prior art has the risk of omitting key execution states, thereby causing underreporting of malicious code detection; the present invention generates an abstract syntax tree by parsing source code; traverses and identifies all types of address variables in the abstract syntax tree, marks them as address variable sets and classifies them; calls the initial state and builds a symbolic execution engine with a buffer pool, and uses the initial state as input to output a matrix through the symbolic execution engine; builds and initializes a result deviation table based on the output matrix; updates the result deviation table according to a symbol replacer and generates a deviation function queue; iteratively analyzes the result deviation based on the deviation function queue to obtain a final deviation variable set; and judges whether the corresponding smart contract is malicious based on the final deviation variable set; the present invention covers a wider range of malicious contract codes.

Embodiments of the present application disclose code packaging methods and devices, computer equipment and storage media. Embodiments of the present application can obtain a code block in source code, convert the code block into a code syntax tree, traverse the code syntax tree, determine a target keyword, determine a reference strategy of the target keyword according to a keyword type of the target keyword, and determine a corresponding package of the code block according to the target keyword and the reference strategy of the target keyword. In the embodiments of the present application, the code is packaged by establishing a syntax tree, the keyword type can be detected according to the syntax tree, and the reference strategy of the keyword can be determined, so that the obtained package contains the reference strategy of the keyword, to facilitate normal operation of a program.

The embodiment of the invention discloses a character conversion file storage method and device, equipment and a medium. A specific embodiment of the method comprises the following steps of: performing ordered character splitting on each suffix character string in a file suffix set to generate a character node linked list set; distributing unique identification information for each character in the linked list set; packaging the allocated linked list set into a character dictionary tree; traversing each non-leaf node of the character dictionary tree; generating an outer-layer branch code based on the identification information; determining child nodes connected with non-leaf nodes; and generating an inner-layer branch code according to the character values of the child nodes. And integrating all the generated outer-layer and inner-layer branch codes into a character conversion file, and storing the character conversion file into a system disk. The method can be applied to extraction of character information in logs and network flow data, recognition and standardized conversion of file suffixes are achieved, the method is compatible with the types of newly-added files, the development time of character adaptation codes is shortened, and the stability of the file processing process is improved.

The application discloses a kind of power grid key section search method, device, equipment and storage medium, the method includes: obtaining first power grid network topology diagram, extract and delete the line of suspension node in first power grid network topology diagram and connect with suspension node, obtain second power grid network topology diagram;Search the cut point in second power grid network topology diagram, and divide second power grid network topology diagram into several subgraphs by cut point;Obtain the heavy load line in second power grid network topology diagram, judge the subgraph where the heavy load line is located;With heavy load line as root node, search first shortest path in subgraph and build key section search tree, traverse the key section search tree, obtain the key section of power grid.The method provided by the application has the characteristics of simplicity, efficiency, parallelism, etc., which can indirectly search the key section of power grid, can consider the accuracy and search efficiency of search result, and can get the key section with cut-set property.

The application provides a glass deep processing process analysis system and method based on AI cloud data, the method comprising: performing semantic analysis and structured packaging on the obtained process query text in combination with a glass industry term library to obtain a structured query instruction; performing database table association, list matching and context enhancement on the structured query instruction based on a bidirectional mode link algorithm, and performing sentence optimization on the matching result after context enhancement based on a binary selection strategy to obtain a primary query sentence; performing logical self-correction on the primary query sentence based on a multi-round syntax tree traversal method to obtain a database query sentence; querying the original data set from the glass processing database by using the database query sentence, and performing multi-dimensional data analysis on the original data set based on a dynamic threshold anomaly detection algorithm and a mutual information algorithm to obtain an analysis result set; and generating an interactive report according to the analysis result set.

The invention discloses a question and answer method and device and a storage medium, and the question and answer method comprises the steps: obtaining a first knowledge set, the first knowledge set comprises at least one text tree, the text tree comprises a plurality of non-leaf nodes and a plurality of leaf nodes, the non-leaf nodes are used for storing hierarchical titles, and the leaf nodes are used for storing text paragraphs; for each text tree, traversing each non-leaf node in the text tree, determining a matching node matched with the user question text in each non-leaf node, and taking the content of a descendant node of the matching node as a first candidate recall result of the text tree; and generating an answer result about the user question text at least based on each first candidate recall result. By means of the mode, the integrity and accuracy of the retrieval recall result can be improved, and therefore the answer accuracy is improved.

The invention discloses a ray tracking method and device and electronic equipment. The method comprises the steps that an initial K-dimensional tree corresponding to a geometric model of a target scene is constructed, each node of the initial K-dimensional tree corresponds to an axis alignment bounding box, the axis alignment bounding boxes are associated with included triangular patch lists, and corresponding electromagnetic parameters are bound according to materials of triangular patches in the triangular patch lists; determining an effective ray probability of a space region represented by an axis alignment bounding box corresponding to each node in the initial K-dimensional tree; optimizing the initial K-dimensional tree according to the effective ray probability to obtain a target K-dimensional tree; and traversing all target nodes in the target K-dimensional tree, detecting the intersection between the rays and the axis alignment bounding boxes corresponding to the target nodes, obtaining an intersection result, stopping until leaf nodes are reached, and tracking the rays according to the intersection result. The technical problem that a large number of invalid redundant rays exist in a traditional ray tracing algorithm, and consequently computing resources are wasted is solved.

The application discloses a landslide susceptibility intelligent evaluation method based on feature stability guidance and cost adaptive tightening, which comprises the following steps: collecting and normalizing landslide sample data; calculating feature importance and sorting by random forest; traversing feature subset scale by gradient boosting tree, determining global optimal subset by cross-validation AUC; calculating feature stability coefficient, generating tightening priority queue; trying to remove features in turn by asymmetric cost-sensitive AUC measurement, and accepting if the performance decline is not more than the threshold; adaptively adjusting the threshold and re-tightening after the confrontation verification, recording the historical optimal subset; retraining the model to output the landslide probability. The application realizes feature stability guidance, asymmetric cost-sensitive tightening and self-evolution threshold closed loop, reduces redundant features while maintaining accuracy, and improves generalization and interpretability. The measured AUC reaches 0.897, which is 3.2% higher than that of the traditional GBDT, and the feature is reduced by 40%.

This application relates to a source coding method, apparatus, device, and medium. The method includes: obtaining the target bit probability and the source symbol probability of each source symbol; constructing a binary prefix code tree by recursively partitioning the Huffman algorithm based on the target bit probability and the source symbol probabilities; traversing the binary prefix code tree to obtain the binary prefix code of each source symbol, and constructing a Huffman codebook based on the binary prefix codes of each source symbol; and mapping the source symbol sequence to a compressed binary bit stream based on the Huffman codebook. This method enables probability shaping during source coding, thereby reducing efficiency losses.