Abstract: A consensus protocol-based replication approach is provided. For each change operation performed by a leader server on a copy of the database, the leader server creates a replication log record and returns a result to the client. The leader does not wait for consensus for the change operation from the followers. For a commit, the leader creates a commit log record and waits for consensus. Thus, the leader executes database transactions asynchronously, performs replication of change operations asynchronously, and performs replication of transaction commits synchronously.

Abstract: A consensus protocol-based replication approach is provided. Chunks are grouped into replication units (RUs) to optimize replication efficiency. Chunks may be assigned to RUs based on load and replication throughput. Splitting and merging RUs do not interrupt concurrent user workload or require routing changes. Transactions spanning chunks within an RU do not require distributed transaction processing. Each replication unit has a replication factor (RF), which refers to the number of copies/replicas of the replication unit, and an associated distribution factor (DF), which refers to the number of servers taking over the workload from a failed leader server. RUs may be placed in rings of servers, where the number of servers in a ring is equal to the replication factor, and quiescing the workload can be restricted to a ring of servers instead of the entire database.

Abstract: A lead-sync log record is used to synchronize the replication logs of follower shards to the leader shard. In response to a failure to determine that there is a consensus for a database transaction commit operation after a shard server becomes a new leader, the new leader shard performs a sync operation using the lead-sync log record to synchronize replication logs of the follower shards to the replication log of the new leader. A shard server identifies a first transaction having a first log record but not a post-commit log record in the replication log, defines a recovery window in the replication log starting at the first log record of the identified first transaction and ending at the lead-sync log record, identifies a set of transactions to be recovered, and performs a recovery action on the set of transactions to be recovered.

Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

Abstract: A method for calculating a fare for a transport service is provided. One or more processors receive a plurality of location data points from a computing device associated with a vehicle providing the transport service. The plurality of location data points correspond to a route of travel during performance of the transport service. A determination is made, based on a set of location data points of the plurality of location data points, that the vehicle has potentially driven along a roadway in which a toll is to be assessed as part of the fare. The roadway in which the toll is to be assessed is identified. The amount for the toll is determined for the identified roadway.

Abstract: Techniques for implementing container credentialing by a host are described herein. In one example, a system for providing credentials includes a memory device for storing instructions and a processing device for executing instructions. The system can also include a container to execute a runtime environment for an application through the memory device and processing device, the application to request access to a credential locked resource. The system can also include a host environment to share the memory and the processing device with the container. In an example, the host environment may detect a request for a credential for the credential locked resource from the container. In an example, the host environment may also provide a credential for a credential locked resource to the container if the container is approved to receive the credential based on a policy.

Abstract: A housing for an electronic device includes a single rear housing assembly coupled to the cover glass of a display assembly. The rear housing assembly includes a metal rear chassis with two layers of injection molded material formed on at least the chassis side regions. The first injection molded layer includes a high reinforcing agent content percentage to provide increased stiffness, and the second injection molded layer includes a low reinforcing agent content percentage, which provides less structural support than the first injection molded layer, but an improved aesthetic appearance.

Abstract: A check valve has a friction-free replaceable valve insert check assembly. The check assembly includes a poppet on which a spring is mounted engaging an axially moveable seat which in turn engages a seat on the inner end of the poppet biased into engagement by the spring. Upon separation of the inner and outer valve bodies the insert check assembly will freely separate from the valve body for inspection or replacement.

Abstract: A method for calculating a fare for a transport service is provided. One or more processors receive a plurality of location data points from a computing device associated with a vehicle providing the transport service. The plurality of location data points correspond to a route of travel during performance of the transport service. A determination is made, based on a set of location data points of the plurality of location data points, that the vehicle has potentially driven along a roadway in which a toll is to be assessed as part of the fare. The roadway in which the toll is to be assessed is identified. The amount for the toll is determined for the identified roadway.

Abstract: Techniques for implementing container credentialing by a host are described herein. In one example, a system for providing credentials includes a memory device for storing instructions and a processing device for executing instructions. The system can also include a container to execute a runtime environment for an application through the memory device and processing device, the application to request access to a credential locked resource. The system can also include a host environment to share the memory and the processing device with the container. In an example, the host environment may detect a request for a credential for the credential locked resource from the container. In an example, the host environment may also provide a credential for a credential locked resource to the container if the container is approved to receive the credential based on a policy.

Abstract: A check valve has a friction-free replaceable valve insert check assembly. The check assembly includes a poppet on which a spring is mounted engaging an axially moveable seat which in turn engages a seat on the inner end of the poppet biased into engagement by the spring. Upon separation of the inner and outer valve bodies the insert check assembly will freely separate from the valve body for inspection or replacement.

