Abstract: Example embodiments for classification are described. In an example embodiment, a request including a text term to be classified is received from a source system via a communication network at a computer system. A rule associated with the text term is accessed, in which the rule indicates at least one classifier of a plurality of classifiers installed at the computer system. Classification information for the text term is generated at the computer system using the at least one classifier indicated by the rule. The generated classification information includes a classification selected from a taxonomy by the at least one classifier. The generated classification information is transmitted via the communication network to the source system.

Abstract: A query is executed in a massively parallel processing data storage system comprising a master node communicating with a cluster of multiple segments that access data in distributed storage by producing a self-described query plan at the master node that incorporates changeable metadata and information needed to execute the self-described query plan on the segments, and that incorporates references to obtain static metadata and information for functions and operators of the query plan from metadata stores on the segments. The distributed storage may be the Hadoop distributed file system, and the query plan may be a full function SQL query plan.

Abstract: The techniques disclosed herein improve performance of file system logging by writing log data to persistent memory instead of staging in RAM before writing to disk. In one embodiment, while the log is being written, checksums are inserted, such that during recovery, the checksums can be used to distinguish good log pages from bad log pages. In this way, good log pages can be evaluated to determine whether to roll a portion of a file system transaction forward, backward, or do nothing, while bad log pages can be safely ignored. Additionally or alternatively, non-temporal copies are employed when writing data to persistent memory, thereby reducing an amount of time log data is exposed to be lost in a crash.

Abstract: A method includes determining an encoding modification for a set of encoded data slices where a data segment of data is dispersed storage error encoded into the set of encoded data slices based on dispersed storage error encoding parameters. The method further includes determining a plurality of tasks for executing the encoding modification, where the encoding modification includes altering one or more parameters of the dispersed storage error encoding parameters. The method further includes assigning a first task of the plurality of tasks to a first storage unit and assigning remaining tasks of the plurality of tasks to a set of storage units. The method further includes executing, by the first storage unit and at least some storage units of the set of storage units, the first task and the remaining tasks of the plurality of tasks, respectively, to produce a modified set of encoded data slices.

Abstract: Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining one or more documents, the one or more documents being grouped into one or more clusters having a score, and the one or more clusters being grouped into one or more megaclusters, presenting information associated with the one or more documents on one or more timelines, wherein the one or more documents are grouped into different megaclusters being presented in a visually distinct way, and filtering the presented information based on the scores associated with the one or more clusters.

Abstract: Systems and methods for indexing blockchain data in a blockchain system so that search may proceed more quickly, efficiently, and reliably in all of the blockchain peers. These systems and methods receive a set of transactions from one or more transaction blocks of a blockchain, wherein the transactions in the set have been validated by one or more peer systems of the blockchain. The systems and methods further generate an index to one or more fields of one or more transactions in the set of transactions of the transaction block generate an index representative of at least one field in the set of transactions of the transaction block and provide the generated index for validation by a peer system of the blockchain. After receiving verification from at least a threshold number of peer systems that the generated index has been validated by the peer system, these systems and methods store the generated index as an index block in the block chain.

Abstract: Disclosed herein are a metadata server and a method for distributing metadata in units of directories using the metadata server. The method includes receiving a request for at least one of creation, deletion and retrieval from a user file system; acquiring an inode corresponding to an identifier of a parent inode, which is included in the request; searching the parent inode for a dentry corresponding to the request when the request is a request to create a directory; selecting a secondary metadata server in which a new directory is to be created in order to distribute metadata in units of directories; requesting the selected secondary metadata server to create an inode; receiving an identifier of the created inode from the secondary metadata server; and adding a new dentry to the parent inode using the identifier of the inode.

Abstract: Systems, methods, and computer-readable media for reducing a number of unverified persons detected in media content are provided.

Abstract: Systems and methods described herein facilitate the search and presentation of historical data for wireless network usage and provide a mechanism for high-redundancy, low-latency record retrieval of data from large data sets. Network devices divide data for a historical data store into separate record type groups, store metadata for each record type in an application database, partition each record type group by date in a historical record database that is different from the application database, and form, within each date partition, buckets of common hash values of a key parameter from each record. When a user performs a query, the network devices generate a record-specific query form based on the record type metadata to obtain lookup parameters; generate a search hash value using a key parameter from the lookup parameters; and generate a query expression based on the record type, lookup parameters, and the search hash value.

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: Methods, computer program products, computer systems, and the like providing for representation and analysis of entities and their relationships are disclosed. The method, for example, includes selecting a node of a plurality of nodes in a property graph, analyzing entity information associated with the node, and, in response to the analyzing, storing the entity information in dependency information. Each node of the plurality of nodes represents an entity of a plurality of entities, and is coupled to at least one other node of the plurality of nodes by one or more links of a plurality of links of the property graph. Each of the one or more links represents a relationship between the each node and the at least one other node. The entity information is information regarding the entity. The dependency information is configured to facilitate orchestration of one or more of the plurality of entities.

