50 results about "Segment tree" patented technology

A method for efficiently and accurately inventorying image features such as timber, including steps of segmenting digital images into tree stands, segmenting tree stands into tree crowns, each tree crown having a tree crown area, classifying tree crowns based on species, and analyzing the tree crown classification to determine information about the individual tree crowns and aggregate tree stands. The tree crown area is used to determine physical information such as tree diameter breast height, tree stem volume and tree height. The tree crown area is also used to determine the value of timber in tree stands and parcels of land using tree stem volume and market price of timber per species.

Methods and systems for detecting trees in aerial imagery are provided. A method for detecting trees in aerial imagery may include training a pixel-level classifier to assign a tree or non-tree label to each pixel in an aerial image. The method may further include segmenting tree and non-tree regions of the labeled pixels. The method may also include locating individual tree crowns in the segmented tree regions using one or more tree templates. A system for detecting trees in aerial imagery may include a trainer, a segmenter and a tree locator.

A peer-to-peer cache architecture stores peer address certificates in different cache segments according to the number of IDs being stored and their relative distance in the peer name space. The cache instantiates regions of decreased range and increased granularity as additional information from close peers is learned. In a large peer cloud where the number of instantiated IDs is not known, each succeeding cache region covers one tenth of the preceding cache region. For peers with multiple IDs registered locally, the segmented cache of the present invention combines overlapping segments of the same granularity to eliminate the duplication of information that would otherwise occur. A cache tree, an instantiated segment tree, and an uninstantiated segment tree are arranged in red-black trees to simplify the search and proper placement and instantiation of information.

An apparatus, system, and method are disclosed for automatically generating an Information Management System (IMS) hierarchical database description from an arbitrary Extensible Markup Language (XML) schema. The apparatus, system, and method may include the steps of: parsing an XML schema including a single root element; generating an XML schema tree that corresponds to the XML schema; generating an IMS segment tree such that each XML schema node is represented by a corresponding IMS segment node; reducing the number of IMS segment nodes from the IMS segment tree based on reduction rules, such that the IMS segment tree corresponds to IMS hierarchical database constraints; and generating IMS database description corresponding to the reduced IMS segment tree.

A simple and fast algorithm for multi-dimensional packet classification by solving the best matching filter problem. The substantial part of the algorithm includes the search of filters being concurrently stabbed by the packet using a KD-tree data structure. Another aspect of the present invention includes the classification of the packet according to its destination address using a second data-structure which preferably consists of a one dimensional segment tree. In a preferred embodiment of the present invention, the packet is first classified according to its protocol type, then the packet is classified according to its destination address using a one dimensional segment tree data structure, and finally, a 6 dimension KD-tree is used to find the filters being stabbed by the remaining 3 parameters of the packet. Among the filters, which comply with the packet, the filter which applies to the packet is the filter with the highest pre-determined priority. Theoretical analysis predicts and experimental results verify that in practice, the proposed data-structure can handle a lot of "difficult" filters quickly and efficiently.< / PTEXT>

The invention discloses a memory allocation method, comprising the following steps: S1, establishing and initializing a segment tree structure for a memory to be managed; S2, applying for the memory by a kernel or an application program; and S3, recovering the memory released by the kernel or the application program by a segment tree. Physical memory management is performed by adopting the segment tree mode, thereby ensuring that the provided memory address is in physical continuity, efficiently applying for the memory with the specific physical address without influencing the overall performance, and overcoming the defects that the common memory management is easy to generate memory fragments, the efficiency is low, the continuity of the physical address can not be ensured and the like.

