Abstract: A system comprising one or more computing devices implements a vehicle information extraction service. The vehicle information extraction service enables customers to optimize an amount of relevant vehicle sensor information extracted from vehicles by reducing instances of collection of redundant data. The vehicle information extraction service additionally, or alternatively, enables customers to maintain a model of a fleet of vehicles and determine number of the vehicles of the fleet in a certain partition to calculate a data reduction factor that will filter out sensor data. The vehicle information extraction service communicates the reduction factor to the vehicles in the geographical region using a vehicle scheme to indicate to the vehicles the probability with which the vehicle is to transmit a particular type of sensor data.

Abstract: Methods and apparatus that allow clients to connect resource instances to virtual networks in provider network environments via private IP. Via private IP linking methods and apparatus, a client of a provider network can establish private IP communications between the client's resource instances on the provider network and the client's resource instances provisioned in the client's virtual network via links from the private IP address space of the virtual network to the private IP address space of the provider network. The provider network client resource instances remain part of the client's provider network implementation and may thus also communicate with other resource instances on the provider network and/or with entities on external networks via public IP while communicating with the virtual network resource instances via private IP.

Abstract: A quantum computing monitoring system may receive a request from user describing an algorithm to be executed using classical and quantum computing resources and a metric to be monitored associated with execution of the algorithm at the quantum computing resources. In execution, the quantum computing monitoring system may cause measurements to be obtained from the quantum computing resources at individual steps of the execution of the algorithm at the quantum computing resources, and the metric to be determined based on the obtained measurements. The quantum computing monitoring system may evaluate the metric with respect to a threshold, and provide an alert to the user responsive to determining that the metric fails to satisfy the threshold. The quantum computing monitoring system may further perform an operation to modify the execution of the algorithm at the quantum computing resources as needed.

Abstract: At a first compute instance run on a virtualization host, a local instance scaling manager is launched. The scaling manager determines, based on metrics collected at the host, that a triggering condition for redistributing one or more types of resources of the first compute instance has been met. The scaling manager causes virtualization management components to allocate a subset of the first compute instance's resources to a second compute instance at the host.

Abstract: An algorithm execution management system of a provider network may receive a request from a user for executing an algorithm using different types of computing resources, including classical computing resources and quantum computing resources. The request may indicate a container that includes the algorithm code and dependencies such as libraries for executing the algorithm. The algorithm execution management system may first determine that the quantum computing resources are available to execute the algorithm, and then cause the classical computing resources to be provisioned. The algorithm execution management system may cause at least one portion of the algorithm to be executed at the classical computing resources using the container indicated by the user, and at least another portion of the algorithm to be executed at the quantum computing resources. The quantum task of the algorithm may be provided a priority during execution of the algorithm for using the quantum computing resources.

Abstract: Respective initial feature sets are obtained for the nodes of a graph in which the nodes represent instances of entity types and edges represent relationships. Using the initial feature sets and the graph, a graph convolutional model is trained to generate one or more types of predictions. In the model, a representation of a particular node at a particular hidden layer is based on aggregated representations of neighbor nodes, and an embedding produced at a final hidden layer is used as input to a prediction layer. The trained model is stored.

Abstract: A candidate attribute combination of a first data set is identified, such that the candidate attribute combination meets a data type similarity criterion with respect to a collection of data types of sensitive information for which the first data set is to be analyzed. A collection of input features is generated for a machine learning model from the candidate attribute combination, including at least one feature indicative of a statistical relationship between the values of the candidate attribute combination and a second data set. An indication of a predicted probability of a presence of sensitive information in the first data set is obtained using the machine learning model.

Abstract: Methods, systems, and computer-readable media for analysis of code coverage differences across environments are disclosed. A code coverage profiling system determines a first code coverage profile associated with execution of program code in a first environment. The first code coverage profile indicates one or more portions of the program code that were executed in the first environment. The code coverage profiling system determines a second code coverage profile associated with execution of the program code in a second environment. The second code coverage profile indicates one or more portions of the program code that were executed in the second environment. The code coverage profiling system performs a comparison of the first code coverage profile and the second code coverage profile. The comparison determines a difference between the portions of the program code that were executed in the first and second environments.

Abstract: Commitments against various resources can be dynamically adjusted for customers in a shared-resource environment. 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), for example, as well as the amount of storage requested. The customer can subsequently adjust the committed rate of IOPS by submitting an appropriate request, or the rate can be adjusted automatically based on any of a number of criteria. Data volumes for the customer can be migrated, split, or combined in order to provide the adjusted rate. The interaction of the customer with the data volume does not need to change, independent of adjustments in rate or changes in the data volume, other than the rate at which requests are processed.

