Abstract: A cycle basis is efficiently determined for a directed graph. A first depth-first search of the directed graph classifies each of the edges of the directed graph to have a type that is one of a within-tree type for an edge within a tree of the first depth first search, a forward type for an edge skipping forward along the tree, a back type for an edge directed back along the tree, or a cross type for an edge between two subtrees of the tree. A second depth-first search of the directed graph determines a respective cycle for each of the edges of the back type. A third depth-first search of the directed graph determines a respective cycle for each of the edges of the cross type that is included a cycle. The basis is output the basis that specifies each of the respective cycles.

Abstract: A taxonomy engine in a software architecture generates a taxonomy dataset establishing the group of well formed commands, and at least one command generator of the system is adapted to generate a well formed command using the taxonomy dataset. The taxonomy engine is configured to deliver the taxonomy dataset to the command generator, and the command generator is configured to deliver the well formed command to the controller.

Abstract: A method, system and computer program product for processing data relating to transactions that enables, for example, performing a Drill-Through on a given association rule for a large number of transactions in a short period of time. A Drill-Through (DT) Preparation, which generates the prefix tree and the transaction group information, and the DT Execution, which determines the transactions supporting an association rule, may be carried out in order to extract hidden information from input data.

Abstract: The present invention is a method and system for handling a plurality of information units in an information processing system, such as a multimodal human computer interaction (HCI) system, through verification process for the plurality of information units. The present invention converts each information unit in the plurality of information units into verified object by augmenting the first meaning in the information unit with a second meaning and expresses the verified objects by object representation for each verified object. The present invention utilizes a processing structure, called polymorphic operator, which is capable of applying a plurality of relationships among the verified objects based on a set of predefined rules in a particular application domain for governing the operation among the verified objects. The present invention is named Object Verification Enabled Network (OVEN).

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: A computer-implemented method disclosed may include providing a plurality of classes to represent at least one attribute of a NIC team, providing at least one association class to represent the relationship between each of the plurality of classes and associating each of the plurality of classes with the at least one association class.

Abstract: In accordance with a method of encoding meta-data associated with tree-structured data, a first set of elements of a plurality of elements in the tree-structured is associated explicitly with explicit meta-data levels, and a second set of elements of the plurality of elements is associated by inheritance with explicit meta-data levels of closest ancestor elements of the first set of elements. The plurality of elements is packed into a plurality of leaf nodes of an index structure. The plurality of leaf nodes is merged into a plurality of non-leaf nodes until a root non-leaf node is generated. The plurality of non-leaf nodes of the index structure is associated with indicators representing ranges of the explicit meta-data levels in the packed first set of elements, such that explicit meta-data level ranges of descendant non-leaf nodes are subsets of explicit meta-data level ranges of ancestor non-leaf nodes.

Abstract: A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.

Abstract: In a method for estimating a loaded execution runtime of database query, a database query for a database is received for a loaded database. Load information for the database is received. A prediction of query runtime tree is accessed. The prediction of query runtime tree is built from historical query information regarding historical database queries previously executed on the database. The prediction of query runtime tree includes a classifier function adjusted for an historical impact of loading of the database. The database query is processed through the prediction of query runtime tree, such that a loaded execution runtime of the database query is estimated based upon information pertaining to historical database queries similar to the database query.

Abstract: A method, computer system, computer program product and graphical interface for generating and displaying an information catalog relating to a business model. The method includes accessing technical metadata from a data warehouse, accessing business metadata from a first source outside of the data warehouse, accessing presentation metadata from a second source outside of the data warehouse, and applying the presentation metadata to the technical metadata and the business metadata to generate the information catalog. The information catalog comprises the technical metadata and the business metadata in accordance with the presentation format specified by the presentation metadata. The technical metadata is associated with data used by computer applications. The computer applications support business processes of the business model.

Abstract: Techniques of the described subject matter employ a break down algorithm in which a population of individuals is broken down into segments that have a greater number of individuals than a threshold minimum. Information on aggregated individuals may then be used to accomplish a variety of tasks, such as consumer purchasing preferences, market data analysis, sales force allocation, etc., without revealing the specific identity of any individuals or permitting others to determine, from the data, the identity of any individuals.