The embodiment of the application discloses a data query method and device of a time interval and an index construction method and device of a time interval. The data query method includes: acquiring a to-be-queried time interval; using the to-be-queried time interval to obtain a first result set of index interval objects in intersection and containing association relationships with the to-be-queried time interval by querying in a first sorted index constructed on the basis of key value pairs of the index interval objects; using the to-be-queried time interval to obtain a second result set of index interval objects in an overlaying association relationship with the to-be-queried time interval by querying in a second segment tree index constructed on the basis of key value pairs of the index interval objects; and combining the first result set of the index interval objects and the second result set of the index interval objects obtained by querying, and then using the combined index interval objects as a query result of the to-be-queried time interval. According to the embodiment of the application, a reverse indexing manner and a segment-tree-type indexing manner are combined, retrieval requirements of the high expansibility and the high concurrency of big data based on a cloud platform can be met, and the retrieval efficiency can also be greatly improved.

The invention relates to a segmentation and reset method based on the Version 6 of a network protocol, which is a method that can improve the transmission performance of the new generation Internet protocol (IPV6) by improving the segmentation and reset efficiency, the specific method includes the following steps: (1) a segmentation and reset system receives a data segment transmitted from a network; (2) the data segment received in step (1) is sent to a segment detection module; (3) the data segment that is not the currently-processed data segment distinguished in step (2) is transmitted to a segmentation tree module for cache, and the segmentation detection module is invoked to guarantee that the segmentation on the branch of the segmentation tree is legal during the branch cache process; 4) the segments passing the authentication in step (2) are transmitted to a segment classification module, and the segments are classified into four types and imprinted with type marks; (5) an advanced processing module is invoked to judge if advanced processing can be carried out, if so, a specific reset module is started to complete the restoration of a data package; otherwise, the data package is transmitted to the segment tree module for cache; and (6) the coming of the next segment is waited and the process is returned to step (1).

The invention discloses a method and device for generating an event group evolution diagram and solves the technical problem of high time complexity in operating an algorithm for configuring event evolution diagrams. The method includes: acquiring one event evolution diagram which represents corresponding relationship between duration and attention hotness of events; acquiring an available area unoccupied by other event evolution diagrams from candidate areas corresponding to the duration according to a segment tree; configuring the event evolution diagram in the available area so as to generate the event group evolution diagram. By the method and device, time complexity in operating the algorithm for configuring the event evolution diagrams is lowered.

According to one embodiment, fingerprints of segment trees are scanned, each segment tree representing one of the files in a filesystem namespace. For each of the fingerprints representing a segment, setting a corresponding bit in a live reference vector (LRV) to indicate that the segment has been referenced by a file in the filesystem namespace. A file index mapping fingerprints to storage locations of segments is scanned, including, for each fingerprint found in the file index, setting a corresponding bit in a live index vector (LIV) to indicate that the fingerprint exists in the file index. The LR vector and the LI vector are compared to determine whether there is any mismatch. A garbage collection operation is performed in response to determining that the LR vector and the LI vector are matched.

The invention discloses an indexing method supporting time series data aggregation function, which supports fast ad hoc query of a simple aggregation operation. The basic thought of the method is that a summary table and segment trees (Segment Tree) are combined, and a segment forest model formed by multiple segment trees is established on the summary table, so that the full table scan operation of the summary table is avoided. Meanwhile, through dynamically constructing a segment forest in a bottom-up method, the defect that the conventional segment tree does not support increase is avoided. In addition, a query algorithm directly positions index data through calculation through calculation, the recursive traversal operation of the segment forest is avoided, and the frequency for disk IO is reduced. An experimental result shows that through adoption of a calculation query way of the summary table and the segment forest, the frequency for disk IO is effectively reduced and the query performance is remarkably improved.

The invention provides a web page information processing method and device. The web page information processing method comprises the steps of obtaining time interval information of web pages to be retrieved, dividing a set of the web pages to be retrieved into multiple areas according to the time interval information of the web pages to be retrieved, dividing a time interval set formed by the time interval information through segment tree structures into at least two unit time intervals, adding reversely-arranged segment tree indexes for each area based on the unit time intervals, respectively retrieving the web pages to be retrieved in each area according to queried time intervals and the reversely-arranged segment tree indexes of each area, determining first candidate web pages associated with the queried time intervals, determining second candidate web pages including query keywords from the first candidate web pages and outputting the second candidate web pages.

