Abstract: In some embodiments, a light emitting structure comprises a layered semiconductor stack comprising a first set of doped layers, a second layer, a light emitting layer positioned between the first set of doped layers and the second layer, and an electrical contact to the first set of doped layers. The first set of doped layers can comprise a first sub-layer, a second sub-layer, and a third sub-layer, wherein the third sub-layer is adjacent to the light emitting layer. The electrical contact can be coupled to the second sub-layer. The first, second and third sub-layers can be doped n-type, and an electrical conductivity of the second sub-layer can be higher than an electrical conductivity of the first and third sub-layers. The first, second and third sub-layers, the light emitting layer, and the second layer can each comprise a superlattice.

Abstract: In some embodiments, a light emitting structure comprises a layered semiconductor stack comprising a first set of doped layers, a second layer, a light emitting layer positioned between the first set of doped layers and the second layer, and an electrical contact to the first set of doped layers. The first set of doped layers can comprise a first sub-layer, a second sub-layer, and a third sub-layer, wherein the third sub-layer is adjacent to the light emitting layer. The electrical contact can be coupled to the second sub-layer. The first, second and third sub-layers can be doped n-type, and an electrical conductivity of the second sub-layer can be higher than an electrical conductivity of the first and third sub-layers. The first, second and third sub-layers, and the light emitting layer can each comprise a superlattice. The second layer can comprise a chirped superlattice.

Abstract: In some embodiments, a light emitting structure comprises a layered semiconductor stack comprising a first set of doped layers, a second layer, a light emitting layer positioned between the first set of doped layers and the second layer, and an electrical contact to the first set of doped layers. The first set of doped layers can comprise a first sub-layer, a second sub-layer, and a third sub-layer, wherein the third sub-layer is adjacent to the light emitting layer. The electrical contact can be coupled to the second sub-layer. The first, second and third sub-layers can be doped n-type, and an electrical conductivity of the second sub-layer can be higher than an electrical conductivity of the first and third sub-layers. The first, second and third sub-layers, and the light emitting layer can each comprise a superlattice. The second layer can comprise a chirped superlattice.

Abstract: In some embodiments, a light emitting structure comprises a layered semiconductor stack comprising a first set of doped layers, a second layer, a light emitting layer positioned between the first set of doped layers and the second layer, and an electrical contact to the first set of doped layers. The first set of doped layers can comprise a first sub-layer, a second sub-layer, and a third sub-layer, where the third sub-layer is adjacent to the light emitting layer. The electrical contact to the first set of doped layers can be made to the second sub-layer. The first, second and third sub-layers can be doped n-type, and an electrical conductivity of the second sub-layer can be higher than an electrical conductivity of the first and third sub-layers. In some cases, the second sub-layer can absorb more light emitted from the light emitting layer than the first or third sub-layers.

Abstract: In some embodiments, a light emitting structure comprises a layered semiconductor stack comprising a first set of doped layers, a second layer, a light emitting layer positioned between the first set of doped layers and the second layer, and an electrical contact to the first set of doped layers. The first set of doped layers can comprise a first sub-layer, a second sub-layer, and a third sub-layer, where the third sub-layer is adjacent to the light emitting layer. The electrical contact to the first set of doped layers can be made to the second sub-layer. The first, second and third sub-layers can be doped n-type, and an electrical conductivity of the second sub-layer can be higher than an electrical conductivity of the first and third sub-layers. In some cases, the second sub-layer can absorb more light emitted from the light emitting layer than the first or third sub-layers.

Abstract: Methods, systems, and computer-readable media for implementing event-stream searching using compiled rule patterns are disclosed. A rule base is compiled based at least in part on one or more rule patterns. The field names are sorted within the rule patterns. The rule patterns comprise one or more field names and one or more field values. The rule base represents a finite-state machine comprising a plurality of states. A plurality of events are received. The events comprise field names and field values describing events associated with resources in a provider network. The field names are sorted within the events. The rule patterns are evaluated against the events using the rule base. In determining a matched rule pattern for one of the events, the finite-state machine transitions between at least two of the states for the matched rule pattern.

Abstract: Methods, systems, and computer-readable media for anything-but matching using finite-state machines are disclosed. A rule base is compiled based at least in part on one or more rule patterns, including an anything-but rule pattern. The rule patterns comprise one or more field values. The rule base represents one or more finite-state machines comprising a plurality of states and encode a specified value for the anything-but rule pattern. A plurality of events are received comprising field values describing resources in a provider network. The rule patterns are evaluated against the events using the rule base. Events matching the specified value using the rule base are excluded from a set of events matching the anything-but rule pattern.

Abstract: Based on analysis of messages transmitted to a communication channel, a schema for a category of messages is generated. The schema indicates one or more data types and an ordering of instances of the data types. The schema is stored in a registry. A code artifact generated in accordance with the schema is provided to automate event processing tasks associated with the message category.