Abstract: Methods and apparatus for interfaces to manage inter-regional connectivity for direct network peerings. A system may include a connectivity coordinator, a first resource collection in a first geographical zone and a second resource collection in a second geographical zone. The coordinator implements a programmatic interface defining connectivity operations. The coordinator receives a request via the interface to establish a logically isolated network path to the second resource collection on behalf of a client that has a dedicated physical link set up to connect to the first resource collection. In response to the request, the coordinator performs one or more configuration operations to enable traffic to flow from the client's network to the second resource collection over a logically isolated network path using the dedicated physical link.

Abstract: Systems and methods are disclosed for elevators for material handling shuttles. In one embodiment, an example system configured to change elevation of a shuttle may include an elevator track disposed between a loading zone and an unloading zone, and a platform coupled to the elevator track and configured to move between the loading zone and the unloading zone. The platform may be configured to engage with a lower surface of the shuttle at the loading zone. The platform may be configured to lift the shuttle off a first set of rails at the loading zone, and to position the shuttle onto a second set of rails at the unloading zone.

Abstract: A representation of a category of task offloaders is stored, in response to receiving a descriptor of the category, in a database of categories of offloaders which can be attached to servers of one or more classes. An indication of server configurations which include a task offloader of the category is provided via programmatic interfaces. A task is executed at a task offloader of a server with one of the server configurations.

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: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: A method and system are provided for continuously monitoring bandwidth utilization in real time on a backbone of a network. Prefixes using the highest traffic can be identified and additional bandwidth can be provisioned in the form of optical transponder wavelengths. The additional bandwidth can be an express path that passes directly through optical nodes (thereby bypassing transit network devices) to the destination optical node. A centralized controller can perform the monitoring of the network devices, decide that an express path needs to be generated, and control both the network device and the optical network nodes to generate the express path from the network device, through the optical network, to the destination network device. The controller can apply and remove IP static routes and IP addresses associated with an express path. Additionally, the controller can request the setup or tear-down of an optical wavelength within the optical network.

Abstract: A quantum computing service includes a quality of service (QoS) and out-of-band prioritization module. The QoS and out-of-band prioritization module enforces QoS guarantees for quantum tasks and quantum jobs submitted to the quantum computing service while allowing for processing of the quantum jobs and quantum tasks based on QoS guarantees and not necessarily in an order in which the quantum jobs or quantum tasks are received. Also, the QoS and out-of-band prioritization module determines updated priorities out-of-band based on quantum resource usage information for previously executed quantum tasks such that submittal of pending quantum tasks is not delayed in while update priorities are being determined.

Abstract: Systems, methods, and collection devices are disclosed for rapid, local PCR testing. The PCR testing system may be configured for use with a disposable sample collection device that includes a swab configured for collecting a biological sample from a patient; and a sample container configured to receive the swab and separate a bulk quantity of the biological sample from the swab for containment in a bulk collection chamber, which is located with the sample container, wherein the sample container is configured to meter a selected volume of the biological sample into a PCR sample tube, which contains a lyophilized master mix, releasably attachable to the sample container.

Abstract: Systems, methods, and collection devices are disclosed for rapid, local PCR testing. The system may include a PCR testing module, memory configured to store computer-executable instructions, and at least one computer processor configured to access the memory and execute the computer executable instructions to: (i) receive an order for a PCR diagnostic test; (ii) associate a sample collection device (SCD) received by the PCR testing module with the order for a PCR diagnostic test; (iii) instruct the PCR testing module to conduct the PCR diagnostic test on a biological specimen in the SCD received by the PCR testing module; and (iv) cause presentation of results of the PCR diagnostic test.

Abstract: A system coordinates with remote hardware to execute customer workloads. The system uses an architecture for ensuring trust to ensure that debugging is not performed at the remote hardware while the customer workload is being executed on the remote hardware without customer consent. For example, debugging at the remote hardware may enable an entity performing the debugging to view certain aspects of the customer's workload. The architecture for ensuring trusts uses a shared secret to ensure customer consent is given before debugging can be performed while the customer's workload is being executed on the remote hardware.

Abstract: Systems and methods are disclosed for rapid PCR testing. Example embodiments may include a PCR testing module that includes a housing having a PCR machine disposed therein; a sample input station on the housing, wherein the sample input station is configured to receive a sample collection device (SCD) comprising a biological specimen sample provided by the patient; an SCD processing mechanism configured to transfer a lysed microportion of the biological specimen sample into a PCR sample tube attached to the SCD; at least one mechanism configured to separate the PCR sample tube from the SCD and transfer the PCR sample tube to the PCR machine; and a controller configured to (i) use the PCR machine to conduct a PCR test on contents of the PCR sample tube, and (ii) generate results of the PCR test.

