Abstract: A method, device and medium for constructing a knowledge base is described, wherein the knowledge base construction based on retrieving text information, determining whether the text information includes at least first information according to a predefined property description pattern, extracting the first information from the text information when the first information is determined to be included in the text information, and constructing the knowledge base based on the first information and an entity corresponding to the first information.

Abstract: A system generates and displays to a user of a digital magazine a list of candidate topics. The system first receives a package name list from a user device of the user, and the package name list indicates computer applications installed on the user device. The system retrieves a package name-topic matrix generated based on information associated with a set of existing users of the system. The system compares package names included in the received package name list and package names included in the package name-topic matrix, and identifies known topics in the package name-topic matrix based on the comparison. The system generates a list of candidate topics for the user based on the identified known topics, and provides the list for display to the user. In response to candidate topics selected by the user, the system provides to the user content relevant to the selected candidate topics.

Abstract: A system and a method, the method including receiving a set of documents, the set including at least one instance of an unstructured document; parsing the set of documents to obtain information regarding the set of documents; determining a map of a map for the set of documents based on the information obtained by the parsing; generating a hierarchical semantic representation of the set of documents based on the map of the map; and storing the hierarchical semantic representation of the set of documents.

Abstract: Techniques are disclosed for processing a data set that is not organized according to a schema being used for organizing data (referred to herein as an “unstructured data set”). An unstructured data set is analyzed based on a group of structured data sets that are organized according to the schema. A particular structured data set is determined to be associated with the unstructured data set. The unstructured data set is stored in association with the particular structured data set. Periodically, the unstructured data set is re-analyzed based on a current version of the group of structured data sets. Additionally or alternatively, an unstructured data set is analyzed based on a particular schema of a set of schemas. A subset of information is extracted from the unstructured data set, and stored in accordance with the particular schema. Periodically, the unstructured data set is re-analyzed based on a current version of the set of schemas.

Abstract: A system for reducing the information content of a data stream according to privacy requirements that vary according to referents of the data while maximizing the utility of the data stream in the aggregate. In embodiments, a receiver of data characterizing multiple referents extracts information such as statistics. A filter may reduce the information content of the data to reduce the probability that the receiver could uniquely identify any single referent from the data, according to privacy requirements that vary by the referent. The filter allows this to be done in a way that allows the utility of the data to be maximized when the permitted probability of identification varies among the referents.

Abstract: The present invention extends to methods, systems, and computing system program products for incrementally calculating kurtosis for Big Data or streamed data in real time by incrementally calculating one or more components of kurtosis. Embodiments of the invention include incrementally calculating one or more components of a kurtosis for a modified computation subset based on the one or more components of the kurtosis calculated for a pre-modified computation subset and then calculating the kurtosis based on the incrementally calculated components. Incrementally calculating kurtosis avoids visiting all data elements in the modified computation subset and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve receiving a query that requires work to be performed on data that resides in a plurality of on disk extents. A parallel query coordinator that is aware of the in-memory distribution divides the work into granules that align with the in-memory separation. The parallel query coordinator then sends each granule to the database server instance with local in memory access to the data required by the granule and aggregates the results to respond to the query.

Abstract: A method begins by determining an encoding modification for a set of encoded data slices. The method continues by determining a plurality of tasks for executing the encoding modification. The method continues by dividing a first task of the plurality of tasks into one or more partial tasks based on the first task and assigning a first partial task of the one or more partial tasks to a first storage unit. The method continues by dividing a second task of the plurality of tasks into a plurality of partial tasks based on the second task and assigning the plurality of partial tasks to a set of storage units. The method continues by executing, by the first storage unit and at least some storage units of the set of storage units, the first partial task and the plurality of partial tasks, respectively, to produce a modified set of encoded data slices.

Abstract: Some aspects of this disclosure include systems, methods, and/or computer programs that may be used to determine a cause of an inaccuracy in predicted affective response to an event that involves a user who has an experience. Some embodiments described herein involve identifying when a difference between a measurement of affective response corresponding to an event is different from the predicted affective response corresponding to the event. When such a discrepancy is identified, a presentation is made to the user of at least one of the following: one or more factors characterizing the event, and effects of the one or more factors on the user, as determined based on a model of the user. Based on a comment made by the user in response to the presentation, at least one of the following is identified: a discrepancy in a description of the event, and an inaccuracy in the model.

