Abstract: A method is provided for constructing an ancestral recombination graph. A value K is received representing K extant units. M non-mixing segments are also received. K vertices V are generated. K lineages for each of M trees are associated with each of the K vertices. An ancestral recombination graph is constructed. To construct the ancestral recombination graph, there is repeated, until only one lineage survives for each of the M trees, a process that includes the following. A tree is randomly selected tree. A first vertex v1 and a second vertex v2 are randomly selected. Two adjoining segments in the M non-mixing segments of the first and second vertices are combined together into a single vertex. A separate vertex is generated for at least one remaining segment in each of the M non-mixing segments of the first and second vertices. The vertices V are updated to be vertices that are non-interior vertices.

Abstract: Embodiments of the present invention describe using a data structure to represent variable domains in solving a constraint problem. The data structure includes nodes that are configured to represent ranges of values in order to save memory space and processor power. Ranges of values and single values may be both added to and removed from the data structure such that the data structure does not include duplicate values. Operations may include detecting multiple nodes with adjacent or overlapping ranges that may be combined into a single node, and adding or removing all the values in the structure that are beyond a threshold value. In one embodiment the data structure may be a balanced binary tree. Constraint solvers may either add values to the data structure as the values are eliminated from the solution, or they may remove those values.

Abstract: A method for indexing a suffix tree in a social network includes: scanning an input string and dividing the string into partitions each having a common prefix; performing no-merge suffix tree indexing on the divided partitions; storing information on the partitions on which no-merge suffix tree indexing is performed; storing suffix nodes of the no-merge suffix tree; and establishing a prefix tree. The performing no-merge suffix tree indexing includes: generating a set of suffixes having the common prefix in the input string; generating a suffix set from the set of suffixes and storing the suffix set; and building the suffix set as a sub-tree.

Abstract: A planning and search system are described wherein a graph search and segment matching are used to handle very large searches at a higher speed.

Abstract: Methods for providing a framework for document objects located on a network are detailed. One method includes steps for creating one or more link directories for storing link relationships between document objects located on the network and for enabling users of the network to create link relationships between a first document object located on the network and a second document object located on the network. The method may also include steps for allowing users to assign attributes describing the link relationships and the document objects related by the link relationships and for managing the presentation of link relationships. One method of managing the presentation of link relationships to a user uses the assigned attributes to determine which link relationships are presented to the user and the manner in which the link relationships are presented.

Abstract: In a KStore having K nodes with respective K node counts a method for updating the K node counts includes processing a K node in accordance with a received particle to provide a processed K node and updating a node count in response to the processing. The processing of the processed K node includes building the processed K node in response to the received particle. A node count of a beginning of sequence node is updated. A beginning of sequence node includes a beginning of thought node. The received particle can be a particle of sensor data having a corresponding sensor node to provide a sensor node determination. A node count of the corresponding sensor node is updated in response to the sensor node determination. A subcomponent node is determined in response to the sensor determination and a K node count of the subcomponent node is updated.

Abstract: In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time.

Abstract: 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.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Described is a technology for reducing the layout complexity of a graph, e.g., an STT graph. Nodes with similar incoming and outgoing links are grouped as candidate groupings to possibly be clustered. For each candidate grouping, if the nodes in the candidate grouping and/or the candidate grouping meet clustering criteria, the candidate grouping is clustered into a clustered node. The criteria may include user-specified parameters directed towards the nodes and/or the candidate groupings. For example, a node is removed from a group if the number of incoming links thereto or the number of outgoing links therefrom exceed maximum incoming and outgoing parameter values, respectively. A group is only clustered if the number of nodes therein meets a minimum size parameter.

Abstract: Provided are a computer program product, system, and method for processing input data in a storage system and in communication with a repository. Views are generated that comprise a tree of nodes selected from a subset of nodes in a hierarchical representation of a schema. The views are saved to the repository. At least one of the views are used to create a job comprising a sequence of data transformation steps to transform the input data described by input schemas to the output data described by output schemas.

Abstract: An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.

