662 results about "Tree (data structure)" patented technology

A method and apparatus for performing classification in a hierarchical classification system performing caching are described. In one embodiment, the method comprises walking a classification tree in the hierarchical classification system to determine whether an incoming flow matches a class in the classification tree, and performing a lookup on a cache storing a data structure of multiple classes of one classification type to compare the incoming flow with multiple classes at the same time to determine whether the incoming flow matches one of the classes.

Method, system, and computer program product for implementing derivative operators at an interactive rate in computer graphics systems. In an embodiment, a data structure representing the operation of one or more computer program statements is received by a compiler and transformed into a tree data structure. Nodes of the tree data structure that determine derivative information are marked, and a transform rule is applied to the marked nodes to transform the tree data structure into a data structure that can be implemented with graphics hardware interface program statements. In one embodiment of the invention, the compiler transforms shading language statements into graphics application programming interface statements that can be implemented with multiple passes through a graphics pipeline. It is a feature of the present invention that it can be implemented on a wide range of computer graphics systems.

A projected management server coupled with a computer network, such as the Internet. A spec server may also be incorporated into the project management environment for completing specs, generating requests for price quotations, purchase orders and the like. A project tree represents project management objects, which can be of any type. Object types are defined for each particular implementation of the system. Typical examples of project management object types include organizational entities, work-groups, people, projects, budgets, tasks, costs, timesheets, specs, requisitions, purchase orders, and to-do lists. The objects are generally organized in a hierarchical data structure referred to as a project management tree or project tree. Each object in a project tree comprises a number of methods that describe the way the object behaves. Such methods include, for example, methods that describe the way the object is added to the tree, edited, deleted from the tree, and archived.

An impact analysis software system is described which resides on a computer connected to a network in an enterprise. The system analyzes the impact of network events on the network, and includes a number of modules, including a number of data source adapters for interfacing with external data sources to thereby allow access by the system to enterprise-related data in the external data sources. The system further includes an impact analysis data structure populated with data accessed from the external data sources and defining relationships between the enterprise-related data. One or more action tree data structures comprise a routine which, when executed, acts upon the relationships defined by the impact analysis data structure to handle events. A message processor reads the network events and select one of the action tree data structures to handle each read network event.

A method for searching a document directory hierarchy which partitions a user-initiated search. The document directory hierarchy comprises a plurality of document directories stored in a tree data structure. Each of the plurality of document directories corresponds to a category within a class hierarchy and stores at least one document. A user query comprising one or more search terms is accepted from an input device. If the user query includes a user-selected category, a directed search is performed. However, if the user query does not include a user-selected category, an undirected search is performed. The directed search confines the search to one of the plurality of document directories corresponding to the user-selected category, and returns relevant documents within the user-selected category. The undirected search is performed within each of the plurality of document directories within the document directory hierarchy, and returns relevant categories corresponding to document directories within the document directory hierarchy.

A distributed collection of web-crawlers to gather information over a large portion of the cyberspace. These crawlers share the overall crawling through a cyberspace partition scheme. They also collaborate with each other through load balancing to maximally utilize the computing resources of each of the crawlers. The invention takes advantage of the hierarchical nature of the cyberspace namespace and uses the syntactic components of the URL structure as the main vehicle for dividing and assigning crawling workload to individual crawler. The partition scheme is completely distributed in which each crawler makes the partitioning decision based on its own crawling status and a globally replicated partition tree data structure.

Methods, apparatuses and systems facilitating hierarchical network traffic classification and resource allocation schemes. In one embodiment, the present invention provides traffic classification data structure facilitating creation and configuration of multi-dimensional, hierarchical network resource allocation schemes. The present invention features a hierarchical network traffic classification scheme that allows users to logically embed (or otherwise associate) one or more reference trees within selected traffic class nodes of a given traffic classification tree. In one embodiment, an administrator can create a pool of referenceable traffic classification trees and select such trees or sub-trees from the pool to achieve a variety of different traffic classification configurations. The present invention, in one embodiment, also facilitates the implementation of a system or domain-level workflow interface that features managed access links as configurable objects as opposed to the network devices operating on the access links.

A column-store database computer system responsive to database requests for the update and retrieval of data from within a stable data table providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the computer system and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table.

