101 results about "Tree traversal" patented technology

The invention discloses a multi-source heterogeneous database SQL (structured query language) statement sensitivity calculation method, relates to the technical field of SQL query, and aims to accurately calculate and add noise of a proper magnitude in a complex SQL statement. The adopted scheme is as follows: receiving and preprocessing an SQL query request, and disassembling the SQL query request to generate an abstract syntax tree; traversing the abstract syntax tree, identifying syntax features needing to be processed, defining a rewriting rule, and modifying and optimizing corresponding nodes in the abstract syntax tree; selecting a serialization format, and converting the optimized abstract syntax tree into corresponding serialization data; and performing semantic analysis and logic analysis on the serialized data, binding semantic information contained in the request with metadata information of a target database, calling a sensitivity evaluation algorithm, and performing sensitivity calculation on the request. The sensitivity obtained through calculation is used for guiding data noise addition in an SQL query result.

Disclosed in the present invention are a method and system for building a compilable customized module. The method comprises: customizing a module on the basis of a process, defining a modeling language syntax, and generating a modeling language file corresponding to the customized module; establishing a text matching rule and a grammar matching rule, using flex to generate a source program file of a lexical analyzer from the text matching rule, and using bison to generate a source program file of a syntax analyzer from the grammar matching rule; performing lexical analysis and generating an abstract syntax tree; traversing the syntax tree, generating a translation C++ file for a modeling language on the basis of a syntax-based translation configuration file, and compiling the translation C++ file; and importing the built customized module and an executable binary file into a simulation platform, and performing flow simulations for different scenarios including process simulation, optimization and parameter tuning. The present invention can realize the rapid commissioning of a process and can seamlessly switch a customized model to various application scenarios.

According to the abstract syntax tree optimization method based on the ST language, the ST programming language is optimized through the compiler front-end technology, the code structure is optimized from the source, the compiling efficiency is improved, and the execution efficiency of the finally generated instruction is improved. An abstract syntax tree optimization method based on an ST language comprises the steps that 1, an antlr tool is used for conducting lexical analysis and grammatical analysis of the ST language, and a complete abstract syntax tree is created; (2) traversing the abstract syntax tree to carry out constant merging, calculating constant tree nodes in advance, and merging the constant tree nodes into a tree node; (3) traversing the abstract syntax tree to eliminate dead codes, and deleting useless tree nodes; and (4) traversing the abstract syntax tree to calculate characteristic values of the tree nodes, and eliminating sub-expressions according to the similarity of the tree nodes, thereby reducing redundant calculation and improving execution efficiency.

The invention discloses a field plant data visual management system based on a grid storage architecture, relates to the technical field of data visualization, and improves the field plant inspection efficiency. The method comprises the following steps: establishing a plant data relation tree according to a plurality of pre-stored plant multi-source information data set, establishing a regional visual grid map according to various real-time data, traversing a target index condition in the plant data relation tree according to basic index information, randomly setting a plurality of initial detection grids in the regional visual grid map, and determining the target index condition according to the initial detection grids. The target index condition is matched with each initial detection grid, each initial detection grid is recorded as a target area grid according to a matching result, the basic index information is matched with an adjacent area grid of each target area grid, and then a shortest exploration driving route is divided in the area visualization grid map according to the matching result.

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 discloses a partitioning and solving method for improving the calculation efficiency of a network equation of a power system. The method comprises the following steps: constructing the network equation and a directed unweighted graph of the power system; generating an adjacent matrix according to a relationship between nodes in the directed unweighted graph; based on the adjacent matrix, an objective function with the aim of minimizing the number of edges used for dividing the power system is constructed, the objective function is optimized and solved, and two node sets and a cut set after division are obtained; dividing each divided node set, and generating a clustering tree according to each divided node set; traversing each layer in the clustering tree, and solving the network equation by adopting a layered off-diagonal low-rank algorithm; wherein parallel computing is carried out on node sets of all layers in the clustering number. The technical problem of low calculation efficiency in the prior art is solved.

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 invention pertains to a computer-implemented method for visualizing 3D data of a multitude of data sets (1-5) in a scene using a computing device having limited available memory for visualizing the 3D data, the method comprising receiving the multitude of data sets, each data set having an LOD structure given as a tree comprising a multitude of nodes, determining the amount of memory available, selecting nodes of the data sets that comprise 3D data to be loaded into the available memory, loading the 3D data of the selected nodes into the memory; and visualizing the 3D data loaded into the memory on a display. Selecting the nodes comprises performing an LOD selection comprising obtaining camera-frustrum information defining a camera frustrum (10) comprising a near plane (11) and a far plane (12), dividing the camera frustrum by defining at least a near frustrum (15) and a background frustrum (16), defining a subset of data sets as foreground data sets based on an overlap of their nodes with the near frustrum, dividing the camera frustrum into a multitude of regions, allocating the available memory to the multitude of regions, and selecting, based on the allocated memory, the nodes that comprise 3D data to be loaded into the available memory. Allocating the available memory comprises determining, based at least on the amount of memory available, a tree-traversal depth, traversing the LOD structure of each foreground data set using the tree-traversal depth, recording all nodes that have an overlap with the camera frustrum and determining a screen space for each of the recorded nodes, mapping each recorded node to one of the regions, and assigning memory to each region based on the screen spaces of the nodes that have been mapped to the respective region.

