680 results about "Tree architecture" patented technology

A system and method using inheritance for the configuration, management, and / or monitoring of computer applications and devices via a computer network are disclosed. The method generally comprises determining a hierarchical tree structure based upon locations of devices in a network topology, each device being a node in the hierarchical tree structure, determining policies for each node in the hierarchical tree structure to be enforced by an agent corresponding to each node, the agent being in communication with the device and the resources corresponding to the device, and communicating the policy to the corresponding agent, wherein the policies corresponding to the resources of each device are selectively inherited along the hierarchical tree structure of the network directory.

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 shared control channel structure includes at least one control channel to be allocated at least to a user for at least one of uplink and downlink directions in a network, which the at least one control channel is arranged as at least a part of a modular structure comprising of modular code blocks on at least two different sizes. One of such modular structures may be represented as a tree structure in particular, where each of the modular code blocks define one node of the tree, respectively.

A virtual web-based computing platform combining a particular network database hierarchy, graphical user interface, and integrated suite of computational tools accessible on demand, by which users gain access to an integrated Virtual Workspace for organizing emails, contacts, bookmarks, tasks, documents, notes, and all other relevant information. The network database hierarchy employs unique data structure and methods, allowing the user to centrally store and manage all data, regardless of type, as well as activities (actions taken and documented by the user). Nevertheless, the interface to said database offers a familiar folder / sub-folder “look and feel” using a tree data hierarchy, which gives a common, centralized and unified approach for storing, managing, displaying, and various types of data, regardless of object- and data-types.

The present invention assists a user in locating an intended address even where an address entered by the user is incorrect. In particular, in accordance with an embodiment of the present invention, an address structure entered by a user containing an existing domain name is considered as a vine of interconnected elements. This vine is then compared to the tree structure of the correctly named domain. A possible match or matches within the domain for the address entered by the user are returned to the user. The possible match or matches may be assigned an accuracy score to assist the user in locating the desired address. The present invention is applicable to any system utilizing addresses that can be considered as a series of elements, such as universal resource locators.

A method (and structure) for enacting changes to a document containing a template-based program that transforms tree-structured data from a first tree-structured data into a second tree-structured data, including providing an interface to permit selection of a document containing the template-based program, constructing a model of the template-based program in the selected document by parsing elements of the template-based program into a corresponding logical construct having a match condition and at least one generator, where the match condition determines whether an element in the first tree-structure data is to be processed by one or more of the at least one generator, and displaying a representation of the model to the user.

A processor is connected to a storage device storing an incoming e-mail, a dependency database, and code for a calendar application. The dependency database can be built from an e-mail corpus containing a plurality of natural language e-mails containing scheduling information. The incoming e-mail is parsed by the processor to build a dependency tree containing word pairs from the e-mail that are found in the dependency tree. The word pairs are stored as dependency pairs in a tree structure in the dependency tree. A probability sum for the dependency tree is calculated to determine if the e-mail contains scheduling information. If the probability sum exceeds a predetermined value, the e-mail is assumed to contain scheduling information and the scheduling information is extracted from the dependency tree and exported to the calendar application.

In one embodiment of the present invention, a rule compiler can compress a plurality of rules to be parsed over a block of data into one state table tree structure. In one embodiment of the present invention, rue parsing over the block of data includes selecting a unit of the block of data, indexing into a state table of the state table tree using the selected unit. The state table indexed into can be used for determining whether a decision regarding the block of data can be reached based on the indexed entry, and for selecting a next state table indicated by the indexed entry if the decision regarding the block of data cannot be reached.

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.

A software tool for computing and displaying differences in at least two object oriented workspaces compared and for reconciling the differences by merging the workspaces has at least one object association graph used as a modeled template for defining the nodes and node paths involved in the difference computation, a data tree structure for displaying element hierarchy symmetrically in each of the compared workspaces, an executable function for merging the separate workspaces to reconcile the found differences, and an interactive user display window for visualizing and directing the process. The tool is characterized in that a user monitors the data structures in each workspace from the display window and executes the difference and merge operations through interaction with the data structure.

A control mechanism is established between a network processor and a tree search coprocessor to deal with latencies in accessing the data such as information formatted in a tree structure. A plurality of independent instruction execution threads are queued to enable them to have rapid access to the shared memory. If execution of a thread becomes stalled due to a latency event, full control is granted to the next thread in the queue. The grant of control is temporary when a short latency event occurs or full when a long latency event occurs. Control is returned to the original thread when a short latency event is completed. Each execution thread utilizes an instruction prefetch buffer that collects instructions for idle execution threads when the instruction bandwidth is not fully utilized by an active execution thread. The thread execution control is governed by the collective functioning of a FIFO, an arbiter and a thread control state machine.

A hierarchy multicasting system (100) includes multiple clients coupled together in a tree structure (102) through a routing process (300). Data is transmitted from a data source (101) to a root node (112) of the tree structure (102). The root node (112) uses its up-link capacity to reflect the data to its children (122, 124). Through various filtering steps, the routing process (300) optimizes the tree structure (102) for efficiency and reliability. In addition, users (612, 622) behind different firewalls (610, 620) may communicate with each other. Therefore, they can be connected in the same hierarchy multicasting tree structure (600).