Abstract: Determining and storing at least one validated results set in a global ontology database for future use by an entity that subscribes to the global ontology database. If global ontology data is stored in a global ontology database, attempt to determine a mapping between first and second ontologies. If a mapping between the first and second ontologies can be determined from the global ontology data, the mapping is validated and the validated mapping is defined as a validated results set. If global ontology data is not stored in a global ontology database or a mapping between the first and second ontologies can not be determined from global ontology data stored in the global ontology database, the first and second ontologies are unified by determining a mapping between the first and second ontologies, the mapping is validated and the validated mapping is defined as a validated results set.

Abstract: A content management system (CMS) includes a value-add application with a first set of XML content services, one or more dedicated XML processing servers with a second and other sets of XML content services, and a core CMS with a third set of XML content services. The content management system may be designed to provide XML content services at any of these three tiers of processing. A first threshold is defined that allows the value-add application to determine when to offload XML content services to a dedicated XML processing server. A second threshold is defined that allows the core CMS to determine when to offload XML content services to a dedicated XML processing server. Callback services are included that allow each tier of XML content services to send or receive additional information to complete the XML processing. The result is a content management system that is very powerful and flexible.

Abstract: A method for processing a request to display data includes receiving at a virtual tree server a request to display data stored in a database. The data is associated with a selected node of a virtual tree structure. The method continues by loading node definition data in response to the request. The node definition data defines the selected node of the virtual tree structure and how the node is displayed. The method also includes saving the node definition data in a page file and transmitting the saved page file.

Abstract: An information source alignment system may include a tree generation module executed by a computer system to generate a source category hierarchy tree for a source class in a first information source and a target category hierarchy tree for a target class in a second information source. The source and target category hierarchy trees may be constructed from a class hierarchy of a knowledge source. A class-similarity determination module may compare the source and target category hierarchy trees. An alignment module may determine whether the source and target classes are aligned based on the comparison of the source and target category hierarchy trees.

Abstract: An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.

Abstract: Methods, program products, and systems for rendering data using multi-tiered caches are described. A system can render a first section of data and store the rendered first section of data in a first tier cache. The system can determine that a data field, when rendered, straddles the rendering of the first section of data and a rendering of a second section of data. The system can generate a rendering of the data field and store the rendering of the data field in a second tier cache. When rendering the second section of data, the system can use the rendered data field stored in the second tier cache instead of regenerating the rendering of the data field.

Abstract: A computer system hosting a column-store database engine is responsive to database requests for the update and retrieval of data from within a stable data table and 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 database engine 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.

Abstract: A mechanism is provided for generating a filter expression using tree parameters receives an expression wherein operators of the expression bind multiple data items to a single parameter to form a received expression, generates a default prompt control using received metadata and the received expression and prompts for an input selection using the default prompt control. Responsive to receiving selected values in response to the default prompt control to form received values the computer-implemented process generates a native database query using the received expression with the single parameter and the received values, wherein the single parameter is a tree parameter.

Abstract: Embodiments of the present invention describe using a data structure to represent variable domains in solving a constraint problem. The data structure includes nodes that are configured to represent ranges of values in order to save memory space and processor power. Ranges of values and single values may be both added to and removed from the data structure such that the data structure does not include duplicate values. Operations may include detecting multiple nodes with adjacent or overlapping ranges that may be combined into a single node, and adding or removing all the values in the structure that are beyond a threshold value. In one embodiment the data structure may be a balanced binary tree. Constraint solvers may either add values to the data structure as the values are eliminated from the solution, or they may remove those values.

Abstract: A method is provided for creating at least one multimedia scene intended to be restored on a mobile radio communication terminal. The multimedia scene includes a plurality of multimedia objects organized in the form of at least one scene description tree. Such a method includes the following steps: associating with the scene description tree(s) a sub-tree of the objects to be restored, including objects intended to be restored at a given instant, and a standby sub-tree, including objects intended not to be restored at the given instance; identifying at least one object, termed the transferable object, that can be transferred from a first of the sub-trees to the second of the sub-trees as a function of at least one predetermined transfer condition.

Abstract: A planning and search system are described wherein a graph search and segment matching are used to handle very large searches at a higher speed.

Abstract: Users are enabled to quickly and easily associate records representing entities such as themselves, other users, contacts, accounts, teams/groups, and similar ones employing a record of the association and assign each entity a role or other attributes as a part of this association. Relationship records and attributes preserving entity association information allow teamwork, communication, and collaboration for effective management of business processes. The records and attributes also enable visualization and facilitate deeper understanding of the relationships between people, data, and business processes.

