Abstract: Methods, systems and computer program products for tracking, encoding and decoding the code-location of runtime events. The system modifies a request packet to access a resource initiated by a source address to indicate the request packet was sent by an intermediary address. The system injects an identifier pre-allocated for the source address into the request packet. The system updates the modified request packet by replacing the intermediary address with a substitute address that corresponds with the source address' pre-allocated identifier. The system sends the updated request packet to the resource, the updated request packet indicating a response to the updated request packet is to be sent back to the substitute address.

Abstract: The present application discloses an improved wait time optimization system, and corresponding methods and computer-readable media. According to disclosed embodiments, the wait time optimization system generates a customized wait time period for a provider computing device that has arrived at a pickup location associated with a matched transportation request. Upon the expiration of the customized wait time period, the wait time optimization system selectively enables a cancellation option for the provider computing device that enables a user of the provider computing device to cancel the transportation request, thereby releasing the provider computing device for a new transportation request match.

Abstract: A data-driven approach to network performance diagnosis and root-cause analysis is presented. By collecting and aggregating data attribute values across multiple components of a content delivery system and comparing against baselines for points of inspection, network performance diagnosis and root-cause analysis may be prioritized based on impact on content delivery. Alerts may be generated to present recommended courses of action based on the tracked performance analysis.

Abstract: A network device, associated with peer network devices, may receive policy information for a protocol; and compute a first update message based on information regarding a route associated with the policy information. The network device may determine that an upper utilization threshold for one or more of peer queues, associated with the peer network devices, is not satisfied; and write the first update message to the peer queues based on determining that the upper utilization threshold is not satisfied. The network device may compute a second update message based on the information regarding the route; determine that the upper utilization threshold for one or more of the peer queues is satisfied; and pause writing the second update message to the peer queues based on the upper utilization threshold being satisfied. The network device may permit the peer network devices to obtain data from corresponding ones of the peer queues.

Abstract: In some implementations, an optical assembly includes a substrate that includes a thermally conductive core, an IC driver chip that is disposed on a first surface of the substrate, and a VCSEL device that includes an electrically insulated surface that is disposed on the thermally conductive core of the substrate within a cavity formed in the second surface of the substrate. The VCSEL device includes a cathode contact disposed on a surface of the VCSEL device and an anode contact disposed on the surface of the VCSEL device. The VCSEL device includes a plurality of emitters and a microlens component that is disposed over the plurality of emitters on the surface of the VCSEL device.

Abstract: In an embodiment, a data platform receives a query that includes a two-sided N dimensional interval join of first and second input relations. The data platform samples, with respect to each of one or more of the N dimensions, one or both of the first input relation and the second input relation with respect to an interval size of an interval determined from the input relation. The data platform demarcates the N dimensional input domain into non-overlapping N dimensional input-domain cells based on the sampling. The data platform implements the interval join using a query-execution plan that includes an equality join that is keyed on input-domain-cell identifiers of input-domain cells that at least partially overlap bounding polygons of the intervals determined from the first and second input relations. The equality join is followed in the query-execution plan by a filter that applies the interval-join predicate. The data platform obtains results of the query by executing the query-execution plan.

Abstract: An optical assembly includes a substrate; an optical subassembly that is disposed on a region of a surface of the substrate; a housing that is disposed on another region of the surface of the substrate; a first optical element that is disposed on a first support component of the housing; and a second optical element that is disposed on a second support component of the housing. The optical subassembly includes an integrated circuit (IC) driver chip; a redistribution layer (RDL) structure that is disposed on a surface of the IC driver chip, wherein the RDL structure includes a cavity; and a vertical cavity surface emitting laser (VCSEL) device disposed on a region of the surface of the RDL structure that is within the cavity of the RDL structure.

Abstract: In general, various aspects of the techniques are described in this disclosure for distributed label assignment for labeled routes. In one example, a method includes obtaining, by a first thread of a plurality of execution threads for at least one routing protocol process executing on processing circuitry of a network device, an allocation of first labels drawn from a label space for a network service; adding, by the first thread, the first labels to a first local label pool for the first thread; generating, by the first thread, after obtaining the allocation of the first labels, a labeled route comprising a route for the network service and a label assigned by the first thread from the first local label pool; and outputting, by the network device, the labeled route.

Abstract: Examples of a multiple-mask multiple-exposure lithographic technique and suitable masks are provided herein. In some examples, a photomask includes a die area and a stitching region disposed adjacent to the die area and along a boundary of the photomask. The stitching region includes a mask feature for forming an integrated circuit feature and an alignment mark for in-chip overlay measurement.

Abstract: Disclosed herein are systems and methods for pre-filter deduplication for multidimensional two-sided interval joins. In an embodiment, a data platform receives query instructions for a two-sided N dimensional interval join, where N is an integer greater than 1. The two-sided N dimensional interval join has an interval-join predicate that compares intervals determined from the input relations in each of N dimensions. The data platform implements the two-sided N dimensional interval join as a query-plan section that includes an N dimensional band join that is followed by a deduplication operator that is followed by a filter that applies the interval-join predicate. The N dimensional band join includes a hash join keyed to N dimensional domain cells overlapped at least in part by intervals determined from the input relations in each of the N dimensions. The deduplication operator removes duplicate rows from a potential-duplicates subset of the output of the N dimensional band join.

