Abstract: A document management system and process for facilitating the state of various portions of electronic content in which users can select specific workflow stages to assign to selected content elements in the electronic content that can indicate the workflow condition of the specified content. This provides individual and group users the ability for precise, timely, and effective management of document workflow that facilitates more natural and smoother document development.

Abstract: Queries executed against a materialized view can execute up to orders of magnitude faster than equivalent queries on a source (or base) table. However, although a query can reference a materialized view directly, a user (e.g., query author) may not know about a relevant materialized view. Moreover, if a source table has multiple materialized views generated, the user may not know which materialized view to reference in the query. Thus, embodiments of the present disclosure provide techniques for automatically rewriting queries directed to a source table to utilize existing materialized views.

Abstract: Systems and methods of tracking and rewarding users of any of a variety of content hosting systems, such as search engines. In one embodiment, a method of rewarding a user of a search engine includes receiving secure identification information identifying a user, retrieving user account information using the secure identification information, receiving a search query associated with the user account information, crediting the user account with a reward that is directly related to providing the search query, and returning search results in response to the received search query.

Abstract: A system for caching includes an interface to receive a portion of a hypercube to evaluate. The hypercube includes cells with a set of the cells having a formula. The system includes a processor to determine term(s) in the formula for each cell of the set of cells; remove from consideration a time dimension and/or a primary dimension for the term(s) in the formula for each cell of the set of cells; determine a set of distinct terms using the term(s); determine whether a total number of terms in the set of cells is larger than a number of distinct terms in the set of distinct terms; and in response to determining that the total number of terms in the set of cells is larger than the number of distinct terms in the set of distinct terms, indicate to cache the set of distinct terms during evaluation.

Abstract: In implementations of higher-order graph clustering and embedding, a computing device receives a heterogeneous graph representing a network. The heterogeneous graph includes nodes that each represent a network entity and edges that each represent an association between two of the nodes in the heterogeneous graph. To preserve node-type and edge-type information, a typed graphlet is implemented to capture a connectivity pattern and the types of the nodes and edges. The computing device determines a frequency of the typed graphlet in the graph and derives a weighted typed graphlet matrix to sort graph nodes. Sorted nodes are subsequently analyzed to identify node clusters having a minimum typed graphlet conductance score. The computing device is further implemented to determine a higher-order network embedding for each of the nodes in the graph using the typed graphlet matrix, which can then be concatenated into a matrix representation of the network.

Abstract: A System and a Method for Assessing Data for Analytics A system and a method for assessing readiness of data for data science and analytics is disclosed. The present invention quantifies readiness of data by providing a data insight quotient (DIQ). In particular, a nucleus of a dataset retrieved from an enterprise database is derived. The dataset is representative of data collected for a predefined objective over a period of time and includes a plurality of features and records. Further, a plurality of time-ordered datasets are generated by dividing the retrieved dataset based on a selected time series. A nucleus is derived for each of the time-ordered dataset. Furthermore, relevancy and redundancy of each of the plurality of time-ordered datasets is evaluated. The present invention, further computes the complexity and noise associated with each of the time-ordered datasets. Finally, a DIQ value for each time-ordered dataset is evaluated as a function of relevancy, complexity, noise and redundancy.

Abstract: A pre-computed result module computes a result prior to receiving a query. The pre-computed result module includes instructions executed by a processor to assess a pre-computation query to designate each identified database source that contributes to the answer to the pre-computation query and corresponding database source metadata. A metadata signature is computed for each identified database source to create a store of identified database sources and corresponding metadata signatures. The query is evaluated to identify accessed database sources responsive to the query. A current metadata signature for each accessed database source is compared to the metadata signatures to identify each updated database source. Re-computed results are formed for each updated database source. Pre-computed results are utilized for each database source that is not updated. A response is supplied to the query using the re-computed results and the pre-computed results.

Abstract: Data is recorded to a time-series database embedded in a PLC. A local clock of the PLC is corrected by accessing a time server such as an NTP server on a regular basis. At that time, a time correction amount and an NTP-ID for identifying each iteration of correction processing are recorded to an NTP log in association with each other. When a query arrives, a time stamp of a record corresponding to a designated time range is modified by proportionally distributing the time correction amount of the corresponding NTP-ID.

Abstract: A system and method for processing a group and aggregate query on a relation are disclosed. A database system determines whether assistance of a heterogeneous system (HS) of compute nodes is beneficial in performing the query. Assuming that the relation has been partitioned and loaded into the HS, the database system determines, in a compile phase, whether the HS has the functional capabilities to assist, and whether the cost and benefit favor performing the operation with the assistance of the HS. If the cost and benefit favor using the assistance of the HS, then the system enters the execution phase. The database system starts, in the execution phase, an optimal number of parallel processes to produce and consume the results from the compute nodes of the HS. After any needed transaction consistency checks, the results of the query are returned by the database system.

Abstract: A system and method are provide for searching, writing, editing, and publishing waveform shape information. A publishing module publishes a sequence of distinct shape code values in which each shape code value has the number of members, and the sum of the member values is the same for each shape code value.