Abstract: A database table, such as may be implemented by a non-relational database, is provided to present information and states associated with that information as memorialized in a cryptographically secured ledger. The semantics of the database table elements, as well as the relationships between various objects therein, may be defined and/or enforced by a schema, a database engine, and/or an application layer. For example, the disclosed methods and systems may be used to implement an asset tracking tool that does not require trust of the implementing system for verification of the system's contents.

Abstract: Methods, systems, and computer-readable media for generating message envelopes for heterogeneous events are disclosed. A plurality of events are received. The events are associated with computing resources in a multi-tenant environment. The events comprise an event formatted using a content schema and a different event formatted using a different content schema. A message is generated comprising a message envelope and the event. The message envelope comprises a plurality of field names and one or more field values formatted using an envelope schema. A different message is generated comprising a different message envelope and the different event. The different message envelope comprises the field names and one or more different field values formatted using the envelope schema. The message is filtered based at least in part on the message envelope, and the different message is filtered based at least in part on the different message envelope.

Abstract: Devices and processes may perform best-effort key affinity workload sharding. Requests including keys are received at a key based workload manager that applies a consistent sharding algorithm to the keys to select a shard to process the request. For selected shards that are associated with a heavy workload various techniques are performed to iterate though a selection of shards until another shard without a heavy workload is selected. For example, techniques are provided such that for a given request a different shard is selected for each iteration, and shards are selected in the same order for repeated requests with the same key. For keys associated with heavy workloads, shards may be reserved solely for that key. If the techniques fail to find a shard without a heavy workload, a fallback provision may select the shard with the least amount of workload, even if that workload is considered heavy.

Abstract: Methods, systems, and computer-readable media for implementing freshness-sensitive message delivery are disclosed. A stream of events including an earlier event and a later event is received. A first attempt is performed to deliver a message indicative of the earlier event. The first attempt to deliver the message is unsuccessful. One or more additional attempts are scheduled to deliver the message indicative of the earlier event. The additional attempts are scheduled over a period of time following the first attempt. An attempt is performed to deliver an additional message indicative of the later event. The attempt to deliver the additional message is not delayed by the additional attempts to deliver the message.

Abstract: A database table, such as may be implemented by a non-relational database, is provided to present information and states associated with that information as memorialized in a cryptographically secured ledger. The semantics of the database table elements, as well as the relationships between various objects therein, may be defined and/or enforced by a schema, a database engine, and/or an application layer. For example, the disclosed methods and systems may be used to implement an asset tracking tool that does not require trust of the implementing system for verification of the system's contents.

Abstract: A workflow interpreter service that interprets a workflow definition language for specifying a workflow definition. Further, the workflow definition language provides features for maintaining control over data flows for data that is passed from one state to another among states of a state machine for a workflow and features for handling errors that may occur within any given state of a workflow state machine. Such control over data flow in between states allows for a given workflow to be processed incrementally, and among multiple different computing resources. Further, the workflow definition language error handling features provide for robust error handling within the state machine framework corresponding to workflow.

Abstract: A workflow interpreter service that interprets a workflow definition language for specifying a workflow definition. Further, the workflow definition language provides features for maintaining control over data flows for data that is passed from one state to another among states of a state machine for a workflow. Such control over data flow in between states allows for a given workflow to be processed incrementally, and among multiple different computing resources.

Abstract: Methods, systems, and computer-readable media for generating message envelopes for heterogeneous events are disclosed. A plurality of events are received. The events are associated with computing resources in a multi-tenant environment. The events comprise an event formatted using a content schema and a different event formatted using a different content schema. A message is generated comprising a message envelope and the event. The message envelope comprises a plurality of field names and one or more field values formatted using an envelope schema. A different message is generated comprising a different message envelope and the different event. The different message envelope comprises the field names and one or more different field values formatted using the envelope schema. The message is filtered based at least in part on the message envelope, and the different message is filtered based at least in part on the different message envelope.

Abstract: Methods, systems, and computer-readable media for implementing freshness-sensitive message delivery are disclosed. A stream of events including an earlier event and a later event is received. A first attempt is performed to deliver a message indicative of the earlier event. The first attempt to deliver the message is unsuccessful. One or more additional attempts are scheduled to deliver the message indicative of the earlier event. The additional attempts are scheduled over a period of time following the first attempt. An attempt is performed to deliver an additional message indicative of the later event. The attempt to deliver the additional message is not delayed by the additional attempts to deliver the message.

Abstract: Methods, systems, and computer-readable media for implementing event-stream searching using compiled rule patterns are disclosed. A rule base is compiled based at least in part on one or more rule patterns. The field names are sorted within the rule patterns. The rule patterns comprise one or more field names and one or more field values. The rule base represents a finite-state machine comprising a plurality of states. A plurality of events are received. The events comprise field names and field values describing events associated with resources in a provider network. The field names are sorted within the events. The rule patterns are evaluated against the events using the rule base. In determining a matched rule pattern for one of the events, the finite-state machine transitions between at least two of the states for the matched rule pattern.