Abstract: A method for providing data collection from a client at a data collection mechanism, the method includes collecting from a client a first portion of data at a first data collection mechanism using at least a portion of a first script comprising one or more queries for information to the client. The method also includes associating the client with a second data collection mechanism based at least in part on an event associated with the client's interaction with the first data collection mechanism. After associating the client with the second data collection mechanism, collecting from the client a second portion of data using a second script, wherein the second script comprises at least one query for information not yet presented to the client by the first script.

Abstract: An authoring tool (or process) to facilitate the performance of an annotation function and an indexing function. The annotation function may generate informational annotations and word annotations to a database design schema (e.g., an entity-relationship diagram or “ERD”). The indexing function may analyze the words of the annotations by classifying the words in accordance with a concordance and dictionary, and assign a normalized weight to each word of each of the annotations based on the classification(s) of the word(s) of the annotation. A query translator (or query translation process) to (i) accept a natural language query from a user interface process, (ii) convert the natural language query to a formal command query (e.g., an SQL query) using the indexed annotations generated by the authoring tool and the database design schema, and (iii) present the formal command query to a database management process for interrogating the relational database.

Abstract: An information processing apparatus for reproducing metadata including information on material data, the information processing apparatus determines whether or not the metadata inputted is defined in advance, and reproduces standard item data and non-standard item data included in the metadata when the metadata is defined in advance, and reproduces only the standard item data included in the metadata when the metadata is not defined in advance.

Abstract: The present invention comprises a computerized method for indexing information through the use of a general-purpose computer in operative communication with a data stream. A data stream is read, wherein the data represents one or more transitions within one or more episodes. A signature is created for each of the episodes within the data stream, wherein the signature is a representation of the transitions. The steps are repeated for each of the episodes in the data stream. An index is created comprised of the signatures.

Abstract: A system provides search results relating to a point-of-view (POV). The system obtains a search query and POV data. The system generates a list of documents based on the search query and filters the list of documents based on the POV data. Alternatively, the system may perform a search based on the search query and the POV data to generate the list of documents. In either case, the system then presents the list of documents as the result of the search.

Abstract: To help ensure high data quality, data warehouses validate and clean, if needed incoming data tuples from external sources. In many situations, input tuples or portions of input tuples must match acceptable tuples in a reference table. For example, product name and description fields in a sales record from a distributor must match the pre-recorded name and description fields in a product reference relation. A disclosed system implements an efficient and accurate approximate or fuzzy match operation that can effectively clean an incoming tuple if it fails to match exactly with any of the multiple tuples in the reference relation. A disclosed similarity function that utilizes token substrings referred to as q-grams overcomes limitations of prior art similarity functions while efficiently performing a fuzzy match process.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention provide for predicting system failure based on pattern recognition of subcomponent exposure to failure. A dataset is generated that has at least one exposure level to failure of a computer-based system and a corresponding rule identifier of a rule used to calculate the exposure level. The rule asynchronously receives information about the computer-based system and calculates the exposure level based on the received information. The generated dataset is compared to a previously generated dataset by comparing the at least one exposure level of the dataset to an at least one exposure level with the same rule identifier in the previously generated dataset, where the previously generated dataset is associated with a known problem with the computer-based system.

Abstract: A system and method for managing the development and manufacturing process of a pharmaceutical is disclosed. The method comprises capturing and recording the development and manufacturing history of the pharmaceutical drug in order to generate a product history. The product history is stored on a computer and is searchable in multiple data dimensions in order to easily retrieve information. The system automatically provides compliance management procedures in order to comply with regulatory standards for the pharmaceutical industry.

Abstract: Acquired data about communication interactions is used to form constructs which are indicative of an entity and communities-of-practice within the entity. A construction may be derived from the addressing data associated with the interactions to depict a communication network construct of the organization over time. The construction is selectively decomposed to smaller communications networks indicative of said communities-of-practice.

Abstract: A method for converting to Unicode, in a Java Input Method Editor (“IME”), the encoding formats of a character code unit, including selecting an encoding format, receiving, through a computer user interface, in an IME, at least one character code unit having the encoding format and an encoding base, and displaying the character code unit through the computer user interface. Embodiments also include converting the encoding format of the character code unit to Unicode, thereby creating a Unicode code point, displaying, through the computer user interface, a glyph corresponding to the Unicode code point, and transferring the Unicode code point to an application.

Abstract: Subject matter includes exemplary flexible rules for defining an information management process, for example a process that manages information being transferred between databases or with respect to an exemplary metadirectory. The flexible rules have inherent logic to define part of an information management action or a database structure and perform a call out for custom logic. The custom logic performs or defines another part of the information management action or database structure. Besides the exemplary flexible rules, the subject matter describes exemplary identity information management processes, engines, and related methods.

