Abstract: Various embodiments included herein include at least one of systems, methods, and software for explanatory animation generation. Some embodiments include receiving data representative of at least two data items, each data item to be presented as a node. Relationships between these data items are discovered in an interrelated dataset and the relationship is illustrated as a set of sequential nodes on a canvas. A text-script descriptive of each of the nodes is then generated. Finally, such embodiments include generating a visualization with a synchronized voiceover based on the sequence nodes and the text-script, the visualization including each node with a synchronized voiceover of each node.

Abstract: In one aspect of the invention, a memory is described for facilitating splitting data by taxonomy. The memory is accessed by an application program, and includes one or more top-level categories, where each top-level category comprises a subset of the items; and also includes a category group corresponding to at least one of the top-level categories and the subset of the items belonging to the top-level categories.

Abstract: A replication operation service migrates data from a source volume having a source file system type to a destination volume having a destination file system type, where the source file system type may be different from the destination file system type. The replication operation is completed without interrupting the operations of a client device in the system. A stable copy of the source file system is generated on the source volume. A file system agnostic representation of a portion of the data in the source volume is generated from the stable copy. The representation is transmitted to the destination volume where it is converted to conform to the destination file system type.

Abstract: This publication discloses a method for classifying and selecting records. This publication also discloses a classification and selection system according to the invention and a computer program product for classifying and selecting records. In the method according to the invention, a classification structure corresponding to a read field is selected (1001), a reference value according to the value contained in the field is searched (1004) from the selected classification structure, at least one class according to the conditions of the classification structure corresponding to the reference value is read (1007) from the selected classification structure, and the record is selected to the class read from the classification structure. The classification and selection system and computer program product according to the invention are suitable to the classification and selection of records.

Abstract: A method is disclosed for receiving a hierarchical data structure, analyzing the hierarchical data structure to determine what actions are needed to correctly process the hierarchical data structure in a data repository, generating a hierarchical command structure comprising a series of repository-specific commands needed to interface with the data repository, and executing the repository-specific commands to process the hierarchical data structure with respect to the data repository. In selected embodiments, the hierarchical command structure is represented as a series of nodes including a parent node and at least one child node.

Abstract: A method is disclosed for reorganizing a set of database partitions based on a ranked set of database partitions. The method includes a step to determine a fragmentation indicator for each database partition within a set of database partitions. A step ranks the set of database partitions according to a rank criteria. The rank criteria includes, at a minimum, the fragmentation indicator. A step reorganizes a subset of the database partitions in the ranked set of database partitions. The subset is selected, at least in part, by a rank order for the ranked set of database partitions. The subset may be selected such that ranked database partitions satisfying a reorganization threshold are included in the subset.

Abstract: A computer process initiates a pre-analysis of managed objects and corresponding structures for storing object data in a relational database. The pre-analysis yields a set of operational instructions (e.g., a “stored” database procedure) that can be applied at run time to more efficiently initiate a modification to objects and corresponding object data stored in a relational database. After execution of a stored procedure to modify contents of an object and respective contents in a relational database, a synchronizer utilizes an identifier to access a log that stores changes associated with a managed object to which the stored procedure was applied. Based on contents of the log, the synchronizer identifies changes to one or more managed objects and identifies corresponding processes that rely on use of the affected managed objects. The synchronizer then notifies corresponding processes utilizing the affected managed objects of the changes to the relational database and/or managed objects.

Abstract: To provide an electronic mail device, an information adding program for an electronic mail and an information adding method for an electronic mail that are capable of saving, when sending the electronic mail, a labor for transmitting the mail by automatically adding information related to a text that is to be transmitted. An input of an electronic mail created by a user is accepted, a keyword is acquired from the electronic mail, additional information corresponding to the keyword is searched for from an additional candidate storage unit stored with candidates for the additional information to the mail, etc. transmitted and received in the past, and the searched additional information is added to the electronic mail.

Abstract: Method allowing a computerized manager to transparently allocate computational resources to a plurality of users. A plurality of computers or servers are provided for accommodating the computational resources or for storing data. These computational resources and the data are arranged as a hierarchical repository. A root computer is used as an interface between the users and the computers or servers. The root computer is capable of communicating with the users, with the computers or with servers. The computers or servers are controlled and the manager is allowed to allocate computer resources to the users. Information is stored in the computers or servers, in a local repository or in the system files of the computers or servers.

Abstract: A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.