Abstract: In one example embodiment, an analysis application implements a technique for measuring a property of interest of an input dataset of location samples. The analysis application may process the input dataset in one or more multi-stage pipelines to produce values that measure a metric for the input dataset. The values that measure the metric for the input dataset may be compared with values that measure the metric for one or more labeled datasets that are generated by the analysis application, for example, using a feedback loop and sampling from a plurality of delta data sets. Each labeled datasets may have different values that measure the metric and corresponding measures of the property of interest. Based on the comparison, the analysis application may determine the measure of the property of interest for the input dataset and such measure may be returned, for example, to a remote device.

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 non-transitory computer tangible medium is disclosed containing instructions for securing a large data set with a blockchained Merkle B-Tree. These instructions provide for accessing a large data set stored within a digital storage device, assigning each object of the large data set to a node of a Merkle B-Tree, and generating vertical blockchains that begin with a root node of the Merkle B-Tree and extend outward toward leaf nodes of the Merkle B-Tree based on data within each object. As a result, vertically blockchained Merkle B-Tree for containing the large data set as data are formed.

Abstract: A computer system for dynamic adaptation of a user interface according to data store mining includes a data store configured to index event data of a plurality of events. A data analyst device is configured to render the user interface to a data analyst and transmit a message that identifies a selected identifier of the plurality of identifiers. A data processing circuit is configured to train a machine learning model based on event data stored by the data store for a first set of identifiers from within a predetermined epoch. An interface circuit determines an interface metric for the selected identifier based on the determined output of the selected identifier and transmits the interface metric to the data analyst device. The data analyst device is configured to, in response to the interface metric from the interface circuit, selectively perform a modification or removal of a second user interface element.

Abstract: Provided are techniques for collaborative learned scoping to extend data reach for a search request. From monitoring prior collaboration data of entities discussing topics, the topics, access response times to data sources with content objects for the topics, and topic response content of the content objects are derived. A data reach model is built using the topics, the access response times, the topic response content, and data sources of the topics. For a topic of the topics, the data reach model is used to determine a new data source to be added and a duration of adding the new data source based on real time entity activity. The new data source is added to a data reach of the current group of entities. In response to receiving a search request, the search request is issued against the data sources and the new data source, and results are returned.

Abstract: A computer processor may extract identity information from a document. The identity information may include at least one custodian identity attribute. After extracting the identity information, the computer processor may determine that the identity information is associated with a specific custodian. The computer processor may then search for the custodian identity attribute in a custodian directory to determine whether the custodian directory contains an entry for the custodian. If the custodian is not in the custodian directory, the computer processor may create a new entry in the custodian directory for the custodian and store the extracted identity information in the new entry.

Abstract: A tangible, non-transitory, machine-readable medium including instructions presents a graphical user interface (GUI) and the GUI provides an indication of two or more output file types. Further, the medium including instructions receives an indication of a selection of at least two of the two or more output file types. Moreover, the medium including instructions generates corresponding output files for the selection of the at least two of the two or more output file types by accessing an applicable computer-aided-design (CAD) model associated with a part number. Also, the medium including instructions generates corresponding output files for the selection of the at least two of the two or more output file types.

Abstract: Relevance optimized representative content associated with a data storage system is disclosed. One example is a system including a data summarization module, a clustering module, and a representative content selection module. The data summarization module associates, via a processor, each data object in a storage system with a derived data object. The clustering module determines clusters of similar data objects based on a similarity between associated derived data objects, and selects a representative data object for each determined cluster. The representative content selection module selects representative content associated with the storage system, where the representative content is based on the data objects, the derived data objects, and the representative data objects, and relevance optimizes of the selected representative content to an analytics application.

Abstract: An engine for resolving a query from a user to provide a dynamic actionable dashboard in a business operating system includes an MLET database, a data interface, a logic configured to process incoming queries, fetch data in relation to those queries, and render an actionable dashboard having data resulting from the queries. The MLET database comprises a plurality of templates (“MLETs”), each MLET being associated with a unique identifier and including a mechanism for accessing data relating to that identifier. The logic processes queries into constructs having a tokens and configurable inputs. If the query includes a unique identifier associated with an MLET in the MLET database, the MLET is used to fetch data responding to the query. If the query includes a unique identifier not associated with an MLET in the MLET database, the logic creates a new MLET using operational intelligence and stores it in the MLET database.