28 results about "Tree node" patented technology

This invention discloses a method and system for managing and automatically formatting slide content based on a tree structure. By abstracting different types of materials such as text, images, tables, code snippets, and mathematical formulas into tree nodes with parent-child hierarchical relationships, users can freely add, delete, move, or mark nodes in a visual interface to achieve rapid merging or splitting of multi-level documents. The system then maps several nodes into multiple slides based on the node merging or splitting markers; and automatically formats the pages during the output stage, including overflow detection and font scaling, adaptive image proportioning, line wrapping for tables or code snippets, and format conversion of mathematical formulas. This approach significantly reduces the burden of manually adjusting text and images, maintains consistency and aesthetics in slide layout across different resolutions, and is suitable for multi-level, text-rich, and large-scale presentation document scenarios.

The application provides a security policy matching method and device, a storage medium and a computing device. When any security policy tree is constructed, a node priority is set for each tree node, which can accurately reflect the highest policy priority of the subordinate sub-tree of each tree node, thereby providing a core basis for pruning low-priority nodes during security policy matching, ensuring the order of dynamic maintenance of the node priority, and improving the security policy matching efficiency. Furthermore, the early stop attribute is set for the security policy of the leaf node in the multi-security policy tree in stages, which realizes the fast marking of the absolute high-priority security policy and the accurate marking of the non-absolute high-priority security policy without intersection, and the combination of the two realizes the accurate setting of the early stop attribute of the security policy. In this way, the large-scale security policy matching efficiency is improved, the optimal matching result is ensured, the computing cost is reduced, and the matching performance of the security policy tree is significantly improved.

Embodiments of the present application provide a front-end page generation method and related device, the method comprising: creating an entity corresponding to entity information according to the obtained entity information; adding an element to the entity according to the configured element, the element belonging to the entity; configuring a tree structure according to the entity and the obtained entity relationship information corresponding to the entity, so that a tree node in the tree structure corresponds to the entity, and the connection relationship of each tree node in the tree structure corresponds to the entity relationship information; adding the content of the element to the tree node corresponding to the entity to which the element belongs in the tree structure according to the obtained content of the element, to obtain tree configuration data; and generating a front-end page based on the tree configuration data. The technical solution of the embodiments of the present application can greatly reduce the development cost of the front-end project, and can significantly improve the development efficiency of the front-end project.

The application discloses a code execution method and device and a storage medium. The application relates to the technical field of program security, and the method comprises the following steps: performing abstract syntax tree conversion on to-be-executed code to obtain a tree-shaped code structure; checking each tree node in the tree-shaped code structure to obtain checking information, adjusting the tree-shaped code structure according to the checking information, and obtaining an adjusted tree-shaped code structure; generating target execution code according to the adjusted tree-shaped code structure; and executing the target execution code in a restricted environment, wherein the restricted environment refers to a code execution environment after a detection function is modified according to a preset restricted object list. Through the application, the problem that the code security checking method in the prior art is not accurate enough and the security of execution code in a system is low, thereby leading to poor system stability, is solved.

This invention provides a method, apparatus, and vehicle for constructing a KD-tree from a vehicle-mounted LiDAR point cloud. The method includes: determining the first median of the point cloud data; performing KD-tree construction steps based on the left and right interval data until the unprocessed data variable is 0, and outputting the KD-tree. Thus, by obtaining the median using a quicksort algorithm, a full sort of the point cloud data is not required. Instead, the data is partitioned into two parts: less than a benchmark value and greater than a benchmark value. The median is then recursively searched, improving the efficiency of finding the first median. Since the first median divides the point cloud data into independent left and right interval data, multi-threaded parallel searching of left and right subtree nodes can be used during KD-tree construction, thereby improving the efficiency of KD-tree construction for the vehicle-mounted LiDAR point cloud and ensuring the response speed and operational sensitivity of the autonomous driving system.