Abstract: The present invention extends to methods, systems, and computing system program products for decrementally calculating kurtosis for Big Data or streamed data. Embodiments of the invention include decrementally calculating one or more components of a kurtosis for an adjusted computation subset based on one or more components of the kurtosis calculated for a previous computation subset and then calculating the kurtosis based on the components. Decrementally calculating kurtosis avoids visiting all data elements in the adjusted computation subset and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: A system with methodology for providing multi-language support for dynamic ontology. In one embodiment, for example, a method comprises: storing an ontology for a data store, wherein the ontology comprises a plurality of data types; for each data type of the plurality of data types: storing, in the ontology, one or more display values, wherein each display value is associated with a locale; determining a locale identifier corresponding to a particular locale; selecting a particular display value corresponding to the particular locale; displaying the particular display value.

Abstract: A computerized system and method provides for sharing digital assets among multiple different organizations in a multi-organization system, and further providing that one or more of localized digital assets can be assembled using digital assets, templates and rules specified by different organizations. Further, the various organizations can contribute and share digital assets with organizations, while controlling the localization of the asset with brand or other information both as specified by the provider organization and as specified by the user organization.

Abstract: The present invention extends to methods, systems, and computing system program products for iteratively calculating variance and/or standard deviation for Big Data. Embodiments of the invention include iteratively calculating one or more components of a variance and/or a standard deviation in a modified computation subset based on iteratively calculated one or more components of the variance and/or the standard deviation calculated for a previous computation subset and then calculating the variance and/or the standard deviation based on the iteratively calculated components. Iteratively calculating the components of variance and/or standard deviation avoids visiting all data elements in the modified computation subset and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: In one aspect, a method includes receiving an I/O to write data to a volume stored, increasing a hash reference count for a hash of the data in response to receiving the I/O, periodically generating snapshots of the volume, adding metadata on the I/O and a timestamp to a metadata journal and increasing the reference count value in response to adding the metadata.

Abstract: In one embodiment of the present invention, one or more computer processors create update commands that describe a state change of a resource and include the update commands in a change event for the resource in a change log. Embodiments of the present invention can obviate the need for an indexer to retrieve all triples of a changed resource via HTTP GET requests, and obviate the need for the indexer to replace all triples of a prior version of a changed resource with newly obtained triples.

Abstract: A method of performing a search of heterogeneous data based on an input query includes: generating an index including at least two hash tables, where each hash table corresponds to a different data domain of the heterogeneous data and includes hash code sets, where at least one of the hash code sets is mapped to a hash code set of another one of the tables. The method further includes performing a hash on the input query to generate a hash code, by referring to the index, determining a first hash code set that the generated hash code belongs to, and determining a second hash code set that the determined first hash code set is mapped to, and providing at least one result based on the determined second hash code set.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for optimizing data analysis. A set of analytics are received and a plurality of subsets of the set of analytics is generated. An optimization goal(s) is defined. The plurality of subsets of analytics are applied to a set of data. The output of applied analytics are recorded on a data storage device by the computer. Performance values of the computer applying the plurality of subsets of analytics are recorded and displayed. An optimal subset of the plurality of subsets of analytics is calculated, using recorded performance values and outputs of the applied plurality of subsets of analytics, being based on the optimization goal. A set of applied analytics are displayed, where the set of applied analytics includes a number of subsets of analytics of the plurality of analytics that meet the criteria of the optimal subset.

Abstract: Systems and methods for managing electronic data are disclosed. Various data management operations can be performed based on a metabase formed from metadata. Such metadata can be identified from an index of data interactions generated by a journaling module, and obtained from their associated data objects stored in one or more storage devices. In various embodiments, such processing of the index and storing of the metadata can facilitate, for example, enhanced data management operations, enhanced data identification operations, enhanced storage operations, data classification for organizing and storing the metadata, cataloging of metadata for the stored metadata, and/or user interfaces for managing data. In various embodiments, the metabase can be configured in different ways. For example, the metabase can be stored separately from the data objects so as to allow obtaining of information about the data objects without accessing the data objects or a data structure used by a file system.

Abstract: Techniques include receiving a search query from a user device, receiving an indication of a current application (app) state of a native app executing on the device from the device, and identifying app state records based on the query and the indication. Each app state record includes an app access mechanism (AAM) and app state information (ASI). The AAM references the native app executing on the user device and indicates operations for the app to perform. The ASI describes an app state of the app after performing the operations. Identifying each app state record based on the indication includes determining that the current app state is a parent app state of the app state described by the ASI included in the identified record. The techniques further include selecting the AAMs from the identified app state records and transmitting the selected AAMs to the user device.

Abstract: At least one hit in a large volume of data is found using a graphical search pattern. The graphical search pattern is created afresh or modified by a user using a graphical interface. The user may implement complex searches and use a graphical representation of properties and/or correlations for the search in a directed manner. The method may be used, for example, in data mining, in the monitoring of states, or in automated alerting.