Abstract: A clock recovery circuit includes a first pulse circuit, a second pulse circuit, a state change circuit connected to the first pulse circuit and the second pulse circuit and a first delay circuit connected to the state change circuit and each of the first pulse circuit and the second pulse circuit. The first pulse circuit receives data inputs to generate a first pulse signal. The second pulse circuit receives the data inputs to generate a second pulse signal. The state change circuit receives the first pulse signal and the second pulse signal and generate a first clock signal for a first transition of one of the data inputs in a first unit interval (UI). The first delay circuit receives the generated first clock signal and mask other transitions of the data inputs in the first UI.

Abstract: Techniques are described for optimizing the allocation of computing resources provided by a service provider network—for example, compute resources such as virtual machine (VM) instances, containers, standalone servers, and possibly other types of computing resources—among computing workloads associated with a user or group of users of the service provider network. A service provider network provides various tools and interfaces to help businesses and other organizations optimize the utilization of computing resource pools obtained by the organizations from the service provider network, including the ability to efficiently schedule use of the resources among workloads having varying resource demands, usage patterns, relative priorities, execution deadlines, or combinations thereof. A service provider network further provides various graphical user interfaces (GUIs) to help users visualize and manage the historical and scheduled uses of computing resources by users' workloads according to user preferences.

Abstract: Techniques are described for optimizing the allocation of computing resources provided by a service provider network—for example, compute resources such as virtual machine (VM) instances, containers, standalone servers, and possibly other types of computing resources—among computing workloads associated with a user or group of users of the service provider network. A service provider network provides various tools and interfaces to help businesses and other organizations optimize the utilization of computing resource pools obtained by the organizations from the service provider network, including the ability to efficiently schedule use of the resources among workloads having varying resource demands, usage patterns, relative priorities, execution deadlines, or combinations thereof. A service provider network further provides various graphical user interfaces (GUIs) to help users visualize and manage the historical and scheduled uses of computing resources by users' workloads according to user preferences.

Abstract: Techniques are described for optimizing the allocation of computing resources provided by a service provider network—for example, compute resources such as virtual machine (VM) instances, containers, standalone servers, and possibly other types of computing resources—among computing workloads associated with a user or group of users of the service provider network. A service provider network provides various tools and interfaces to help businesses and other organizations optimize the utilization of computing resource pools obtained by the organizations from the service provider network, including the ability to efficiently schedule use of the resources among workloads having varying resource demands, usage patterns, relative priorities, execution deadlines, or combinations thereof. A service provider network further provides various graphical user interfaces (GUIs) to help users visualize and manage the historical and scheduled uses of computing resources by users' workloads according to user preferences.

Abstract: A method for launching a plurality of computing instances may include obtaining a request to launch a plurality of computing instances. The request may indicate a first number and a target number of compute instances that is larger than the first number. The method may further include verifying that there is sufficient capacity, for example of a compute instance service, to launch at least the first number of compute instances. The request may be fulfilled by at least launching at least the first number of compute instances in a way that bypasses a rate limit that limits a rate at which compute instances can be launched. In some cases, the method may additionally include launching additional compute instances, as they become available, until the target number has been reached.

Abstract: A service workflow agent associated with a particular service of a provider network identifies a repository in which workflow descriptors indicative of tasks to be performed by the service are stored. In response to determining that a modification has been applied at one such repository, the agent examines a particular workflow descriptor stored in the repository. The agent initiates an attempt to implement a first task indicated in the descriptor. Subsequently, the agent updates the descriptor in accordance with an optimistic concurrency control technique to indicate a status of the first task.

Abstract: Techniques for private network mirroring are described. Users can select one or more existing private networks to be mirrored in the same or different network area. Any network configuration changes made in the selected private network (e.g., “master” private network) can be propagated automatically to the mirror private network. This enables users to utilize resources in another network area for disaster recovery, ensuring that the network configuration of the mirror private network is consistent with the master private network through real-time updates. Additionally, users managing infrastructure that includes multiple private networks can select one master private network and propagate configuration changes to other private networks, reducing management overhead incurred by these multi-private network installations.

Abstract: Techniques for private network mirroring are described. Users can select one or more existing private networks to be mirrored in the same or different network area. Any network configuration changes made in the selected private network (e.g., “master” private network) can be propagated automatically to the mirror private network. This enables users to utilize resources in another network area for disaster recovery, ensuring that the network configuration of the mirror private network is consistent with the master private network through real-time updates. Additionally, users managing infrastructure that includes multiple private networks can select one master private network and propagate configuration changes to other private networks, reducing management overhead incurred by these multi-private network installations.

Abstract: A system and method for client authentication wherein a client computing system is authenticated by at least performing, at an authentication system different than a target computing system, a set of validation operations on authorization information addressed to a destination port of the target computing system, and, as a result of the client computing system being authenticated by the set of validation operations, switching to a mode wherein a port of the target computing system is opened and data from the client computing system is communicated to the port of the target computing system.

Abstract: Various aspects of a system and method to process data in an adder based circuit, such as an integrated circuit, are disclosed herein. In accordance with an embodiment, a first addend is encoded as a first unary number. The first unary number comprises a token bit. A second addend is encoded as a second unary number. A first shift operation is performed on the token bit in the first unary number based on the second unary number. The first shift operation is performed to generate an output unary number. The generated output unary number is decoded to a number representation that corresponds to the number representation of the first addend and/or the second addend. The decoded number representation indicates a summation of the first addend and the second addend.

