31 results about "Tree structured data" patented technology

The invention discloses a communication message log desensitization system, method and device, a medium and a program product. The system comprises: a client adaptation module, which is used for receiving byte data and a message type identifier of an original communication message from a service system through an application program interface; the analysis rule base is used for storing message structure configuration information of various message formats; the processing function warehouse is used for registering analytic functions of various message formats; the analysis processing engine is used for analyzing the byte data into tree structure data based on the message structure configuration information and an analysis function; the desensitization rule base is used for storing desensitization rules of various message types; and the desensitization execution engine is used for synchronizing the traversed tree structure data and the desensitization rule base so as to position a target message domain, and desensitizing the target message domain to obtain desensitized structured log data. According to the embodiment of the invention, the method can desensitize the complex message log, and the desensitization process is low in invasion to a service system and is low in maintenance cost.

Techniques and architecture are described for converting tree structured data such as, for example, JavaScript Object Notation (JSON) data, into multiple feature vectors to train multiple instance learning (MIL) models for providing cybersecurity in networks. In particular, a data set is provided, wherein the data set comprises a sample configured as a hierarchal tree. The sample is converted into a set of path and value pairs, e.g., flattened into a set of path and value pairs, where the path is a sequence of field names and array indices encoding a position of a value. Each path and value pair of the set of path and value pairs is converted into a respective feature vector to form a set of feature vectors. The set of feature vectors is used to train a multiple instance learning (MIL) model, wherein each feature vector has a same, fixed length.

The invention relates to the technical field of block chains, and provides an account state data concurrent updating method, electronic equipment and a computer program product. The method comprises the following steps: determining each to-be-updated account of which the state data needs to be updated; sorting the accounts to be updated according to a sequence rule of storing the account state data by each leaf node of the tree structure data; for each to-be-updated account, distributing a state updating operation of the to-be-updated account to an updating task of a to-be-updated leaf node corresponding to the sequence of the to-be-updated account in each leaf node; and concurrently executing the updating task of each to-be-updated leaf node so as to complete the state updating operation of each to-be-updated account. According to the method, the consistency of the updated account state data of each block chain node can be improved while the data updating efficiency is improved by adopting tree structures such as a B + tree and the like.

The invention provides a tree structure data storage and query method and system and a medium, relates to the technical field of data storage, and solves the problems of performance bottleneck and hierarchical information loss of tree structure data storage and query in the prior art. The method comprises the following steps: generating and storing node data including a node identifier, a father node identifier, a hierarchy depth and a path identifier; the hierarchy depth of the node is obtained by adding 1 to the hierarchy depth of a father node of the node, and the path identifier is formed by splicing a path identifier of the father node of the node, a node identifier of the node and a predefined separator in sequence; in cross-hierarchy query, taking a path identifier of a target node as a left fuzzy matching condition, and performing condition screening in combination with hierarchy depth; and in the whole subtree query, performing reconstruction according to a query result. According to the method, retrieval based on the table structure in the database does not need to generate extra memory overhead, so that the query efficiency can be greatly improved, and the performance overhead can be greatly reduced.

This application discloses a data rendering method, apparatus, and storage medium. Relating to the field of data processing, the method includes: receiving raw data to be rendered via a program interface, wherein the raw data has a tree structure; obtaining configuration options corresponding to the raw data, and generating tree structure data based on the raw data and configuration options; determining the target node range based on the tree structure data and a target display area, and flattening the data within the target node range in the tree structure data to obtain target data; passing the target data to a virtual scrolling list component, and rendering the target data based on the virtual scrolling list component to obtain a tree-like rendering result of the target data. This application solves the problem of insufficient performance in data rendering in related technologies.

The invention relates to the field of data visualization, and discloses a tree structure data display method and device, electronic equipment and a storage medium, the display method comprises the following steps: in response to a first trigger instruction for a target leaf node, determining whether to update initial tree structure data according to attributes of the target leaf node and corresponding display data; the initial tree structure data is local structure data obtained by cutting complete tree structure data; if the attribute of the target leaf node is a preset attribute and the corresponding display data is not empty, determining to update the initial tree structure data; wherein the preset attributes are attributes representing that the nodes correspondingly load the details of the data displayed by the nodes. According to the method, only part of nodes are loaded in the initial stage, and the non-leaf nodes are expanded as required subsequently, so that the front-end rendering pressure is effectively reduced, the system performance and the interaction fluency are improved, and efficient, controllable and extensible visual display of the complex tree data is realized.