The application discloses a data import method and device, equipment, a storage medium and a product. The application relates to the technical field of computers. The method comprises the following steps: obtaining a to-be-imported data table, wherein a table header structure of the to-be-imported data table comprises a starting point, at least two intermediate nodes and an end point in sequence; storing to-be-imported data in the to-be-imported data table into a preset data model of a tree structure row by row in the direction from the starting point to the end point to obtain an imported data tree; for each two adjacent intermediate nodes in the table header structure, the intermediate node close to the starting point corresponds to a parent node in the imported data tree, and the intermediate node far from the starting point corresponds to a child node in the imported data tree; and converting the imported data tree into a database table in a preset database to realize persistent storage of the to-be-imported data, wherein different levels of tree nodes in the imported data tree correspond to different database tables. Through the technical scheme, the efficiency and accuracy of data import can be ensured.

This application provides a source code modification method, apparatus, and electronic device based on a large model, relating to the field of software development technology. The source code modification method based on a large model includes: responding to receiving an interactive operation on a first page element of a target object; determining a first tree node in the source code abstract syntax tree structure of the target object corresponding to the first page element; and obtaining the first source code location information carried by the first tree node; obtaining the associated source code file corresponding to the first tree node based on a pre-constructed source code file relationship graph and the first source code location information; obtaining modification intent information corresponding to the first page element; generating a modification semantic description corresponding to the first page element based on the modification intent information; and inputting the modification intent information, modification semantic description, and associated source code file into a pre-trained large model to modify the associated source code file through the large model. This application can improve the comprehensiveness and accuracy of source code modification based on a large model.

The application provides a time series data interaction progressive visualization method and system, which converts original data into a hierarchical maximum-minimum tree structure representation mode by using maximum-minimum aggregation and difference operation; according to the visualization requirement, a target layer is selected from the maximum-minimum tree structure, and a breadth search is performed on the maximum-minimum tree structure from the layer; according to the time range relationship between the tree node and the column pixel, corresponding nodes and child nodes are traversed, and the obtained maximum-minimum tree structure is updated and visualized during the traversal process. The application combines the time series data representation mode based on the maximum-minimum tree structure and the incremental query visualization generation based on the tree structure, realizes the progressive generation of accurate visualization, and can provide various smooth interaction modes, and can effectively meet the demand of large-scale time series data interactive visualization.

Methods, systems, and apparatus, including computer programs, are described for video processing. One example video processing method includes performing, according to a rule, a conversion between a video comprising a video block and a bitstream of the video, wherein the video block is a coding tree node comprising one or more coding units, and wherein the rule specifies that coding information of the video block indicates whether a coding mode is enabled for the one or more coding units of the video block.

Embodiments of the present application provide a data processing method and device based on a line segment tree structure, equipment and medium, the method comprises: after the oracle contract receives the first transaction request sent by the business contract, the first request condition corresponding to the first condition hash value is obtained based on the first transaction request, and the condition hash value matched with the first condition hash value is found in the line segment tree structure of the on-chain storage space. If not found, the oracle contract is called to send the first off-chain query request for the first request condition to the off-chain oracle, so that the oracle returns the first off-chain business data to the oracle contract. The received first off-chain business data is taken as the first business data by calling the oracle contract, and the first business data and the first condition hash value are updated to the tree node associated with the first request condition in the on-chain storage space. By using the embodiments of the present application, the utilization rate of off-chain data can be improved, and the waste of storage resources can be avoided.

The application relates to the technical field of traffic site selection, and discloses a road network space site selection method and system based on semantic uncertainty, which comprises the following steps: generating Beta distribution shape parameters corresponding to OD flow according to an OD flow data set and a research area POI data set; constructing a hierarchical binary tree decision environment based on city road network topology data, an OD trajectory data set and the Beta distribution shape parameters, and generating flow composition fingerprint features corresponding to each tree node; determining a state space, an action space and a marginal contribution reward mechanism based on sequence priority of a plurality of intelligent agents based on the above processing; initializing double-head Critic network and Actor network of the plurality of intelligent agents, generating experience trajectories through interaction between the intelligent agents and the environment, calculating a risk adjustment advantage function of uncertainty perception, updating network parameters based on Gaussian negative logarithm likelihood loss and PPO truncation agent loss, and outputting a final facility deployment road section set after iterative training until convergence.