Abstract: The invention relates to topic classification systems in which text intervals are represented as proposition trees. Free-text queries and candidate responses are transformed into proposition trees, and a particular candidate response can be matched to a free-text query by transforming the proposition trees of the free-text query into the proposition trees of the candidate responses. Because proposition trees are able to capture semantic information of text intervals, the topic classification system accounts for the relative importance of topic words, for paraphrases and re-wordings, and for omissions and additions. Redundancy of two text intervals can also be identified.

Abstract: A method and apparatus for providing service discovery are disclosed. Specifically, each service provider builds or constructs a behavior description or model of its service and, in turn, stores and publishes the behavior description. Each behavior description is implemented in accordance with a set of shared ontology of terms for a particular domain. In turn, a user may generate a query associated with service discovery that will be capable of exploiting the behavior descriptions for a plurality of services.

Abstract: A system and method for automatically transforming non-Unicode supporting files into Unicode supporting files via one or more reusable maps. The system comprises a reusable source type tree organized from a schema, wherein the schema is created from a file; and one or more reusable maps, structured to automatically map one or more rules onto the reusable source type tree to transform the reusable source type tree into a reusable target type tree. The method comprises determining a type of data to be supported; defining one or more rules to support the type of data; and applying the one or more rules automatically to a reusable source type tree to transform the reusable source type tree into a reusable target type tree.

Abstract: A method and system for controlling access to data via a data-centric security model. A business data classification scheme is defined as a hierarchy that includes data types aligned with business operations. A data element is labeled with a data label. The data label includes multiple attributes associated with a data-centric security model. A first attribute is a data type of the data element. A second attribute includes security requirements. Data control rules are automatically generated for an enforcement of the security requirements. The enforcement grants or denies to a user an access to the data element via a predefined action. The enforcement is based on a predefined association among the predefined action, a predefined role that includes the user, the data type and, optionally, a purpose for performing the predefined action.

Abstract: Systems and methods are disclosed that provide an indexing data structure. In one embodiment, the indexing data structure is mirrored index tree where the copies of the nodes of the tree are stored across devices in a distributed system. In one embodiment, nodes that are stored on an offline device are restored, and an offline device that comes back online is merged into the distributed system and given access to the current indexing data structure. In one embodiment, the indexing data structure is traversed to locate and restore nodes that are stored on offline devices of the distributed system.

Abstract: Systems, methods and devices for managing objects stored in memory are described. Information about the cached objects are stored in a tree structure that can be searched when a request for an object is made, in order to locate the object in memory. During or shortly after the search process, information about the search path through the tree is stored in a cache, and used to speed later searches for objects in memory.

Abstract: A database system with methodology for generating bushy nested loop join trees is described. In one embodiment, for example, an improved method is described for optimization of a query requesting data from a database, the method comprises steps of: generating a left deep operator tree for returning data requested by the query based on traversing a left deep operator tree search space; transforming the left deep operator tree into a semantically correct structure for returning data requested by the query; and building a query execution plan for returning data requested by the query based on the semantically correct structure.

Abstract: This present invention describes an innovative solution in the area of indexing and searching binary files including various binary files such as multimedia files, including image files, mp3 files and other audio/video files from the public Internet. The invention introduces a way to index binary files such as multimedia files according to their content signatures, which uniquely identify themselves, and search for related files by walking through a graph database constructed during the index phase. The present invention can be used in a search engine and a download engine, as well as with text based index and search technologies. As a result, such extended usage will broaden a multimedia file's context and increase relevant accuracy of the keywords describing the context.

Abstract: Progressive evaluation of predicate expressions in streaming XPath processor. A method for evaluating multiple XPath predicate expressions of multiple XPath queries includes identifying includes determining hit of a location path in a SAX event. All XPath predicate expressions of all XPath queries corresponding to the location path are then identified. All leaf nodes in the XPath predicate expressions corresponding to the location path are then determined. Thereafter, storage of nearest parent nodes of the leaf nodes is checked. Each nearest parent node is a first parent node which is encountered while moving from a leaf node towards a root node in an XPath predicate expression and which requires storage for storing intermediate Boolean result. Results of parent nodes of the leaf nodes are the determined based on the checking. Thereafter, the results of the parent nodes are stored if the results of the parent nodes are Boolean results.

