Abstract: Described herein are, among other things, techniques, devices, and systems for generating one or more trained machine-learning models. Also described herein are techniques, devices, and systems for applying a consumption history of a particular user to the trained model(s) to generate score data indicating a correlation between each content-item title and the consumption history. The techniques then determine a ranked list of content items having a highest correlation to the consumption history, which may be used to retrieve videos associated with the most-correlated content items for generating a compilation video composed of these retrieved videos.

Abstract: Described herein are, among other things, techniques, devices, and systems for generating one or more trained machine-learning models. Also described herein are techniques, devices, and systems for applying a consumption history of a particular user to the trained model(s) to generate score data indicating a correlation between each content-item title and the consumption history. The techniques then determine a ranked list of content items having a highest correlation to the consumption history, which may be used to retrieve videos associated with the most-correlated content items for generating a compilation video composed of these retrieved videos.

Abstract: Described herein are, among other things, techniques, devices, and systems for generating one or more trained machine-learning models. Also described herein are techniques, devices, and systems for applying a consumption history of a particular user to the trained model(s) to generate score data indicating a correlation between each content-item title and the consumption history. The techniques then determine a ranked list of content items having a highest correlation to the consumption history, which may be used to retrieve videos associated with the most-correlated content items for generating a compilation video composed of these retrieved videos.

Abstract: Described herein are, among other things, techniques, devices, and systems for generating one or more trained machine-learning models. Also described herein are techniques, devices, and systems for applying a consumption history of a particular user to the trained model(s) to generate score data indicating a correlation between each content-item title and the consumption history. The techniques then determine a ranked list of content items having a highest correlation to the consumption history, which may be used to retrieve videos associated with the most-correlated content items for generating a compilation video composed of these retrieved videos.

Abstract: An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries. The directory entry types can define whether a cluster chain corresponding to a file can be contiguously allocated.

Abstract: A model in which filter drivers are managed to receive callbacks for I/O requests in which the filter drivers have registered an interest. Per-volume instances of filter drivers register with a filter manager for pre-callbacks (for I/O to the file system) and post-callbacks (for I/O from the file system), and identify which I/O requests (e.g., create, read, write) they are registering to receive callbacks. The filter manager orders the instances for callbacks. When an I/O request is received, the filter manager converts the I/O request to callback data and calls the interested filters in the callback order, whereby the filter instances can process the I/O data. As the request returns from the file system, filters desiring post callbacks are called in the reverse order. Efficient context management for the filters and other functions, such as non-reentrant file I/O, are also provided by the model.

Abstract: An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries.

Abstract: In order to provide a more efficient persistent storage device, one or more long-term storage media are included along with a non-volatile memory. In one embodiment, one portion of the non-volatile memory is used as a write buffer and a read cache for writes and reads to the long-term storage media. Interfaces are provided for controlling the use of the non-volatile memory as a write buffer and a read cache. Additionally, a portion of the non-volatile memory is used to provide a direct mapping for specified sectors of the long-term storage media. Descriptive data regarding the persistent storage device is stored in another portion of the non-volatile memory.

Abstract: A file system enables the real-time correction of detected corruptions to on-disk data. An enhancement to a file system responds in real time to file system corruptions detected on a running volume, and repairs the corruptions at the point where the file system detects them. Upon detection of a corruption by the file system, the system enhancement records information describing the nature of the corruption. A repair scan is defined for each type of corruption encountered. Repair scans can be run at the top level of execution in the current thread in which the corruption is detected, or they may require a dedicated thread to service the repair operation.

Abstract: Kernel objects for implementing a transaction have a security descriptor applied thereto. The kernel objects include, at least, a transaction object, a resource management object, and an enlistment object. The security descriptor, otherwise known as an access control list, identifies at least one user, an operation to be performed on the kernel object to which the security descriptor is applied, and a right indicating that the identified user is permitted or prohibited to perform the operation.

Abstract: Transactions among kernel objects utilize application program interfaces (APIs) to implement operations on a transaction object and APIs to implement operations on a resource manager object.

Abstract: A file system stores data and meta-data in a like fashion. The lowest level of stored file data on disk is a stream, which constitutes a logically contiguous group of bytes. Related streams, such as found in a file, a directory or a subdirectory, are stored in a variable-sized onode data structure. Variable-sized onode data structures are stored in an array of fixed-sized buckets of disk space. Related onode data structures are stored within catalog data structures. The catalog data structures are stored within the array of fixed-sized buckets of disk space. The array of buckets of fixed-sized buckets of disk space is, in turn, stored as a stream.

Abstract: File data is stored in a number of different representations on disk. File data is stored in streams which may assume any of several different representations. Each stream has an associated stream descriptor which describes how the stream is stored on the disk. The representations include storage of a stream in a single extent, storage of a stream in multiple extents and storage of a stream in an associated stream descriptor.

Abstract: A modified buddy system is adopted for managing disk space in a disk storage. The modified buddy system uses a minimal amount of memory space and provides very quick access to extents within the disk space. The modified buddy system utilizes a tree structure of nodes, wherein each node represents an extent of disk space. A bitmap is provided for holding state bits for each of the nodes in the tree structure. The bitmap is organized to preserve locality of reference.

Abstract: A method and system for executing code remotely is provided. In a preferred embodiment, a client program executes on a client node and communicates with a network. The executing client program then requests the execution of server code corresponding to an object instance or object class instance with which the client program desires to communicate. In response to the client program request, the computer system determines a location where the server code will be executed. This determination is made using a set of rules that arbitrate between location contexts specified by the corresponding server program and a location context requested by the client program. Once the appropriate location is determined, the client program forwards its request to the appropriate network node, which requests execution of the requested server code.

Abstract: A file system provides a hierarchical approach to storage of file data. Logically contiguous bytes of file data are stored in stream data structures, and streams which hold related file data are stored in a variable sized onode data structures on disk. The variable-sized onode data structures are stored in fixed sized buckets, and the buckets are organized into a variable sized array. Thus, the file system provides a combination of variable-sized storage with fixed-sized storage to provide a very efficient approach to storing file data. In addition, indexes may be provided within the structures to allow quick access to onodes and streams.

Abstract: A portion of a first storage stores identifying information of files to be processed by a computer. The files are stored in a second storage, with each file having associated identifying information which identifies the file, and each file including an update sequence value which indicates an order in which the file is to be processed by the computer. A threshold value is provided which is set equal to a largest update sequence value retrieved from the file that have been processed by the computer. In response to a loss of the file identifiers stored in the portion of the first storage, the file identifier for each file whose update sequence value is beyond the threshold value is stored in the portion of the first storage.

Abstract: A modified buddy system is adopted for managing disk space in a disk storage. The modified buddy system uses a minimal amount of memory space and provides very quick access to extents within the disk space. The modified buddy system utilizes a tree structure of nodes, wherein each node represents an extent of disk space. A bitmap is provided for holding state bits for each of the nodes in the tree structure. The bitmap is organized to preserve locality of reference.