A data structure, added to a modified form of the Blink-tree data structure, tracks delete states for nodes. The index delete state (DX) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The DX state is maintained globally, outside of the tree structure. The data delete state (DD) indicates whether it is safe to post an index term for a new leaf node. A DD state is maintained in each level 1 node for its leaf nodes. Delete states indicate whether a specific node has not been deleted, or whether it may have been deleted. Delete states are used to remove the necessity for atomic node splits and chains of latches for deletes, while not requiring retraversal. This property of not requiring a retraversal is exploited to simplify the tree modification operations.

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.

Mechanisms and methods for traversing trees are disclosed. A novel data structure for modeling a node that includes a unique node counter also is described. In certain embodiments of the inventions the unique node counter is a timestamp of sufficient granularity to render each timestamp in the tree unique. A node counter, in conjunction with the lineage of a specified continuation node may be used to locate an appropriate starting point within a tree in a continuation call when the specified continuation node no longer exists in the tree.

A method is provided for processing tree like data structures in a streaming manner. An initial context of name / value bindings is set up. A tree of objects is constructed. Each element in the tree of objects is represented as a function object that accepts a context parameter and a target parameter that it can send a stream of start, content, and end events to represent tree output. The parse tree of objects is examined for element names that are recognized as commands. The commands are converted to special function objects that implement command's semantics. Other elements, that are not recognized as commands, are mapped to a default function object.

A 3D graphical user interface includes a two-dimensional ground-plane layout representing the relationship between one or more leaf elements of a tree data structure. The interface further includes at least one building-like structure, each of the at least one building-like structure corresponding to a respective one of the one or more leaf elements. Each of the at least one building-like structure provides a summary of media associated with the respective one of the more leaf elements corresponding to at least one building-like structure.

Embodiments provide a strategy for computing the motions of a mobile robot operating in an obstacle-laden environment without requiring prior knowledge of the distribution of obstacles in the environment or knowing the trajectory of a target tracked by the robot. Embodiments provide an algorithm that governs the motion of the observer robot based on measurements of the target's position and the location of obstacles in the environment. The algorithm computes a description of the geometric arrangement between the target and the observer's visibility region produced by the obstacles and computes a continuous control rule using this description. Embodiments employ an escape-path tree data structure to categorize the target's possible modes of escaping from the observer robot's sensors and use the escape-path tree to determine the target's shortest escape path.

System, computer-readable medium and method are provided for differencing (diffing) first and second sets of 3D voxel data to identify differences that may exist between the two sets. The system includes a 64-bit processor, a memory, and a display. The memory is loaded with the two sets of 3D voxel data arranged in a 64-tree data structure, wherein an occupied or empty state of each voxel is indicated by 1 bit. The processor executes a 3D voxel diffing algorithm including steps of: (i) aligning the first and second sets of 3D voxel data; (ii) making a one-to-one comparison between each voxel in the first set and a corresponding voxel in the second set to create a diff model that records differences found between the first and second sets; and (iii) displaying the content of the diff model on the display.

A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties.

Disclosed is a method for data synchronization in a web-based transmission device management system, in which managing data requiring synchronization between a web server and a client is constructed as a tree data structure, and a change flag for judging a data change is easily set. The web server increases a second event number by a certain degree whenever an event datagram is transmitted to the client, and the client judges whether or not the event datagram is lost by comparing the second event number and a first event number stored by the client whenever an event datagram is transmitted from the web server. If the event datagram is not lost, the client increases the first event number by a certain degree and performs data synchronization using the received event datagram. However, if the event datagram is lost, the client transmits every checksum of the leaf nodes in its tree data structure in one request datagram to the web server, and performs data synchronization by receiving changed data from the web server. Therefore, a loss of data is recognized promptly and precisely, and change of data on the web server also can be recognized promptly.

Transformations of digital records are used as lowest level inputs to a tree data structure having a root in a core system and having nodes computed as digital combinations of child node values. A combination of root values is published in a permanent medium. Signature vectors are associated with the digital records and have parameters that enable recomputation upward through the tree data structure to either a current root value or to the published value. Recomputation yields the same value only if a candidate digital record is an exact version of the original digital record included in the original computation of the value.

Techniques to present hierarchical information as orthographic projections are described. An apparatus may comprise an orthographic projection application arranged to manage a three dimensional orthographic projection of hierarchical information. The orthographic projection application may comprise a hierarchical information component operative to receive hierarchical information representing multiple nodes at different hierarchical levels, and parse the hierarchical information into a tree data structure, an orthographic generator component operative to generate a graphical tile for each node, arrange graphical tiles for each hierarchical level into graphical layers, and arrange the graphical layers in a vertical stack, and an orthographic presentation component operative to present a three dimensional orthographic projection of the hierarchical information with the stack of graphical layers each having multiple graphical tiles. Other embodiments are described and claimed.