The application discloses a log analysis method and an electronic device, relates to the technical field of data processing, and cuts log data into multiple log blocks and respectively performs matching and analysis, so that log processing is changed from centralized offline processing to segmented processing based on blocks, thereby gradually analyzing and evaluating the value of each log block in the process of continuous log generation, and realizing dynamic real-time processing. A log template tree is constructed, log blocks are mapped to corresponding tree node state vectors, logs of different text forms but belonging to the same type of abnormal mode are uniformly represented at the structure level, a composite vector is formed by combining a system performance vector and a semantic vector, and the composite vector is input into a value function model for evaluation, so that the model realizes abnormal risk prediction through state structured expression and value function modeling, solves the technical problems that logs cannot be dynamically and instantaneously processed and that low-sample abnormalities are difficult to effectively learn, and achieves the technical effects of improving real-time analysis capability and enhancing abnormal prediction stability.

This invention provides a fast calculation method, apparatus, electronic device, and storage medium for the directed distance field from point cloud to STL mesh of blood vessel wall, belonging to the field of medical image processing. The method starts with the directed distance from a single point to the STL mesh of the blood vessel wall, transforming the calculation of the directed distance from a single point to the STL mesh into a binary tree traversal. The binary tree is constructed non-recursively, tree nodes are stored using a linear array, and the depth of the auxiliary stack is estimated, allowing the binary tree generated on the CPU to be directly sent to the GPU for use. When performing binary tree search on the GPU, the non-recursive traversal method strictly controls memory overhead. During threaded search, the GPU-side algorithm achieves near-linear scalability, greatly improving the calculation efficiency of the directed distance field from point cloud to STL mesh of blood vessel wall. This method can be widely used in medical image analysis and biomechanical calculations and analysis related to blood vessels.

The present application relates to the technical field of document information processing, in particular to a scientific research paper collaborative writing and multi-format adaptive output method and system, which obtains the structure tree data of formula and code and the target version core width, and constructs a cross-modal anchor mapping table representing synonymous association between heterogeneous tree nodes; when the formula rendering width exceeds the threshold of the current layout format, redundant sub-trees are stripped in the formula structure tree and replacement dummy nodes are inserted to realize structure reduction; at the same time, the associated code structure tree is synchronously and reversely reconstructed based on the mapping table, ensuring the logical consistency of formula and code in collaborative adjustment; finally, the data is summarized and converted into a target markup language for rendering output, realizing formula layout automatic adaptation and formula-code synchronous update when scientific research papers are converted between multiple formats, improving the efficiency of scientific research paper collaborative writing and the quality of multi-format output documents.

The application discloses a kind of Word analysis and digital teaching material editing method of one-key import, it is related to digital education technical field.The method includes decompressing the uploaded Word document, extracts core XML file group, establishes memory DOM tree;Iterate memory DOM tree node, according to node type triggers different analysis algorithm, obtains discrete data, and stores discrete data into structured JSON data;Structured JSON data is reconstructed and cleaned, and structured JSON data after cleaning is obtained;Through recursive traversal renderer, structured JSON data after cleaning is rendered into the native component of digital teaching material editing system.The method directly traverses and logically reconstructs the XML structure and binary object of the bottom layer of Word document, establishes a three-layer mapping mechanism, realizes high-fidelity and editable restoration of complex teaching material documents, and supports one-key import into the digital teaching material editing system.

The application discloses a kind of intelligent driving car path planning methods based on multi-algorithm cooperation, belong to intelligent driving technical field, including: by the improved Bi-RRT* algorithm initialization two respectively from start point and target point growth search tree and carry out bidirectional search;Dynamic detection two search tree node distance, when meeting condition, trigger the strategy of opposite bias, and carry out global path generation;In global path generation, improved artificial potential field method is used to carry out local path planning, and new node is expanded;When expansion failure, trigger ray projection navigation mechanism, detect the feasible path in front through sector area, select optimal intersection and expand, when the node of two search trees meets connection condition and path has no collision, realize bidirectional connection, generate initial complete path;The initial complete path generated is handled with path cooperation optimization and smoothing, generates final path, and the path planning ability of intelligent driving vehicle in complex environment is improved by the method.