Abstract: A method includes defining collaborative information spaces (CISs) on a corporate intranet using semantic definitions that reflect how people work together. A classification scheme allows network spaces (e.g., intranet spaces) to be defined, e.g., defining resources and/or information associated with tasks and people. The classification scheme may also be used to define standard collaborative entities that should be supported within an enterprise. The CIS(s) and/or collaborative entities may have associated privacy levels to control access to information and resources of the CIS. The classification scheme allows a user, or group of users, to define public and private information spaces. For example, a user may define public information on a web-page that defines the users skills and assigned tasks. The user may have another set of private information that is accessible only to other members of others having a common task.

Abstract: A system for the management of information relating to the installation of firestopping systems within one or more facilities by contractors includes a network server and client devices that interact with the network server via a computer network. The client devices may be associated with administrators and contractors. The network server collects information from the contractors that describes a penetration of a fire-rated structure or an installation of a fire-rated duct, and direct a database server to generate a record for the penetration or duct based on the collected information and store the record in a database. The information may include the contractor, an authorizer, work-type, location, and one or more firestopping systems to be installed. The network server may provide the contractors with lists of permissible selections for the information. The network server may generate these lists from information stored in the database that was previously provided by administrators.

Abstract: A method, a query optimizer, and computer program product are provided for implementing live switchover to a temporary sparse index for faster query performance. A first plan using an existing index is used for processing a query. A temporary sparse index is built for the query simultaneously with the first plan processing the query. When the temporary sparse index is built, processing the query with the first plan is stopped and a live switchover to the temporary sparse index is provided. Then a second plan using the temporary sparse index is used to continue processing the query at a point where processing stopped with the first plan.

Abstract: A system and methodology for generating bushy trees using a left-deep tree join enumeration strategy for optimizing execution of a database query is described. In response to receipt of a query specifying at least one join condition between two or more database tables, each query block comprising an atomic portion of the query is identified and subplans are created for each query block based on grouping portions of each query block. At least one favorable access plan is determined for each subplan of each query block based, at least in part, on estimated execution costs. An optimal access plan for each query block is generated based upon at least one favorable access plan determined for each subplan. A query execution plan is then constructed based upon the optimal access plan generated for each query block.

Abstract: Tokens are used to prepare a target database for replication from a source database and to confirm the preparation in an asynchronous coordinated commit replication process. During a dual write replication process, transmission of the replicated data and locking of data records in the target database occurs only on updates.

Abstract: Techniques are provided for determining the efficient conjunction of Boolean variables drawn from an and-or forest of choices. The techniques determine two contexts to conjoin, where the contexts consist of choices drawn from an and-or forest of choices. The choices in the first context are marked with a first mark, along with all of their antecedent choices. The choices in the second context are marked with a second mark, along with all of their antecedent choices. The techniques determine and-nodes in the and-or forest having the first mark from a first dependent or-node and the second mark from a second dependent node. The dependent or-nodes are refined and then partitioned into classes based on the presence of the first mark and the second mark, the first mark only, the second mark only, and neither mark.

Abstract: Methods and apparatus, including computer program products, for representing hierarchical list data. One method involves receiving a first list comprising an element A1 and an element A2, the element A2 comprising a first nested list comprising an element N1 and an element N2; receiving a second list comprising an element B1 and an element B2, the element B2 comprising a second nested list comprising an element M1 and an element M2; storing the elements A1 and B1 in a first array; and storing the elements A2 and B2 in a second array, the second array comprising a first sub-array to store the elements N1 and M1, and a second sub-array to store the N2 and M2.

Abstract: This invention enables a file to be accessed even during replication while maintaining its consistency. The replication is done among a plurality of distributed storage devices, a file is searched, in response to an access request from a client machine #11, from GUID management databases 13, 23 each of which stores a relationship between a GUID of a file stored in a storage device #0 (#1) and a device ID of a storage device containing an original file. When the storage device #1 does not have the demanded file, a device ID (#0) of a storage device containing its original file is searched from the GUID management database based on a GUID of the file C, and the file C demanded by this the storage device #0 is accessed.

Abstract: A system, method, and computer program product retrieve information associated with the signals. The information retrieval can be performed on a signal by quantizing the signal, forming words, and indexing based on weights of the words. The words are formed by grouping letters together to form a number of words within predetermined threshold values. The weights of the words are determined using a binomial log likelihood ratio analysis. The present invention may be applied to identification of an unknown song.