Abstract: A navigation mechanism for hierarchical data uses a climb/dive and rotate inputs to traverse a hierarchical dataset. The hierarchical dataset may be arranged in a filial-heir arrangement for easy traversal. The navigation mechanism may be used with several different ways of displaying the data, some of which may display both overall context and detailed view of the data. One such example may have a context section and a detail section, where the context section may present the overall context of a focus node in relation to the overall dataset and the detail section may display other nodes that are at the same or lower level than the focus node.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed.

Abstract: A computer-implemented method and system for encoding (and decoding) nodes of a tree structure are provided. The method includes receiving nodes of a tree structure into memory and, with a processor, for each node of at least one node in the tree structure, creating a numeric encoding by assigning an encoding value to the node, a root node N0 having a fixed encoding value and any other node Nj having an encoding value which is a function of an encoding value of its parent node and an integer k, where Nj is the kth child of the parent node. The encoding enables a path from the node to be traversed to the root node of the tree by applying a decomposition function to the encoding.

Abstract: In some embodiments, the invention involves utilizing a tree merge sort in a platform to minimize cache reads/writes when sorting large amounts of data. An embodiment uses blocks of pre-sorted data residing in “leaf nodes” residing in memory storage. A pre-sorted block of data from each leaf node is read from memory and stored in faster cache memory. A tree merge sort is performed on the nodes that are cache resident until a block of data migrates to a root node. Sorted blocks reaching the root node are written to memory storage in an output list until all pre-sorted data blocks have been moved to cache and merged upward to the root. The completed output list in memory storage is a list of the fully sorted data. Other embodiments are described and claimed.

Abstract: Various embodiments of a system and method for conditioning search results are described. The system and method for conditioning search results may include a search result conditioning component. The search result conditioning component may be configured to determine a search result group including multiple search results each corresponding to an item offered for sale; such search results may be results of a search query. The search result conditioning component may be configure to modify the search result group by removing one or more search results from the search result group in response to determining that a measure of similarity between the one or more search results and other search results of the search result group is greater than a requisite measure of similarity (e.g., a threshold). The search result conditioning component may be configured to output the modified search result group.

Abstract: A term analyzer receives an ordered collection of text-based terms. The term analyzer analyzes groupings of consecutive text-based terms in the ordered collection to identify occurrences of different combinations of text-based terms. In addition, the term analyzer maintains frequency information representing the occurrences of the different combinations of text-based terms in the collection. The frequency information can then be used to determine relatively significant keywords and/or keyword phrases in the document. In an example configuration, the term analyzer creates a tree in which a first term in a given grouping of the groupings is defined as a parent node in the tree and a second term in the given grouping is defined as a child node of the parent node in the tree. The method of the analyzer generalizes to create a tree of multi-word terms in which the terms can be efficiently ranked by occurrence.

Abstract: The present invention provides a system, method, and data structure for packaging assets for processing and distribution over a multi-tiered network. An asset may represent network and/or application components (e.g., data, objects, applications, program modules, etc.) that may be distributed among the various resources of the network. In an embodiment, the package structure includes at least one representation of an asset having a logic/data portion and an asset extended environment portion, and a package extended environment that includes package information associated with at least one asset.

Abstract: De-identification device for automatically configuring a general hierarchy tree of attribute values of identity information. The provided de-identification device quantitatively evaluates the amount of information which is lost when generalizing an attribute value, and can thereby automatically assess priorities between de-identified data and between data that is being de-identified. Information of each person includes attribute values of the person for a plurality of attributes. De-identification is achieved by obfuscating the attribute values, and a structure in which attribute values to be obfuscated are expressed in a tree structure according to the level of obfuscation is called a general hierarchy tree. The disclosed identity information de-identification device achieves automatic configuration by configuring a tree using frequency information of attribute values.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: It is possible to surely commit a revision made on a software component in a software component database and a software product group and to create a new software product from the same database. Provided is a software configuration management system which includes a software component database and a software product management unit and accepts data transmission/reception from a software component database management client and a software product operation client. The software configuration management system further includes: a component-product correspondence table, component-file correspondence information, a synchronization unit for mutually committing a modification of the software component database and a modification of a software product; update information; and a correspondence table update unit.

