Abstract: Techniques described herein include managing scheduling of interrupts by receiving a data packet comprising an indication of an interrupt to be delivered, determining an availability status of a processing thread, and managing an interrupt status indicator in response to determining the availability status. A value of the interrupt status indicator corresponds to a quantity of pending interrupts. An event handling circuit processes the interrupt or one or more pending interrupts using the processing thread.

Abstract: A kernel comprising at least one dynamically configurable parameter is submitted by a processor. The kernel is to be executed at a later time. Data is received after the kernel has been submitted. The at least one dynamically configurable parameter of the kernel is updated based on the data. The kernel having the at least one updated dynamically configurable parameter is executed after the at least one dynamically configurable parameter has been updated.

Abstract: An insert for an arthropod trapping device. The insert comprising a substrate and a frame for supporting the substrate, where a surface of the substrate has an adhesive disposed thereon, an optional mounting bracket spaced apart from the adhesive surface of the insert and located at a first end of the insert, and an optional graspable tab extending from the frame at a second end of the insert.

Abstract: Apparatuses, systems, and techniques to cause data to be selectively stored in one or more memory locations. In at least one embodiment, a processor is to cause data to be selectively stored in one or more memory locations based, at least in part, on one or more threads to use the data.

Abstract: Apparatuses, systems, and techniques to facilitate graph code synchronization between application programming interfaces. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause graph code to wait on a semaphore used by another API.

Abstract: Apparatuses, systems, and techniques to facilitate execution graph control. In at least one embodiment, an application programming interface comprising one or more parameters is used to control which of one or more portions of graph code are to be performed.

Abstract: Apparatuses, systems, and techniques to facilitate execution graph control. In at least one embodiment, an application programming interface comprising one or more parameters is used to indicate which of one or more portions of graph code are to be performed.

Abstract: Apparatuses, systems, and techniques to facilitate graph code synchronization between application programming interfaces. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause graph code to update a semaphore used by another API.

Abstract: Apparatuses, systems, and techniques to allocate processor memory. In at least one embodiment, an application programming interface is used to execute instructions to asynchronously deallocate memory locations from processors.

Abstract: Apparatuses, systems, and techniques to allocate processor memory. In at least one embodiment, an application programming interface is used to execute instructions to asynchronously allocate memory locations to processors.

Abstract: Apparatuses, systems, and techniques to modify graph code. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to modify executable graph code.

Abstract: A kernel comprising at least one dynamically configurable parameter is submitted by a processor. The kernel is to be executed at a later time. Data is received after the kernel has been submitted. The at least one dynamically configurable parameter of the kernel is updated based on the data. The kernel having the at least one updated dynamically configurable parameter is executed after the at least one dynamically configurable parameter has been updated.

Abstract: Apparatuses, systems, and techniques to facilitate execution graph synchronization. In at least one embodiment, an application programming interface comprising one or more parameters is used to create dependencies between graph code nodes and one or more software routines.

Abstract: Apparatuses, systems, and techniques to generate one or more graph code nodes to allocate memory. In at least one embodiment, one or more graph code nodes to allocate memory are generated, based on, for example, CUDA or other parallel computing platform code.

Abstract: Apparatuses, systems, and techniques to generate one or more graph code nodes to deallocate memory. In at least one embodiment, one or more graph code nodes to deallocate memory are generated, based on, for example, CUDA or other parallel computing platform code.

Abstract: Apparatuses, systems, and techniques to generate numbers. In at least one embodiment, one or more circuits are to cause one or more thirty-two bit floating point numbers to be truncated to generate one or more rounded numbers based, at least in part, on one or more rounding attributes.

Abstract: Provided are therapeutic agent or nutraceutical compositions recovered from a dispersion comprising a sugar, sugar alcohol, or sugar substitute; water; and a therapeutic agent or nutraceutical. Also provided are products comprising the therapeutic agent or nutraceutical compositions, including a variety of therapeutic products, as well as methods of using the compositions.

Abstract: A method for simulating the distribution of blades on a turbomachine disc includes: providing blade configurations, each being associated with a blade and including at least one measurement of a balancing parameter measured on the associated blade; and searching for and selecting a bladed-disc distribution combining the configurations of blades supplied with positions on the disc, the bladed disc distribution encouraging the attainment of at least one criterion defined according to a predetermined cost function dependent on the balancing parameter measurements, and the searching and selecting being performed by successive iterations.

Abstract: Present teachings relate to a method for controlling a service running at least partially on an electronic device, the method comprising the steps of: —Determining, using a proximity sensor in the electronic device, a first parameter indicative of the physical distance between the electronic device and a user; and—Adapting at least one operation of the electronic device dependent upon the first parameter.

Abstract: The invention relates to a method (100) for manufacturing a turbomachine fan comprising a plurality of blades mounted on a disc extending along a longitudinal axis, said method comprising the following steps of: —measuring (102) at least one structural parameter of each of the blades in the cold state, and, for each of the blades, estimating (103) at least one structural parameter in operation relating to a blade from the structural parameter(s) measured on said blade in the cold state, —determining (104) an optimal sequence of the blades around the disc from the structural parameters estimated in operation for each of the blades, and —mounting (105) the blades on the disc in the optimal sequence thus determined.