85 results about "Tree representation" patented technology

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 method and system are provided for automated diagnosis for a system. In one embodiment, the method includes providing a fault tree representation of the system, the fault tree specifying propagations of errors generated in the system by problems to produce error reports. At least some of the propagations have timing information associated therewith. One or more error reports having timing information associated therewith are received and analysed using the fault tree representation to determine a suspect list of problems. The suspect list contains those problems that could have generated errors to produce the received error reports compatible with the propagations in the fault tree, and consistent with the timing information associated with the propagations and the received error reports.

A method of displaying data, comprising the steps of defining a set of documents, each document having a unique identification and optionally citing other documents by their respective unique identification, the set being defined by selecting at least one starting document, with the set further comprising documents being included based on predetermined relationships with at least one other document in the set; generating a hierarchal tree representation of the at least one subset of documents, a subset inclusion and hierarchy thereof being defined by said predetermined relationships between documents within the set; and selectively focusing on a node of said hierarchal tree, to define a graphic display representation of at least a portion thereof to emphasize the selected focus while depicting the hierarchal relationships.

A method and system are provided for performing automated management on a system. The method includes providing a fault tree representation of the system. The fault tree specifies propagations of errors generated in the system by problems to produce error reports. The method further includes receiving one or more error reports which are analyzed using the fault tree representation to determine one or more suspected problems. The suspected problems represent those problems that could have generated errors to produce the received error reports compatible with the propagations in the fault tree. The method further includes deconfiguring or reconfiguring one or more components in the system in response to the determination of the suspected problems.

One embodiment of the invention provides a method for simulating the operation of a system. The method includes providing a fault tree representation of the system. The fault tree defines a set of problems that may occur in the system, and specifies propagations in the system whereby a problem may create one or more errors that may in turn be detected by error detectors to produce corresponding error reports. The fault tree representation allows the presence of a problem in the system to be simulated, and the set of error reports resulting from the simulated problem to be determined. This simulation can be repeated for different problems to compare the sets of error reports potentially produced by the different problems.

A client-side editing application allows advertisers and / or customer service representatives to easily and efficiently view, navigate, and edit ad accounts, even those with large numbers of campaigns, ad_groups, keywords and ad creatives. Information viewable in a user interface screen may be limited in scope by a node selection of a hierarchical tree representation of ad account information and limited in type by a tab selection. Ad information, represented in table rows, may be cut, copied and / or moved among different ad groups and ad campaigns.

Techniques are disclosed for generating a representation of an access control list, the representation being utilizable in a network processor or other type of processor to perform packet filtering or other type of access control list based function. A plurality of rules of the access-control list are determined, each of at least a subset of the rules having a plurality of fields and a corresponding action, and the rules are processed to generate a multi-level tree representation of the access control list, in which each of one or more of the levels of the tree representation is associated with a corresponding one of the fields. At least one level of the tree representation other than a root level of the tree representation comprises a plurality of nodes, with at least two of the nodes at that level each having a separate matching table associated therewith.

A distributed multiresolution modeling system has a database management system on a first server. The database management system provides access to a hierarchical tree representation of surfaces of geometric models. Client programs executing on computers connected to the first server accesses and updates the model by traversing the hierarchical tree representation until a terminating criterion has been satisfied. During the traversal the client programs request quad-tree nodes from the database management system.

Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

A method of implementing a user integrated circuit (IC) design in a tree representation includes the step of introducing the tree representation for the user IC design in a partitioned manner including at least one sub-design to form a design abstraction of the user design. At least one sub-design can include a sub-design providing for multiple levels of implementation hierarchy. The method can further include the step of traversing the design abstraction in a top-down fashion to provide functions selected among floor planning, port assignment, and timing budgeting for at least one sub-design, and the step of traversing the design abstraction in a bottom-up fashion to facilitate at least one among resolution of resource conflicts and parallel processing of multiple sub-designs. Traversing the design abstraction in the bottom-up fashion can facilitate a re-budgeting of timing for the integrated circuit design.

A method for improving a thoracic diagnostic image for the detection of nodules. Non-lung regions are removed from the diagnostic image to provide a lung image. Vessels and vessel junctions of the lung(s) in the lung image are enhanced according to a first-order partial derivative of each of a plurality of voxels of the lung image. A vessel tree representation is constructed from the enhanced vessels and vessel junctions. The vessel tree representation can be subtracted from the lung image to enhance the visibility of nodules in the lung(s).

Computer systems and methods for call-stacks representation for easier analysis of thread dumps. Execution data for a number of process threads are accessed by a parser in a thread dump wherein execution data includes a number of call-stacks. Process threads have corresponding call-stacks comprising information about active program subroutines of the thread. Threads are grouped in a number of sets that include threads with one or more actions in common. The sets correspond to a same action or subroutine in the call-stacks of the grouped threads. A tree representation of the execution data is generated based on the active actions in the call-stacks. In the tree representation, a first set of grouped threads is a child to a second set of grouped threads when the action corresponding to the first set is invoked by the subroutine corresponding to the second set.

