Abstract:
An event detection system for detecting events related to vehicles based on sensor data from the vehicles. An event detection service on a network may receive streams of sensor data from vehicles and apply machine learning techniques to train models and to analyze the data to detect vehicle-related events. Supervised and unsupervised techniques may be used to train the models and to detect known as well as anomalous events. Events may be detected based on data from one or from multiple vehicles. The system may respond to events by alerting entities and/or signaling vehicle control systems to respond to the events. Trained models may be downloaded to vehicles; the vehicle computer systems can then locally detect events. The downloaded models can be further trained on the vehicles, uploaded to the network, and integrated into the network-based models to improve the performance of the models.
Abstract:
Methods, systems, and computer-readable media for a client-side filesystem for a remote repository are disclosed. One or more files of a repository are sent from a storage service to a client device. The file(s) are obtained by the client using a credential sent by a repository manager. Local copies of the file(s) are accessible via a local filesystem mounted at the client device. One or more new files associated with the repository are generated at the client device. Using the credential, the one or more new files are obtained at the storage service from the client device. The one or more new files are added to the repository.
Abstract:
Multiple edits to a hierarchical data structure may be atomically applied. A request to perform modifications with respect to a portion or the entire hierarchical data structure may be received. A copy of the requested portion of the hierarchical data structure may be created separate from the hierarchical data structure. The portion of the hierarchical data structure may remain available for read access. Modifications may be applied to the copy of the portion of the hierarchical data structure. In response to a request to commit the modifications to the portion of the hierarchical data structure, the copy of the portion of the hierarchical data structure may atomically replace the portion of the hierarchical data structure.
Abstract:
A distributed data store may maintain versioned hierarchical data structures. Different versions of a hierarchical data structure may be maintained consistent with a transaction log for the hierarchical data structure. When access requests directed to the hierarchical data structure are received, a version of the hierarchical data structure may be identified for processing an access request. For access requests with snapshot isolation, the identified version alone may be sufficient to consistently process the access request. For access requests with higher isolation requirements, such as serializable isolation, transactions based on the access request may be submitted to the transaction log so that access requests resulting in committed transactions may be allowed, whereas access requests resulting in conflicting transactions may be denied.
Abstract:
A distributed key-value database management system may provide transactions having a high degree of conformance to ACID properties. A data element may be maintained as a versioned list, where each entry may comprise a timestamp and a value indicative of a corresponding version of the data element. The timestamp may be based at least in part on a vended time value. Timestamps may be monotonically increasing and unique across all entries in a distributed system. Conflicting updates to a data element may be detected directly, prior to the completion of involved transactions.
Abstract:
A replication chain comprising one or more replication nodes of a multi-tenant stream management system is assigned to store data records of a partition of a particular data stream. A data record of the partition is received at a selected replication node of the replication chain. In a sequential order, a respective replica of the data record is stored at each replication node of the chain. An acknowledgement of a successful storage of the data record is provided after the replications are completed.
Abstract:
A partitioning policy, comprising an indication of an initial mapping of data records of a stream to a plurality of partitions, is selected to distribute data records of a data stream among a plurality of nodes of a stream management service. Data ingestion nodes and storage nodes are configured according to the initial mapping. In response to a determination that a triggering criterion for dynamically repartitioning the data stream has been met, a modified mapping is generated, and a different set of ingestion and storage nodes are configured. For at least some time during which arriving data records are stored in accordance with the modified mapping, data records stored at the first set of storage nodes in accordance with the initial mapping are retained.
Abstract:
Systems and methods are presented for processing and auditing data records using a stream based data processing system. Data output by data center computers may be collected and used to generate data records that include values for metrics related to computer resource consumption. These data records may be inserted into a stream which can include auditors and various other processors. The auditors may determine whether any of the data records include discrepancies. A gating processor can determine which processors, if any, to provide data records that include discrepancies. Further, an amendment processor can be used to resolve discrepancies detected by the auditors. In addition, a billing processor can be used to generate bills that identify the discrepancies and include information relating to the cause and actions taken in response to the discrepancies detected in the data records.
Abstract:
Virtual resource provisioning may be enhanced by coloring virtual resource instances and/or underlying implementation resources. Particular resource colors may be associated with particular treatments during allocation of implementation resources to virtual resources. There may be different types of colors corresponding to different types of allocation treatment. Exclusory colors may be utilized to reduce clustering of virtual resources with respect to implementation resources. Assignment of exclusory colors to virtual resources can help strike a balance between lower costs through efficient implementation resource utilization and higher fault tolerance through spreading across an available implementation resource pool. Inclusive colors may be utilized to require and/or prefer allocation of virtual resources to implementation resources painted with the inclusive color. Proximity colors may be utilized to enhance a computational performance of a set of virtual resources. Proximity colors may be associated with proximity specifications that define proximity in implementation resource networks.
Abstract:
Methods and apparatus for vibration cancellation are disclosed. Vibration data from one or more vibration detectors associated with a storage device is collected. The vibration data represents vibrations experienced by the storage device. In response to the vibration data from the one or more vibration detectors, one or more movements for respective ones of one or more counter-vibration actuators to at least partially cancel of the vibrations experienced by the storage device is calculated. The one or more counter-vibration actuators perform the one or more movements.