624 results about "Tree architecture" patented technology

A visual tree structure as specified by a program is constructed and maintained by a visual system's user interface thread. As needed, the tree structure is traversed on the UI thread, with changes compiled into change queues. A secondary rendering thread that handles animation and graphical composition takes the content from the change queues, to construct and maintain a condensed visual tree. Static visual subtrees are collapsed, leaving a condensed tree with only animated attributes such as transforms as parent nodes, such that animation data is managed on the secondary thread, with references into the visual tree. When run, the rendering thread processes the change queues, applies changes to the condensed trees, and updates the structure of the animation list as necessary by resampling animated values at their new times. Content in the condensed visual tree is then rendered and composed. Animation and a composition communication protocol are also provided.

A system and method are provided for organizing and managing a tree structure having a plurality of nodes representing physical entities, the tree structure defining a number of node locations, each node location being reached via a predetermined path from a root node of the tree structure. The method comprises the steps of associating first and second keys with each node to be included in the tree structure, the value of at least the first key being unique for each node, and then arranging the nodes within the tree structure by sorting the nodes with respect to both the first key and the second key, the sorting with respect to the first key being such that each node may be positioned within the tree structure at any node location along the path from the root node to the node location specified by the first key. By this approach, a search can be performed for a node within the tree structure based on specified criteria for both the first and second keys.

Methods, systems, devices and computer program products operable in a computer graphics system include constructing a hierarchical ray tracing acceleration data structure comprising a tree structure, the modes of which are generated utilizing a bounding interval hierarchy based on defining an axis-aligned scene bounding box and two parallel planes to partition a set of objects in a sense into left objects and right objects, and matching split planes to object bounding boxes. The two planes are perpendicular to a selected one of x, y, or z-axes. Given a splitting plane, each object in an image is classified either left or right based on a left/right selection criterion, and two splitting plane values of the child modes are determined by the maximum and minimum coordinate of the left and right objects, respectively.

A process for identifying the original tree, which is a member of a dictionary of labelled ordered trees, by processing a potentially Noisy Subsequence-Tree. The original tree relates to the Noisy Subsequence-Tree through a Subsequence-Tree, which is an arbitrary subsequence-tree of the original tree, which is further subjected to substitution, insertion and deletion errors yielding the Noisy Subsequence-Tree. This invention has application to the general area of comparing tree structures which is commonly used in computer science, and in particular to the areas of statistical, syntactic and structural pattern recognition.

Apparatus and methods of revealing the hierarchical structure of a document having content of a characteristic type of content are described (100). The hierarchical structure may be expressed, independently of document content type, as a tree structure of one or more nodes (126) A semantic representation for interpreting the tree structure may also be provided, document description files are used to encapsulate structural and meta information associated with a document stored on a computer-readable medium (156). Document description files are external to native application files and have a set of required fields. Document description files point to the referenced document data using uniform resource locators (URLS) and serve as virtual documents. In addition to the required fields, applications can choose to encode additional structural information in the document description files.

Techniques for managing membership of a network of nodes are provided. Nodes of the network are organized into a tree structure having a plurality of vertices. Each vertex of the tree structure comprises a group having a plurality of nodes. Membership information is maintained at each node. The membership information for a given node comprises information about a group to which the given node belongs and child groups of the group to which the given node belongs in the tree structure.

The invention discloses a cipher searching method based on a cloud document system. The system includes the following achievement steps that 1) a data uploading person encrypts a document and transmits the encrypted document to a proxy server; 2) the proxy server analyzes the document, extracts keywords, calculates the keyword weight of the document, transmits the keyword weight and the keyword trap door to an index server together, meanwhile utilizes a random key to conduct secondary encryption on the document and transmits the document to a storage server; 3) an index server utilizes the keyword trap door to construct a keyword trap door index tree with a binary tree embedded in a B + tree structure; 4) when a searching user conducts keyword searching, the proxy server transmits the keyword trap door to be inquired to the proxy server, and the proxy server searches the index tree to obtain a document identifier meeting the requirements and transmit the document identifier to the storage server; 5) the storage server transmits the corresponding cipher document to a user according to the document identifier, and the user decrypted the cipher to obtain the plain text. The method is high in safety and searching efficiency.

A method and system for classifying semi-structured documents by distinguishing sub-tree structural information as a distinct representative characteristic of a fragment of the document structure identified by a sub-tree node therein. The structural information comprises both an inner structure and an outer structure which individually can be exploited as representative data in a probabilistic classifier for classifying the sub-tree itself or the entire document. Additional representative feature data can also be independently used for classification and comprises the data content of the fragment structurally represented by the sub-tree and additionally with node attributes. The classification values independently generated from each of the different sets of features can then be combined in an assembly classifier to generate an automated classification system.

