2386 results about "Tree structure" patented technology

An environmental control system controls monitoring and operation of a multiplicity of disparate environmental control devices by determining an appropriate configuration for each control device and communicates corresponding monitoring and control commands to each device in accordance with its corresponding communication protocol over a selected I/O port. An operational instruction set includes a structural definition of an enterprise facility in which devices are defined by personality modules and communicate with a system host in accordance with a protocol defined in a protocol module. Facility implementation is defined by a node tree structure which collects suitable protocol nodes under a corresponding I/O interface port node. Device (personality) nodes are collected under corresponding protocol nodes, and data point nodes depend from their corresponding device nodes. Data points nodes are individually accessible by merely traversing the node tree using a URL-like notational structure, allowing off-site users to control and monitor environmental devices by issuing commands in the form of a URL.

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 hierarchical network management system (NMS) in which a plurality of NMS managers, each responsible for different portions or aggregations of a communications network, are logically arranged in a tree structure. The NMS managers are further organized into various sub-groups. The NMS managers within each sub-group monitor the status of one another in order to detect when one of them is no longer operational. If this happens, the remaining operational NMS managers of the sub-group collectively elect one of them to assume the responsibility of the non-operational NMS manager. The NMS is thus "self-healing" in the sense that one NMS manager can dynamically, without operator intervention, assume the responsibilities for another NMS manager.

A method of providing multicast routing for use in ad hoc broadcast networks, such as wireless and mobile networks. The method is described within a protocol referred to as core-assisted mesh protocol, or CAMP. The method departs from traditional tree-structured multicast protocols and utilizes multicast meshes in which the network need not be flooded with control or data packets to establish routing paths. Each router configured for CAMP is capable of accepting unique packets arriving from any neighbor in the mesh, wherein packets are forwarded along reverse shortest paths to the receiver. Multiple cores may be defined for a group wherein the loss of a single core does not prevent packet flow. Routers for sender-only hosts are allowed to join the multicast mesh in simplex mode, and in certain cases may join without the sending of a join request.

In a system where client and server components (or actors) of an application are organized as complementary hierarchical graphs, a method and apparatus for creating server applications and dynamically deploying server applications on a client system are described. The server graph comprises, as a minimum, server nodes corresponding to the union of all possible client nodes, whereas each client graph corresponds to a subset of the related server nodes. The server graph is a compound tree from which all possible combinations of client trees can be dynamically created. At a desired time, for example, when the client requests for a client tree representation, the server creates the client tree representation using a peeling process to determine which nodes in the server actor tree should be included in the client tree representation. The peeling process involves determining the server actor nodes that meet a set of criteria for the particular client. The generated client tree structure contains objects that are shipped via a secured communication interface to the client in a tree structure.

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 using inheritance for the configuration, management, and/or monitoring of computer applications and devices via a computer network are disclosed. The method generally comprises calculating control settings to be enforced by an end node corresponding to a device of the network of devices, the control settings being calculated by the corresponding device. The control settings to be enforced by the end node are applicable to the device and the resources of the device. The calculation is performed by the end node or device by accessing data stored in a network directory defining a hierarchical tree structure containing nodes corresponding to the network of devices and defining control settings corresponding to and to be enforced upon the resources available to the devices. The control settings corresponding to the resources of each device are selectively inherited down the hierarchical tree structure of the network directory.

A method of storing collected data on a wireless device. User interaction with a wireless device and/or the performance of the wireless device is monitored and data related thereto collected. The collected data may be structured into a tagged hierarchical structure comprising a plurality of events that are separate and independent from one another. Each event may describe a specific application with a plurality of attributes. The tagged hierarchical structure formed as a tree structure is translated into a syntax generic language. The result may be formed into a compact format using a zipped format and/or a binary-equivalent format and then stored and transmitted to a central location (e.g., a server) for statistical analysis processing. The server transforms the received data into expanded format and forms a hierarchical tree structure for each event and its attributes. The result is processed for producing a statistical analysis of the collected data.

Disclosed is a system, method, and program for generating a data structure in computer memory for storing strings, such as words in a dictionary. Each string includes at least one character from a set of characters. An arrangement of nodes is determined to store the characters such that the arrangement of the nodes is capable of defining a tree structure. An array data structure is generated to store the nodes. The array includes a row for each node and a column for each character in the set of characters. A non-empty cell identifies a node for the character indicated in the column of the cell that has descendant nodes in the row indicated in the cell content for the node. The array data structure is processed to eliminate at least one row in the array data structure to reduce a number of bytes needed to represent the array data structure. In this way, the array data structure following the processing requires less bytes of storage space then before the processing.

