Abstract: A first network namespace and second network namespace are created in a computing instance of a computer system, with the second network namespace being accessible to the first network namespace via an interface. A service is executed in the first namespace and an encoder is executed in the second namespace, with the encoder transforming media from one format to another format. Communication from the encoder to the service is regulated via the interface.

Abstract: A distributed system processing a publisher's streaming data. The distributed system comprises multiple workers and publisher data stores, each publisher data store dedicated to a worker and a publisher. A sampling ratio (the fraction of data items for storage in the publisher's data store) is selected by a publisher data store's worker based on historical information. At least two workers select different sampling ratios. Data items representing an interaction between an entity and the publisher are received. Each data item is assigned to a worker for processing. A hash function is applied to the data item's identifier, resulting in a key value falling within the hash function's range. The scope of the publisher's data store is equal to the hash function's range multiplied by the sampling ratio of the publisher's data store. A data item with a key value within the scope of the publisher's data store is stored therein.

Abstract: A distributed system processing a publisher's streaming data. The distributed system comprises multiple workers and publisher data stores, each publisher data store dedicated to a worker and a publisher. A sampling ratio (the fraction of data items for storage in the publisher's data store) is selected by a publisher data store's worker based on historical information. At least two workers select different sampling ratios. Data items representing an interaction between an entity and the publisher are received. Each data item is assigned to a worker for processing. A hash function is applied to the data item's identifier, resulting in a key value falling within the hash function's range. The scope of the publisher's data store is equal to the hash function's range multiplied by the sampling ratio of the publisher's data store. A data item with a key value within the scope of the publisher's data store is stored therein.

Abstract: A distributed system processing a publisher's streaming data. The distributed system comprises multiple workers and publisher data stores, each publisher data store dedicated to a worker and a publisher. A sampling ratio (the fraction of data items for storage in the publisher's data store) is selected by a publisher data store's worker based on historical information. At least two workers select different sampling ratios. Data items representing an interaction between an entity and the publisher are received. Each data item is assigned to a worker for processing. A hash function is applied to the data item's identifier, resulting in a key value falling within the hash function's range. The scope of the publisher's data store is equal to the hash function's range multiplied by the sampling ratio of the publisher's data store. A data item with a key value within the scope of the publisher's data store is stored therein.

Abstract: A method supports data communication in a mobile application by specifying in the mobile application a program intent and one or more course or fine-grained properties of data objects in terms of tolerance to delay and loss; selecting a transfer policy for a set of data objects based on the application intent; receiving and coalescing intents of one or more applications for object data for the one or more applications; crafting an aggregate transfer policy, and communicating data from one or more applications as an aggregate based on the aggregate transfer policy to programmatically incorporate and benefit from tolerance to delay in the transfer of data.

Abstract: Disclosed herein are methods and structures for networks of mobile computers which efficiently synchronizes table data across the mobile computers while exhibiting great tolerance for temporary disconnects.

Abstract: Disclosed herein are methods and structures for a computer cache that includes its own garbage collection component that reclaims space occupied by free objects in the cache such that the cache avoids retaining deleted objects thereby increasing cache hit ratios and further permits short-lived dirty objects to be deleted without requiring them to be written back to an underlying store.

Abstract: Disclosed are methods and structures that facilitate the synchronization of mobile devices and apps with cloud storage systems. Our disclosure, Simba, provides a unified synchronization mechanism for object and table data in the context of mobile clients. Advantageously, Simba provides application developers a single, API where object data is logically embedded with the table data. On the mobile device, Simba uses a specialized data layout to efficiently store both table data and object data. SQL-like queries are used to store and retrieve all data via a table abstraction. Simba also provides efficient synchronization by splitting object data into chunks which can be synchronized independently. Therefore, if only a small part of an object changes, the full object need not be synced. Advantageously only the changed chunks need be synched.

Abstract: A method supports data communication in a mobile application by specifying in the mobile application a program intent and one or more course or fine-grained properties of data objects in terms of tolerance to delay and loss; selecting a transfer policy for a set of data objects based on the application intent; receiving and coalescing intents of one or more applications for object data for the one or more applications; crafting an aggregate transfer policy, and communicating data from one or more applications as an aggregate based on the aggregate transfer policy to programmatically incorporate and benefit from tolerance to delay in the transfer of data.

Abstract: A cell phone having distributed artificial intelligence services is provided. The cell phone includes a neural network for performing a first pass of object recognition on an image to identify objects of interest therein based on one or more criterion. The cell phone also includes a patch generator for deriving patches from the objects of interest. Each of the patches includes a portion of a respective one of the objects of interest. The cell phone additionally includes a transmitter for transmitting the patches to a server for further processing in place of an entirety of the image to reduce network traffic.

Abstract: A cell phone having distributed artificial intelligence services is provided. The cell phone includes a neural network for performing a first pass of object recognition on an image to identify objects of interest therein based on one or more criterion. The cell phone also includes a patch generator for deriving patches from the objects of interest. Each of the patches includes a portion of a respective one of the objects of interest. The cell phone additionally includes a transmitter for transmitting the patches to a server for further processing in place of an entirety of the image to reduce network traffic.

Abstract: A region of a node is searched to find a content-defined split point. A split point of a node is determined based at least in part on hashes of entries in the node and the node is split based on the determined split point. The search region is searched for the first encountered split point and the node is split based on that split point. That split point is based on a predetermined bitmask of the hashes of the entries in the node satisfying a predetermined condition.

Abstract: An operating system kernel, including a protocol stack, includes a network layer for receiving a message from a data network, a stackable file system layer coupled to the network layer for inspecting the message, wherein the stackable file system layer is coupled to a storage device, the stackable file system determining and storing file system level information determined from the message, and a wrapped file system comprising a file targeted by the message coupled to the stackable file system layer for receiving the message inspected by the stackable file system.