Abstract: A network device, associated with peer network devices, may receive policy information for a protocol; and compute a first update message based on information regarding a route associated with the policy information. The network device may determine that an upper utilization threshold for one or more of peer queues, associated with the peer network devices, is not satisfied; and write the first update message to the peer queues based on determining that the upper utilization threshold is not satisfied. The network device may compute a second update message based on the information regarding the route; determine that the upper utilization threshold for one or more of the peer queues is satisfied; and pause writing the second update message to the peer queues based on the upper utilization threshold being satisfied. The network device may permit the peer network devices to obtain data from corresponding ones of the peer queues.

Abstract: In an embodiment, a data platform implements a two-sided N dimensional interval join using an N dimensional band join followed by a filter that applies a predicate of the interval join. The data platform generates first and second modified relations from first and second input relations. Each modified relation includes a copy of each row from the corresponding input relation for each input-domain cell that overlaps, in each of N dimensions, a bounding polygon of intervals determined from the row of the corresponding input relation. The data platform inserts, in each row in each modified relation, an input-domain-cell identifier of the corresponding overlapping input-domain cell and uses a hash-equality join that receives the first and second modified relations and that is keyed on the input-domain-cell identifiers. The data platform obtains results of a query by executing a query-execution plan that includes the query-plan section.

Abstract: The present disclosure provides a process of recovering sulfopolyester comprising reduced impurity. Sulfopolyester is recovered from a composite material comprising water-dispersible sulfopolyester polymer and at least one non-water-dispersible polymer. The process includes washing the composite material comprising water-dispersible sulfopolyester with a solvent composition. The recovered sulfopolyester can be generated as a concentrated aqueous dispersion, a polymer melt, or a sulfopolyester solid.

Abstract: Disclosed herein are systems and methods for pre-filter deduplication for multidimensional two-sided interval joins. In an embodiment, a data platform receives query instructions for a two-sided N dimensional interval join, where N is an integer greater than 1. The two-sided N dimensional interval join has an interval-join predicate that compares intervals determined from the input relations in each of N dimensions. The data platform implements the two-sided N dimensional interval join as a query-plan section that includes an N dimensional band join that is followed by a deduplication operator that is followed by a filter that applies the interval-join predicate. The N dimensional band join includes a hash join keyed to N dimensional domain cells overlapped at least in part by intervals determined from the input relations in each of the N dimensions. The deduplication operator removes duplicate rows from a potential-duplicates subset of the output of the N dimensional band join.

Abstract: In an embodiment, a data platform receives a query that includes a two-sided N dimensional interval join of first and second input relations. The data platform samples, with respect to each of one or more of the N dimensions, one or both of the first input relation and the second input relation with respect to an interval size of an interval determined from the input relation. The data platform demarcates the N dimensional input domain into non-overlapping N dimensional input-domain cells based on the sampling. The data platform implements the interval join using a query-execution plan that includes an equality join that is keyed on input-domain-cell identifiers of input-domain cells that at least partially overlap bounding polygons of the intervals determined from the first and second input relations. The equality join is followed in the query-execution plan by a filter that applies the interval join predicate. The data platform obtains results of the query by executing the query-execution plan.

Abstract: In an embodiment, a data platform implements a two-sided N dimensional interval join using an N dimensional band join followed by a filter that applies a predicate of the interval join. The data platform generates first and second modified relations from first and second input relations. Each modified relation includes a copy of each row from the corresponding input relation for each input-domain cell that overlaps, in each of N dimensions, a bounding polygon of intervals determined from the row of the corresponding input relation. The data platform inserts, in each row in each modified relation, an input-domain-cell identifier of the corresponding overlapping input-domain cell and uses a hash-equality join that receives the first and second modified relations and that is keyed on the input-domain-cell identifiers. The data platform obtains results of a query by executing a query-execution plan that includes the query-plan section.

Abstract: The present disclosure provides a process of recovering sulfopolyester comprising reduced impurity. Sulfopolyester is recovered from a composite material comprising water-dispersible sulfopolyester polymer and at least one non-water-dispersible polymer. The process includes washing the composite material comprising water-dispersible sulfopolyester with a solvent composition. The recovered sulfopolyester can be generated as a concentrated aqueous dispersion, a polymer melt, or a sulfopolyester solid.

Abstract: A luminaire is provided. The luminaire comprises a light source for generating a light, an electrical circuitry for driving the light source, and at least one air duct extending from an air inlet to an air outlet. The air ducts comprise walls with a photocatalytic element and are configured such that the air flowing through the at least one air duct can get in contact with the photocatalytic element and participate in a photocatalytic reaction under exposure to the light generated by the light source of the luminaire and/or an external light.

Abstract: In some cases, once Fast Reroute (FRR) has taken place (e.g., for MPLS protection), a further FRR is undesirable, and even detrimental. A mechanism to prevent a further FRR, once such a further FRR is determined to be potentially harmful, is described.

Abstract: A data-driven approach to network performance diagnosis and root-cause analysis is presented. By collecting and aggregating data attribute values across multiple components of a content delivery system and comparing against baselines for points of inspection, network performance diagnosis and root-cause analysis may be prioritized based on impact on content delivery. Recommended courses of action may be determined and provided based on the tracked network performance analysis at diagnosis points.