Abstract: The disclosed computer-implemented method may include accessing media segments that correspond to respective media items. At least one of the media segments may be divided into discrete video shots. The method may also include matching the discrete video shots in the media segments to corresponding video shots in the corresponding media items according to various matching factors. The method may further include generating a relative similarity score between the matched video shots in the media segments and the corresponding video shots in the media items, and training a machine learning model to automatically identify video shots in the media items according to the generated relative similarity score between matched video shots. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: One embodiment of the invention disclosed herein provides techniques for detecting and remediating an outlier server in a distributed computer system. A control server retrieves a group of time-series data sets associated with a first time period, where each time-series data set represents a performance metric for a different server in a group of servers. The control server generates a cluster that includes two or more of the time-series data sets, where the performance metric for each server that is associated with one of the time-series data sets in the cluster is within a threshold distance from the performance metric for the servers that are associated with the other time-series data sets in the cluster. The control server determines that a particular time-series data set corresponds to a server included in the group of servers and is not included in the cluster, and marks the server as an outlier server.

Abstract: The disclosed computer-implemented method includes applying transport protocol heuristics to selective acknowledgement (SACK) messages received at a network adapter from a network node. The transport protocol heuristics identify threshold values for operational functions that are performed when processing the SACK messages. The method further includes determining, by applying the transport protocol heuristics to the SACK messages received from the network node, that the threshold values for the transport protocol heuristics have been reached. In response to determining that the threshold values have been reached, the method includes identifying the network node as a security threat and taking remedial actions to mitigate the security threat. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: In various embodiments, a quality of experience (QoE) prediction application computes a visual quality score associated with a stream of encoded video content. The QoE prediction application also determines a rebuffering duration associated with the stream of encoded video content. Subsequently, the QoE prediction application computes an overall QoE score associated with the stream of encoded video content based on the visual quality score, the rebuffering duration, and an exponential QoE model. The exponential QoE model is generated using a plurality of subjective QoE scores and a linear regression model. The overall QoE score indicates a quality level of a user experience when viewing reconstructed video content derived from the stream of encoded video content.

Abstract: In various embodiments, a subsequence-based encoding application generates a convex hull of subsequence encode points based on multiple encoding points and a first subsequence included in a set of subsequences that are associated with a media title. The subsequence-based encoding application then generates a first encode list that includes multiple subsequence encode points based on the first convex hull. Notably, each subsequence encode point included in the first encode list is associated with a different subsequence. The subsequence-based encoding application selects a first subsequence encode point included in the first encode list based on a first variability constraint that is associated with a media metric. The subsequence-based encoding application then replaces the first subsequence encode point included in the first encode list with a second subsequence encode point to generate a second encode list.

Abstract: One embodiment of the present invention sets forth a technique for replicating a file within a network of servers. The technique includes determining one or more regional master servers included in a regional cluster of servers and causing each regional master server to retrieve a file from a fill source. The technique further includes, for at least one local cluster of servers included in the regional cluster of servers, determining one or more local master servers included in the at least one local cluster of servers, and causing each local master server to retrieve the file from one of the one or more regional master servers.

Abstract: In various embodiments, a monitoring application assesses delays associated with a circuit within a network. The monitoring application determines a measured trip time between a first device and a second device that is connected to the first device via the circuit. The measured trip time is associated with a first variance attributable to the first device. The monitoring application performs one or more digital signal processing operations based on the measured trip time to generate a predicted trip time. The predicted trip time is associated with a second variance attributable to the first device that is less than the first variance. Based on the predicted trip time, the monitoring application determines characteristic(s) of the delay associated with the circuit. Advantageously, reducing variations attributable to the first device when generating the first predicted trip time increases the accuracy with which the monitoring application can determine the characteristic(s) of the delay.

Abstract: The disclosed computer-implemented method may include (1) accessing a first media data object and a different, second media data object that, when played back, each render temporally sequenced content, (2) comparing first temporally sequenced content represented by the first media data object with second temporally sequenced content represented by the second media data object to identify a set of common temporal subsequences between the first media data object and the second media data object, (3) identifying a set of edits relative to the set of common temporal subsequences that describe a difference between the temporally sequenced content of the first media data object and the temporally sequenced content of the second media data object, and (4) executing a workflow relating to the first media data object and/or the second media data object based on the set of edits. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: One embodiment includes acceleration systems that operate as intermediaries between the API processing system and the clients to reduce API call roundtrip latencies. The acceleration systems are a network of interconnected systems that are distributed across the globe. A given acceleration system establishes a network connection with a given client and receives a request for processing an API call over the connection. The programming function associated with the API call is configured in the API processing system. The acceleration system facilitates the processing of the API call over an established connection with the API processing system.