Abstract: Methods, systems, and computer-readable media for orchestration of computations using a remote repository are disclosed. A representation of one or more inputs to a computation is stored in a repository. The computation is assigned to one or more hosts of a plurality of hosts. A representation of program code executable to perform the computation is stored in the repository. A local copy of the one or more inputs is stored on the one or more hosts. The computation is initiated on the one or more hosts using the program code and the local copy of the one or more inputs. The computation is initiated for a plurality of keys. The computation succeeds for one or more keys after the computation has failed for one or more other keys. A representation of one or more outputs of the computation is stored in the repository.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and snapshot copies of some volumes may also be stored (e.g., on remote archival storage systems). A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The snapshot copies of volumes may be used in various ways, including to allow users to obtain their own copies of other users' volumes (e.g., for a fee).

Abstract: Interface models may be used to execute interface queries over multiple interfaces. A query may be received at a service that is specified according to an interface query language. A plan to perform the query may be generated from an application of interface models for different components of the service to determine behavior for invoking different interfaces. The different interfaces are then invoked according to the plan in order to perform the query. A result to the query is determined based on responses received from the different interfaces and returned.

Abstract: Various embodiments of apparatuses and methods for transaction processing at edge servers in a content distribution network (“CDN”) are described. In some embodiments, an edge server receives an initial request from a client for content associated with a particular origin, and then provides the content to the client. The edge server can then receive another request from the client that might include an indicator for transaction processing. The edge server determines that transaction processing is indicated for handling this new request, in some embodiments. The edge server can then send a transaction notification to the origin, receive a transaction continuation response from the origin, and then execute a data transaction with transaction entities that are distinct from the content distribution network and the origin, in some embodiments. If the transaction is successful, the edge server can notify the client and the origin of the successful transaction, in some embodiments.

Abstract: One or more multi-stage optimization iterations are performed with respect to a compression algorithm. A given iteration comprises a first stage in which hyper-parameters of a perceptual quality algorithm are tuned independently of the compression algorithm. A second stage of the iteration comprises tuning hyper-parameters of the compression algorithm using a set of perceptual quality scores generated by the tuned perceptual quality algorithm. The final stage of the iteration comprises performing a compression quality evaluation test on the tuned compression algorithm.

Abstract: Extensible change control management for development and deployment of applications is described. A change control manager may register plugin components, including requester, approver and performer components, to process changes to a resource of a resource type, where registering is performed responsive to request(s) received via programmatic interface(s). Upon receiving a change request from the requester component, the change control manager may send the change request to the approver component to approve the change request and, responsive to notification of approval from the approver component, the change control manager may then send the change request to the performer component to implement the requested change.

Abstract: Decentralized development and deployment of applications is described. An application may be defined as being composed of multiple code libraries, each independently developed and deployed. Packagers of individual code libraries may deploy various versions of respective code libraries in multiple code cells and may further define cell selection criteria for the libraries. An application manifest may be constructed identifying the component code libraries with optional version selection criteria for the libraries. Upon receiving a request for the application for a particular client, a refined manifest for the application may be generated for that client, the refined manifest including identifiers of particular cells for the respective component code libraries. The application may then be generated according to the refined manifest and provided to the client. Subsequent requests for the application for the same client may be serviced according to the refined manifest.

Abstract: Multi-tenant hosting of inverted indexes for text searches is implemented. Text search requests are routed to different index nodes that cache inverted indexes for different user accounts. Updates to inverted indexes are routed to index nodes that have acquired a lock on an inverted index. The index nodes have access to a common data store that persistently stores the inverted indexes.

Abstract: A separate relationship management interface for applications that utilize application data objects to implement various application features is used to track changes to relationships between application data objects. Requests that cause writes corresponding to relationships between application data objects and requests that cause reads of relationships between application data objects may be handled using an interface that interacts with a separate data store tracking the relationships between application data objects.

Abstract: Unified automation of application development and delivery is provided. An automation pipeline execution coordinator may define a pipeline specification that includes actions to be performed, a triggering event definition and specification for determining execution context. The coordinator may concurrently detect triggering events for multiple pipelines matching the pipeline specification, and responsive to the detecting, determine execution contexts for the pipelines. The coordinator may then execute the multiple pipelines, where execution may proceed independently for pipelines with differing execution contexts. For pipelines sharing an execution context, execution of various actions of the respective pipelines may be coordinated. Execution context may be determined according to the specification for determining execution context, which may include an overridable default specification that determines context by locations of source data related to the triggering event.