The invention relates to the technical field of atmospheric mode and numerical simulation, in particular to a tree canopy drag wind speed attenuation parameterization method based on a turbulence physical model, which comprises the following steps: calculating a three-dimensional equivalent leaf area index by acquiring street geometric parameters and tree structure data, and decomposing the three-dimensional equivalent leaf area index into leaf area density changing along with height; further converting into equivalent windward area density, substituting the equivalent windward area density into a momentum equation, defining a canopy drag source item and calculating a canopy turbulence production item; and finally, coupling a canopy turbulence production item with a turbulence equation, and carrying out numerical solution by combining the speed and shear stress conditions of the ground, the crown edge and the roof to obtain a street height stratification wind speed profile. According to the three-dimensional parameterization method, the wind speed attenuation simulation capability of the tree streets is remarkably improved, the wind speed profile is more continuous and reasonable and highly coincides with the CFD simulation result, and the method is suitable for urban wind environment assessment and air pollution simulation.

This application provides a data processing method, apparatus, electronic device, and storage medium. The method includes: firstly, reading the table data of each sub-table in a spreadsheet; then, traversing the table data of each group of adjacent columns to determine the structural relationship between multiple groups of adjacent columns; and finally, generating tree structure data corresponding to at least one vertically merged cell based on the table data and the structural relationship between multiple groups of adjacent columns. This application can efficiently restore the tree structure corresponding to vertically merged cells in a spreadsheet.

The invention relates to a query processing method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: obtaining query content; performing task splitting based on the query content to obtain task tree structure data; wherein the task tree structure data is used for generating an initial task tree for the query content; task nodes in the initial task tree are used for representing tasks obtained through task splitting; under the condition that the task tree structure data is changed, incremental update data corresponding to the changed data is generated; the incremental updating data is used for performing incremental updating on the current task tree; and for the updated task tree obtained by incremental updating, obtaining a query result of the query content by merging execution results of the tasks in the updated task tree. By adopting the method, the system response performance can be improved.

The present application relates to the technical field of atmospheric model and numerical simulation, and particularly relates to a tree crown drag wind speed attenuation parameterization method based on a turbulent flow physical model, which obtains street geometric parameters and tree structure data, calculates a three-dimensional equivalent leaf area index, and decomposes the three-dimensional equivalent leaf area index into a leaf area density varying with height; after being further converted into an equivalent windward area density, the equivalent windward area density is substituted into a momentum equation, a crown layer drag source term is defined and a crown layer turbulent production term is calculated; finally, the crown layer turbulent production term is coupled with a turbulent flow equation, and velocity and shear stress conditions of the ground, the tree crown edge and the roof are combined to obtain a street height layered wind speed profile by numerical solution. The present application significantly improves the wind speed attenuation simulation capability of a street with trees by a three-dimensional parameterization method, makes the wind speed profile more continuous and reasonable, and is highly consistent with a CFD simulation result, and is suitable for urban wind environment evaluation and air pollution simulation.

The embodiment of the invention provides a data processing task script processing method and device, equipment and a medium, and the method comprises the steps: collecting operation information when a data processing task is executed; triggering a to-be-adjusted condition in response to the operation information, and obtaining initial script data corresponding to the data processing task; converting the initial script data into tree structure data; determining fault information based on the tree structure data, the operation information and a preset large language model; updating the initial script data based on the fault information, and determining target script data; and performing gray release based on the target script data. According to the method, the initial script data needing to be updated are determined through collection of the operation information and autonomous triggering, the initial script data are corrected and updated in combination with the large language model, and then gray release is performed, so that the script updating processing efficiency and processing reliability of the data processing task can be improved, and the performance of the data processing task is improved.

Embodiments of the present application disclose a message conversion method and device, electronic equipment and a storage medium. The method comprises: obtaining a structure document of an initial message, and parsing the structure document to obtain structured configuration data, wherein the structured configuration data comprises at least one node absolute path; for each node absolute path in the at least one node absolute path, determining a node relative path corresponding to each absolute node on the node absolute path according to the structured configuration data, and determining target configuration data according to each node relative path; constructing tree structure data based on the target configuration data, and determining a target message based on the tree structure data to convert the initial message into the target message. The technical solution of the embodiments of the present application improves the message conversion efficiency and compatibility.