Abstract: In one embodiment of the present invention, a data-backup method includes partitioning a fingerprint namespace among a cluster of backup servers, the fingerprint namespace comprising fingerprints for representing units of data, each backup server of the cluster of backup servers managing units of data having fingerprints corresponding to an assigned partition of the fingerprint namespace. The method further includes receiving backup information from a client computing device for a block of data comprising units of data, the backup information including at least a fingerprint for each of the units of data and client-specific backup information. In addition, the method includes, utilizing the fingerprint for each of the units of data, deduplicating the units of data in parallel at the cluster of backup servers in accordance with the partitioning step, the deduplicating step comprising identifying ones of the units data already stored by the cluster of backup servers.

Abstract: A manufacturing execution system contains a depicting device for depicting at least a part of a productive process to a hierarchically structured set of entities and an application programming interface for managing data in a data base and for inputting a tree into the application programming interface. The tree representing a hierarchical relationship between at least two entities of the hierarchically structured set of entities. A program device provides a method accessible by the application programming interface. The method is adapted to manipulate the hierarchically structured set of entities. A manipulating device is provided for manipulating the entities of the tree according to the method.

Abstract: Described is a technology in which an image retrieval system is updated incrementally as new image data becomes available. Updating is incrementally performed and only triggered when the new image data is large enough or diverse enough relative to the image data currently in use for image retrieval. Incremental updating updates the leaf nodes of a vocabulary tree based upon the new image data. Each leaf node's feature frequency is evaluated against upper and/or lower threshold values, to modify the nodes of the tree based on the feature frequency. Upon completion of the incremental updating, a server that performed the incremental updating is switched to an active state with respect to handling client queries for image retrieval, and another server that was actively handling client queries is switched to an inactive state, awaiting a subsequent incremental updating before switching back to active state.

Abstract: A keyword related to a user's interest is acquired. A keyword acquiring device including a tree storage unit that stores a keyword tree obtained by performing hierarchization according to the number of appearances and relevance in advance using a keyword associated with content as a node records a keyword associated with content previously selected by a user as a log, extracts a plurality of keywords based on a predetermined condition from a log corresponding to a certain user recorded in the log, extracts a partial tree including the extracted keywords from the keyword tree, and acquires a keyword in a node having no other lower node as a keyword related to the user's interest.

Abstract: A defect classification method to classify defects by using a classifier having a binary tree structure based on features of defects extracted from detected signals acquired from a defect inspection apparatus includes a classifier construction process for constructing the classifier by setting a branch condition including defect classes respectively belonging to groups located on both sides of the branch point, a feature to be used for branching, and a discriminant reference, for each branch point in the structure based on instruction of defect classes and feature data respectively associated therewith beforehand. The process includes a priority order specification process for previously specifying target classification performance of purity and accuracy for each defect class, whole and in worst case, with priority order, and an evaluation process for evaluating whether the specified target classification performance under the branching condition is satisfied and displaying a result of evaluation, every item.

Abstract: Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.

Abstract: A data management system or “DMS” provides data services to data sources associated with a set of application host servers. The DMS typically comprises one or more regions, with each region having one or more clusters. A given cluster has one or more nodes that share storage. When providing continuous data protection and data distribution, the DMS nodes create distributed active object storage to provide the necessary real-time data management services. The distributed object store can be built above raw storage devices, a traditional file system, a special purpose file system, a clustered file system, and a database. The DMS active object store provides an indexing service to the active objects. In an illustrative embodiment, any object property that has a given attribute is indexed and, as a result, the attribute becomes searchable. The DMS provides hierarchical distributed indexing using index trees to facilitate searching.

Abstract: Techniques are provided for efficiently extracting scalar values from binary-encoded XML data. Node information is stored in association with binary-encoded XML data to indicate whether one or more nodes of an XML document are simple or complex. A node is simple if the node has no child elements and no attributes. The node information of a particular node is used to determine whether a particular node, identified in a query, is simple or complex. If the particular node is simple, then the scalar value of the particular node is identified without performing any operations other than possibly converting the scalar value to a non-binary-encoded format or converting the scalar value to a value of a different data type.