The invention is applicable to image feature extraction, and provides a binary segmenting tree based regional feature description method. The regional feature description method comprises the steps of A, cutting an original image into multiple segmented regions; B, calculating similarities of adjacent segmented regions, and combining two adjacent regions with the highest similarity into a super-region; C, repeatedly performing the step B until a complete original image is combined; D, establishing a binary segmenting tree according to the segmented regions and the super-region; and E, extracting features of a target region and the features of the super-region corresponding to the target region from the binary segmenting tree, and establishing region features based on the extracted features, and performing target regional feature description according to the regional features. According to the regional feature description method, the basic regional features of the target region, the equative super-region, the adjacent superior region and the super-region are combined for describing features of the target object; and therefore, local region features are included while overall situational information is included as well, so that the binary segmenting tree based regional feature description method has the advantages of situational perceptivity, high recognition and high robustness.

Embodiments of the present invention relate to the field of information security and disclose a method for constructing a DDoS attack event set and a DDoS attack defense method. The DDoS attack event set construction method includes: constructing an event set and setting a weight value for each event in the event set; updating the weight value corresponding to each event based on the occurrence frequency of each event and recording the update time; constructing a segment tree based on the updated weight value and update time of each event, and updating the information of each node in the segment tree; traversing each node in the segment tree, screening events that meet predetermined conditions, and obtaining a DDoS attack event set. The embodiment of the present invention uses an exponentially decaying event weight value calculation and update method to screen attack events to form a DDoS attack event set, facilitating the subsequent use of the DDoS attack event set to search for DDoS attack events from a large number of events, thereby improving the efficiency of attack event detection.

The present invention discloses an online path planning method for a mobile robot based on deep reinforcement learning. The specific steps are as follows: Obtain obstacle information through a lidar, obtain the robot position information and target point information through ROS built-in plugins, and process and integrate the two into the robot state S. Input the state S into the DDPG network to obtain the optimal execution action, enabling the robot to quickly and safely reach the target point during navigation; Design a cascaded structure of LSTM and Actor networks; The structure of the improved experience replay pool adopts a segment tree, which can efficiently update the weight changes caused by the continuous increase in the number of episodes; For the optimization of the Critic network, a fractional gradient descent algorithm with a momentum term is adopted, which can improve both the accuracy and the convergence speed compared to the integer order; The present invention is used to solve problems such as low accuracy and slow convergence speed when conventional DDPG is used for robot path planning.

The invention relates to a method and system for retrieving prefix data, including: acquiring a network prefix represented by binary, constructing a prefix tree for the network prefix, segmenting the prefix tree to obtain a multi-segment segment tree; Retrieve network prefixes, process the to-be-retrieved network prefixes into segments, obtain multiple segment prefixes, perform concurrent retrieval on the segment tree corresponding to each segment prefix, and obtain the retrieval result r i , which represents the retrieval result of the segment prefix in the i-th segment in the segment-tree of the i-th segment, perform a logical AND operation on all the retrieval results, and use the operation result as the retrieval result of the network prefix to be retrieved. The invention can use the segmented prefix tree structure to construct the information base for the prefix information, and can perform parallelized prefix matching search for the specific prefix, so as to realize the significant improvement of the prefix matching efficiency.

The invention provides a web page information processing method and device. The web page information processing method comprises the steps of obtaining time interval information of web pages to be retrieved, dividing a set of the web pages to be retrieved into multiple areas according to the time interval information of the web pages to be retrieved, dividing a time interval set formed by the time interval information through segment tree structures into at least two unit time intervals, adding reversely-arranged segment tree indexes for each area based on the unit time intervals, respectively retrieving the web pages to be retrieved in each area according to queried time intervals and the reversely-arranged segment tree indexes of each area, determining first candidate web pages associated with the queried time intervals, determining second candidate web pages including query keywords from the first candidate web pages and outputting the second candidate web pages.

