Abstract: Embodiments are directed to a computer implemented method of analyzing a graph having a plurality of vertices and edges to identify a subgraph of the graph, wherein the subgraph includes an exact subset. The method includes applying, by a first processor, a heuristic analysis to the graph to determine an initial subset of the graph. The method further includes applying, by either the first processor or a second processor, an exact analysis to the initial subset to determine an exact subset of the initial subset.

Abstract: A category name extraction device includes a specifying means configured to specify a word contained in a plurality of item information respectively belonging to a plurality of categories in parallel structure, qualifying or being qualified by a name of a category where each item information belongs, and being in common to a plurality of item information belonging to a plurality of different categories, as a reference word, an extraction means configured to extract a word contained in a phrase contained in item information belonging to any of the plurality of categories, qualifying or being qualified by the reference word, and being different from names of the plurality of categories, as a candidate category name, and an output means configured to output the candidate category name extracted by the extraction means.

Abstract: The insertion into a data stream of collection records associated with multiple collections of data items in the data stream, for purposes of aiding in subsequent processing of the data stream by collections. Each collection record comprises a collection definition that does not overlap with the collection definition in any of the sequence of collection records including the collection definition of any neighboring collection record in the sequence of collection records. Each collection record also includes a data stream address range extending from the first data item to the last data item in the collection.

Abstract: A technique for suggesting patterns to search documents for information of interest includes acquiring a working set of spans for a document set that includes one or more documents. A list of one or more suggested patterns is generated by applying a pattern suggestion algorithm (PSA) to the set of spans for each document in the document set. One or more unique patterns are generated by applying a pattern consolidation algorithm (PCA) to the generated list of suggested patterns. Pattern information for each of the unique patterns is then generated. The pattern information includes a respective first count that corresponds to the number of times each of the unique patterns occurs in the document set.

Abstract: Linear run length encoding is described. A system and method include storing a table of time series data in a database of a data platform, the table of time series data representing a set of time series blocks. Each time series block of the set of time series blocks has a time series of equally-incremented time intervals and a run length. Each time interval of the time series is associated with one or more values. The run length has a starting position with at least one starting value and an ending position with at least one ending value. The starting position and the at least one starting value is stored for each time series block in a column store of the database. Then, a compressed index is generated in the column store of the database for each time series block, the compressed index comprising the starting position and the at least one starting value.

Abstract: A method of checking file system compliance including receiving a plurality of compliance rules corresponding to a file system of a production system, collecting, by a collector, file system meta data from the file system, analyzing, by an analyzer, the file system meta data using the plurality of compliance rules to determine at least one compliance deviation of the file system, and throttling the collector and the analyzer independently of one-another, wherein the collector and the analyzer are configured according to a model of performance for the production system and a schedule for the collection and analyzing.

Abstract: A method for discovering representative composite configuration item (CI) patterns in an IT system that includes a plurality of configuration items may include data mining a graph representing the IT system to extract extended frequent composite CI patterns. The method may also include clustering the extended frequent composite CI patterns into clusters based on similarity between the maximal frequent composite CI patterns. The method may further include extracting a representative composite CI pattern for each of the clusters, and using an output device, outputting the representative composite CI pattern for each of the clusters.

Abstract: Methods, systems, devices and/or apparatus related to type of network-based social network in which network “connections” are include a topical trust factor between users, so that reputable information available over the network may be provided. In an example embodiment, a social rank score for available items of information is provided that allows the system to rank available information based upon topical factors associated with such information.

Abstract: Synchronization metadata is read from non-volatile storage. The synchronization metadata comprises indications of one or more synchronization targets. A synchronization target is a node of a clustered storage system. A synchronization cache is populated with the synchronization metadata. After populating the synchronization cache with at least a portion of the synchronization metadata, a connection to a network is established. After the connection to the network is established, a connection to a first of the one or more synchronization targets is established.

Abstract: Categorizing data in an on-demand database environment is provided. The categorized data is accessed to provide results based on statistical likelihood that records provide a desired result of a query. The categorization of the data includes organizing queries based on semantic terms, with categorization based on a multidimensional categorization of data in the database environment. The generating of results includes accessing relationship metadata both for individual records and for categories. Relationships along the same category, or among categories can provide records that may answer the query. The relationships and statistics are updated based on usage of the results data. Records and relationships identified as being used to solve the query, or being a desired solution to the query, can be weighted more heavily, thus increasing the likelihood of providing the most relevant data for subsequent queries.

Abstract: Techniques and structures relating to processing of data in an information sharing service are disclosed. Implementation of a data structure including entries identifying data that may be shared amongst users in the information service facilitates efficient processing. The data structure entries may include pointers usable to access corresponding details of the sharable data. The entries may also include information useful for filtering the entities, such as an indication of a user account that originates an account update, and a time associated with an update. The data structure may be used to generate data feeds that allow users to access the identified data.

