Abstract: An example method for managing datasets produced by alert-triggering search queries may include producing a dataset by executing a search query on a portion of data associated with a time window defined relative to a current time. The method may further include responsive to determining that a portion of the dataset satisfies a condition defining an alert, generating an instance of the alert. The method may further include associating, by a memory data structure, the instance of the alert with an identifier of the query and a parameter specifying a time of execution of the query that has triggered the instance. The method may further include receiving a request for the dataset portion. The method may further include substituting, in a definition of the time window, the current time with the time parameter. The method may further include reproducing the dataset portion by re-executing the query using the time window.

Abstract: The present disclosure relates to extracting key concepts from digital content items and determining associations between the key concepts and candidate terms for use in generating and presenting a correlation graph object based on the determined associations. For example, systems described herein involve determining frequency of co-occurrence between various key concepts and applying a classification model (e.g., a zero-shot classification model) to the key concepts and candidate terms to determine associations between the key concepts and candidate terms for a given domain of interest. The systems further involve generating a graph object and processing graph queries in a way that enables fast and efficient presentation of slices of the graph object that provide a visual depiction of key concepts and edges representing associations between pairs of the key concepts.

Abstract: The technology described herein builds an optimal refresh schedule by minimizing a cost function constrained by an available refresh bandwidth. The cost function receives an importance score for a content item and a change rate for the content item as input in order to optimize the schedule. The cost function is considered optimized when a refresh schedule is found that minimizes the cost while using the available bandwidth and no more. The technology can build an optimized schedule to refresh content with incomplete change data, content with complete change data, or a mixture of content with and without complete change data. It can also re-learn content item change rates from its own schedule execution history and re-compute the refresh schedule, ensuring that this schedule takes into account the latest trends in content item updates.

Abstract: The present teaching generally relates to identifying data bucket overlap with online experiments. In a non-limiting embodiment, first data representing a first set of identifiers associated with a first data bucket of a first online experiment may be obtained. Second data representing a second set of identifiers associated with a second data bucket of the first online experiment may be obtained. Based on the first data and the second data, a first number of identifiers that are associated with the first data bucket and the second data bucket may be determined. In response to determining that the first number exceeds a threshold, a data flag indicating that results associated with the first online experiment are inconsistent may be generated.

Abstract: A method and device of data transmission, applied to a distributed database is provided including a plurality of nodes, with accelerator cards provided in at least two of the nodes, the high-speed interfaces of each the accelerator card is interconnected to form a data transmission path, the method including: when the accelerator card receives a database operation command from the CPU of the node requesting access to the target data, generating a data request based on the get data operation or the modify data operation; the accelerator card detects hit the target data in the cache based on the data request, the accelerator card fetches the target data from the cache; otherwise the accelerator card sends a data request message corresponding to the data request to a distant destination node via the data transmission path, and obtains the target data based on the data packet returned from the destination node.

Abstract: Graph data processing methods and system are disclosed. One example method comprises obtaining, by a master node, graph data, wherein the graph data comprises M vertexes and a plurality of directional edges, each edge connects two vertexes, a direction of each edge is from a source to a destination vertex in the two vertexes, and M is an integer greater than two. The node divides the graph data into P non-overlapping shards, where each shard comprises at least one incoming edge directed to at least one vertex in the corresponding shard. The node schedules at least two edge sets comprised in a first shard of the P shards and an associate edge set comprised in a second shard of the P shards for processing by at least two worker nodes.

Abstract: Methods and systems to de-identify data records, including to merge pairs of clusters data records of individuals until a number of data records of each cluster meets a minimum size threshold, de-identify the clusters when each cluster meets the minimum size threshold, assess a risk of re-identification of the de-identified clusters based on k-anonymity, increase the minimum size threshold and re-perform the merge, the de-identify, and the assess a risk, if the assessed risk does not meet a risk criterion, and present the de-identified clusters on a display when the assessed risk meets the risk criterion.

Abstract: Meta data is provided flexibly according to an application A related data extraction apparatus for extracting related data which is given to data collected from a target system and is related to the data includes: a configuration data accumulation unit that manages configuration information of the target system; a configuration data input unit that accepts input of registration or update of the configuration information; an application linkage unit that accepts a request for the related data given to the data by an application for analyzing the data; and a related data extraction unit that extracts the related data from the configuration information on the basis of the request.

Abstract: The present invention provides a matching result display device, a matching result display method, a program, and a recording medium, which allow, at the time of displaying feature points of objects determined as matching on the basis of matching result information provided by a matching system, visual check of the displayed feature points to be performed easily.