The invention discloses a resource scheduling method and device, a nonvolatile storage medium and electronic equipment. The method comprises the steps of receiving a to-be-executed task and resource demand information of the to-be-executed task; nodes to be selected are determined in a resource line segment tree according to the resource demand information, and the resource line segment tree adopts a time dimension to represent the resource state of a resource providing cluster; for each to-be-selected node, determining whether the to-be-selected node has a resource conflict, and obtaining a resource conflict judgment result; and under the condition that the resource conflict judgment result indicates that the resource conflict exists, determining a resource reservation strategy according to the task types of the other tasks and the running states of the other tasks, and determining whether to determine the node to be selected as a target node or not according to the resource reservation strategy, the computing resources provided by the target node are scheduled to the to-be-executed task in the time window; and under the condition that the resource conflict judgment result indicates that the resource conflict does not exist, determining the node to be selected as a target node.

The embodiment of the application discloses a data query method and device of a time interval and an index construction method and device of a time interval. The data query method includes: acquiring a to-be-queried time interval; using the to-be-queried time interval to obtain a first result set of index interval objects in intersection and containing association relationships with the to-be-queried time interval by querying in a first sorted index constructed on the basis of key value pairs of the index interval objects; using the to-be-queried time interval to obtain a second result set of index interval objects in an overlaying association relationship with the to-be-queried time interval by querying in a second segment tree index constructed on the basis of key value pairs of the index interval objects; and combining the first result set of the index interval objects and the second result set of the index interval objects obtained by querying, and then using the combined index interval objects as a query result of the to-be-queried time interval. According to the embodiment of the application, a reverse indexing manner and a segment-tree-type indexing manner are combined, retrieval requirements of the high expansibility and the high concurrency of big data based on a cloud platform can be met, and the retrieval efficiency can also be greatly improved.

The invention discloses a machine position positioning and type analysis method and device in a machine room space, electronic equipment, a readable storage medium and a computer program product, and belongs to the technical field of communication equipment. The method comprises the steps of obtaining a straight line segment in a machine room plane graph; analyzing straight line segments in the machine room plane graph based on a global scanning line and a line segment tree algorithm, and obtaining rectangular positioning information of machine positions in the machine room space; and calculating the rectangular positioning information of the machine positions in the machine room space by using a convolutional neural network to obtain a type analysis result corresponding to the machine positions in the machine room space.

The invention relates to a distributed convergence behavior mining method and system. The method comprises the following steps of: obtaining a data set formed by four groups of data, and dividing thedata set into a plurality of event sets according to event types, wherein the four groups of data comprise objects, events, time points and weights; constructing index trees for the event sets, determining a total time length of the index trees according to the time points in the event sets, splitting the total time length into time periods according to a segment tree division method, and storingthe index trees to a distributed database, wherein each node of the index trees corresponds to a weight sum of all objects in the time periods; obtaining a to-be-queried event and a to-be-queried timeperiod of a to-be-queried object, searching an index tree corresponding to the to-be-queried event from the distributed database to serve as a to-be-queried index tree, querying a weight sum of all objects in the to-be-queried time period in the to-be-queried index tree to serve as a convergence degree of the to-be-queried object, and selecting the object with the highest convergence degree as amining result.

An access object (AOB) service receives a restore stream from a client for a file managed by a deduplication filesystem. The file is represented by a segment tree including segments in an upper level referencing chunks of the file. The upper level segments are grouped into similarity groups and the similarity groups are assigned to deduplication object (DOB) services. The upper level segments are iterated over to open multiple internal read-ahead streams from the AOB service to the DOB service to populate a read-ahead cache maintained at the AOB service. The restore stream is serviced using the read-ahead cache.