Abstract: A quantum computing service includes a quantum circuit compilation module that uses received information about quantum processing units (QPUs) along with information about a quantum circuit to be compiled in order to generate an optimized ordered list of compilation passes to be performed to compile the quantum circuit for execution on a given QPU.

Abstract: Translations between versions of data object schemas may be performed between data object producers and data object consumers. A request to update a data object may be an update according to an additional version of a schema applicable to the data object from an existing version of a schema. The data object may be provided by one component of a distributed system. A trigger event may be detected to send the data object to a different component of the distributed system. The data object may be translated from the additional version to the existing version and sent to the different component.

Abstract: A database system may include a database service and a separate distributed storage service. The database service (or a database engine head node thereof) may be responsible for query parsing, optimization, and execution, transactionality, and consistency, while the storage service may be responsible for generating data pages from redo log records and for durability of those data pages. For example, in response to a write request directed to a particular data page, the database engine head node may generate a redo log record and send it, but not the data page, to a storage service node. The storage service node may store the redo log record and return a write acknowledgement to the database service prior to applying the redo log record. The server node may apply the redo log record and other redo log records to a previously stored version of the data page to create a current version.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Abstract: Network pathways are identified to transfer packets between a pair of regional virtual traffic hubs of a provider network. At a first hub of the pair, a first action is performed, resulting in a transmission of a packet received from a first isolated network to the second hub along a pathway selected using dynamic routing parameters. At the second hub, a second action is performed, resulting in the transmission of the packet to a destination within a second isolated network.

Abstract: Techniques are described for managing communications between multiple intercommunicating computing nodes, such as multiple virtual machine nodes hosted on one or more physical computing machines or systems. In some situations, users may specify groups of computing nodes and optionally associated access policies for use in the managing of the communications for those groups, such as by specifying which source nodes are allowed to transmit data to particular destinations nodes. In addition, determinations of whether initiated data transmissions from source nodes to destination nodes are authorized may be dynamically negotiated for and recorded for later use in automatically authorizing future such data transmissions without negotiation. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Techniques are described for enabling users of a service provider network to create and configure “application profiles” that include parameters related to execution of user workloads at provider substrate extensions. Once an application profile is created, users can request the deployment of user workloads to provider substrate extensions by requesting instance launches based on a defined application profile. The service provider network can then automate the launch and placement of the user's workload at one or more provider substrate extensions using edge-optimized compute instances (e.g., compute instances tailored for execution within provider substrate extension environments).

Abstract: Metadata indicating that a virtual traffic hub enabling connectivity between a plurality of isolated networks has been established is stored. A determination is made that a first entry of a first isolated network attached to the hub is to be represented in a second routing table of a second isolated network attached to the hub, e.g., to enable network packets originating at resources of the second isolated network to be transmitted via the hub to the first isolated network. A new entry corresponding to the first entry is included in the second routing table.

Abstract: A Toffoli magic state to be injected in preparation of a Toffoli gate may be prepared using a bottom-up approach. In the bottom-up approach, computational basis states are prepared in a fault tolerant manner using a STOP algorithm. The computational basis states are further used to prepare the Toffoli magic state. The STOP algorithm tracks syndrome outcomes and can be used to determine when to stop repeating syndrome measurements such that faults are guaranteed to be below a threshold level. Also, the STOP algorithm may be used in growing repetition code from a first code distance to a second code distance, such as for use in the computational basis states.

Abstract: Multiple stage filtering may be implemented for natural language query processing pipelines. Natural language queries may be received at a natural language query processing system and processed through a query language processing pipeline. The query language processing pipeline may filter candidate linkages for a natural language query before performing further filtering of the candidate linkages in the natural language query processing pipeline as part of generating an intermediate representation used to execute the natural language query.

Abstract: Techniques are described for managing communications between multiple computing nodes, such as for computing nodes that are part of managed virtual computer networks provided on behalf of users or other entities. In some situations, one or more of the computing nodes of a managed virtual computer network is configured to perform actions to extend capabilities of the managed virtual computer network to other computing nodes that are not part of the managed virtual computer network, such as by forwarding communications between computing nodes of the managed virtual computer network and the other external computing nodes so as to enable the other external computing nodes to participate in the managed virtual computer network. In some situations, the computing nodes may include virtual machine nodes hosted on one or more physical computing machines or systems, such as by or on behalf of one or more users.

