Abstract: Techniques are described that facilitate co-viewing in an experiential reality environment such as a virtual reality or augmented reality environment. These techniques include prioritizing a main view of experiential reality content over side views of the experiential reality content.

Abstract: Described is a multiple-camera system and process for disambiguating between multiple users and identifying which of the multiple users performed an event. For example, when an event is detected, user patterns near the location of the event are determined, along with touch points at the location of the event. User pattern orientation and/or arm trajectories between the event location and the user patterns may be determined and processed to disambiguate between multiple users and determine which user pattern is involved in the event.

Abstract: Systems and methods are provided for optimizing campaigns (such as marketing campaigns) based on both short term and long term behaviors of users. A computing system learns an incremental outcome prediction model using training data comprising a marketing campaign log entry of a subject user and another marketing campaign log entry of a corresponding user, which represents a counterfactual outcome for the subject user. A marketing campaign can be selected for another user using the learned model.

Abstract: Techniques are described for managing program execution capacity used to execute software programs, such as for a group of computing nodes in use executing one or more programs for a user. Dynamic modifications to the program execution capacity of the group may include adding or removing computing nodes, such as based on automated determinations that previously specified criteria are currently satisfied. The described techniques further include tracking information about changes that occur in one or more capacity utilization metrics of interest in response to dynamic modifications to the program execution capacity of the group, and then using such learned responses to determine a customized capacity modification policy that is configured for the actual operation of the software program(s) for the user. In some situations, the techniques are used in conjunction with a fee-based program execution service that executes multiple programs on behalf of multiple users of the service.

Abstract: Technologies are provided for storing data by alternating the performance of data write operations using multiple clusters of storage devices. Data is written to internal buffers of storage devices in one cluster while data stored in buffers of storage devices in another cluster is transferred to the storage devices' permanent storages. When available buffer capacity in a cluster falls below a specified threshold, data write commands are no longer sent the cluster and the storage devices in the cluster transfer data stored in their buffers to their permanent storages. While the data is being transferred, data write commands are transmitted to other clusters. When the data transfer is complete, the storage devices in the cluster can be scheduled to receive data write commands again. A cluster can be selected for performing a given data write request by matching the attributes of the cluster to parameters of the data write request.

Abstract: Consistency metadata, including a parameter for a pseudo-random number source, are determined for training-and-evaluation iterations of a machine learning model. Using the metadata, a first training set comprising records of at least a first chunk is identified from a plurality of chunks of a data set. The first training set is used to train a machine learning model during a first training-and-evaluation iteration. A first test set comprising records of at least a second chunk is identified using the metadata, and is used to evaluate the model during the first training-and-evaluation iteration.

Abstract: Customers of a shared-resource environment can provision resources in a fine-grained manner that meets specific performance requirements. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), and the amount of storage requested. The customer will then at any time be able to complete at least the committed rate of IOPS. If the customer generates submissions at a rate that exceeds the committed rate, the resource can still process at the higher rate when the system is not under pressure. Even under pressure, the system will deliver at least the committed rate. Multiple customers can be provisioned on the same resource, and more than one customer can have a committed rate on that resource. Customers without committed or guaranteed rates can utilize the uncommitted portion, or committed portions that are not being used.

Abstract: Temperature management systems for aerial vehicles may include heat pipes that are thermally connected to components that generate heat. The heat pipes may be routed through or adjacent to a propeller or propulsion airflow, or within or across a vehicle airflow, to dissipate heat from the components. A heat pipe may be selected from a plurality of heat pipes based on measured temperatures of components that generate heat, operational characteristics of the aerial vehicle and/or one or more propellers, and/or measured temperatures of other components that may be heated. Additional temperature management systems may include cool air ducts and cool air pipes that may be routed from a propeller or propulsion airflow, or a vehicle airflow, to components that generate heat or other components that may be cooled.

Abstract: At a resource corresponding to one node of a data processing workflow, a persistent representation of a binary signal representing a condition associated with an event is generated. The signal indicates a validity period of the condition. At a second resource corresponding to another node of the workflow, a decision to initiate an action is generated based on analysis of a set of binary signals and an action scheduling rule, and the action is initiated.

Abstract: A device provisioning service (DPS) fields requests from unprovisioned devices so that those unprovisioned devices can obtain network credentials or other data used in provisioning the unprovisioned device. The DPS can identify the device securely and associate with a known user account, or the user provisioning the device can supply network credentials over a side channel after supplying a provision code indicative of possession of the unprovisioned device. The provision code can be unique to the unprovisioned device or a short-sequence code that is not necessarily unique, but that is sufficiently uncommon that a specific short-sequence code would not likely be used more than once at a time. In order to communicate with the DPS, a provisioning device might connect the unprovisioned device and the DPS. If the provisioning device is a trusted device, it can perform some of the steps otherwise required by the DPS.