The invention belongs to the field of unmanned aerial vehicle path planning, and particularly relates to a multi-unmanned aerial vehicle cooperative path planning method based on an improved MATD3 algorithm. The method comprises the following steps: constructing an unmanned aerial vehicle kinematics model and a multi-unmanned aerial vehicle environment model; designing a reward function based on the two models; constructing an experience playback buffer area by adopting a PER mechanism and managing priorities by adopting a segment tree structure; an SA algorithm is adopted to optimize a PER mechanism; an MATD3 algorithm model based on an Actor-Critic network is constructed; training an MATD3 algorithm model based on the reward function and the experience playback buffer area, and completing multi-unmanned aerial vehicle cooperative path planning by using the trained MATD3 algorithm model; the method improves the performance and reliability of a multi-unmanned aerial vehicle system in complex tasks, and has a good application prospect.

This application discloses a resource scheduling method and apparatus, a non-volatile storage medium, and an electronic device. The method includes: receiving a task to be executed and its resource requirement information; determining candidate nodes in a resource segment tree based on the resource requirement information, wherein the resource segment tree uses a time dimension to represent the resource status of the resource-providing cluster; for each candidate node, determining whether a resource conflict exists, obtaining a resource conflict judgment result; if the resource conflict judgment result indicates a resource conflict, determining a resource reservation strategy based on the task type and running status of other tasks, and determining whether to designate the candidate node as a target node based on the resource reservation strategy, wherein the computing resources provided by the target node are scheduled to the task to be executed within a time window; if the resource conflict judgment result indicates no resource conflict, designating the candidate node as the target node.

The invention relates to a segmentation and reset method based on the Version 6 of a network protocol, which is a method that can improve the transmission performance of the new generation Internet protocol (IPV6) by improving the segmentation and reset efficiency, the specific method includes the following steps: (1) a segmentation and reset system receives a data segment transmitted from a network; (2) the data segment received in step (1) is sent to a segment detection module; (3) the data segment that is not the currently-processed data segment distinguished in step (2) is transmitted to a segmentation tree module for cache, and the segmentation detection module is invoked to guarantee that the segmentation on the branch of the segmentation tree is legal during the branch cache process; 4) the segments passing the authentication in step (2) are transmitted to a segment classification module, and the segments are classified into four types and imprinted with type marks; (5) an advanced processing module is invoked to judge if advanced processing can be carried out, if so, a specific reset module is started to complete the restoration of a data package; otherwise, the data package is transmitted to the segment tree module for cache; and (6) the coming of the next segment is waited and the process is returned to step (1).

Cloud units are maintained in cloud storage. Each cloud unit includes containers including data containers storing segments of files, segment tree containers storing upper-level segments of segment trees representing the files, and cloud containers storing headers from the data and segment tree containers. A header for a data container includes fingerprints identifying the segments of files. A header for a segment tree container includes fingerprints identifying the upper-level segments. A cloud unit is attached to a storage appliance in one of a read-write state or a read-only state by recovering, from cloud storage, to a local storage of the appliance, at least the cloud containers associated with the first cloud unit. While the cloud containers are being recovered, a request is received to access a segment tree of the cloud unit. The request is redirected to cloud storage.

The present invention relates to a method, storage medium and electronic device for identifying drawing frames and labels in architectural drawings, comprising the following steps: obtaining coordinate information of endpoints of all straight line segments detected from the architectural drawings; constructing a two-dimensional segment tree using the coordinate information of the endpoints of all straight line segments; traversing and searching the two-dimensional segment tree using a depth-first search algorithm to obtain a plurality of target straight line segments related to an outer frame of a drawing frame area in the architectural drawings from among all the straight line segments, and determining the position of the drawing frame area based on the plurality of target straight line segments; and identifying a drawing label area in the architectural drawing from within the drawing frame area based on the position of the drawing frame area. Compared with the existing method of manually marking drawing frames, the method can not only reduce workload but also improve recognition efficiency.