Abstract: Disclosed is a luminaire such as an LED downlight which is suitable for mounting in ceiling cavities of commercial environments. An example luminaire (200) comprises a light source (202) including an integral primary optic which is configured to transmit light toward a second optic (214). The second optic (214) is a lens configured to receive light from the light source (202) via the primary optic and transmit at least part of the received light toward a circular reflector (201). The circular reflector (201) is configured to direct light received from the second optic (214) away from the luminaire (204). A shape of the second optic (214) is interdependent with a shape of the circular reflector (201), and the shape of the second optic (214) and circular reflector (201) act in combination to transmit light away from the luminaire with a non-circular illuminance distribution (206).

Abstract: A self-centering split substrate carrier that supports a semiconductor substrate in a CVD system includes a first section configured to be centrally located in the split substrate carrier having a top surface with a recessed area for receiving a substrate for CVD processing and comprising a plurality of apertures positioned in an outer surface. A second section formed in a ring-shape having an inner surface configured to receive the first section and an outer surface configured to interface with an edge drive rotation mechanism that rotates the substrate carrier. The inner surface comprising a plurality of boss structures, wherein a respective one of the plurality of boss structures on the inner surface of the second section is configured to fit into a respective one of the plurality of apertures positioned in the outer surface of the first section, so as to improve alignment of the first and the second section of the self-centering split substrate carrier.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in successive rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in an iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Kits for performing the methods are also disclosed.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in one or more rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in a pooled and/or iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Compositions and kits for performing the methods are also disclosed.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in one or more rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in a pooled and/or iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Compositions and kits for performing the methods are also disclosed.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in successive rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in an iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Kits for performing the methods are also disclosed.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in one or more rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in a pooled and/or iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Compositions and kits for performing the methods are also disclosed.

Abstract: The present invention relates to methods for editing the genome of a microbial host cell in successive rounds of transformation. The method allows the introduction of genetic edits into the genome of a microbial host cell in an iterative fashion that does not require the use of functional counterselection following at least one round of transformation. It can be used to rapidly stack genetic edits in the genome of a microbial host cell. Kits for performing the methods are also disclosed.

Abstract: The present invention relates to a method for producing a powdered porous product from at least one starting powdery and/or viscous product, characterised in that it comprises the continuous following steps without exposing the product to open air: a) preparing the starting product in order to make it viscous; b) in a thermo-mechanical machine (10) for continuously realising transport and/or mixing functions of viscous products or dry-material rich products, lowering the viscosity of the viscous product without changing its dry-material content, by intimate mixing with a gas injected into the processing machine (10) and simultaneously initiating the porosity in the viscous product; c) continuously with the processing machine (10), statically or dynamically intensifying the intimate mixture of the viscous product with a gas in order to obtain an aerated and porous mass; and d), dividing said mass in order to obtain aerated and porous particles.

Abstract: The presently disclosed subject matter is broadly directed to a hydroponic growing system. The disclosed system is a soil-free plant growth system comprising a water solution that includes dissolved nutrients and oxygen. The roots of the plants are submerged into the nutrient-laden aqueous solution, thereby providing nutrition to the plant. In this way, the exact amount of water, nutrients, and oxygen can be provided. The disclosed system further comprises an irrigation subsystem, environmental subsystem, and control subsystem that allows the system to be customized and motorized depending on the plant grown and the grow desired grow conditions.

Abstract: The presently disclosed subject matter is broadly directed to a hydroponic growing system. The disclosed system is a soil-free plant growth system comprising a water solution that includes dissolved nutrients and oxygen. The roots of the plants are submerged into the nutrient-laden aqueous solution, thereby providing nutrition to the plant. In this way, the exact amount of water, nutrients, and oxygen can be provided. The disclosed system further comprises an irrigation subsystem, environmental subsystem, and control subsystem that allows the system to be customized and motorized depending on the plant grown and the grow desired grow conditions.

Abstract: Exemplary embodiments relate to the problem of allocating a finite number of units of a resource among requestors willing to offer different amounts of value for the resource. When different classes of requestors are permitted to cancel the request or fail to show up to collect the unit of the resource with different probabilities (collectively referred to as “wash”), the problem becomes difficult to solve efficiently. According to the procedures described herein, the capacity is artificially inflated to offset the impact of wash, and then protection levels are computed using the inflated capacity as if there was no wash. The capacity is then artificially inflated again based on the new protection levels, and the process is repeated until, e.g., the results converge. Using this procedure, overallocation limits and protection levels can be computed in real-time, and accordingly the resource can be allocated efficiently as new requests are received.