Abstract: Systems and methods disclosed herein may include a parallel-processing graph-database solution for protein-sequence analytics to determine a viable therapeutic for a given condition, and may include: determining a protein sequence for the given condition; using sequence database to compare a query sequence of the sequence of the given condition with sequences of other known proteins in the sequence database using the sequence database to determine a similarity of the query sequence with sequences of the other known proteins in the sequence database based on the comparison; and querying a graph database based on the similarity of sequences to identify potential therapeutics that could be have an inhibitory effect on the given condition.

Abstract: Proactive auto scaling can be implemented in a scaled multi-tenant cloud environment. For a particular update window, a management server can obtain tenant details for each tenant whose endpoints are to be updated during the update window using a file server. The management server can use the tenant details to calculate a total update time for deploying a respective update to each of the endpoints. If the total update time will exceed the update window, the management server can create one or more additional file servers and cause some of the endpoints to obtain their respective update from the one or more additional file servers to thereby ensure that all the endpoints can complete the update during the update window.

Abstract: An NLQ-SQLQ tool or service of a provider network may receive a natural language query (NLQ) from a client and convert the NLQ to an SQL query using ontological codes and placeholders. For one or more portions of the NLQ, the tool/service determines that the portion is associated with one or more codes of an ontology. The tool/service then assigns, based on criteria, a particular code to the portion. The tool/service replaces portions of the NLQ with different argument placeholders to generate a modified NLQ. A trained model converts the modified NLQ into an initial SQL query that has argument placeholders and subquery placeholders. The tool/service generates a final SQL query based on the initial SQL query, predefined SQL subquery templates associated with the subquery placeholders, and codes associated with the argument placeholders. The tool/service executes the final SQL query and sends results to the client.

Abstract: A method includes receiving, at a container registry, a container image including a set of files, determining that at least one file of the set of files is a duplicate of a previously stored container image file at the container registry. The method further includes storing the container image at the container registry with the at least one file of the plurality of files that is a duplicate of the previously stored container image file removed from the container image.

Abstract: Maintaining cardinality of rows while joining worksheets from a database including receiving a request to join, to a first worksheet, a second worksheet from the database; for each row in the first worksheet: generating a join row for data from the second worksheet on the database; in response to determining that there is at least one matching row in the second worksheet on the database: compare a maximum value and a minimum value for each column in each row of the at least one matching row; if the maximum value and the minimum value match, store a matching value in a corresponding column of the join row; and if the maximum value and the minimum value do not match, store a multiple value indication in the corresponding column of the join row; and presenting the join row adjacent to a corresponding row in the first worksheet.

Abstract: Systems and methods are provided for conducting continuous changelog-based replication of modifications made to a file system to a target storage system. An export system can monitor a changelog on a file system to detect changes made to the file system. The exporter system can further filter and reformat the changes for replication to the target storage system by storing the changes in a pending changes data store. To reduce duplicative traffic, the export system can store changes for a configurable delay period, writing all pending changes to a file system object after the delay while aggregating and deduplicating the changes, thus improving performance relative to immediate replication.

Abstract: A computer remediates data quality issues in a consolidated data record includes elements from several datasets, comprising. The computer determines, based at least in part on dataset feed information, dataset flow quality value for first and second datasets for a consolidated data record resulting from combining a plurality of datasets. The datasets include associated metadata. The computer, responsive to flow quality value determinations, compares dataset flow quality values with a predetermined dataset flow quality threshold and conducts a correction action for datasets with dataset flow quality value beyond the threshold. The computer determines, based at least in part on said dataset element health information, dataset health quality values for the datasets.

Abstract: The present invention provides a matching result display device, a matching result display method, a program, and a recording medium, which allow, at the time of displaying feature points of objects determined as matching on the basis of matching result information provided by a matching system, visual check of the displayed feature points to be performed easily.

Abstract: The present invention provides a matching result display device, a matching result display method, a program, and a recording medium, which allow, at the time of displaying feature points of objects determined as matching on the basis of matching result information provided by a matching system, visual check of the displayed feature points to be performed easily.

Abstract: One example method includes injecting processing into sessions including IO sessions. Events in a file system are intercepted and processed. During processing, policies may be applied to the events. Some of the policies are triggered such that external actions or processing is applied to the event. Once the actions have been performed, the event may be processed by the file system.

Abstract: Concrete data types for raw data organized in one or more columns of one or more tables may be determined. Functional data types for the one or more columns may be determined based on the raw data and the concrete data types such that a portion of the one or more columns may be associated with an identifier data type. Relationships between the one or more tables may be determined based on the portion of the one or more columns associated with the identifier data type. A schema representing the raw data may be generated based on the one or more relationships and the one or more tables.