Abstract: Techniques are described for providing logical networking functionality for managed computer networks, such as for virtual computer networks provided on behalf of users or other entities. In some situations, a user may configure or otherwise specify a network topology for a virtual computer network, such as a logical network topology that separates multiple computing nodes of the virtual computer network into multiple logical sub-networks and/or that specifies one or more logical networking devices for the virtual computer network. After a network topology is specified for a virtual computer network, logical networking functionality corresponding to the network topology may be provided in various manners, such as without physically implementing the network topology for the virtual computer network. In some situations, the computing nodes may include virtual machine nodes hosted on one or more physical computing machines or systems, such as by or on behalf of one or more users.

Abstract: A connected device at a client network implements a local data classification service for classifying data based on a data classification service of a remote provider network. The local data classification service receives a request to classify data at one or more data sources of the client network. The request is initiated from a client device of the client network according to a management interface for a data classification service of a remote provider network (e.g., using the same API request used by the remote classification service). The local data classification service obtains at least some of the data from the one or more data sources of the client network. The local data classification service classifies the obtained data according to different types of sensitivity using the data classification engine in the execution environment without the data being exposed outside of a data isolation boundary of the client network.

Abstract: Aspects of a data environment, such as the cloning, hibernation, and recovery of databases, are managed using a separate control environment. A monitoring component of the control environment can periodically communicate with the data environment to determine any necessary actions to be performed, such as to recover from faults or events for a data instance in the data environment. A workflow can be instantiated that includes tasks necessary to perform actions such as recovery, hibernation, resumption from hibernation, or backup or cloning. Tasks of the workflow can cause certain jobs to be performed by host managers in the data environment to affect calls made to the control environment.

Abstract: A system for providing a geofence service is disclosed. The geofence service receives an encrypted geospatial index for a specified geofence based on application of a hash function to respective ones of a plurality of locations for the specified geofence in accordance with a secret key that is unknown to the geofence service. The geofence service stores the encrypted geospatial index to a data store according to a geofence identifier for the specified geofence. The geofence service receives an encrypted device location identifier generated based on application of the hash function to a representation of a current location of a user device in accordance with the secret key. The geofence service determines whether the user device is located in a location of the plurality of locations based on a query of the encrypted geospatial index according to the encrypted device location identifier.

Abstract: Disclosed are system architectures and techniques for multiple access points for a data container. Control plane and data plane APIs are disclosed for generating access points and associating the access points with data containers, as well as for generating access point policies that specify permissions for the access points. More than one access point may be associated with a single data container. A storage service receives requests directed to the access points, and grants or denies the requests based on the permissions specified in the corresponding policies. Various types of use cases for using access policies are contemplated such as default, regional, or network-based (e.g., VPC-based) use-cases or the like. A system may implement layers of policies such as identity and access management policies, access point policies and data container policies.

Abstract: A device includes an interposer card that includes a processor, such as a system on a chip (SoC), and memory devices. The interposer card mounts to a mass storage device and has a shape that corresponds to a size of an end of the mass storage device to which the interposer card is mounted. The SoC of the interposer card is configured to implement an individual server for the mass storage device to which the interposer card is mounted. In some embodiments, a data storage system includes multiple mass storage devices mounted in a chassis and coupled to one or more backplanes, wherein interposer cards are connected between the mass storage devices and the one or more backplanes.

Abstract: Systems, devices, and methods are provided for secure multiparty computation (MPC) protocols. A first computing entity may send a first cryptographically protected data set to a server and a second computing entity may send a second cryptographically protected data set to the server. The server may lack access to plaintext versions of the data sets. The server may compare cryptographically protected data elements from the first and second data sets as part of a secure MPC protocol to determine certain information regarding the data sets, such as determining which data elements are included in both sets, and perform homomorphic computations according to a homomorphic encryption scheme. The server is accordingly able to determine an encrypted result.

Abstract: Systems and methods are disclosed for wireless powering and control of conveyors on shuttles. An example system may include a track, and a shuttle configured to move along the track, the shuttle having a conveyor, and a first induction coil. The system may include a second induction coil disposed at a first location along the track, where the second induction coil is configured to interact with the first induction coil to power the conveyor. The shuttle may not have an onboard power source coupled to the conveyor.

Abstract: Methods, systems, and computer-readable media for a query language for selecting and addressing resources are disclosed. Records are stored in a data store. The records comprise attribute data descriptive of resources managed by a provider network. The data store is queried to select one or more records matching one or more values of the attribute data. The query is expressed using a query language. A resource group is determined based (at least in part) on the query. The resource group comprises one or more resources corresponding to the one or more records selected by the query.