The application discloses an intelligent extraction and automatic metadata management system based on multi-source heterogeneous data, and relates to the technical field of data processing.The system comprises a structure analysis module, a format conversion module, a semantic mining module, a metadata generation module and a verification and registration module.The structure analysis module identifies the encoding and logical structure of the original data file and generates an original structure characteristic descriptor.The format conversion module uniformly converts the heterogeneous data into an intermediate representation data block with a preset tree node structure according to the original data.The semantic mining module extracts the name label, numerical distribution and context dependency relationship of the key field from the intermediate representation to form a semantic feature vector set.The metadata generation module inputs the set into a template matching engine, automatically selects and fills the most matched metadata description template, and generates an initial metadata record.The verification and registration module performs logical consistency and integrity verification and revision on the record, and registers the record to a unified metadata registry.

This provides a storage technology for segment images that can be expanded in resource-poor environments. [Solution] The spatial partitioning storage method of the present invention targets a segment image in which attribute values ​​are the pixel space, and includes a partitioning step in which the pixel space is recursively partitioned based on a predetermined partitioning ratio to form a hierarchical partitioned structure consisting of branch tree nodes and image blocks; a terminal processing step in which, for each region constituting the partitioned structure, the image blocks are ranked higher using the code amount as an indicator; and a structuring step in which the determined branch tree node structure and image blocks are converted into a structured bit sequence (a type of structured data). In particular, the terminal processing step calculates the code amount when generated as structured data for cases where the branch tree nodes and below are held as a hierarchical structure and when they are represented as "terminal blocks containing multiple or single attribute values", compares the code amounts and selects the smaller one.

The application provides a kind of unmanned aerial vehicle autonomous inspection route planning method and system, including collecting inspection area boundary, obstacle distribution, inspection point and unmanned aerial vehicle movement, safety spacing parameter, constructs three-dimensional planning space;Based on the accessibility of inspection point and the piecewise weighted sampling of obstacle distribution to generate candidate points, determine the extension direction of tree node, combine obstacle distance, corner constraint and path cost to construct extension criterion, under the condition of meeting turning radius, climbing gradient and safety constraint, variable step extension generates initial search tree, and the initial route covering all inspection points is obtained by parent node optimization reconnection;According to the node corner change and the traffic allowance, the route is divided into smooth area and sensitive area, the nodes in the smooth area are thinned, the sensitive area is reconstructed according to the continuous constraint of safety spacing and curvature, and the unmanned aerial vehicle inspection route meeting the inspection order, obstacle avoidance and movement constraint is output after discretization, redundant point elimination and feasibility check.

The application discloses a kind of WPS WebOffice-oriented tender chapter tree driven mass generation and positioning write method, system and computer readable storage medium.It is described as follows:The method includes: parsing tender outline data into chapter tree containing multiple levels of title nodes and hierarchical relationship;According to chapter tree structure, write each level title in WPS WebOffice online document, and create chapter anchor bookmark in its write end position after writing in target title node is completed, establish the mapping relationship between chapter tree node and document location;Based on write state machine, drive mass content generation and positioning write process, construct generation request containing hierarchical context information according to batch for the title node to be generated, obtain corresponding structured content;Get the end position of chapter anchor bookmark, and position write structured content in the end position;After writing is completed, update node state and persistently save, and after all batches are completed, uniformly delete the used chapter anchor bookmark.The application solves the technical problems that multi-chapter content positioning write in online document is unstable, long-process write lacks breakpoint continuation ability, and repeated title leads to content and chapter mapping ambiguity, improves the positioning accuracy of tender content write, process reliability and context relevance.