Abstract: A computing environment is disclosed that receives from devices requests directed toward services accessible in the environment, and that forwards communications from services in the environment to devices registered with the environment. During a registration process at the environment, devices are assigned a device identifier that is used to identify and authenticate each particular device and requests communicated from and to the device via the environment. The computing environment maintains state information for each device that has been registered with the system. As the device interacts with the system, the state information is updated to reflect the changes in the device. When requests to perform functions are received from devices, the computing environment determines for the particular device and the particular function requested what processing needs to be performed by the environment in response to the request.

Abstract: Network hardware devices are organized in a wireless mesh network (WMN) including a base station node (BSN) device connected to a tower in a geographic area and multiple home access node (HAN) relay devices located in a geographic area and separated from one another by a distance up to approximately 500 meters. A first set of HAN relay devices is organized in a first linear sub-mesh network with a first deployment layout having an S-shape or an inverse S-shape. Each of the first set of HAN relay devices establishes a frequency-division duplex (FDD) link between itself and at least one other HAN relay device and at least one of the first set of HAN relay devices establishes a time-division duplex (TDD) link over which the at least one of the HAN relay devices communicates with the BSN device.

Abstract: Features are disclosed for dividing content pages into sections, or “tiles,” that can be updated independently of one another, and determining the processing burdens associated with updating and managing such divided content pages, the likelihood that portions of the content pages will change, etc. The processing burdens may be based on an analysis of how long it takes to update the display of the tiles or other sections of the content page, the computer memory used to update the display, the processor cycles used to update the display, etc. A browser application or some other module can use the determined processing burdens and/or change likelihoods to define a new or updated layout for dividing the content pages into tiles. The browser application may also cache, for future use, cost information and/or information regarding the new or updated layout for dividing the content pages into tiles.

Abstract: Computer implemented systems and methods for distributing replica chunks are disclosed. Computing nodes in the network are assigned to zones that correspond to functions performed by the nodes in the network. Replica chunks are likewise associated with the zones that are typically used in processing the replica chunks. When the owner of a replica chunk identifies a new node, it distributes to the new node those replica chunks that are associated with a zone that matches the zone associated with the new node. The owner of the replica chunk is further programmed to receive requests from nodes to subscribe to a data chunk. The node replicates the data chunk to those nodes in the network that have subscribed to the data chunk. When a node no longer requires access to a data chunk, the node unsubscribes from receiving the data chunk.

Abstract: A time code to byte conversion system is provided herein that maps time codes to byte ranges such that a user device can retrieve a portion of, but not all of, a media file by specifying a time range. For example, the time code to byte conversion system can play a media file and identify the byte at which each time code begins. The time code to byte conversion system can then store the byte to time code mapping in an index accessible by a media retrieval server. A user device can then provide a time range to the media retrieval server, the media retrieval server can query the index to identify the range of bytes that corresponds to the provided time range, and then the media retrieval server can retrieve the identified range of bytes from a media database for transmission to the user device.

Abstract: Dynamic data partitioning for stateless request routing may be implemented. Respective partitions of data and corresponding mapping information may be maintained at partition hosts. A repartitioning event may be detected for the data to move a portion of data from a source partition host to a destination partition host. In response, the mapping information at the source partition host may be updated to indicate that the portion of data is located at the destination partition host for subsequent access requests received at the source partition host. The portion of the data may be copied from the source partition host to the destination partition host. Upon completion of the copy of the portion of the data, the mapping information at the destination partition host may be updated to indicate that the portion of the data is located at the destination partition host and is available for access.

Abstract: Technologies are provided for determining sources of network packet loss in a network environment. The sources of packet loss can be determined by sending probe packets between devices in different areas in which the areas are connected via the Internet. From the probe packets, IP path information can be obtained. The IP path information can be annotated in order to identify nodes along forward and return paths between the areas. Packet loss can be assigned to the nodes using the annotated IP path information. Using the packet loss assigned to the nodes, epicenters of packet loss can be identified and corrective action can be taken.

Abstract: A distributed file storage services (DFSS) that provides low latency (LL) and high throughput (HT) modes for file systems. A HT metadata subsystem (HTMS) may use a distributed transaction system for data and metadata reads and writes for file systems in HT mode. A LL metadata subsystem (LLMS) may process metadata requests for file systems in LL mode. For metadata read requests, the LLMS may locally cache at least some of the file system metadata. For metadata write requests, the LLMS may write entries to a journal and notify the access node after the entries are committed to the journal. Data reads and writes for file systems in LL mode may be handled similarly to data reads and writes for file systems in HT mode. A file system may be converted from LL to HT mode, or from HT to LL mode.

Abstract: Systems and methods are disclosed that identify users of a media distribution system that tend to consume popular media items prior to such media items gaining popularity. For example, a set of early adopters may be identified that tend to listen to music associated with particular artists before such artists become popular. The systems and methods disclosed may also utilize identified early adopters to determine relatively obscure or unpopular media items (or creators thereof) that are likely to become popular in the future. Illustratively, an obscure artist whose content is commonly consumed by early adopters can be identified as potentially achieving widespread popularity in the future. These media items predicted to become popular or media item creators may then be recommended to other users of the media distribution system.