Abstract: A first database may receive a query comprising a first portion associated with a non-deterministic result. The first non-deterministic portion of the query may be mapped to a second deterministic portion. A second, deterministic query may be formed by replacing the first portion with the second portion. The second version of the query may be executed on the first database, causing the first database to transition from a first state to a second state. The second query may be executed on a second database in the first state, causing the second database to transition to a state equivalent to the second state of the first database.

Abstract: Systems, methods, and computer-readable media are disclosed for preventing duplicate content selection for digital presentation. In one embodiment, an example method may include determining a first bid request for a first content delivery slot at a first time, the first bid request having a first user identifier, determining a ranking of candidate product identifiers for which the first user identifier is eligible at the first time, and determining a second bid request for a second content delivery slot at a second time, the second bid request having the first user identifier, where the second time is within a predetermined time interval of the first time. Example methods may include determining an impression counter value for the first user identifier at the second time, selecting a product identifier from the candidate product identifiers using the impression counter value, and determining a first bid amount using the product identifier.

Abstract: A pick rate planning system is utilized to determine pick rates needed for the picking of items in a materials handling facility. Critical pull times (“CPTs”) are determined which indicate times by which items must be picked from inventory. A picking capacity of the materials handling facility is determined and pick rates are allocated as corresponding to regions of the picking capacity that are associated with the CPTs. As part of the allocating of the pick rates, regions of the picking capacity may have portions that result in a level filling of the picking capacity that minimizes spikes and other undesirable fluctuations.

Abstract: Cipher suites and/or other parameters for cryptographic protection of communications are dynamically selected to more closely match the intended uses of the sessions. A client indicates a planned use of a session to a server. The client's indication of the planned use may be explicit or implicit. The server selects an appropriate set of parameters for cryptographic protection of communications based at least in part on the indicated planned use and the client and server complete a handshake process to establish a cryptographically protected communications session to use the selected set of parameters.

Abstract: An active patch panel assembly splits an optical signal of a fiber optic cable into two signals: a first signal directed to a patch panel port and a second signal measured by an optical sensor unit. A network management service of a computing services resource provider receives signal information from the optical sensor unit regarding the optical signal. The network management server may compare the signal information with signal information received from another patch panel assembly. Based on a correspondence between the signal information of the different patch panels, the network management service may determine a data path association between the optical signals. The data path association may be recorded in a database that stores data path associations of a service provider.

Abstract: A system that implements a scalable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain table data in multiple replicas of partitions that are stored on respective computing nodes in the system. In response to detecting an anomaly in the system, detecting a change in data volume on a partition or service request traffic directed to a partition, or receiving a service request from a client to split a partition, the data storage service may create additional copies of a partition replica using a physical copy mechanism. The data storage service may issue a split command defined in an API for the data store to divide the original and additional replicas into multiple replica groups, and to configure each replica group to maintain a respective portion of the table data that was stored in the partition before the split.

Abstract: Techniques for restricting the execution of algorithms contained in applications executing on virtual machines executing within a computer system are described herein. A first sampled set of computer executable instructions is gathered from a virtual machine by a controlling domain and compared against a reference set of computer executable instructions. If the first set is similar to the reference set, and if the execution of the algorithm corresponding to the reference set is restricted by one or more computer system polices, one or more operations limiting the execution of the restricted algorithm are performed, thus ensuring conformance with the computer system policies.

Abstract: Systems and methods are provided herein for mitigating contentions between mobile drive units (MDUs) within a workspace. Contentions between planned traversal paths of a set of MDUs may be identified by a contention management module. A schedule for interleaving execution of the planned traversal paths may be determined. The contention management module may submit space allocation requests to a facility management module on behalf of one or more MDUs in accordance with the schedule. The facility management module may decide to grant or deny usage of space within the workspace based on the space allocation requests. The decision may be communicated to the MDU (e.g., via the contention management module), and the MDU may act accordingly. In this manner, the contention management module may affect the timing of execution of steps within the planned traversal paths to reduce wait times of the MDUs and improve the throughput of the system.

Abstract: An electronic marketplace for service images permits users to browse descriptions of service images implementing desired functionalities of a virtual machine image. The described service images may contain one or more software applications and may be further offered for purchase through an electronic service image marketplace. The electronic marketplace can further provide uniform control objects that are associated with multiple service images and multiple instruction sets. Following an interaction with a particular uniform control object, the electronic marketplace can perform an action on a particular service image based on an association between the particular uniform control object and a particular instruction set associated with the particular service image.