Abstract: A method for maintaining group membership records includes 1) maintaining a record of group memberships for a membership hierarchy, the membership record identifying a direct relationship between a first object and a second object in the membership hierarchy, 2) receiving a membership update indicating that, as of a first point in time, a direct relationship between the second object and a third object changed, 3) updating the record of group memberships to reflect the change in the relationship between the second object and the third object, 4) deducing, based on the membership update and the record of group memberships, a change in an indirect relationship between the first object and the third object as of the first point in time, and 5) providing a view of object relationships within the membership hierarchy as the object relationships exist at the first point in time and a historical record of object relationships.

Abstract: The present disclosure provides a method and an apparatus for storing data classification structure. Based on an initial classification structure tree, a reorganized classification structure tree that stores data classifications structure differently from that of the initial classification structure is generated. As the reorganized classification structure tree is flexible, when maintaining data and searching data by using the search engine, the present techniques may quickly find the desired data, thereby reducing the heavy burden of the search engine under the conventional techniques to conduct data search and high pressure of conducting data maintenance and data search. Further, the present techniques may not only reduce the burden of the search engine, but also relieve the pressure for maintaining data and searching data.

Abstract: Creating data tables by identifying paths in a tree of data entities and relationships, the tree including data entities and relationships between the entities, where each of the paths originates from the same data entity, includes a terminal data entity that is at the to-many end of a one-to-many or many-to-many relationship with another data entity along the path, and includes no other of the data entities that lie along any path descending from the terminal data entity and that is at the to-many end of a one-to-many or many-to-many relationship with another of the data entities that lie along the path descending from the terminal data entity, and creating on a computer-readable medium a separate table for each of the paths, where each of the tables includes a column per each of the data entities of the path for which the table was created.

Abstract: An apparatus for processing a sequence of tokens to detect predetermined data, wherein each said token has a token type, and the predetermined data has a structure that comprises a predetermined sequence of token types, including at least one optional token type. The apparatus comprises a processor arranged to: provide a tree for detecting the predetermined data, the tree comprising a plurality of states, each said state being linked with at least one other state by a respective condition, the arrangement of linked states forming a plurality of paths; and compare the token types of the sequence of tokens to respective conditions in the tree to match the sequence of tokens to one or more paths in the tree, wherein the predetermined data can be detected without using an epsilon reduction to take account of said at least one optional token type.

Abstract: Updating an index is disclosed. An indication of one or more changes to be made to data is received. The one or more changes are written to a storage medium prior to updating one or more file name index entries. One or more file name index entries are updated prior to writing a new index tree root. A new index tree root is written.

Abstract: Health monitoring system comprising a patient side subsystem, a health care provider side subsystem, and a server station. The patient side subsystem is able to periodically receive and apply a monitoring profile comprising profile elements being connected to each other in a predetermined manner, the monitoring profile elements comprising patient related data, monitoring related data, evaluating process elements, wherein the monitoring profile elements are connected to each other to provide a multi-level tree structure consisting of at least two monitoring profile levels comprising a higher or top level and a lower or bottom level, wherein the monitoring profile elements are divided according to the tree structure of the multi level monitoring profile and a part of the monitoring profile elements is assigned to the top monitoring profile level and a part of the monitoring profile elements is assigned to the bottom monitoring profile level.

Abstract: Apparatus and methods are provided herein for path lookup in a hierarchical file system. An inode associated with a requested object is identified. The inode may be organized in an inode table and identified in the table using an inode number. Ancestry information and size constraint information may also be available for the inode. An inode chain associated with the pathway is identified based, at least in part, on ancestry information associated with the inode for the requested object. A size constraint analysis is performed for the requested object. The size altering operation is selectively performed based on the size constraint analysis.

Abstract: Embodiments of the invention generally pertain to memory devices and more specifically to reducing the write amplification of memory devices without increasing cache requirements. Embodiments of the present invention may be represented as a modified B+ tree in that said tree comprises a multi-level tree in which all data items are stored in the leaf nodes of the tree. Each non-leaf node in the tree will reference a large number of nodes in the next level down from the tree. Modified B+ trees described herein may be represented as data structures used to map memory device page addresses. The entire modified B+ tree used to map said pages may be stored on the same memory device requiring limited amounts of cache. These embodiments may be utilized by low cost controllers that require good sequential read and write performance without large amounts of cache.