Abstract: Exemplary embodiments relate to the problem of allocating a finite number of units of a resource among requestors willing to offer different amounts of value for the resource. When different classes of requestors are permitted to cancel the request or fail to show up to collect the unit of the resource with different probabilities (collectively referred to as “wash”), the problem becomes difficult to solve efficiently. According to the procedures described herein, the capacity is artificially inflated to offset the impact of wash, and then protection levels are computed using the inflated capacity as if there was no wash. The capacity is then artificially inflated again based on the new protection levels, and the process is repeated until, e.g., the results converge. Using this procedure, overallocation limits and protection levels can be computed in real-time, and accordingly the resource can be allocated efficiently as new requests are received.

Abstract: In one example, a system can receive configuration data indicating how resources can be combined, identify availability data indicating the total number of various resources that are available, and determine maximum-capacity data using the availability data and the configuration data. The system can also receive distribution data having probability distributions for jobs to be implemented using the resources, determine capacity valuations using the distribution data and the availability data, and determine a configuration of resources using the capacity valuations and the maximum-capacity data. Thereafter, the system can receive a job and determine that a valuation for the job exceeds a predefined threshold associated with using the configuration of resources. In response to determining that the valuation exceeds the predefined threshold, the system can assign the resources to the job in the configuration.

Abstract: Resources can be managed by predicting resource usage. For example, a first computing resource having a first attribute with a first value can be identified. A second computing resource having a second attribute with a second value can also be identified. A configuration parameter can be determined based on at least one of historical data or a predetermined probability. A predetermined model can be used to predict a first amount of interest in the first computing resource based on the first value, the second value, and the configuration parameter. The predetermined model can also be used to predict a second amount of interest for the second computing resource based on the first value, the second value, and the configuration parameter. Information related to the predicted first amount of interest in the first computing resource and the predicted second amount of interest in the second computing resource can be transmitted.

Abstract: The present invention relates to a method for producing a powdered porous product from at least one starting powdery and/or viscous product, characterised in that it comprises the continuous following steps without exposing the product to open air: a) preparing the starting product in order to make it viscous; b) in a thermo-mechanical machine (10) for continuously realising transport and/or mixing functions of viscous products or dry-material rich products, lowering the viscosity of the viscous product without changing its dry-material content, by intimate mixing with a gas injected into the processing machine (10) and simultaneously initiating the porosity in the viscous product; c) continuously with the processing machine (10), statically or dynamically intensifying the intimate mixture of the viscous product with a gas in order to obtain an aerated and porous mass; and d), dividing said mass in order to obtain aerated and porous particles.

Abstract: The disclosure contains descriptions of various methods and systems for accelerating the execution of a virtual prototype simulation. Acceleration may be achieved, for example, by providing two or more redundant virtual communication paths for access made by virtual models of a virtual prototype of a hardware design to provide for both accelerated access transactions and time-accurate access transactions. A model having such redundant virtual communication paths is referred to herein as a “multimode model.

Abstract: A lock for a cam-and-groove coupler comprises a collar member positionable around the cam-and-groove coupler. The collar member comprises at least first and second wall portions. The first wall portion is positionable adjacent the first lever arm of the cam-and-groove coupler to prevent movement of the first lever arm to an unsecured position. The second wall portion is positionable adjacent a second lever arm of the cam-and-groove coupler to prevent movement of the second lever arm to the unsecured position. The lock further comprises at least one projection extending inwardly from the collar member and configured to engage the cam-and-groove coupler to prevent the collar member from sliding off of the cam-and-groove coupler. At least one securing member is coupled to the collar member and configured to releasably secure the collar member around the cam-and-groove-coupler.

Abstract: A linear charge system (100) for applying a destructive explosive charge to a barrier structure; said system comprising a charge carrier (101) and an explosive charge element (120) assembled within said charge carrier (101); said explosive charge element (120) adapted to effect a directed explosive charge for the penetration of a said barrier in which a tamping fluid forms at least a portion of a penetrating agent.

Abstract: A method and system for logging into and providing access to multiple computer systems via the Internet or other communications network using a single authenticating process (e.g. username and password).