According to the repositioning method based on the laser radar, repositioning is accurately carried out under the condition of not depending on an external environment reference object and a GPS signal by only using the laser radar configured by equipment, and the limitation in the aspects of using scenes, depending on GPS satellite signals and the like is expected to be overcome. Comprising the following steps: 1) mapping; step 2), repositioning; judging a state before last positioning; if the positioning is normal, executing 2.1. 1), and reading the positioning data; 2.1. 2), registering with a point cloud map and calculating a score; if the positioning is abnormal, executing the following steps: 2.2. 1) calculating the descriptor of the current frame of the laser; 2.2. 2) sequentially traversing the descriptors of the key frame and the descriptors of the current frame in the mapping to calculate a matching value; 2.2. 3) obtaining a pose corresponding to the candidate frame serial number from a pose file of mapping; (2.2. 4) calculating poses in tree nodes by using a 64-way tree traversal search method; (2.2. 5) the pose result data obtained through calculation is further verified through the gicp pose verification algorithm; and (3) positioning.

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 embodiments of this specification provide a method, device and equipment for determining a structured query statement for a full table scan, which relates to the field of big data technology, wherein the method includes: converting a target structured query statement into a syntax tree; traversing the nodes in the syntax tree to filter out the table name involved in the target structured query statement; determining the field filtered by the target structured query statement according to the syntax tree; obtaining the field information set corresponding to the table name involved in the target structured query statement; determining whether the field filtered by the target structured query statement matches the field information set; in the case of mismatch, determining that the target structured query statement is a structured query statement for a full table scan. In the embodiments of this specification, it is possible to efficiently and accurately determine whether the target structured query statement is a structured query statement for a full table scan, thereby ensuring that database resources can be reasonably utilized.

The invention provides a code templated 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; analyzing annotation marks in the global template file to form a global template syntax tree; executing the global template syntax tree, and traversing the code template file; reading a code template file; analyzing annotation marks in the code template file to form a code template syntax tree; executing the code template syntax tree to generate a code; creating a code file and writing codes; the generation system comprises a meta-object, an annotation markup language, a frame template specification, a meta-object controller, a generator, a dialect controller, a file reader, an annotation markup language parser and an annotation markup language actuator. The project framework template has the advantages that the project framework template is provided, research and development standards are unified, code writing efficiency and quality are improved, and the project framework template is suitable for various computer languages.

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 a hybrid instruction set architecture-oriented instruction selection optimization method. The method comprises the following steps of: obtaining an IR tree of a source application program; traversing the IR tree, and recording the minimum cost of a sub-tree taking each node as a root in a node cost table (costTable); the IR tree is traversed, and an instruction value of each node is recorded in an instruction table; traversing the IR tree, matching each node with a pattern of a target platform instruction, and updating the minimum cost and instruction value corresponding to each node in a node cost table (costTable) and an instruction table (instructionTable) according to a matching result; and traversing the IR tree, generating a target code according to the updated instruction value of each node in the instruction table, and obtaining a target platform instruction of the source application program. According to the method, the global optimal code is generated by locally selecting the optimal instruction combination.

A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to provide a deterministic result of intersected triangles regardless of the order that the memory subsystem returns triangle range blocks for processing, while opportunistically eliminating alpha intersections that lie further along the length of the ray than closer opaque intersections.

The invention relates to the field of mobile application security testing, in particular to a mobile application vulnerability iterative penetration testing method based on dynamic environment adaptation, which comprises the following steps: firstly, performing code analysis to generate an abstract syntax tree, traversing the abstract syntax tree to extract nodes related to risk component calling, and constructing a potential risk node set; performing penetration testing on all nodes in the potential risk node set, verifying whether vulnerabilities exist really, and constructing a first vulnerability node set; after the version of the mobile application is upgraded, code difference analysis is carried out, modification and newly-added parts of codes are automatically identified, penetration testing is triggered in a targeted mode, newly-added risk points are focused, newly-added vulnerabilities are found in time, and by carrying out iterative penetration testing on the upgraded version, the vulnerability detection accuracy can be improved, dynamic environment changes can be better adapted, and the vulnerability detection efficiency is improved. And accurate positioning of the vulnerabilities is carried out.

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.

Methods and systems are described in some examples for changing the traversal of an acceleration data structure in a highly dynamic query-specific manner, with each query specifying test parameters, a test opcode and a mapping of test results to actions. In an example ray tracing implementation, traversal of a bounding volume hierarchy by a ray is performed with the default behavior of the traversal being changed in accordance with results of a test performed using the test opcode and test parameters specified in the ray data structure and another test parameter specified in a node of the bounding volume hierarchy. In an example implementation a traversal coprocessor is configured to perform the traversal of the bounding volume hierarchy.

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.