44 results about "Tree traversal" patented technology

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

The invention discloses a WEB application protection effect visualization method and device, equipment and a medium, and relates to the technical field of network security, and the method comprises the steps: carrying out the layer-by-layer analysis of a target request message through employing a plurality of preset analysis technologies after receiving the target request message, so as to obtain a layer-by-layer analysis result, and taking the target request message as a root node, and carrying out the layer-by-layer analysis of the target request message; generating a target analysis tree based on the layer-by-layer analysis result; traversing the target parse tree to perform security detection on leaf nodes in the target parse tree, judging whether the leaf nodes have security threats according to a detection result, determining a threat level, and obtaining a determination result; marking node labels on a plurality of nodes in the target parse tree according to a determination result to obtain a to-be-displayed parse tree comprising the node labels; and performing color rendering on the node labels in the to-be-displayed parse tree so as to visually display the to-be-displayed parse tree at the front end of the WEB application firewall.

In an aspect of the disclosure, a method, a computer-readable medium, and an apparatus are provided. The apparatus may be a computing device. The computing device initiates discovery of Redfish-capable nodes in a data center. The computing device performs a Redfish tree walk for each discovered node to collect resource information. The computing device parses the collected resource information to generate cleaned data by removing non-essential data. The computing device stores the cleaned data in a database. The computing device provides a query interface for accessing resources across the data center using keyword-based searches.

The invention discloses a complex table text conversion method based on a tree structure. The method comprises the following steps of: firstly, converting a table image into structured JSON (JavaScript Object Notation) data; then, performing type judgment on cells in the JSON data by utilizing a prompt word normal form of LLM, and supplementing cell type information; performing row / column position matching and connectivity verification according to two basic principles of a title-data relationship and a row-column position relationship, thereby automatically constructing two subtrees of a row tree and a column tree; and finally, performing row and / or column-to-dimension text conversion based on a sub-tree structure by utilizing a tree traversal strategy assisted by a queue and a stack. The problem that a traditional table serialization mode cannot process hierarchical tables, merge cells and nesting relations is solved, and meanwhile the problem that a table conversion mode does not consider content semantic relations is solved.

The invention provides a log file pre-retrieval method and device, a medium and a system.The method comprises the steps that a log binding ID input by a client side is received, integrity verification is conducted on the log binding ID, and the log binding ID comprises a log timestamp; traversing a first timestamp of a root node of each improved Merkel tree according to the log timestamp of the log binding ID passing the integrity verification; under the condition that the first timestamp contains the log timestamp, determining the corresponding Merkel tree as a target Merkel tree; traversing the target Merkel tree until leaf nodes corresponding to the second timestamps and the same as the log timestamps are determined, and obtaining target leaf nodes; and capturing corresponding data from the database according to the target leaf node to obtain target data. The problem that in the prior art, the retrieval efficiency of a retrieval method based on the Merkel tree is low along with the increase of the data volume in the system is solved.

The application relates to the technical field of Beidou grid code, and particularly discloses a self-adaptive grid coding method, device and system for Beidou grid code, which comprises the following steps: acquiring oblique photography three-dimensional model data; performing analysis processing on the oblique photography three-dimensional model data to obtain all triangular facet data constituting the oblique photography three-dimensional model; performing parallel tree traversal coding on all the triangular facet data according to a multi-working-thread parallel mode; each working thread independently performs hierarchical tree traversal coding on the respective triangular facet data in a top-down order until a preset target level is reached, wherein the top-down order is determined according to a level standard of the Beidou grid code; merging and removing duplicate processing are performed on the preset target level grid code obtained after the traversal of each working thread to obtain a Beidou grid code set; and the Beidou grid code set is output. The self-adaptive grid coding method for the Beidou grid code can balance the coding integrity and the calculation efficiency.

The present disclosure relates to inverse transform sampling by ray tracing. High quality image rendering can be partially achieved by using inverse transform sampling to direct samples to more important areas (e.g., areas with higher luminance values) to reduce noise and improve convergence. Inverse transform sampling can be more efficiently implemented by reformulating the tree traversal unit, which can be accelerated, as a ray tracing problem. A geometric grid can be generated based on a set of cumulative distribution functions (CDFs) for individual rows and columns of pixels in a texture, and individual rays can be traced against the grid, with higher intersection probabilities at points with greater importance (e.g., higher luminance values). A probability distribution function for importance sampling can be derived by analyzing the partial derivatives of the CDF geometry at the intersection locations.

The invention provides a Pincare contract detection model-oriented data poisoning method. Firstly, a target contract is compiled to generate an AST (abstract syntax tree), nodes of the AST are traversed and matched with Pincare contract features, and whether the AST contains three features of a user structure, an investment behavior and a return behavior or not is judged. Then, according to a feature matching result, judging whether the target contract contains a feature of a given Pincare type, if the target contract contains features of a user structure, an investment behavior and a return behavior, indicating that the target contract contains a complete fund flow, and skipping the contract; otherwise, if the target contract lacks one or more features, injecting the lacked features into the corresponding AST node, thereby obtaining a poisoned abstract syntax tree AST '; and finally, converting AST'into a contract source code through decompilation so as to generate poisoning data. The poisoning data and the clean data are mixed to train the model so as to interfere with the judgment of the Pincare contract detection model and further verify the security of the existing Pincare contract detection model.

The application discloses an index method, device and medium based on database foreign key constraint checking, the method comprising: assigning a fixed-capacity foreign key checking buffer for each foreign key constraint when batch data is loaded; extracting foreign key values and row identifiers according to each row foreign key checking request and filling them into the buffer; judging whether the buffer meets the forced refresh trigger condition; when the condition is met, aggregating the foreign key values to be checked in the buffer to construct a batch search key set, calling a batch index detection interface to perform single index tree traversal on the parent table index; mapping the detection result back to each checking unit to determine the constraint verification state of each row of data; when there is a verification failure, the operation is aborted and rolled back, and when all pass, the buffer is reset for reuse. The application ensures controllable memory through the fixed-capacity buffer and instant batch detection, avoids the random I / O overhead of row-by-row checking and the memory explosion problem of the existing batch scheme, and significantly improves the foreign key checking performance in the batch data import scene.