Abstract:
Techniques for providing maximal concurrency while ensuring no deadlock in a tree structure are provided. The techniques include accessing a minimum number of one or more nodes to perform an operation.
Abstract:
A method of creating a new XML document having at least a root element and a declaration. The method comprises retrieving from storage a new fragment XML document comprising at least one XML template for a new XML file that itself has a root element. Then, at least one XML template is selected and the selected XML template is used to create an XML document. User and programmer interfaces, as well as device and system structures that can implement the method, also are provided.
Abstract:
Apparatus for displaying information from an information source, the information being indexed by nodes in a hierarchical structure, the apparatus comprising: at least one display for displaying information from the information source; a user input device for receiving a user-selectable forward navigation selection, a user-selectable back navigation selection and a user-selectable mode switch selection; and a controller for implementing a plurality of alternative navigation strategies to allow a user to navigate through at least part of the hierarchical structure using said forward navigation selection and said back navigation selection in order to display user-selected information from the information source on said at least one display, the controller being configured to switch from a currently selected navigation strategy to another of said alternative navigation strategies in response to reception of said user-selectable mode switch selection, wherein each navigation strategy comprises one or more rules defining an order in which the hierarchical structure is navigated.
Abstract:
A system and method for innovation documents is disclosed. A database stores an innovation classification system, ontology, synonym vocabulary and fill word list plus prior innovation descriptions. An innovation document, describing a new innovation is received and processed (3-2), including identifying key words by ignoring fill words (3-4); using the synonym vocabulary (3-6) and ontology (3-10) to produce (3-12) a systematized innovation document; weighting (3-14) the key words of the systematized innovation document by mapping its key words against the innovation classification system (3-16); determining an optimal placement (3-18) for the innovation document in the innovation classification system based on the weights; and outputting the optimal placement and at least part of the innovation classification system.
Abstract:
An object-based merge tool for structured object models encapsulates data in files, such as metadata in XML files, as model objects in accordance with an underlying model, all of which can be graphically represented to a user. Graphical representation of files also allows the user to see how the files have been changed and allow for the observation of static integrity constraints. The differences between files or file sets can be graphically represented to the user, such as through markings of the model objects in the tree structure, and the differences can be explained in an additional view. Related apparatus, computer program products and computer systems are also described.
Abstract:
Leaf node items within a tree data structure are efficiently deleted. A leaf node item of a leaf node of the tree data structure is marked for deletion. The leaf node is marked as containing leaf node items that have been marked for deletion. A flag for a region encompassing the leaf node within a linear representation of the tree data structure is set. The linear representation of the tree data structure has a number of regions, each of which encompass one or more of the leaf nodes and that have a corresponding flag. Periodically, the tree data structure is cleaned. Each region of the linear representation for which the corresponding flag is set is scanned for leaf nodes that have been marked as containing leaf node items that have been marked for deletion. Each such leaf node item that within each such leaf node is found is deleted.
Abstract:
A method and system for creating and searching a central linked list comprising a parent node which is situated at the center of a plurality of child nodes. Each child node has two double linked list pointers. One pointer points to the next child node, and the other pointer points to the parent node. Thus, matched data obtained at several child nodes moves immediately back to the parent simultaneously. The parent node contains the memory address and name of central linked list, a description of central linked list, and a description of the relationship between other parent nodes, as well as the relationship between each child node to its specific parent node. Each child node contains a node address, an attribute comprised of some or all of the stored data field and a link to the full data content that may reside on a file or in a database. Memory storage of the structure information is stored in system memory, such as, RAM. Thus, searching and comparison operations may be accomplished without the need to access a hard disk.
Abstract:
A method of manipulation of data information trees, and software and systems therefore, allow the mapping of information models for support of markup-oriented registry services. For example, a first business entity may provide a service. Service information regarding the service is stored in a hierarchical directory information tree at a node corresponding to the business entity. Another business entity may desire to provide the service of the first business entity. Service projection information regarding the service offered by the first entity is stored in a hierarchical directory information tree at a node corresponding to the second business entity.
Abstract:
Hierarchies are navigated easily through a user interface that is continuous in its presentation of node information and may be implemented using a small display space.
Abstract:
Methods, non-transitory computer readable media, and model evaluations systems for understanding diverse machine learning models (MLMs) are disclosed. In some examples, a feature contribution value is determined for features included in a reference or evaluation input data set. The evaluation input data set represents a protected class population and each feature contribution value identifies a contribution by a feature to a difference in output generated by an MLM for the evaluation input data set. Model explanation information is generated using the feature contribution values and execution of the MLM is monitored. The model explanation information explains the difference in output generated by the MLM for the evaluation input data set and includes information relating to a model-based decision. A report is generated from a knowledge graph for the MLM and output via a GUI to an operator device that includes the model explanation information.