The invention relates to a parallel computing framework-based tree structure data migration method, which belongs to the field of data processing, and comprises the following steps of: acquiring tree structure data to be migrated, and analyzing a source tree structure to determine a root node and each branch structure of a tree; decomposing a migration task of the whole tree into a plurality of branch subtasks by adopting a Fork-Join framework; dynamically creating a thread pool by adopting a Fork-Join framework, wherein each branch subtask is executed by a working thread; a work stealing mechanism of a Fork-Join pool is utilized to automatically balance the load of each work thread; the task result of each branch subtask is obtained in real time, the task results of all the branch subtasks are combined, and state checking is conducted on each branch subtask. According to the method, the advantages of parallel computing are fully utilized, efficient and stable migration of tree structure data is achieved, repetition can be avoided without locking when nodes are inserted, and meanwhile the problems of stack overflow and load balancing are solved.

This application discloses a corpus processing method, apparatus, storage medium, and program product, relating to the field of artificial intelligence technology. The method includes: identifying a file to be identified to obtain identification results, and performing clustering processing on the identification results to determine an aggregation result; constructing a full node graph based on the aggregation result, and determining a tree structure graph corresponding to the aggregation result according to the semantic relationships between nodes in the full node graph; classifying and identifying nodes in the tree structure graph, determining tree structure data, and constructing question-answer pairs to represent the semantic relationships corresponding to the file to be identified. The solution of this application solves the problems of neglecting tree graph parsing, difficulty in identifying text structure associations in OCR, insufficient feature utilization, and low extraction accuracy in existing corpus processing solutions.

This invention belongs to the interdisciplinary field of natural language processing and building engineering informatics, and particularly relates to a multimodal comparison method for engineering construction standards based on multi-level semantics and index quantification, comprising: S1, acquiring the engineering construction standard documents to be compared, and parsing them to obtain corresponding topological tree structure data; S2, obtaining the basic semantic similarity S based on the topological tree structure data of S1. base S3. Parse the structured key-value pairs in S1 to separate the indicator names, corresponding values, and dimensions, forming a set of key technical indicators; calculate the common indicator deviation D. shared and the one-sided indicator missing rate P miss S4, S based on S2 base S3's P miss With D shared The overall consistency score S is calculated using a nonlinear comprehensive evaluation model. final S5, the overall consistency score based on S4 final This invention generates a structured comparison report. It enables precise, cross-language, cross-system, multi-dimensional, and fully automated comparison and quantitative evaluation of engineering construction standards.

Embodiments of the invention provide a data processing method and device, a readable storage medium and a program product. The method comprises the steps of obtaining tree structure data; constructing a memory data structure of a node graph based on a father-child node association relationship in the tree structure data and the data of each node; wherein the memory data structure comprises a node array, a key-identifier mapping table and a child node mapping table, and the node array represents an association relationship between a node identity identifier and node data; the key-identifier mapping table represents an association relationship between a key of the node and an identity identifier of the node; the child node mapping table represents an association relationship between an identifier of a father node and a child node list corresponding to the father node, and the child node list comprises an identity identifier of at least one direct child node; and storing the memory data structure of the node graph. Query efficiency can be improved, and node updating complexity can be reduced.

The application discloses a kind of based on network data snapshot visual tree layout method, belong to data visualization technical field, including the following steps: obtaining the tree structure data of network data default snapshot;According to tree structure data, the total row number, total column number, the row number and length of non-leaf node, the position of leaf node of visual tree are calculated;According to the tree structure data obtained in S1 and the data calculated in S2, the position of non-leaf node of visual tree is calculated;According to the position data of leaf node in S2 and the position data of non-leaf node in S3, tree type visual view is drawn, the tree structure data of network data default snapshot is traversed in the application, and the length, row number and column number of leaf node and non-leaf node are calculated, the position of leaf node and non-leaf node is obtained, and compact, symmetrical, non-overlapping visual tree can be generated layout, can be more intuitive and in-depth to understand data, quickly discover and mine effective information, greatly improve work efficiency.

The invention relates to a software testing method and device, computer equipment and a readable storage medium. The method comprises the steps of generating a directed acyclic graph of a tested service in response to a view construction operation, and establishing a test model for processing a data logic test task according to the directed acyclic graph; converting according to the test model to obtain tree structure data, traversing paths in the tree structure data, and generating a plurality of test cases of the tested service; analyzing a data expression of each path in the tree structure data through a rule engine, and generating test data corresponding to each test case; the data expression is used for representing a test data generation rule of the corresponding path; and according to preset data source configuration information, pushing each test case and the test data thereof to a tested data source for test processing to obtain a test result corresponding to the tested service. By adopting the method, the full-link automation of the test process can be realized, the test case and the test data thereof are fully covered, and the test efficiency is effectively improved.