A method for applying a strategy to a dataset in a data mining system to address a business problem, comprising: receiving at least one conditional expression defining the strategy from a user through a graphical user interface (“GUI”) displayed on a display screen of the data mining system; applying the conditional expression to the dataset to split the dataset into segments; displaying the segments as nodes in a tree structure on the display screen; receiving a calculation expression for operating on one or more values in one or more of the segments; applying the calculation expression to one or more of the segments to generate one or more respective calculated values; displaying the one or more calculated values in respective nodes of the tree structure; receiving a treatment expression for operating on the calculated values; applying the treatment expression to one or more of the calculated values to generate respective responses to the business problem; and, displaying the responses in respective nodes of the tree structure to thereby address the business problem.

Techniques for designing stylesheets using meta-tag and/or associated meta-tag information are described. In one embodiment, a graphic user interface environment including at least two displays is provided. One of the displays is from a commonly used browser or an application to display a target file including a plurality of objects and the other display is used to facilitate the editing of a tree structure. Each of the nodes in the tree structure is associated with one of the objects by associated meta-tag information. Based on the tree structure, a source can be generated. Together with the source file, the stylesheet can be designed in accordance with the displayed target file.

A data structure, added to a modified form of the B^link-tree data structure, tracks delete states for nodes. The index delete state (D_X) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The D_X state is maintained globally, outside of the tree structure. The data delete state (D_D) indicates whether it is safe to post an index term for a new leaf node. A D_D 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.

This invention discloses a method for synchronizing a plurality of devices, including: obtaining, by a first device, an extended address of an informational node of a plurality of informational nodes of a second device, the plurality of informational nodes arranged in a hierarchical tree structure; and utilizing the extended address to locate the informational node amongst the tree structure to enable synchronization of the informational node; wherein the extended address includes a hierarchical location of the informational node. This invention further discloses a system, client and server for data sync, and the folder-level data sync can be implemented by using the method of this invention.

An network of proxy servers overlaying a wide area network that comprises a plurality of autonomous systems establishes a hierarchial multicast tree overlay network structure for providing streaming live media from media sources to end users. The tree structure is constructed and maintained by peer-to-peer negotiations between proxy servers that identify proxy servers and data paths that optimize utilization of network resources based upon minimizing costs as a function of loadings. The proxy servers maintain information about the status of neighboring proxy servers, and exchange messages to redirect join requests to more suitable proxies, to redistribute portions of their own loads when they are overutilized, and to consolidate loads when they are underutilized.

A method of caching commands in microprocessors having a plurality of arithmetic units and in modules having a two- or multidimensional cell arrangement is provided. The method includes combining a plurality of cells and arithmetic units to form a plurality of groups, assigning a cache unit to a group, and connecting the cache unit to a higher level unit via a tree structure. The cache unit may send requests for required commands to the higher level cache unit, which may return a command sequence including the required command, if the higher level cache unit holds the first command sequence including the required command in the higher level cache unit's local memory.

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.

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.

Methods and devices for accelerating webpage rendering by a browser store document object model (DOM) tree structures and computations of rendered pages, and compare portions of a DOM tree of pages being render to determining if portions of the DOM tree structures match. If a DOM tree of a webpage to be rendered matches a DOM tree stored in memory, the computations associated with the match DOM tree may be recalled from memory, obviating the need to perform the calculations to render the page. A tree isomorphism algorithm may be used to recognize DOM trees stored in memory that match the DOM tree of the webpage to be rendered. Reusing rendering computations may significantly reducing the time and resources required for rendering web pages. Identifying reusable portions of calculation results based on DOM tree isomorphism enables the browser to reuse stored webpage rendering calculations even when URLs do not match.

A text-mining system and method automatically extracts useful information from a large set of tree-structured data by generating successive sets of candidate tree-structured association patterns for comparison with the tree-structured data. The number of times is counted that each of the candidate association patterns matches with a tree in the set of tree-structured data in order to determine which of the candidate association patterns frequently matches with a tree in the data set. Each successive set of candidate association patterns is generated from the frequent association patterns determined from the previous set of candidate association patterns.

A process and system for profiling code executing on a data processing system is provided. Event-based trace data is recorded in response to selected events, and the event-based trace data includes an indication which code is being interrupted. The trace data may be processed to identify a thread or method that was executing during the event. A periodically occurring event is also detected, and a call stack associated with the profiled code is identified in response to detection of the periodically occurring event, such as a timer interrupt. The call stack is examined to identify each routine that is currently executing during the periodically occurring event, and the trace data is recorded with the call stack information. The trace data from the recorded events and the trace data from the call stacks are processed to generate a tree structure in which the nodes indicate the call structure of the routine information from both the trace events and the call stacks.