A display portal page in a web-based environment. This display portlet presents the message communication information between the portlets that are currently running on that portal page. The displayed message communication information indicates the portlet that is the source of a transmitted message and displays one or more portlets that receive the message. The visual representations can be of various formats such as a spacial display or a tree representation. Each communicated message has a stored record identifying the transmitting portlet and any portlet that receives the message.

A computer performed method models a spatial index having n spatial regions defined in a multidimensional space using a tree-based model representing an infinite number of arrangements of n spatial regions in the multidimensional space allowable by the spatial index using a finite number of tree representations, computes an average retrieval complexity measure for content retrieval using the spatial index based on the tree based model, and provides a spatial index recommendation based on the average retrieval complexity measure. In some embodiments a spatial index selection module selects the spatial index based on average retrieval complexity measures for candidate spatial indices that are functionally dependent upon a number of spatial regions to be defined by the spatial index.

The invention improves processing time when accessing information in a byte stream and avoids the step of deserializing unneeded portions of the byte stream when the byte stream encodes an information structure corresponding to a schema with arbitrarily nested lists and tuples. It facilitates efficient keyed access when lists of tuples represent tables with key columns by storing tables in nested column order, which extends the well-known concept of column-order so as to apply to arbitrarily nested tables. Using well-known offset calculation techniques within the nested lists that result from nested column order, the invention achieves greater efficiency by grouping together all scalar information items that correspond to the same node in a tree representation of the schema.

A computer implemented method may be used for analyzing equipment failures and maintenance schedules. An equipment maintenance system generates a model of equipment and components of each piece of equipment. In one embodiment, the model is a tree representation. The equipment maintenance system may then determine estimated failure information for each component based on a selected statistical model. The equipment maintenance system may also generate a maintenance schedule based on the determined estimated failure information for each component of the equipment. In one embodiment, the equipment maintenance system displays the equipment maintenance information.

A computer system 1 is operable to receive a plurality of XML (or other marked-up) documents associated with heterogeneous databases 20, 30 and to process these to generate a virtual integrated view presenting a seemingly merged view of the database structures. The computer system includes an input interface for receiving a plurality of marked-up documents, a document object model generation module operable to generate a tree-structured document object model of each marked-up document; an intermediate structure generation module operable to traverse each document object model to generate an intermediate structure comprising a list of lists of elements and sub-elements; a syntax tree generation module for generating a syntax tree representation of the intermediate structure; and a virtual integrated view module operable to generate a view of the syntax tree representation which may be conveniently displayed to the user on a graphical display, wherein by providing the system with a plurality of marked-up documents reflecting the structures of a plurality of databases, the virtual integrated view module is operable to provide a virtual integrated view of the plurality of databases.

Methods and apparatuses that search tree representations of a bitmap for available blocks to allocate in storage devices are described. An allocation request for a file may be received to initiate the search. In one embodiment, the bitmap may include an array of bits corresponding to blocks in the storage devices. Each bit may indicate whether one of the blocks is available. The tree representations may include at least one red-black tree having nodes corresponding to one or more consecutive bits in the bitmap indicating an extent of available blocks. One of the tree representations may be selected according to a file associated with an allocation request to identify an extent of available block matching the allocation request. The tree representations may be synchronized as the bitmap is updated with changes of block allocations in the storage devices.

The invention discloses an event-structure-based Chinese statement analysis method, which is used for expressing a Chinese statement into a tree structure consisting of a plurality of event designators and event characters comprising event character uncorrelated components corresponding to the event designators. The method comprises the following analysis steps of first preprocessing the Chinese statement; then performing event-structure-based Chinese statement analysis, finding the event designators in the statement and the event characters corresponding to the event designators, and analyzing multi-character components and the event character uncorrelated components; and finally labeling each statement component, adding function descriptions of each component, and giving a parenthesis representation form of a tree representation structure. The method is more applied to Chinese syntactic analysis, relationships between event elements are reflected, support is provided for semantic synthesis, and a language representation method and representation rules of an event can be reflected. According to the method, the event designators which are not verbs can be processed, and semantic functions of modifiers, prepositions, conjunctions and other components can be described.

A method for managing dialogue interaction includes generating a hierarchical tree representation of a set of hierarchical data entities, and identifying a leaf node in the hierarchical tree representation. A system for managing dialogue interaction includes a hierarchical data format having a plurality of hierarchical data entities, and a dialogue interaction manager that manages a dialogue with a user based upon the hierarchical data format.