Abstract: A memory storing a computerized data array in the form of a table of values stored in the memory as a directed tree representing a set of data. Each data entry in the set is associated with a particular node of the tree, the values representing node ranks of the tree. The node ranks are ordered according to a first total order relation, the values being stored at addresses in the memory representing the node ranks and being ordered according to a second total order relation.

Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.

Abstract: Search tree structures with nodes that represent signatures derived from segments of video and audio content are used by systems to identify content and re-establish the correct alignment between video and audio content that have become disassociated with one another. The amount of storage needed to record data representing the tree structure can be reduced by replacing stored signature sets with signature pointers. The efficiency of searches in the tree structure can be improved by constructing and using partial tree structures.

Abstract: A method and system for comparing two documents, such as XML (Extensible Markup Language) files, where each document is capable of being parsed into a DOM (Document Object Model) trees. Each tree structure is converted into an array of leaf paths containing nodes. These arrays are then compared to identify corresponding matched nodes—either exactly matched nodes or schema matched nodes. In reporting the results of the comparison, unmatched nodes of the source document are reported as “deleted nodes”, that is, existing in the source but not in the target. Similarly all unmatched nodes of the target document are reported as “added nodes”, that is, existing in the target but not in the source. In addition, schema matched nodes are reported as “modified nodes” between source and target documents.

Abstract: A method and computer program product for automatically populating data in a tree widget on a Web page are provided. The method includes rendering a tree structure of tree nodes populated with data in a viewable area of a Web page, creating placeholder nodes without data in the tree structure, and placing the placeholder nodes in a hidden area of the Web page. The method also includes monitoring for a scrolling request to shift the tree structure in the viewable area of the Web page, and initiating an asynchronous request for data to populate a subset of the placeholder nodes in response to the scrolling request. The method further includes receiving the data to populate the subset of placeholder nodes, populating the subset of placeholder nodes with the received data, and shifting the subset of placeholder nodes with the received data to the viewable area of the Web page.

Abstract: Data segments are logically organized in groups in a data repository. Each segment is stored at an index in the data repository. In association with a write request, a hash algorithm is applied to the data segment to generate a group identifier. Each group is identifiable by a corresponding group identifier. The group identifier is applied to a hash tree to determine whether a corresponding group in the data repository exists. Each existing group in the data repository corresponds to a leaf of the hash tree. If no corresponding group exists in the data repository, the data segment is stored in a new group in the data repository. However, if a corresponding group exists, the group is further searched to determine if a data segment matching the data segment to be stored is already stored. The data segment can be stored in accordance with the results of the search.

Abstract: A method for parallel processing of data organized in the form of a tree including: converting the tree into a linear array structure including a data array for storing the data of said tree and three reference arrays; determining partial workloads from the linear array structure obtained at step a; and performing parallel processing of said partial workloads. Each entry in the data array corresponding to a given node in the tree and includes three pointers. The pointers each point to a respective one of the reference arrays: a first pointer identifies the parent node of the given node, a second pointer identifies the first child node of the given node, and a third pointer identifies the sibling node of the given node.

Abstract: A parallel-processing system that is capable of dynamically creating a distributed tree for distributing data. The system includes a plurality of first nodes. Each of the plurality of first nodes is capable of establishing a connection with at least one of the plurality of first nodes to form at least a portion of a dynamically created distribution tree. The system also includes a second node that is capable of receiving data for distribution within the parallel-processing system. The second node is also capable of establishing a connection with at least two of the plurality of first nodes. In this particular embodiment, the second node and the plurality of first nodes operate to form the dynamically created distribution tree. Moreover, the second node also operates to distribute the data to each of the plurality of first nodes through the dynamically created distribution tree.