Abstract: In various embodiments, a quality inference application estimates perceived audio quality. The quality inference application computes a set of feature values for a set of audio features based on an audio clip. The quality inference application then uses a trained multitask learning model to generate predicted labels based on the set of feature values. The predicted labels specify metric values for metrics that are relevant to audio quality. Subsequently, the quality inference application computes an audio quality score for the audio clip based on the predicted labels.

Abstract: Various embodiments of the invention disclosed herein provide techniques for performing distributed anti-entropy repair procedures across a plurality of nodes in a distributed database network. A node included in a plurality of nodes within the distributed database network determines, before all other nodes included in the plurality of nodes, that a first anti-entropy repair procedure has ended. The node determines that a second anti-entropy repair procedure is ready to begin. The node generates a schedule for executing one or more operations associated with the second anti-entropy repair procedure. The node writes the schedule to a shared repair schedule data structure to initiate the second anti-entropy repair procedure across multiple nodes included in the plurality of nodes. Each of the nodes included in the plurality of nodes then performs a node repair based on the schedule.

Abstract: One embodiment of the present disclosure sets forth a technique for generating translation suggestions. The technique includes receiving a sequence of source-language subtitle events associated with a content item, where each source-language subtitle event includes a different textual string representing a corresponding portion of the content item, generating a unit of translatable text based on a textual string included in at least one source-language subtitle event from the sequence, translating, via software executing on a machine, the unit of translatable text into target-language text, generating, based on the target-language text, at least one target-language subtitle event associated with a portion of the content item corresponding to the at least one source-language subtitle event, and generating, for display, a subtitle presentation template that includes the at least one target-language subtitle event.

Abstract: In one embodiment of the present invention, a sticky canary router routes each request associated with a service to either a canary cluster of servers that implement a modification to the service or a baseline cluster of servers that do not implement the modification. The sticky canary router implements a mapping algorithm that determines the routing of each request based on a current time, a time window for the routing, and a characteristic of the request. Notably, the mapping algorithm may be implemented such that, for time segments with duration equal to the time window, the sticky canary router routes all requests received from a particular device in a consistent fashion—either to the canary cluster or to a baseline cluster. Configured thusly, the sticky canary router enables the analysis of approximately full sections of client interactions with the canary servers, thereby facilitating identification of client-side effects of the changes.

Abstract: A method includes receiving, with a computing system, a video item. The method further includes identifying a first set of features within a first frame of the video item. The method further includes identifying, with the computing system, a second set of features within a second frame of the video item, the second frame being subsequent to the first frame. The method further includes determining, with the computing system, differences between the first set of features and the second set of features. The method further includes assigning a clip category to a clip extending between the first frame and the second frame based on the differences.

Abstract: The disclosed computer-implemented method includes accessing information related to a playback session in which at least a portion of requested multimedia content is streamed over a network to a client electronic device. The method further includes accessing network topology information for the network to identify which route through the network was used to provide the requested multimedia content during the playback session, including indicating which end node was used to provide the multimedia content. Still further, the method includes accessing network steering factors that indicate why the requested multimedia content was steered through the identified network route, determining, based on the network steering factors, which end node would have been more suited to providing the requested multimedia content for the playback session, and then transferring the requested multimedia content to the determined end node for provisioning during subsequent playback sessions.

Abstract: Various embodiments of the present disclosure relate to a computer-implemented method of receiving an invalidation command that includes a first asset identifier, and a set of extension value fields, identifying a first file that is stored in a first cache device and is associated with an identifier matching the first asset identifier, comparing attributes of the first file to the set of extension value fields, and upon determining that, for each extension value field, at least one attribute of the first file matches at least one value of the extension value field, causing the first file in the first cache device to be preserved, or upon determining that, for at least one extension value, at least one attribute of the first file does not match at least one value of the extension value field, causing the first file to be invalidated.

Abstract: Techniques are disclosed for improving user experience of multimedia streaming over computer networks. More specifically, techniques presented herein reduce (or eliminate) latency in playback start time for streaming digital media content resulting from digital rights management (DRM) authorizations. A streaming media client (e.g., a browser, set-top box, mobile telephone or tablet “app”) may request a “fast-expiring” license for titles the streaming media client predicts a user is likely to begin streaming. A fast-expiring license is a DRM license (and associated decryption key) which is valid for only a very limited time after being used for playback. During the validity period of such a license, the client device requests a “normal” or “regular” license to continue accessing the title after the fast-expiring license expires.

Abstract: The disclosed computer-implemented method includes establishing a coalescing service configured to combine queries received at the coalescing service. The method further includes instantiating, within the coalescing service, multiple execution windows to which the received queries are to be assigned, where each execution window has an assigned deadline within which to execute. The method also includes analyzing a first query among the received queries to identify characteristics of the first query. The method then includes assigning the first query to a first execution window among the execution windows according to the identified characteristics. Then, upon detecting the occurrence of a specified trigger for at least one of the queries in the first execution window, the method includes executing those queries, including the first query, that are assigned to the first execution window. Various other methods, systems, and computer-readable media are also disclosed.