A method of predicting consumer response to given content. The process begins with the step of collecting a dataset of consumer response to the content, each data item including values for a selected set of segmentation variables related to past consumer behavior. The dataset contains at least twice the number of entries required to provide statistical validity. The process continues by constructing a classification tree structure using the dataset, in which the dataset is subdivided into learning and validation datasets of substantially equal size. Also, the criterion for each successive split is the lowest entropy of segmentation variables not employed to the point of such split. Each successive split of the learning dataset is performed only if that split produces child nodes statistically different from one another, and an identical split of the validation data set produces child nodes statistically similar to child nodes produced on the learning dataset. The system estimates consumer responses by first receiving a data item related to a new consumer, including values for the segmentation variables and then computing the likely response of the new consumer to the content, employing the classification tree data structure.

In a data communication system, a client and a server perform a data communication, in particular to provide the client with a instruction data set in response to a content data request message made by client. An instruction format configuration file contains a tree data structure having a plurality of instruction format nodes, each instruction format node indicating a particular combination of instruction elements constituting a particular instruction format and having associated with it a node selection criterion. The program extracts and determines properties from the content data request issued by the client. The program searches the tree data structure with the determined properties in order to find an instruction format node, whose associated node selection condition matches the properties. Thus, the instruction data set returned to the client can be provided in a flexible manner.

Embodiments of the present invention enable navigation in a web browser to be supported by a session browse history. In embodiments, a session browse history may be an n-ary tree data structure. Embodiments of the present invention integrated into a browser enable a user to access a session browse history tree via browser UI displays such as a navigation bar, a main tool bar, or a combination thereof. In embodiments, a session browse history tree may be exported to persistent storage, and may be imported into and integrated with an active session browse history tree. In embodiments, a stored session browse history tree may be updated in response to handling a caught browser event such as a “browser refresh” event, and in response to processing a user-initiated “go to” request from the browser UI. In embodiments, a currently stored session browse history tree may be returned in response to a request received from the browser UI.

A system, computer readable medium, and method are disclosed for performing a tree traversal operation. The method includes the steps of executing, via a processor, a tree traversal operation for a tree data structure, receiving a transformation node that includes transformation data during the tree traversal operation, and transforming spatial data included in a query data structure based on the transformation data. Each node in the tree data structure is classified according to one of a plurality of nodesets, the plurality of nodesets corresponding to a plurality of local coordinate systems. The processor may be a parallel processing unit that includes one or more tree traversal units, which implement the tree traversal operation in hardware, software, or a combination of hardware and software.

A large-scale data processing system, a large-scale data processing method, and a non-transitory tangible machine-readable medium are provided. The large-scale data processing system comprises an interface and a processor. The interface accesses a multi-dimensional data model, wherein the multi-dimensional data model comprises a plurality of dimensions, the dimensions form a multi-dimensional space of measures, each dimension is a single space comprising a plurality of members with a common set of attributes, and each measure is a data element organized and accessible through the multi-dimensional space of the cross-product of all dimensions. The processor builds at least one Tree Object (TO), wherein the TO is derived by converting the multi-dimensional data model into an N-level tree data structure according to a level order of N attributes, each tree node in the TO meets all conditions of attributes for all ancestor nodes, and N is a positive integer.

The invention discloses a method and device for visualization of layering data. The method and device includes generating a tree data structure in a data set HD according to internal layering relation, generating a fan-shaped structure through a self-adaptive radioactive ring algorithm by each node in layers lower than node threshold in the generated tree data structure, enable each node in layers higher than or equal to the node threshold in the generated tree data structure to generate a sub radioactive ring, namely a necklace ring through a necklace ring algorithm in interaction mode and mapping and displaying the radioactive ring and the necklace ring on a display plane. The method and device resolves the problem that space utilization rate of a central area in the radioactive ring is low, peripheral areas are crowd, and fan area is small and cannot be recognized by naked eyes in the existing visualization method. The method and device achieves the effect that data layering structure is shown to users to the largest extent in limited space and enables the users to obtain detail information on any layer and structure information between layers by means of interaction.

A method and apparatus for coding positions of data such as coefficients are described. In one embodiment, the method comprises coding data in a vector of data based on indications of whether the data is zero or non-zero identified using a tree data structure and producing a bit stream based on coded data.