Abstract: A computer system for generating a dynamic presentation comprises: a master storage containing master presentation data having a master nodal structure and master contents associated with content nodes of said structure, a structure editor capable of copying said master nodal structure into a personalized data structure in a dedicated read/write storage and of selectively changing the copied master nodal structure into a personalized nodal structure in response to user inputs, wherein said personalized nodal structure comprises all or part of the nodes of the master nodal structure, a contents editor capable of copying a master content into said personalized data structure in said dedicated read/write storage and of selectively changing the copied master content into a personalized content in response to user inputs, a dynamic presentation generator for generating a personalized presentation by accessing said personalized data structure, determining which content nodes in said structure belong to personalized

Abstract: The present invention provides methods, systems and apparatus: for constructing a personalized category tree; for maintaining a personalized category tree; for displaying documents by category by utilizing a personalized category tree; and a personalized categorization system. A personalized category tree is a category tree that includes at least one category node. A method for constructing a personalized category tree includes: the independent creation of each of said at least one category node comprises the steps of: defining a label for the category node; and specifying at least one keyword for the category node.

Abstract: A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure.

Abstract: Method and apparatus for predicting properties of a target object, in particular, one of an origin and a source, comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods.

Abstract: Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods.

Abstract: A method and a processing device are provided for compressing a web graph including multiple nodes and links between the multiple nodes. Nodes of the web graph may be clustered into groups including no more than a predetermined number of nodes. A list of links of the clustered nodes may be created and sorted based on a frequency of occurrence of each of the links. A prefix tree may be created based on the sorted list of links. The prefix tree may be walked to find candidate virtual nodes. The candidate virtual nodes may be analyzed according to a selection criteria and a virtual node may be selected. The prefix tree may be adjusted to account for the selection of the virtual node and the virtual node may be added to the web graph.

Abstract: A search tree embodying a plurality of signatures and a number of states each having a failure transition to a fail state and one or more success transitions to next states is optimized by selecting a success size parameter that indicates a maximum number of input characters to be traversed on the success transitions and compressing the search tree to create a compressed search tree characterized by the selected success size parameter.

Abstract: A method of storing data in a memory circuit of an Aho-Corasick type character recognition automaton recognizes character strings by implementing successive transitions in a tree of nodes stored in a memory. Each node corresponds to a state of the automaton and to a recognition of a sequence of the character string. Each node is associated with a transition vector serves to determine the destination node or nodes of a transition. For storage of the data, a test is performed to find out whether transition vectors point to common destination addresses. The transition vectors are combined if the addresses to which the vectors point are separate by formulating a combination vector and the nodes are stored at the memory addresses pointed at by the combination vector.

Abstract: Various embodiments of the present invention are directed to a unique memory management scheme utilized by the DTP whereby data extracted from an external source is placed in a memory buffer and is then manipulated by the components without the need for copying the data to any other location in memory. While logically the data moves from component to component in the DFE for the various embodiments described herein, the data does not in fact change locations but, instead, the data resides in the buffer and is operated upon by a series of components that, in turn, access the data in the buffer via pointers and manipulate same.

Abstract: Content filtering of data containers of multiple content types is performed using multiple filtering modules operating concurrently. An apparatus for content filtering has a set of content-specific filtering modules and a network interface for parsing a received data container into components and directing each component to a respective filtering module. A filtering module edits a component of a specific content type according to respective rules. A multiplexer combines edited components produced by the set of filtering modules to form an edited data container. A root module applies a set of basic rules to a data container and any attachments. In an alternative configuration, the apparatus employs multiple filtering modules each applying rules for all content types. Received data containers are distributed among the filtering modules and an output module arranges edited data containers of a data stream in proper sequential order.

Abstract: A morphed musical piece generation system that enables even a user with little knowledge of music to easily generate a morphed musical piece between two different musical pieces is provided. A first intermediate time-span tree data generation section 6 selectively removes difference information between common time-span tree data and first time-span tree data from the first time-span tree data. Also, a second intermediate time-span tree data generation section 7 performs the same operation to obtain second intermediate time-span tree data. A data combining section combines the first intermediate time-span tree data and the second intermediate time-span tree data to generate combined time-span tree data. A musical piece data generation section generates a morphed musical piece on the basis of the combined time-span tree data.