A method and system for storing and retrieving data using a radix-search tree is disclosed. The method encorporates: (a) storing a plurality of nodes, each of the nodes having node-attributes, in a radix-search tree, and (b) retrieving the node-attributes of the plurality of nodes in single memory access. The system encorporates: (a) a data storage module for storing a plurality of sub-trees containing a plurality of nodes having node attributes, wherein the node attributes of at least one of the sub-trees are stored in a contiguous memory block, and (b) a processor that is operative to perform operations including: (i) transferring the node attributes of at least one of the sub-trees to the data storage module, and (ii) retrieving the node attributes of at least one of the sub-tree s from the data storage module.

The invention relates to a balanced binary tree-based method for detecting collisions in a large-scale virtual environment. According to the characteristics of large object quantity and complex object types in a large-scale visual environment, the method adopts an expanded balanced binary tree to improve a bounding volume hierarchy tree, accelerates the detection of object collisions and reduces time complexity, caused by environmental changes, of tree reconstruction for overcoming the drawbacks of the conventional bounding volume hierarchy method in the real-time detection of collisions in a dynamic environment. The method adopts different bounding volumes according to hierarchy, combines the simplicity and compactibility of the bounding volumes, and improves a collision method as well as the accuracy of collision detection. Concrete processing flow is described in drawings in the abstract.

An algorithm on a computer readable medium for efficiently creating a message efficient virtual backbone in a wireless ad hoc network utilizes three phases to establish an efficient network among the independent transceivers of a wireless ad hoc network. Independent transceivers within the transmission range of each other are neighbors. A leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established. A level calculation phase determines the level of each transceiver away from the root transceiver, with each transceiver recording the level of its neighbors. Precedence for each transceiver is established with consideration of each transceiver's tree level and identifier, with tree level being paramount in deciding precedence; and reporting when the levels of the tree are established. A backbone construction phase establishes all transceivers as a dominator or a dominatee, with the dominators forming the network backbone and the dominatees all being neighbors to a dominator. Within the network each transceiver only needs to know the information of its neighboring transceivers.

The invention relates to a storing and accessing method of a tree implemented by 2D tables, including: (1) building 2D tables, including: a capacity allocation table, describing the capacity of tables in the system; a tree-structure relation table, describing the relation of the tree structure; several data storage area tables, recording the node attribute values in the tree structure; (2) loading and maintaining the data, including adding, deleting, amending and searching as well as the relative operations; (3) managing the data, including loading, synchronizing, changing and observing. It achieves the effects of flexibly configuring data and of making maximum use of the original mechanisms of the object-oriented database and enhances processing efficiency, flexibility and stability.

A method and system to provide management information of network devices by mapping between SNMP MIB module schema and Common Information Model (CIM) schema. MIB modules are tree-structured lists of objects for describing SNMP network device information, whereas CIM schema employs user-intuitive, object-oriented classes to model such information. A mapping process enumerates the MIB objects and then maps the objects into CIM Managed Object Format (MOF) classes using defined mapping tables. A correlation mechanism is further provided to efficiently determine in real time which MIBs (or portions thereof) and corresponding CIM classes a network device supports.

A method for matching tree-structures using original image data includes providing a first tree representative of an anatomical structure in a first digital medical image of a pair of digital medical images, said tree comprising a plurality of double linked, directed branches B=(S, P, C) of sites S, links to parents P, and links to children C, providing a second tree representative of an anatomical structure in a second digital medical image of said pair of images, registering said first medical image to said second medical image wherein a registration function is defined, and matching said first tree and said second tree using said registration function.

Provided are multiview video inter-layer encoding and decoding based on coding units of a tree structure. A video encoding method includes operations of encoding a base layer image that is one of a base view texture image and a base view depth image of a base view image, based on coding units of a tree structure that are among coding units obtained by hierarchically splitting a maximum coding unit of an image, determining an inter-layer encoding mode for performing inter-layer encoding on an additional view image by referring to the base layer image based on the coding units of the tree structure, and referring to an additional layer image including the additional view image, based on the inter-layer encoding mode.

The invention provides a subject area identifying method based on weight of a text structure. Based on a tree structure, the method provided by the invention comprises the following steps: resolving a webpage into a label tree and improving a data area excavation and semanteme link block identifying technology on the basis of tree matching, thereby realizing pre-processing for removing links; providing a concept of the weight of the text structure and identifying a subject area with the assistance of the calculation result of the weight of the text structure; and finally adopting a normalization method to calculate a relative length value of a text node in the subject area, and using the normalized relative length value for effectively removing the text node independent from a subject content, thereby realizing denoising in the subject area and acquiring an accurate subject content. By applying the technical scheme of the invention, valuable information on the webpage can be accurately and rapidly excavated, thus the subject area identifying method provided by the invention has a wide application prospect.