This application relates to a method, apparatus, and computer equipment for predicting the operational status of a distribution network, belonging to the field of computer technology. The method includes: obtaining a current power grid hierarchical tree and a current power grid knowledge graph based on current operational data of the distribution network; extracting abnormal paths from the current power grid knowledge graph through the matching relationship between tree nodes in the current power grid hierarchical tree and graph nodes in the current power grid knowledge graph; determining the current operational status of the distribution network based on the distribution of matching tree nodes of abnormal graph nodes in the abnormal paths within the current power grid hierarchical tree; the current operational status is used to characterize the operational state of entities in the distribution network; and predicting the operational status of the distribution network based on the current operational status, the current power grid hierarchical tree, and the current power grid knowledge graph, obtaining the predicted operational status result of the distribution network. This method can improve the accuracy of the predicted operational status.

This application provides a dynamic page generation system and a dynamic page configuration method, which can be applied to the field of financial technology. The system includes: a design module configured to: provide a visual interface to receive user settings for page element layout, style, and logic; construct a unified syntax tree (UST) based on the operations, where nodes of the UST correspond to the page elements, and node attributes contain logical information representing the mapping relationship; convert the UST into a page description file; and a rendering module configured to: obtain the page description file; parse the page description file to reconstruct the UST; dynamically generate corresponding page element instances based on the reconstructed syntax tree to form a page structure; and dynamically associate the mapping relationship with the corresponding page element instances in the page structure according to the logical information in the reconstructed syntax tree nodes.

The invention relates to the technical field of webpage content protection, and discloses a webpage watermark anti-hiding generation method based on a package protection structure. The method comprises the following steps: firstly, determining an information source after a page is initialized, and generating and caching watermark image data based on canvas; a watermark load layer is dynamically created, display and visibility, transparency, filter, size, positioning, hierarchy, transformation and pointer penetration parameters are solidified by adopting an in-line style, a watermark image is tiled through a background style, and a highest priority mark is written in; creating a watermark wrapping layer and a watermark protection layer, placing the protected content in the protection layer, solidifying the positioning pattern of the wrapping layer and the positioning and overflowing pattern of the protection layer, and enabling the level of the load layer to be larger than that of the protection layer; and monitoring deletion of nodes of a wrapping layer and a sub-tree of the wrapping layer and attribute changes of the stack and the hidden, pausing monitoring and executing load layer reconstruction back-insertion or protection layer style resetting or wrapping layer style resetting when a modification operation which is not allowed is identified after triggering, and recovering monitoring after verification.

The application provides a computer interlocking code bit search method based on a sorting dictionary tree, comprising the following steps: S1, initializing a sorting dictionary tree data structure; S2, sequentially inserting all code bit objects contained in a code bit table, reconstructing the sorting dictionary tree data structure according to a code bit object name string each time of insertion, inserting each code bit object pointer into a sorting one-dimensional array sortedBitArr in sequence, and refilling a two-dimensional array val2NodesArr used for determining a starting search dictionary tree node according to a newly added tree node; S3, obtaining all starting search dictionary tree nodes based on the two-dimensional array val2NodesArr according to a keyword input by a user at present, sequentially preorder traversing the sorting dictionary tree from each starting search dictionary tree node, and if the keyword matches successfully, combining the sorting one-dimensional array sortedBitArr to determine all code bit objects meeting the requirement and putting the code bit objects into a search result set. The application greatly improves the search efficiency, success rate and availability of the search method, reduces the address space consumption of each dictionary tree node, and shortens the search consumption time.

The application relates to a tree structure data rendering method, device and medium based on a VUE framework, the method comprising the following steps: acquiring a scroll event triggering instruction, calculating the number of tree nodes that should be displayed on a page according to the expansion and folding state of a corresponding current tree node, thereby calculating the height of a scrollable area according to the height of each tree node item; acquiring the nodes to be rendered according to the height of a visible area and the position of a scroll bar corresponding to the scroll event triggering instruction, obtaining a virtual list; when the virtual list corresponding to the visible area is the tree nodes of the same level, the DOM structure is reused in the virtual list; when the virtual list corresponding to the visible area contains the tree nodes of different levels, the DOM structure is reused according to the attributes of the tree nodes, and the tree node DOM structures of different levels are created or deleted, and finally the tree nodes are rendered to a front-end page. Compared with the prior art, the application has the advantages of high calculation efficiency, rapid node rendering and the like.