Abstract: A data model that allows for relationships between entities, also referred to as parties, to be modeled as attributes of an entity and for customization of the data model in a manner that facilitates upgrading of the data model. The data model defines a party class that includes a party identifier and a list of relationships of that party with other parties. The relationships may include represented-by relationships, customer-of relationships, contact-of relationships, or employee-of relationships. The party class can be sub-classed (i.e., be a base class for a derived class) depending on the type of party that is being model.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: Systems and methods for searching heterogeneous interrelated entities for a heterogeneous entities search query are disclosed herein. A user may enter the heterogeneous entities search query. The search retrieves and returns multiple types of heterogeneous entities. The retrieved heterogeneous interrelated entities are searched in a unified matrix that represents relationships between one or more heterogeneous entities. The retrieved heterogeneous interrelated entities may have one or more entity types. The set of retrieved interrelated entities may also be ranked based on the similarity between each entity and the search query. Feedback may also be incorporated into the system to improve search accuracy.

Abstract: In one embodiment, a mechanism for separating content from noisy context in template-based documents for search indexing is disclosed. In one embodiment, a method includes selecting a plurality of documents for index comparison, identifying one or more identical elements found in each of the plurality of documents, and removing the one or more identical elements from consideration in an indexing process of the plurality of documents.

Abstract: A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item.

Abstract: A structured document storage and management technique utilizes a generic document model tree, a symbol conversion module and an encoded vector set to store structured documents. The generic document model tree represents a structured document model and contains one or more structured document nodes without storing node data unique to any particular structured document. The symbol conversion module contains untagged data associated with the one or more structured document nodes, and representing node data for particular structured documents. The symbol conversion module also maintains a value code in association with each untagged data element. The encoded vector set includes one or more encoded vectors corresponding to the one or more structured document nodes having associated untagged data. Each encoded vector contains one of the value codes at an index position that corresponds to a particular structured document.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML document corresponds to a tree-like data structure, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; and decoding, via a decoder within a telecommunications device, paths with new elements, which does not conform to a previous schema, by communicating to the decoder one of (a) the associated tree structure nodes beforehand, and (b) a completely new schema.

Abstract: A method, computer program product, and a data processing system that facilitates navigation through a directed graph for selection of sub-processes of a modified business process derived from a business process is provided. A bounding box is used for evaluating and selecting sequences of nodes representative of business sub-processes or services. The bounding box has a predefined depth for limiting the scope of the evaluation. The bounding box is shifted during the evaluation as sequences of nodes are selected. Additionally, state data is maintained such that a sense response model may be employed to detect and account for changes to the environment in previously evaluated services. By maintaining state data, a transition to a previously evaluated sub-process may be implemented to account for significant changes in the environment.

Abstract: A fully web-enabled software system for building, editing, evaluating, rendering, navigating and storing an integrate repository of debate in which schematic representations of individual debates are bound together to form an overarching repository of debate by a multiplicity of user-specified semantic cross-relationships that allow the emergence of clusters of related debates. The system is comprised of: A Application software that allows system users to build and edit debate maps made up of discrete elements representing entities such as issues or questions, claims, positions, and simple and compound arguments, scenarios and debate protagonists in accordance with a set of constraints herein termed a map grammar that ensure that such maps are constructed in accordance with sound argumentation principles, an in which the set of all such maps are stored in a single, unified data structure.

Abstract: Methods and apparatus for classifying data for use in data fusion processes are disclosed. An example method of classifying data selectively groups nodes of a classification tree so that each node is assigned to only one of a plurality of groups and so that at least one of the groups includes at least two of the nodes. Data is classified based on the classification tree and the selective grouping of the nodes, and the results displayed.

Abstract: The disclosure relates to integration of a digital asset management system with a network sales system. The digital asset management system may comprise digital asset storage, search and retrieval functionality. Each digital asset may comprise one or more versions of the asset, properties of the asset, and conditions on its use. By way of the integration with the network sales system, a digital asset or digital asset version may be assigned a product identity to facilitate sale of the digital asset or digital asset version.