This invention discloses a key-value pair storage method for front-end tree structure data, specifically implemented according to the following steps: Step 1, constructing a dual-index key-value pair storage structure; Step 2, obtaining the original nested tree data from the front end, converting the original nested tree data into a dual-index key-value pair storage structure, and initializing it; Step 3, performing node operations on the dual-index key-value pair storage structure initialized in Step 2, realizing node search, addition, and deletion operations; Step 4, restoring the tree structure based on the dual-index key-value pair storage structure. This invention also discloses a key-value pair storage device for front-end tree structure data, solving the problems of low data storage efficiency, high memory consumption, and cumbersome root node location in existing technologies.

The application relates to a data migration method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: writing data in a first variable table into a second variable table; the data in the first variable table and the data in the second variable table are respectively tree structure data; modifying the parent-child relationship identifier in the second variable table according to the self-increment identifier in the second variable table to obtain a modified second variable table; inserting the modified second variable table into a target data table and performing self-increment processing on the self-increment identifier in the inserted second variable table according to a preset self-increment strategy to obtain a processed variable table; repairing the parent-child relationship identifier in the processed variable table according to the processed self-increment identifier to obtain a repaired target data table; and storing the repaired target data table. The method can realize fast migration of data without changing the structure of the target data table.

This invention provides a method, apparatus, device, and storage medium for generating a list switching component, relating to the field of artificial intelligence. The method includes: acquiring tree structure data corresponding to each business list of business data; determining the maximum level depth of each business list based on the tree structure data; transforming the tree structure data of each business list according to the maximum level depth to obtain array data corresponding to each business list; acquiring multiple preset root nodes; encapsulating the multiple preset root nodes according to the array data of each business list to generate a target root node and its corresponding node parameters; and rendering a preset component based on a preset component rendering function, according to the target root node and its corresponding node parameters, to generate a list switching component. This application aims to generate a component with multiple list switching selection functions, improving the user's interactive experience.

The embodiment of the invention provides an early warning method for identifying mobile application update popup windows based on an AI large model, and belongs to the technical field of data processing, and the method specifically comprises the following steps: synchronously obtaining View tree structure data, OCR identification data and AI visual detection data; after static basic weights of multiple types of recognition technologies are configured, core features of each type of recognition technology are disassembled and quantitative scoring rules are set, quantitative scoring is carried out on View tree structure data, OCR recognition data and AI visual inspection data according to the quantitative scoring rules; dynamically adjusting the static basic weight based on the identification confidence of the three types of identification technologies to obtain an adjusted dynamic weight; performing weighted summation on the identification confidence of each identification technology and the corresponding dynamic weight to obtain a comprehensive score of popup window identification; and comparing the comprehensive score with a preset classification threshold value, and judging the type of the current popup window. Through the scheme disclosed by the invention, the accurate distinguishing of the updated pop-up window and the jamming pop-up window is realized.

A tree-structured database management method and system, and a storage medium. The database management method is applied to a tree-structured database system, wherein the database system comprises a hub tree, the hub tree comprises a plurality of branch trees, and each branch tree comprises a plurality of spoke trees. The database management method comprises: on the basis of key-value pair data pre-stored in leaf nodes, creating append files and generating index information of the key-value pair data, wherein the index information comprises index information of the append files and index information of spoke trees pointed to by the leaf node pointers; updating mapping tables of the append files on the basis of the index information of the append files; and on the basis of the index information of the key-value pair data and the mapping tables, reading and / or maintaining the key-value pair data corresponding to the leaf nodes. In the method, a large volume of data of different categories are aggregated into a hub tree by means of different spoke trees, thereby reducing the number of data structures; during data search, corresponding data is retrieved on the basis of index information and mapping tables, thereby improving query efficiency.

The invention provides a REST API context construction method based on multilevel associated data analysis in a public cloud network, and belongs to the technical field of computer security. The method comprises the following steps: analyzing an OpenAPI specification document to obtain tree structured data, constructing a dependency edge according to a tree node parameter type, initializing an edge weight according to API interface names to which two nodes connected with the dependency edge belong and parameter names of the nodes, and updating the weight of the dependency edge based on a description attribute of the nodes to obtain a static directed weighted API dependency graph; based on the dependency graph, an exploration request sequence is established for each API, then requests in the sequences are sent in an inverted order, corresponding dependency edge weights are updated according to preorder request responses, and the accurate directed weighted dependency graph is obtained. The API dependency graph generated by the method can guide the fuzzy test stage to effectively generate the API request sequence, the API request is effectively prevented from being filtered or the tested service is prevented from being thrown abnormally, and the code coverage rate, the fuzzy test efficiency and the vulnerability discovery capability of the fuzzy test in the public cloud network are effectively improved.