Abstract: There is provided a performance information reproducing apparatus that is capable of realizing desired synchronized reproduction of a plurality of types of data, such as music and images with ease. An external storage device stores a musical tone data file, in which musical tone information is recorded, and at least one media data file, in which at least one other type of media information is recorded, together with a management file in which reading manners of the musical tone data file and the media data files are recorded. A CPU generates, based on the musical tone data file and the management file, reproduction data that designates the musical tone information and the media data file to be reproduced, using designation information in a same format as the musical tone information.

Abstract: Disclosed is a technique for indexing data. A token is received. It is determined whether a data field associated with the token is a fixed width. When the data field is a fixed width, the token is designated as one for which fixed width sort is to be performed. When the data field is a variable length, the token is designated as one for which a variable width sort is to be performed.

Abstract: A computer system performs data processing using a data organizer which parses a primary set of data into predefined sets of data components according to one or more enterprise models. The sets of data components from the data organizer are respectively stored in multiple data sources. The data components may be stored as a binary file or hierarchical file. A plurality of data processing systems execute the enterprise models. A task manager controls which enterprise model executes on each data processing system. The data processing systems access the data components from the data sources which correspond the executing enterprise model. The data components are sent over dedicated communication channels to the data processing systems. Each data processing system may have a data interface, which is configured to receive data from different sources and convert the data into a standard format.

Abstract: A method and system thereof for identifying records are described. Records on a node are distinguished from other records on the node by assigning each record a unique local identifier. When a record is moved from one node to another node, a unique global identifier is assigned to the record. A translation technique is employed to map the local identifier to the global identifier (and vice versa).

Abstract: Systems and methods for improved exposure of database schema information are disclosed. Generally, a database driver may retrieve and provide database schema information according to one of two default methods or, also, a third override method. The first default method is to execute a query on the database. The second default method is to retrieve information from a hard-coded collection stored locally at the driver. The third override method is to retrieve information from a designated file that may be updated at any time without having to update the database and/or driver binaries.

Abstract: A method and apparatus for performing network file system (NFS) operations across a plurality of servers is provided. At a first server, a filehandle for a particular file is generated based, at least in part, on an identifier that uniquely identifies the particular file relative to all other files within a file system repository. The file system repository may be implemented in a database. The identifier may also be stored in the database. The first server sends a client the filehandle. The client may thereafter send another request for the performance of a file operation, containing the filehandle, to a different server. The second server may read the filehandle and use the identifier to locate the file within the repository against which to perform the file operation without receiving, from the first server, information that associates the filehandle with the file.

Abstract: The present invention is related to caching data by employing probabilistic predictive techniques. The invention has particular application to multimedia systems for providing local storage of a subset of available viewing selections by assigning a value to a selection and retaining selections in the cache depending on the value and size of the selection. The value assigned to an item can represent the time-dependent likelihood that a user will review an item at some time in the future. An initial value of an item can be based on the user's viewing habits, the user's or a group of user's viewing habit over particular time segment. A value assigned to a selection dynamically changes according to a set of cache retention policies. A selection's value may be reduced based upon age, changes on a user's viewing habits, changes in time segments or a user's modification of the cache retention policies.

Abstract: A Structured Query Language (SQL) adapter business service that converts data from a data set to a common representation format used for all data sets with which the SQL adapter business service interacts. Hence the SQL adapter business service can communicate with various internal and external systems independently of the native format in which those systems maintain and store data. The SQL adapter business service optimizes operations to update data in the data sets by combining operations when possible and by using result sets from executing previous SQL statements to construct subsequent SQL statements. SQL adapter business service takes advantage of parent/child relationships between tables to construct SQL statements in an order such that the SQL statements process only a minimum amount of data, thereby making retrieval of data as efficient as possible.

Abstract: Performing operations on multidimensional data managed by a relational database system is facilitated by registration of solved cubes with a RDBMS. A solved cube is an abstract construct likened to a view or a table on relational data and contains not only base data, but also aggregated measure data that is base data that has been processed across multiple levels of a hierarchical dimension. In an embodiment, a solved cube may provide all the pre-computed aggregated data for a particular context that the solved cube represents. In another embodiment, a solved cube may not provide any pre-computed data, but may provide several procedures, operations and/or instructions that can be executed to compute aggregated data for a particular context that the solved cube represents. A solved cube is registered with a RDBMS by providing metadata that defines a given solved cube. Therefore, a database server is able interpret the metadata, and to perform operations on the given solved cube based on the metadata.

Abstract: Systems and methods for populating attribute value fields in an entity object employ in a ranked list of transfer options to determine which of a plurality of transfer options will be used to populate the attribute value fields in the entity object.