Abstract: Performance information indicative of operator performance of a mobile machine is detected. Context criteria are identified based on a sensed context of the mobile machine. As set of performance data is parsed to identify reference data, based on the context criteria. A performance opportunity space is identified, by comparing the detected performance information to the reference data. A user interface component is controlled to surface the performance opportunity space for interaction.

Abstract: A method includes storing documents of different fields, and a relationship between any two documents of different fields, performing word segmentation and stop word removal on the documents of different fields, to obtain a vocabulary data set for the documents of different fields, constructing an incidence matrix between the documents of different fields according to the relationship between the any two documents of different fields, obtaining a topic cluster of the documents of different fields according to the vocabulary data set, obtaining a probability that any topic in the topic cluster appears in any document and a matching weight of the any topic for any two different fields according to the incidence matrix and the topic cluster, and computing a similarity between the any two documents according to the probabilities and the matching weight of the any topic for the fields to which the any two documents belong.

Abstract: A unique material identifier (UMID) for a media file that was not provided with a UMID at its point of origination is generated by using the content of the file, and is independent of the time of file import or accessing. For a given item of media material, the UMID remains unchanged and uniquely identifies the item when such a file is imported or accessed multiple times. The UMID may be generated by hashing together selected portions of the metadata and essence of the media file. The amount of metadata and essence sampled is chosen to provide a high degree of assurance that the UMID will be unique, but is kept small enough so as to avoid causing a perceptible lag when the UMID is generated. In various embodiments the UMID is based purely on one or more selected portions of the media file essence.

Abstract: An event-occurrence-place estimation method having a process executed by a computer, the process includes acquiring a message of a predetermined event from social media to which a message is posted; extracting occurrence place information indicating an occurrence place of the predetermined event from the acquired messages; ranking the occurrence places in descending order according to the number of acquired messages corresponding to each of the pieces of occurrence place information, cumulating, for each of the occurrence places, the number of acquired messages of the occurrence place and the number of acquired messages of the occurrence places which are ranked higher than the occurrence place information, and identifying a change point where an increase rate of the cumulated number of the messages is an average increase ratio; and outputting the piece of occurrence place information identified by the identified change point.

Abstract: Systems and articles for customized applications are described. The system comprises at least one database having previously-obtained information, an assessment module communicable attached to the at least one database communicably attached to the at least one database, wherein the assessment module is configured to identify requisite data based on the previously-obtained information in the at least one database, and an application-generating module communicably attached to the at least one database, wherein the application-generating module is configured to generate an application based on requisite data in the at least one database. Other embodiments may be described and claimed.

Abstract: In some example embodiments, an indication of a selected data point of a current visualization can be received. A context of the selected data point can be determined based on a dimension of the data point, and explanation candidates can be generated based on the context of the selected data point. Each exploration candidate can have a different dimension context that is within the context of the selected data point and a corresponding value for the dimension context. For each one of the explanation candidates, a corresponding score can be generated based on a difference between the value for the explanation candidate and an average value of all the values of the explanation candidates. The explanation candidates can be ranked based on the scores. At least one of the explanation candidates can be selected based on the ranking, and selectable explanation(s) for the selected explanation candidate(s) can be displayed.

Abstract: An approach includes a system implemented in a computer infrastructure including a processor. The approach further includes the processor configured to receive dimensionally aware linkages. The approach further includes the processor configured to retrieve aggregated data from a data set. The approach further includes the processor configured to identify at least one affinity cluster related to the dimensionally aware linkages in at least two dimensions and the retrieved aggregated data by performing at least one lookup linkage which matches at least one dimension of the at least two dimensions of the dimensionally aware linkages with the retrieved aggregated data. The approach further includes the processor configured to provide personalized content to a user having same or similar user preferences as the received dimensionally aware linkages based on the identified at least one affinity cluster.

Abstract: An indexing system for documents such as web pages divides a document into elements, such as document object model elements. User attention data from prior interactions with the document are analyzed to determine those elements of a document that satisfy a threshold requirement of user attention. Elements meeting the user attention threshold requirement are added to a set of indexable content for the document. Furthermore, document sections are determined based on attention data and each section is indexed separately. Indexing is per section and based only on the indexable content, thereby enhancing the index relevance, increasing the efficiency of search engines and reducing spamdexing.

Abstract: A technique for suggesting patterns to search documents for information of interest includes acquiring a working set of spans for a document set that includes one or more documents. A list of one or more suggested patterns is generated by applying a pattern suggestion algorithm (PSA) to the set of spans for each document in the document set. One or more unique patterns are generated by applying a pattern consolidation algorithm (PCA) to the generated list of suggested patterns. Pattern information for each of the unique patterns is then generated. The pattern information includes a respective first count that corresponds to the number of times each of the unique patterns occurs in the document set.