The application discloses a kind of main station self-healing method and device of main integration, its method includes: obtaining the basic information of self-healing feeder group in main station system of distribution network and main network, based on the basic information, construct self-healing tree structure data, switch in the self-healing tree structure data is marked as non-locking flag, whether all switches on the associated power supply path branch upstream of the fault point in the basic information exist non-locking flag is judged, if not, determine all switches on the associated power supply path branch as locking flag, complete all marks, if yes, then close all switches in the self-healing tree structure data, complete self-healing power supply.The technical problem that the abnormality of existing distribution network self-healing technology, failure and load condition of main network equipment can not be considered to cause self-healing failure even expand blackout range is solved, and the power supply reliability of distribution network is improved.

The present application relates to the technical field of municipal drainage pipe network, and particularly relates to a drainage system CAD-GIS data conversion and standard marking method, which comprises the following steps: analyzing CAD data and extracting, extracting data in CAD according to types, and storing text files; processing CAD data, generating directed graph structure data from the extracted CAD data, generating KDTree search tree structure data from the X and Y positions of the text marking, filtering and finding the text near the midpoint of the preset inspection well or pipeline to obtain correct text marking content; converting the elevation text into real elevation, and obtaining the start point and end point elevation data of the preset inspection well, using the directed graph data structure and the extracted elevation data of the preset inspection well to analyze and sort the pipeline elevation and pipe diameter data; and converting into shp data. The method can greatly improve the information input efficiency of the drawing of the inspection well and the pipeline, and standardize the marking.

The present disclosure relates to the technical field of big data data processing, and specifically discloses a tree structure data conversion method and device, computer equipment, storage medium and computer program product. The method comprises: obtaining to-be-converted data, the to-be-converted data being tree structure data, performing path standardization processing on the to-be-converted data to unify the to-be-converted data and internal reference data formats, then determining conversion weight data of each node in the to-be-converted data after the path standardization processing, and then merging the to-be-converted data and the internal reference data according to the conversion weight data of each node in the to-be-converted data. Compared with a tree structure conversion method relying on manual processing, the tree structure data conversion processing efficiency is greatly improved, errors are reduced, and the accuracy of tree structure data conversion is improved.

The invention belongs to the technical field of spectrum analysis, and discloses a spectrum turning time identification method and device, electronic equipment and a storage medium, and the method comprises the steps: periodically obtaining real-time spectrum data of a to-be-detected sample, employing a condensation type hierarchical clustering method, combining a Mahalanobis distance and a minimum variance method, and according to a time sequence, carrying out spectrum turning time identification on the to-be-detected sample; and merging the real-time spectral data into corresponding clustering tree structure data, determining turning point data meeting a preset clustering distance mutation condition and a preset frequency domain feature hopping condition based on a merging distance in the clustering tree structure data through a sliding window algorithm and a Fourier transform algorithm, and obtaining a frequency domain feature transition point according to an isolation forest algorithm. Verifying the turning point data to determine a time point corresponding to the turning point data of the non-abnormal data as a turning time point; according to the method, the recognition efficiency of the spectrum turning time is improved.

The invention discloses a user-defined printing method and device, equipment and a storage medium, and relates to the field of computers.The method comprises the steps that in response to dragging operation of a user for preset tree structure data, value paths associated with data nodes operated by the user are filled into cells in a preset data table, the tree structure data is constructed according to an obtained document data source, and each data node in the tree structure data is associated with a value path of the data; generating a target configuration file according to the filled data table and a cell style set by a user; and performing mapping conversion on the target configuration file according to a document data source to obtain a to-be-printed file, and printing the to-be-printed file. A user can select the corresponding data to generate the data table according to actual printing requirements, and can set the cell style by himself, so that the self-defined to-be-printed file is generated. Developers do not need to write codes in the whole process, and users can complete setting of printing requirements and receipt printing by themselves.

The application discloses a tree data multi-selection method and a system for realizing tree data multi-selection, and belongs to the technical field of computer data processing, and the realization of the method comprises the following steps: data reading, acquiring first layer data from a server end and displaying the first layer data to a client end; meanwhile, the data that has been selected and saved on the server end is acquired; front-end data object definition, the front end adopts an incremental mode to record all operations of a user, and the specific contents of the data selected by the user and the data unselected by the user are recorded respectively; front-end data operation, according to the operation sequence of the user and according to the agreement in the front-end data object definition, data processing is carried out, including front-end interface processing and back-end processing. The application can improve the loading speed and saving speed of a large amount of tree structure data, and prevent the phenomenon of slow front-end loading, even loading failure, slow multi-selection saving and the like caused by too large data.