Abstract: In one embodiment, the present disclosure pertains to downloading visualization data. Data visualizations in a user interface display may be created from remote data. Portions of the remote data may be downloaded to a local computer to recreate the data visualizations without the need for remote data requests. In another embodiment, a data export architecture includes jobs comprising a plurality of tasks configured in series. In one example embodiment, the jobs may correspond to particular data visualizations to be downloaded.

Abstract: A computer implemented method implemented with a processor for assigning a unique identifier for a data item initially deployed at a cluster of a networked environment that includes determining a unique cluster identifier for the cluster of the networked environment, atomically modifying a local counter value at the cluster of the networked environment and appending the unique cluster identifier to the atomically modified local counter value at the cluster of the networked environment to form a unique ID for the data item.

Abstract: A method performed by a physical computing device communicatively coupled to a computer network for creating an aggregate report of a presence of a user of the physical computing device on the network includes periodically searching the network with the physical computing device for content related to the user authored by a source other than the user, the searching being based on a unique set of identifiers associated with the user, dynamically updating the unique set of identifiers based on contextual trends within content returned as a result of the searching, and aggregating content published by the user to the network with the content returned as a result of the searching to form the aggregate report of the presence of the user on the network.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory comprising instructions, which are executed by the at least one processor and configure the processor to implement a patient information extractor. The patient information extractor receives a query specification for executing a query on a patient electronic medical record (EMR). The query specification provides parameters indicating a methodology for extracting search results from the patient EMR. The patient information extractor retrieves the patient EMR from a patient registry. The patient information extractor automatically executes the query specification on the retrieved patient EMR to thereby extract the search results from the patient EMR in accordance with the parameters of the query specification. The patient information extractor automatically processes the extracted search results to generate a patient indicator value.

Abstract: Data sets such as databases are often distributed over a number of servers, where each server stores a subset of records and an index that enables the server to locate the records in response to queries. However, tight coupling of indexing and storage may limit load-balancing, fault recovery, and distribution. Instead, the set of servers may be partitioned into a set of storage servers that store the records and a set of index servers of the index over the records. In a set that is decoupled in this manner, load-balancing may involve provisioning and locating index servers independently of the provisioning and locating of the storage servers in view of the particular sensitivities and tolerances of various applications. Additionally, the index servers may also utilize a data layout that is selected and adapted independent of the data layout of the storage servers and/or the schema of the data stored thereby.

Abstract: Determining relative relationships of people who share a common ancestor within at least a threshold number of generations includes: receiving recombinable deoxyribonucleic acid (DNA) sequence information of a first user and recombinable DNA sequence information of a plurality of users; processing, using one or more computer processors, the recombinable DNA sequence information of the plurality of users in parallel; determining, based at least in part on a result of processing the recombinable DNA information of the plurality of users in parallel, a predicted degree of relationship between the first user and a user among the plurality of users, the predicted degree of relative relationship corresponding to a number of generations within which the first user and the second user share a common ancestor.

Abstract: A mechanism is provided in a data processing system for asynchronous replication in a hierarchical storage management integrated storage system. For a given file to be replicated from a primary storage system to a remote storage system, the primary storage system accesses the remote storage system to determine file existence and migration status at the remote storage system for the given file. Responsive to the primary storage system determining that the given file exists and has been migrated from first tier storage to second tier storage at the remote storage system, the primary storage system determines a first performance penalty for file recall and a second performance penalty for sending excess data from the primary storage system to the remote storage system.

Abstract: Non-limiting examples of the present disclosure describe processing by a contextual image analysis service that generates and surfaces contextually relevant data objects based on entities identified from image content. In one example, image content is analyzed and entity annotations are generated for the image content. The entity annotations may be converted to queries. Raw search results may be identified based on the converted queries. The raw search results may be filtered based on one or more specific content types. A contextual representation is generated based on the filtered raw search results, where the contextual representation comprises the image content and one or more contextually relevant data objects for at least one entity associated with the image content. The exemplary contextual representation of the image content and the one or more contextually relevant data objects may be surfaced through a user interface of an application/service.

Abstract: Techniques for improving a search user interface by demoting a set of spam user profiles included in a listing of candidate user profiles that are to be presented in response to a search request are disclosed herein. The search request is received from a client device. The search request requests the listing of candidate user profiles corresponding to a search query. The listing of candidate user profiles corresponding to the search query is determined. A trained spam detection model is applied to each of the candidate user profiles to identify the set of spam user profiles. The demoting of the spam user profiles is performed. The listing of candidate user profiles is communicated for presentation in the search user interface, the presentation reflecting the demoting of the spam user profiles.

Abstract: Trigger-free asynchronous maintenance of custom indexes and skinny performance meta-structures is described. A database system receives a request to manipulate data in an object in a database table, and determines whether the object in the database table is associated with a user-based data structure. If the object in the database table is associated with the user-based data structure, the database system manipulates the data in the object in the database table and data in an object in an intermediate data table. The database system receives a query, and determines whether the query requests any data that is in the user-based data structure. If the query requests any data that is in the user-based data structure, the database system creates a query result by combining any data that is in the object in the intermediate data table with any requested data that is in the user-based data structure, and outputs the query result.