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.

Abstract: A method for simulating the distribution of blades on a turbomachine disc, including providing blade configurations, each being associated with a blade and including at least one measurement of a balancing parameter measured on the associated blade, search for and selection of 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, the search and selection being performed by successive iterations.

Abstract: The invention relates to the use of a three-layer plastic film that is permeable to carbon dioxide but slightly impermeable to oxygen, as packing for liquid or semi-liquid products which produce gas. When the plastic film is reinforced with a uniformly perforated second plastic film, the resulting material is suitable for the manufacture of packaging for the storage of liquid or semi-liquid products containing yeasts, such as cream yeast.

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.

Abstract: The ultrasonic inspectability of a supplied part out of which a final component is to be machined is determined by following a set of inspection rules for ultrasonic inspection of the supplied part. The rules determine which parts of the polygon cannot be inspected by a scan at a given ultrasound beam angle (typical beam angles are 0°, +20° and ?20° relative to the perpendicular direction to the edge) along a given edge of the polygon.

Abstract: A method of regulating oil pressure within an engine assembly is provided. The engine assembly includes an oil pump configured to provide oil to an oil system of the engine assembly; a piston cooling jet configured to direct a jet of oil from the oil system towards a piston of an engine; and an electronic control valve configured to control the flow of oil to the piston cooling jet. The method includes operating the electronic control valve to provide a flow rate of oil above a threshold flow rate to the piston cooling jet when the engine assembly is operating above a threshold power output or engine running speed; and regulating the pressure of oil within the oil system when the engine assembly is operating below the threshold power output or engine running speed, by operating the electronic control valve.

Abstract: A method for discovering a group defined by a common characteristic is disclosed. The method includes building representation of a portion of a social network based on a starting person with the given characteristic, the person also providing the person's gender and school affiliation. The social network representation is then searched to discover clusters therein meeting certain size and connectivity requirements with respect to the network. After the clusters in the network are discovered, clusters having a high degree of similarity are merged together. The resulting clusters, both merged and non-merged, are then scored to determine the cluster that best fits the original group. The winning cluster is then returned to the starting person who confirms the correctness of the cluster. The set of the persons in a confirmed cluster are then displayed to the starting person.