To satisfy the needs for stringent control of a record of revisions made to, for example, laws, ordinances, legal documents, patent specifications, industrial codes, documents regarding financial products, specifications, instruction and other manuals, office regulations, bylaws and the like and for strict control of revision histories of editing in the field of publishing and the like. To provide a system for constructing, in a storage device of a computer, data expressing a document to be revised as an XML document, in which a volume, a chapter, a clause, an item, a section, a sub-section, a paragraph and the like of a document to be revised are expressed as a tree structure, assigning to an element corresponding to a branch node of tree structured data a set of a unique revision ID and an attribute representing a type of the revisions written in a list structure every time a revision is made and saving in the element the original document prior to the revision so that a revision operation of the element is performed using the information.

A system for use in developing a voice application, including a dialog element selector for defining execution paths of the application by selecting dialog elements and adding the dialog elements to a tree structure, each path through the tree structure representing one of the execution paths, a dialog element generator for generating the dialog elements on the basis of predetermined templates and properties of the dialog elements, the properties templates received from a user of the system, each of said dialog elements corresponding to at least one voice language template, and a code generator for generating at least one voice language module for the application on the basis of said at least one voice language template and said properties. The voice language templates include VoiceXML elements, and the dialog elements can be regenerated from the voice language module. The voice language module can be used to provide the voice application for an IVR.

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 tracing profiling information using per thread metric variables with reused kernel threads is disclosed. In one embodiment kernel thread level metrics are stored by the operating system kernel. A profiler request metric information for the operating system kernel in response to an event. After the kernel thread level metrics are read by the operating system for a profiler, their values are reset to zero by the operating system kernel. The profiler then applies the metric values to base metric values to appropriate Java threads that are stored in nodes in a tree structure base on the type of event and whether or not the kernel thread has been reused. In another embodiment non-zero values of thread level metrics are entered on a liked list. In response to a request from a profiler, the operating system kernel reads each kernel thread's entry in the linked list and zeros each entry. The profiler can then update the intermediate full tree snapshots of profiling information with the collection of non-zero metric variables.

The present invention provides a client-server computing system capable of validating cached data having a data store, a server, a cache, a transformation engine, a cache monitor, and an object dependency mapper. The transformation engine transforms data into a format suitable for a client application based on a set of transformation rules. The cache monitor ensures that cached objects are valid when changes to data in the data store are detected by the server. The object dependency mapper automatically and continuously determines the dependencies between data in the data store and sets of transformation rules. Data in the data store is represented as a tree structure. The cache monitor determines the validity of the cached objects based on the tree structure and the dependencies between data and the transformation rules.

In a system for managing the information for the network components including hardware devices such as routers, switches, and the like, an apparatus and method is disclosed, which allows not only the current network configuration information but also the future network configuration information to be stored, wherein the future network configuration information reflects the future facilities planning considerations and may be derived from the current network configuration information. The system includes a directory server on which a current map tree and a temporary map tree are stored, wherein the current map tree contains the current network configuration information organized into a tree structure, and the temporary map tree only contains the information for any components, organized into a tree structure, for which the configuration changes are expected to occur in the future. The future network configuration information may be obtained by merging the information in the current map tree together with the information in the temporary map tree that may be setup up to any future time as specified. The system further includes means that responds to the request for the network configuration information that is applicable to any future time from any external requester, such as applications or users, for issuing a request to search the trees including the directory entries that reside in the current map tree and temporary map tree stored in the directory server and obtaining the configuration information as requested, and means for merging the configuration information obtained from the current map tree together with the temporary map tree to generate the network configuration information that is applicable to the particular time and returning the generated network configuration information to the requester.

A language model structure for use in a speech recognition system employs a tree-structured network model. The language model is structured such that identifiers associated with each word and contained therein are arranged such that each node of the network model with which the language model is associated spans a continuous range of identifiers. A method of transferring tokens through a tree-structured network in a speech recognition process is also provided.

Methods and apparatuses to determine the temperature profile of a pressurized wellbore using a fiber optic cable and an anchor are disclosed. Furthermore, a pressurized wellhead spool that couples to a standard Christmas tree structure on a well head to facilitate the injection of fiber optic cable into an oil and gas well is disclosed. The wellhead spool is portable and may be connected to fiber optic cable already located at the site, for quick connection to on-site instrumentation. A method of using the apparatuses disclosed to measure wellbore temperature at multiple depths of investigation is also disclosed.

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.

A method of tracking modifications of specific program objects during the runtime of a computer program, facilitates the creation of general UnDo and ReDo operations, as well as the support of an object-specific UnDo operation. When an object is modified, the object is interrogated to collect information about it and how the modification may be undone. The collected information is stored in a highly unbalanced data-tree structure. Since the interrogation of an object is a characteristic of the programming language, and not necessarily a modification of the program being executed, the present method may be easily applied to different existing programs with minimal, if any, modification to the existing programs.

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.

Some embodiments provide a method for storing a document. The method stores a content stream representation of the document that includes an ordered stream of code representations for primitive elements of the document. Each code representation of a primitive element has an index that indicates the order in the content stream of the primitive element representation. The method stores an object representation of the document that includes a set of object nodes arranged in a tree structure. Each object node references a range of indices in the content stream.