Abstract: A method, a system and a computer program product for matching a publication to at least one subscriber are disclosed. After receiving a publication request, a matching engine accesses a hash table to determine whether there is a non-wildcarded match corresponding to the publication request. If the matching engine finds the non-wildcarded match in the hash table, the matching engine omits validating a topic of the publication and provides the non-wildcarded match to the broker device without waiting for a result of searching a wildcarded match. Otherwise, the matching engine validates the topic of the publication. The matching engine also starts to search a wildcarded match in a wildcarded subscription data store. Upon finding the wildcarded match, the matching engine provides the wildcarded match to the broker device. The matching engine provides each result of the findings asynchronously to the broker device.

Abstract: A metrics generation system provides IT and other computing system metrics from different data sources in a single display. Configuration files containing parameters and instructions are loaded by the system to access different data sources. The metrics generation system retrieves IT system health data, processes and aggregates metrics from the retrieved data and displays the metrics based on user defined parameters and instructions in the configuration files. The metrics generation system is flexible in that it can be changed to extract data from different IT data sources, calculate different metric information having a hierarchy of attribute types and values, and display a variety of metric data in different formats.

Abstract: Method and system for determining a driving factor for a data value of interest in a multidimensional database, by collecting a context for the data value of interest in the multidimensional database. The data value of interest has dimensional levels with dimensional members outside the drill path of the data value of interest. The dimensional levels are enumerated in a list. A query using the dimensional members of the dimensional level is executed. A variance is calculated for the set of query results. A driving factor for the data value of interest is determined based on the variance. The driving factor is added to the context of the data value of interest.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture comprising at least one processor-readable medium and instructions carried on the at least one medium. The instructions causes a processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: Systems and methods that integrate user assigned association among a plurality of resources or entities. The subject innovation employs an association component that relates such resources or entities, based on aggregate of user notions that are assigned for relationships; and/or based on how users perceive existence of relationships among such resources. Accordingly, resources can be related (e.g., linked, matched, tagged and the like) based on relevance of collective user behavior during tagging.

Abstract: Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.

Abstract: A method of examining a data stream to detect presence of a complex string belonging to a complex dictionary is provided. The method includes associating an array of state variables and an array of reference states with the complex dictionary; detecting a simple string in the data stream, the simple string being a constituent string in the complex string in the complex dictionary; updating a state variable associated with the complex string according to all relative positions of the simple string within the complex string; and determining that the complex string is present in the data stream when the state variable attains a corresponding reference state. A corresponding system is also provided.

Abstract: What is disclosed is a novel system and method for analyzing multi-dimensional cluster data sets to identify clusters of related documents in an electronic document storage system. Digital documents, for which multi-dimensional probabilistic relationships are to be determined, are received and then parsed to identify multi-dimensional count data with at least three dimensions. Multi-dimensional tensors representing the count data and estimated cluster membership probabilities are created. The tensors are then iteratively processed using a first and a complementary second tensor factorization model to refine the cluster definition matrices until a convergence criteria has been satisfied. Likely cluster memberships for the count data are determined based upon the refinements made to the cluster definition matrices by the alternating tensor factorization models.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture comprising at least one processor-readable medium and instructions carried on the at least one medium. The instructions causes a processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: A computer implemented method, computer program product, and data processing system for performing analysis on a plurality of data stored in a database. In an illustrative method, a first cohort is generated from the plurality of data. An optimal control cohort is generated from the plurality of data. Generating is performed based on the first cohort and at least one constraint, and a mathematical process is used to derive the optimal control cohort. A first inference is generated based on a comparison of the first cohort to the optimal control cohort, wherein the first inference is absent from the database. In an illustrative example, the first inference is stored.

Abstract: A method for inserting a validated time-image on a primary CDP subsystem in a continuous data protection and replication (CDP/R) subsystem. In one embodiment, the method includes processing data of RI1 at a secondary system in accordance with a recovery process, wherein RI1 is a first image of a replication of a data object. First data is generated in response to processing the data of RI1 in accordance with the recovery process, wherein the first data relates to processing the data of RI1 in accordance with the recovery process. Once the first data is generated, a copy of the first data is transmitted to a primary system that stores the data object.

Abstract: Determining an application user as a source of database activity is disclosed. A communication is received. A thread that is configured to handle the communication is associated with an application user with which the communication is associated. The application user is associated with a database query generated by the thread.

Abstract: A system and method are provided for object age detection in garbage collection heaps. In one embodiment, ages of objects in a garbage collection heap at a first virtual machine at a server are determined by detecting a number of garbage collections each object has survived. An age is associated to each object according to the determined ages. The objects are grouped in age ranges, wherein the age ranges correspond to the determined ages. The age ranges are communicated to a second virtual machine at a client.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture comprising at least one processor-readable medium and instructions carried on the at least one medium. The instructions causes a processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: Associative references in a garbage collected programming environment is disclosed. An indication that an object is not reachable from any root object. The object is kept alive if it is determined by a garbage collection process, based at least in part on data other than data comprising the object or managed by an application with which the object is associated, that the object is associated with at least one other object that has been determined to be reachable.

Abstract: A local terminal search system is provided, which includes a search request processing unit, a search/index unit, a filtering unit, and a complex-structured file preprocessing unit. The search request processing unit receives search request information and converts search result information into prescribed document format and provides it to a search interface program. The search/index unit searches a local terminal using a search keyword in the search request information to generate search result information and indexes information stored in the terminal. The filtering unit collects information of files stored in the terminal for filtering and determines if a file corresponding to the collected information is a complex-structured file which requires more than a prescribed threshold time for filtering and filters the file if it is not a complex-structured file.

Abstract: A condition generating unit generates a hierarchical-type search condition including a search target structure ID and a search result structure ID. A first acquiring unit acquires an object ID corresponding to the search target structure ID to which a vocabulary index is not attached. A candidate generating unit generates a candidate of the search result in which an acquired object ID is associated with the search key as a first constraint condition. A second acquiring unit acquires a search result structure ID complying with a structure constraint. A result acquiring unit acquires an object corresponding to the object ID satisfying the first constraint condition.

Abstract: A computer implemented method, apparatus, and computer usable program code for inferring a probability of a first inference absent from a database at which a query regarding the inference is received. Each datum of the database is conformed to the dimensions of the database. Each datum of the plurality of data has associated metadata and an associated key. The associated metadata includes data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum. The query is used as a frame of reference for the search. The database returns a probability of the correctness of the first inference based on the query and on the data.

Abstract: A system and method for law enforcement query entry that enables universal platform access without requiring specialized platform software by utilizing a keystroke efficient lexicon for data entry that is converted to standardized search commands by a back end server and by displaying search results in accordance with user, platform, network, and data security constraints.

Abstract: Disclosed is a method, apparatus and a computer program of a virtual execution environment. In one aspect thereof a data processor includes a disk-based storage system and a virtual machine monitor configured to execute a program in a virtual container. The virtual machine monitor is responsive, prior to execution of the application, to record a set of files accessed during a phase change in the disk-based storage system in a manner predetermined to minimize the time needed to retrieve the set of files. The virtual machine monitor is further responsive, at the occurrence of the phase change, or prior to the occurrence of a phase change if the files are prefetched, to retrieve the files from the disk-based storage system.