Abstract: A mesh network device includes a content repository including a first section to store original data and a second section to store cached data, and an application processor including a user space, kernel space, and an on-path data caching engine. The on-path data caching engine is to receive, from a second mesh network device, data frames via a data link layer of a TCP/IP mesh network. The data frames include audio or video content. The on-path data caching engine is further to store the data frames in a socket kernel buffer, determine that a third mesh network device is a destination for the data frames, and forward the data frames to the third mesh network device. The on-path data caching engine is to determine that the audio or video content is to be cached and asynchronously copy the audio or video content to the second section of the content repository.

Abstract: Methods, systems, and computer-readable media for cloud-based access to quantum computing resources are disclosed. A classical computing instance is launched based at least in part on a request. The computing instance is launched by a control plane of a provider network. A quantum computing resource is accessible to the computing instance and is selected based at least in part on input from a user associated with the request. The quantum computing resource is implemented in the provider network and comprises a plurality of quantum bits. A quantum algorithm is run on the quantum computing resource.

Abstract: A data volume can be created on a network-accessible storage device in a data center for use by a virtual machine instance. More specifically, a management system of the data center may request storage servers to allocate space for the data volume. Prior to receiving confirmation that the data volume has been created, the management system may further request the storage servers to establish a lease that authorizes the virtual machine access to the data volume.

Abstract: A method for automated risk assessment of source code for a program includes detecting that a new version of source code for a program is available to be deployed by a software deployment pipeline, determining a portion of the new version of the source code that comprises one or more updates to a previous version of the source code, determining a risk weight value associated with the one or more updates, and determining whether the risk weight value meets a threshold value is determined. Responsive to determining that the risk weight value meets the threshold value, the method executes a high risk deployment protocol for the new version of the source code within the software deployment pipeline.

Abstract: In one embodiment, an inventory storage module has a first conveyor segment, a second conveyor segment spaced below the first conveyor segment, a first vertical lift disposed at a first end of the module, and a second vertical lift disposed at a second end of the module. The first and second lifts each transfer inventory carriers between the first and second conveyor segments. The first conveyor segment, the second conveyor segment, the first vertical lift, and the second vertical lift together define a conveying loop in a vertical plane, and the storage module translates inventory carriers around the conveying loop until a desired one of the inventory carriers is presented at one of the first and second module ends. An inventory item can be retrieved from, or stowed in, the desired one of the inventory carriers at the one of the first and second module ends.

Abstract: Techniques for facilitating the configuration of a device through inductance power transfer are described. In some instances, a device that is packaged for shipment may be associated with an induction coil. The induction coil may be disposed within a package or otherwise arranged. The device may be temporarily powered via the induction coil to receive content wirelessly and store the content on the device. The content may be associated with a user to which the package will be shipped.

Abstract: Techniques for address migration are described. An address migration service can receive a request to migrate an address space to a provider network, the request including at least one range of addresses. The AMS service can authorize the request with an internet registry and provision the address space in at least one area of the provider network. The AMS can receive a request to advertise the address space, advertise the address space, and allocate at least one address in the address space to at least one resource in the provider network.

Abstract: Technologies are described for a local interface override that allows a program code function to be executed on a computing hub and interface with a local service located on the computing hub. An example method may include loading, on a computing hub included in a local device network, a program code function configured to interface with a shared service located in a service provider environment. Loading a local library to overlay a service provider library, where the local library provides a local service interface for a local service located on the computing hub that is similar to a shared service interface for the shared service. Overriding the service provider library with the local library in response to service requests generated by the instance of the program code function; thereby providing the local service interface for the local service located on the computing hub.

Abstract: A processing device receives an event notification indicating a security configuration change of a cloud computing resource associated with a member account. In response, the processing device identifies a security policy associated with an administrative account corresponding to the member account and evaluates the security policy against the security configuration change to determine compliance with the policy. If not in compliance, the processing device generates a change event indicating a repair to the security configuration of the cloud computing resource to bring the security configuration into compliance with the security policy.

Abstract: Methods, systems, and computer-readable media for failure isolation in a distributed system are disclosed. An operation is initiated at a first service in a distributed system. The operation is dependent on a plurality of requests to one or more services including a second service, and the requests are associated with a key. A keyspace comprising an ordered set of potential key values is partitioned into a first partition and a second partition, where the first partition represents potential key values to be subjected to deliberate request shedding. The key associated with the requests is mapped to the first partition. The requests to the second service are discarded based at least in part on the mapping, and the operation associated with the key fails at the first service.