Abstract: Embodiments of the present disclosure provide a method, a device and a computer program product for managing data replication. According to example implementations of the present disclosure, a replication policy model associated with data replication of a source device can be obtained, which is determined based on historical status information of the source device and a historical replication policy corresponding to the historical status information; current status information of the source device is determined, wherein the current status information indicates status information associated with pending data replication of the source device; and a target replication policy is determined based on the replication policy model and the current status information, which indicates a replication policy to be applied for performing the pending data replication.

Abstract: The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: A system and method for operating a high-performance learning-ready platform for real-time analytics involves operating a collector to collect logging data from electronic design automation (EDA) tools. The collector operates either (A) a set of programming interface (i.e., function calls) integrated with an EDA tool, or (B) a selector to extract the logging data from EDA tool logs. The collector generates data logs in a key-value pair data logging format from the logging data. A memory controller loads and indexes the data logs into a controlled memory data structure. A comparator in an archiving engine prioritizes storage of particular data logs based, in part, on previously stored data logs in the controlled memory data structure.

Abstract: According to aspects of the present disclosure, a computer-implemented method includes generating a metadata record for each event record of a subset of a plurality of event records, the metadata record being one of a plurality of metadata records. The method further includes assigning a metadata indicator to each event record of the subset of the plurality of event records to indicate that the event record is associated with a metadata record. The method further includes assigning, for each event record of the subset of the plurality of event records and the metadata record associated therewith, a timestamp. The method further includes matching for each event record of the subset of the plurality of event records, one of the plurality of metadata records with the event record based at least in part on the metadata indicator and the timestamp.

Abstract: The present technology pertains to a organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: A system for providing a graph protocol for forming a decentralized and distributed graph database is disclosed. The system involves receiving, from a device, a bid request to generate a graph on a graph protocol network via the graph protocol. A plurality of masternodes in the system may transmit ask requests associated with providing storage and computation power to service the bid request. If the system determines that the requirements of the bid request match or correlate with the requirements of the ask request, the system may select any masternodes having matching or correlating ask requests to service the ask request. The system may then arrange the masternodes into a unique artificially-intelligent router of the graph protocol network. The system may then proceed to generate the graph on the graph protocol network by utilizing the masternodes of the router and may process any queries associated with the generated graph.

Abstract: A method of analyzing conversational messages may be provided. The method including receiving a query defining a timespan of messages, retrieving at least two conversational messages associated with the defined timespan from a plurality of interleaved messages, de-threading the at least two conversational messages to identify at least one conversational thread, and generating a visualization of conversational threads based on the defined timespan, the at least one conversational thread, the visualization organized into time intervals based on the defined timespan.

Abstract: Methods and apparatuses are described for enforcing referential integrity of database columns across a plurality of tables in a database. A server periodically captures a database schema comprising relationships between a primary key column in a first table and a foreign key column in a second table. The server executes a first procedure call to determine a discrepancy between the primary key column and the foreign key column with respect to a data length value or a data type value. The server executes database queries against data in the first table or second table to confirm the discrepancy. The server executes a second procedure call to change the data length value or the data type value. After the second procedure call finishes, the data length value and the data type value of the primary key column and the foreign key column match.

Abstract: Detecting missing entities in a graph schema is provided. Unlabeled and unstructured data of a particular domain are divided into a plurality of Voronoi cells using a clustering algorithm that is initiated with cluster centroids proportional to a number of entity types corresponding to the particular domain existing in the graph schema. One additional cluster more than the number of entity types corresponding to the particular domain existing in the graph schema is initialized using a cluster initializing formula of the clustering algorithm. It is determined whether the one additional cluster is populated. In response to determining that the one additional cluster is populated, an entity type is determined to be missing from the number of entity types existing in the graph schema. The missing entity type is added to the graph schema.

Abstract: A method and computer device for selecting a current context-specific response for a current query is disclosed. The method comprises receiving a current context snippet comprising the current query; generating, by a neural network, a current context vector based on the current context snippet; for each response snippet associated with a respective one of a plurality of vectors, generating a respective ranking score as a value of (1) a respective first vector similarity value being indicative of a linguistic similarity between (i) the current context snippet and (ii) the respective context snippet, and (2) a respective second vector similarity value being indicative of a linguistic and a logical similarity between (i) the current context snippet and (ii) the respective response snippet. The method comprises selecting the current context-specific response amongst the response snippets based on the respective ranking scores.