Abstract: A novel computational QSAR approach that provides sub-molecular correlations that are specific to individual lobes of the pertinent molecular orbitals.

Abstract: Computing devices that perform hardware rooted attestation are described, as are methods for use therewith, wherein such devices include a system integrated TPM (e.g., a firmware-based TPM), with m boot chain components loaded and executed prior to the system integrated TPM. Between powering-up of a device and the system integrated TPM being loaded and executed, seed morphing is performed for n=0 to m. This involves an nth encryption seed (ESn) being morphed into an n+1th encryption seed (ESn+1), under control of an nth boot chain component, by extending the nth encryption seed (ESn) with a measurement of the n+1th boot chain component to thereby generate the n+1th encryption seed (ESn+1). In a similar manner, an nth identity seed (ISn) is morphed into an n+1th identity seed (ISn+1). Such techniques establish trust in the system integrated TPM despite it not being the first component loaded and executed after powering-up.

Abstract: Embodiments of the invention make the issuance of trustworthy device claims available to client devices as a service, so that a client device to which device claims are issued may use the device claims in relation to an attempt to access a network application. The service may conduct an assessment of the device's characteristics and/or state, characterize the results of this assessment in device claims, and issue the device claims to the device. The service may be accessible to a client device from outside administrative boundaries of an entity that makes a network application accessible, and thus may be useful to entities making network applications accessible in business-to-consumer (B2C) and business-to-business (B2B) topologies, such as over the publicly accessible Internet.

Abstract: A distributed system in which time-dependent credentials are supplied by controllers that operate according to different local times. Errors that might arise from the controllers generating inconsistent credentials because of time skew are avoided by identifying credentials generated during transition intervals in which different ones of the controllers may generate different credentials at the same absolute time. During a transition interval, controllers and other devices may use credentials differentially based on the nature of the authentication function. Each controller may periodically renew its credentials based on self-scheduled renewals or based on requests from other devices, such that renewal times are offset by random delays to avoid excessive network traffic. Controllers may determine which credential is valid for any given time, based on a cryptographically secure key associated with that time and information identifying the entity that is associated with that credential.

Abstract: Computing devices that perform hardware rooted attestation are described, as are methods for use therewith, wherein such devices include a system integrated TPM (e.g., a firmware-based TPM), with m boot chain components loaded and executed prior to the system integrated TPM. Between powering-up of a device and the system integrated TPM being loaded and executed, seed morphing is performed for n=0 to m. This involves an nth encryption seed (ESn) being morphed into an n+1th encryption seed (ESn+1), under control of an nth boot chain component, by extending the nth encryption seed (ESn) with a measurement of the n+1th boot chain component to thereby generate the n+1th encryption seed (ESn+1). In a similar manner, an nth identity seed (ISn) is morphed into an n+1th identity seed (ISn+1). Such techniques establish trust in the system integrated TPM despite it not being the first component loaded and executed after powering-up.

Abstract: A distributed system in which time-dependent credentials are supplied by controllers that operate according to different local times. Errors that might arise from the controllers generating inconsistent credentials because of time skew are avoided by identifying credentials generated during transition intervals in which different ones of the controllers may generate different credentials at the same absolute time. During a transition interval, controllers and other devices may use credentials differentially based on the nature of the authentication function. Each controller may periodically renew its credentials based on self-scheduled renewals or based on requests from other devices, such that renewal times are offset by random delays to avoid excessive network traffic. Controllers may determine which credential is valid for any given time, based on a cryptographically secure key associated with that time and information identifying the entity that is associated with that credential.

Abstract: A method for calculating a fare for a transport service is provided. One or more processors receive a plurality of location data points from a computing device associated with a vehicle providing the transport service. The plurality of location data points correspond to a route of travel during performance of the transport service. A determination is made, based on a set of location data points of the plurality of location data points, that the vehicle has potentially driven along a roadway in which a toll is to be assessed as part of the fare. The roadway in which the toll is to be assessed is identified. The amount for the toll is determined for the identified roadway.

Abstract: A distributed system in which time-dependent credentials are supplied by controllers that operate according to different local times. Errors that might arise from the controllers generating inconsistent credentials because of time skew are avoided by identifying credentials generated during transition intervals in which different ones of the controllers may generate different credentials at the same absolute time. During a transition interval, controllers and other devices may use credentials differentially based on the nature of the authentication function. Each controller may periodically renew its credentials based on self-scheduled renewals or based on requests from other devices, such that renewal times are offset by random delays to avoid excessive network traffic. Controllers may determine which credential is valid for any given time, based on a cryptographically secure key associated with that time and information identifying the entity that is associated with that credential.