Abstract: An overfill prevention system for use with a liquid storage tank includes a valve assembly defining a downwardly open liquid discharge opening. A pilot tube is fixed relative to and projects downwardly relative to the valve assembly. The pilot tube defines an internal channel in fluid communication with the valve assembly and a discharge hole spaced downwardly from the valve assembly and in fluid communication with the internal channel and the tank. A float is buoyantly shiftable along the pilot tube between an open position in which the float exposes the discharge hole when liquid within the tank is below a predetermined level, and a closed position in which the float covers the discharge hole when liquid within the tank reaches or exceeds the predetermined level. A flow diverter is disposed between the discharge opening and the float to deflect liquid from the discharge opening away from the float.

Abstract: A fixture for temporarily mounting connectors of a plurality of cable assemblies is provided for use while replacing an electronic component having a plurality of receptacles. Each cable assembly has a connector disposed in one of the receptacles. The fixture includes a body, an array of cavities disposed on the body, and an array of body indicia. Each cavity receives one of the connectors therein and each body indicia is disposed adjacent one of the cavities, with each body indicia being unique relative to other body indicia. A plurality of the pluggable identifier elements are provided with each pluggable identifier element being pluggable into one of the cavities and including an element indicia. Each element indicia corresponds to one of the body indicia and is unique relative to other element indicia. A kit of pluggable identifier elements and a method of replacing an electronic component is also provided.

Abstract: Various systems, processes, and techniques may be used to allocate computer resources. In particular implementations, systems and processes for allocation of computer resources may include the ability to determine whether a request for allocation of computer resources has been received and determine a set of server computers able to fulfill requirements of the request. The systems and processes may also include the ability to identify one or more server computers in the set likely to successfully provide the computer resources and allocate the requested computer resources on an identified server computer.

Abstract: The present disclosure describes a gummy dosage form including honey in an amount of 20% by dry weight or greater; fruit juice concentrate in an amount of 2% by dry weight or greater; a calcium source; one or more hydrating materials; and a hydrophilic long-chain polymer. The gummy dosage forms can further include additives such as flavorants, fiber, and pH-adjusters. The disclosure further comprises methods for preparing such gummy dosage forms.

Abstract: Disclosed are compositions that comprise an organic electrochemical mediator and a gasotransmitter salt which converts into a gasotransmitter via electron transfer. Also disclosed are bandages and wound dressings comprising the subject gasotransmitters, and methods of making a gasotransmitters, comprising exposing the compositions to a voltage sufficient to reduce the water soluble organic mediator. Further disclosed are methods of treating a variety of trauma and disease states by applying a therapeutically effective amount of at least one gasotransmitter thereto, and methods of generating an effective dose of the gasotransmitter generated from electrolytic reaction involving the gasotransmitter-generating compositions.

Abstract: In a service provider environment, software deployments can be implemented by automatically routing an incrementally larger percentage of requests to a new software stack based on a success rate for previous requests. Thus, new and old versions of the software stack can be executed simultaneously with a small portion being routed to the new version until a sufficient number of requests have been handled. By slowly bringing a new software stack online, a confidence level in the new deployment can increase until it is fully deployed. Different success rates and different ramping rates can be used for each customer or based on different components of the request, such as API name, API parameters, location, etc. The software deployments can be extended to web-page requests.

Abstract: An overfill prevention system for use with a liquid storage tank includes a valve assembly defining a downwardly open liquid discharge opening. A pilot tube is fixed relative to and projects downwardly relative to the valve assembly. The pilot tube defines an internal channel in fluid communication with the valve assembly and a discharge hole spaced downwardly from the valve assembly and in fluid communication with the internal channel and the tank. A float is buoyantly shiftable along the pilot tube between an open position in which the float exposes the discharge hole when liquid within the tank is below a predetermined level, and a closed position in which the float covers the discharge hole when liquid within the tank reaches or exceeds the predetermined level. A flow diverter is disposed between the discharge opening and the float to deflect liquid from the discharge opening away from the float.

Abstract: Methods and systems for a topology service providing an interface for specifying a topology and answering queries regarding the topology. Further, the topology service may create, from a specified topology, a directed acyclic graph and corresponding closure table. The topology service may also provide an interface for receiving metadata regarding the topology. In this way, the topology service, based at least in part on connections between nodes in the entries of the closure table and based at least in part on the metadata regarding the topology, may answer queries in regard to the specified topology.

Abstract: Various aspects of a system and method to process data in an adder based circuit, such as an integrated circuit, are disclosed herein. In accordance with an embodiment, a first addend is encoded as a first unary number. The first unary number comprises a token bit. A second addend is encoded as a second unary number. A first shift operation is performed on the token bit in the first unary number based on the second unary number. The first shift operation is performed to generate an output unary number. The generated output unary number is decoded to a number representation that corresponds to the number representation of the first addend and/or the second addend. The decoded number representation indicates a summation of the first addend and the second addend.

Abstract: At a logging service, a representation of a transaction requested by a client is received. The transaction includes at least a first write operation directed to a data object at a first data store. Based at least in part on the contents of the representation and contents of a persistent log of the logging service, a determination is made that the requested transaction is to be committed. A log record corresponding to the first write operation is inserted into the persistent log. The first write is propagated to the first data store after the record has been inserted in the persistent log.