A polyline tree representation of a coronary artery tree imaged in a volume data set is obtained, and its topology is extracted to give a topological representation indicating the relative positions of vessels in the tree. The topological representation is compared with a set of topological rules to find possible anatomical classifications for each vessel, and a set of candidate labeled polyline trees is generated by labeling the polyline tree with labels showing each combination of possible anatomical classifications. Each candidate labeled tree is filtered according to a set of geometric rules pertaining to spatial characteristics of vessels in arterial trees, and any labeled tree not satisfying the geometric rules is rejected A figure of merit is calculated for each remaining candidate by comparing features of the vessels measured from the polyline tree and from the volume data set with features of correctly classified vessels in other data sets to determine the probable correctness of the labeling of each candidate, and the candidate with the best figure of merit is selected as showing the proper classification of the vessels.

A method for contrast-agent-free non-triggered angiographic imaging in magnetic resonance tomography that includes the steps of (S1) 2D or 3D measurement of a bodily region having a flow of blood, using a flow-insensitive SSFP sequence, (S2) measurement of the same bodily region using a flow-sensitive SSFP sequence, (S3) registration of the measurement results obtained in steps S1 and S2 to one another, (S4) unweighted or self-weighted subtraction of the registered measurement result obtained in step S2 from the registered measurement result obtained in step S1, (S5) execution of a 2D or 3D image correction of the image obtained in step S4 by removing image distortions caused by gradient field inhomogeneities and / or magnetic basic field inhomogeneities, and (S6) representation of the angiogram obtained in step S5 in the form of an MIP or segmented 2D or 3D vessel tree representation.

A method of regenerating a network device configuration command based on configuration data stored in the network device is provided. The configuration data is created as a result of parsing and processing of the configuration command. The command comprises at least one command element that can have a plurality of values. At least one linear node is created and stored in a parse tree for representing said at least one command element. The linear node comprises a begin option node having a single entrance; a next option node coupled to the begin option node; and an end option node coupled to the begin option node. The end option node has a single exit. A linear command regeneration template is created and stored in a memory. The linear command regeneration template comprises information identifying how to regenerate a command. The command is then regenerated based on the linear command regeneration template and based on data from a database. Each of the plurality of branches represents one possible value of a command element of the configuration command. Each branch is connected back to the begin option node through a next option node. During parsing of a command, each command element is represented by a different linear node.

A placement tool generates an optimal placement for a plurality of device modules within an analog integrated circuit (IC) subject to device matching, symmetry, and proximity constraints by first defining a multiple-level hierarchy of constraint groups, wherein each constraint group consists of elements that are subject to one of the placement constraints. Each element of each constraint group consists of either of one of the device modules or another one of the constraint groups residing at a lower level of the hierarchy. The tool then generates a hierarchical B*-tree representation of a trial placement for the IC including a separate node representing each constraint group of the hierarchy and a separate node for each of device module not included in any of the constraint groups. Each node representing a constraint group defines relative positions within the IC of each the device modules or lower level constraint groups forming the constraint group that are consistent with the placement constraint on the constraint group. The placement tool iteratively perturbs the hierarchical B*-tree to generate a sequence of trial placements for the IC design and then evaluates a cost function for each trial placement to select a best one of the trial placements as the optimal trial placement.

A graphical user interface for a quality analysis computer program includes a first display area for displaying graphical representations of statistical data and a second display area containing a tree representation of a quality analysis project. The tree representation may include one or more quality analysis project steps, one or more statistical tool categories associated with the one or more quality analysis project steps, and one or more statistical tools associated with the one or more statistical tool categories.

In an embodiment of the present invention, at a Deployer level, an application software component is provided with a tree representation 510 of objects it contains. An object is a leaf node, with the attributes of the object being in nexus between the root and the leaf node. An accessor object 511 has methods to access the tree 510. In one embodiment of the present invention, at an administrator level, a handler object 611 in turn accesses accessor object 511. Handler object 611 may be part of a handler home object 619. Client applications 710 have lookup services 711 to access handler objects like 611, e.g. via a lookup home object 719, and handler home object 619.

Techniques are disclosed for generating a representation of an access control list, the representation being utilizable in a network processor or other type of processor to perform packet filtering or other type of access control list based function. A plurality of rules of the access control list are determined, each of at least a subset of the rules having a plurality of fields and a corresponding action. The rules are processed to generate a multi-level tree representation of the access control list, in which each of one or more of the levels of the tree representation is associated with a corresponding one of the fields. At least one level of the tree representation comprises a plurality of nodes, with two or more of the nodes of that level having a common subtree, and the tree representation including only a single copy of that subtree. The tree representation is characterizable as a directed graph in which each of the two nodes having the common subtree points to the single copy of the common subtree.