A method and system extends the functionality of the Open Mobile Alliance (OMA) Device Management (DM) standard to manage vendor specific configuration parameters and settings. An OMA DM structure is provided as an extension to the tree structure of the OMA DM standard. The OMA DM extension allows selected vendor specific parameters and settings to be managed under the OMA DM protocol.

A system and method is provided for efficiently adapting information content for an electronic device. A normalizer includes a template normalizer for matching and applying a document tree to a template tree, and applying changes to the document tree. If the template normalizer does not find an appropriate template match, an automatic normalizer is utilized. The automatic normalizer utilizes weighting heuristics and pattern recognition with formatting rules to partition content into folders. The automatic normalizer can also utilize embedded normalization markup in the information content to assist in normalizing the information content. Information content can be represented by document object tree. A document object tree is created by storing information relating to the information content into arrays. The stored information describes a document object tree structure and tree dependencies as a mutable object.

A dynamically updateable graphical index for rapidly scanning through content available on a website. The index comprises user-selectable levels within branches of a hierarchical tree structure representing various categories and sub-categories of content available on the website. All content on the website is associated with meta-data. The categories and sub-categories correspond to this meta-data. As content is added to the website, the content's associated meta-data is dynamically incorporated into the index and is searchable within the hierarchical tree structure displayed to the user.

A method and system of data backup for a computer system is disclosed. Full and incremental backups of data stored to a first storage device coupled to the computer system are stored to a backup storage device coupled to the computer system. The backup storage device may be remotely located and coupled via a network. Data representative of the relationship of each incremental backup to its respective parent backup is stored in a dependency data structure, preferably a tree-like structure. Different types of incremental backups may be performed to provide different data granularity. When two or more storage media are used in a rotational manner, each medium always contains a complete backup. The backup storage device is automatically managed by paring at least one of a full and incremental backup at the backup storage device automatically in accordance with a plan. The plan is preferably configured to manage an amount of available storage space at the backup storage device. When restoring data from a backup, data to be restored that is stored in a parent backup is automatically located and restored. Stored backups may be encrypted and decrypted when restored.

A web crawler system has an automatic website crawler and a virtual browser that provides script related information to the website crawler. The virtual browser transforms an HTML document included in a web page of the website into an XML document, and builds a document object model containing document objects in a tree structure based on the XML document. The virtual browser extracts from the DOM scripts that are potentially executable, and executes the extracted scripts using a browser object model provided for the virtual browser containing objects and methods and properties that are used for script execution so as to capture script related information generated by execution of the scripts.

A distributed data object sharing system in which a plurality of data objects are replicated across computing nodes. The system may be operable to identify replica conflicts for the data objects and modify tree structures to reflect the conflicts. In one embodiment, a tree structure may represent a plurality of replica versions. Replica versions in conflict with each other may be represented as child versions at branch points in the tree.

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 designer tool that facilitates design of an object model. The tool takes as input a computer-readable representation of a graph of objects (e.g., classes), and creates automatically one or more diagrams that depict these classes as editable trees showing their relationships and properties. These graphs naturally have a tree-like structure which is exploited by the approach. The design tool system includes a layout component that receives as input one or more of the graphs, and converts the one or more graphs into the editable treelike structure. The system further comprises a presentation component that presents the editable treelike structure as a treelike structure diagram, and facilitates user interaction therewith. The tool can be used for opening, editing and saving existing object model files or to create new ones.

A method of performing a three-way merge includes receiving first, second, and third versions of a structured document containing first, second, and third pluralities of elements respectively; deserializing the first, second, and third versions to generate first, second, and third tree-structured data models respectively representing the first, second, and third versions; generating an identifier for each node of each data model that is unique within the data model by applying identifier determination rules to a context describing the element corresponding to the node; comparing each identifier in the first data model with each identifier in the second data model to identify each node in the first data model not having matching identifiers with any node in the second data model and to link each pair of nodes having matching identifiers; and applying comparison rules to the contexts of each linked pair of nodes to identify differences therebetween.

An input/output (I/O) method, system, and computer program product are disclosed. An incoming I/O request is received from an application running on a processor. A tree structure including processor-executable instructions defines one or more layers of processing associated with the I/O request. The instructions divide the data in the I/O request into one or more chunks at each of the one or more layers of processing. Each instruction has an associated data dependency to one or more corresponding instructions in a previous layer. The instructions are sorted into an order of processing by determining a location of each chunk and data dependencies between chunks of different layers of processing. One or more instructions are inserted into a schedule that depends at least partly on the order of processing. The I/O request is serviced by executing the instructions according to the schedule with the processor according to the order of processing.