Abstract: In a wireless communication system, user equipment (UE) is provided, one or more set of rules are provided for the UE to handle the processing during a measurement gap. In some aspects, the gap measurement may be ignored. In some aspects, the processing is stored and handled at a later in time and gap measurements are performed. Depending on the system, the measurements performed during the gaps may be UE implementation dependent, wherein the UE determines whether to perform the measurement for a given gap. In some instances, the UE may not perform measurements during the gap, thereby giving priority to other processing, such as RACH processing. Depending on the type of processing required (DL-SCH, UL-SCH, TTI bundling, RACH or SR), the UE may store requests and process the measurements during the gap or ignore the gap measurement as if there were no gaps.

Abstract: A lancing mechanism is adapted to move between a resting, cocking and a puncture position. The lancing mechanism comprises a lancet holder adapted to receive a lancet, a shaft attached to the lancet holder, at least one drive spring and at least one damping spring. The drive spring surrounds at least a portion of the shaft and drives the lancing mechanism from the cocking position to the puncture position. The damping spring moves the lancing mechanism from the puncture position to the resting position. The drive spring is located at least partially within the damping spring.

Abstract: Delayed insertion of safepoint related code is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is analyzed programmatically to identify a safepoint and insert safepoint related code associated with the safepoint. In some embodiments, analyzing the optimized intermediate representation programmatically comprises determining where to place the safepoint within a program structure of the source code as reflected in the intermediate representation.

Abstract: Deferred constant pool generation is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is used to generate a constant pool. In some embodiments, the source code comprises JavaScript, which is used to generate a low level virtual machine (LLVM) or other intermediate representation (IR), which intermediate representation is optimized prior to a constant pool being generated.

Abstract: Stackable trays for jugs, stacked arrangements and stacking methods are disclosed. A tray has a first surface to support a bottom of one or more jugs, and could include jug receiving cells. A collar could extend downwardly from a second surface opposite the first surface and have at least one notch sized to receive a portion of a handle of a respective jug located beneath each jug receiving cell. Load transfer to the handles of the jugs below the second surface could be provided by load transfer structures, such as the collars in one embodiment, which extend from the second surface to engage the jugs. A stacked arrangement includes multiple layers of jugs with a respective stackable tray between adjacent layers of the multiple layers. The trays could thus be used in stacking or otherwise arranging jugs in multiple layers.

Abstract: Stackable trays for bags containing liquids, stacked arrangements and stacking methods are disclosed. A tray has a first surface to support one or more bags containing liquid and could include a plurality of cells adapted to receive the bags. The tray has a second surface opposite the first surface. The second surface transfers at least a portion of a load on the first surface to one or more bags containing liquid arranged below the second surface. A stacked arrangement includes multiple layers of bags containing liquid with a respective stackable tray between adjacent layers of the multiple layers. The trays could thus be used in stacking or otherwise arranging bags containing liquid in multiple layers.

Abstract: A device-independent intermediate representation of a source code is generated and stored, e.g., in a memory or other storage mechanism. The stored intermediate representation of the source code is used to generate a device-specific machine code corresponding to the source code. The stored intermediate representation may be updated, e.g., periodically, for example by obtaining an updated version of the source code and compiling the updated source code to generate an updated intermediate representation. The stored intermediate representation may be based on source code received from a device that is synchronized with which a compiling device that generates the device-specific machine code. In some cases, the stored intermediate representation may be used to generate for each of a plurality of devices a corresponding device-specific machine code.

Abstract: A lancing mechanism is adapted to move between a resting, cocking and a puncture position. The lancing mechanism comprises a lancet holder adapted to receive a lancet, a shaft attached to the lancet holder, at least one drive spring and at least one damping spring. The drive spring surrounds at least a portion of the shaft and drives the lancing mechanism from the cocking position to the puncture position. The damping spring moves the lancing mechanism from the puncture position to the resting position. The drive spring is located at least partially within the damping spring.

Abstract: A lancing mechanism is adapted to move between a resting, cocking and a puncture position. The lancing mechanism comprises a lancet holder adapted to receive a lancet, a shaft attached to the lancet holder, at least one drive spring and at least one damping spring. The drive spring surrounds at least a portion of the shaft and drives the lancing mechanism from the cocking position to the puncture position. The damping spring moves the lancing mechanism from the puncture position to the resting position. The drive spring is located at least partially within the damping spring.

Abstract: A lancing mechanism is adapted to move between a resting, cocking and a puncture position. The lancing mechanism comprises a lancet holder adapted to receive a lancet, a shaft attached to the lancet holder, at least one drive spring and at least one damping spring. The drive spring surrounds at least a portion of the shaft and drives the lancing mechanism from the cocking position to the puncture position. The damping spring moves the lancing mechanism from the puncture position to the resting position. The drive spring is located at least partially within the damping spring.

Abstract: Techniques for processing computer code are disclosed. In one example, an indication that a computer code is to begin execution at a portion of code other than a starting portion of the code is received, and a runtime state associated with the portion of the code at which execution is to begin is constructed. In some examples, execution of the portion of code is initiated. In some examples, a program counter associated with the portion of the code is used to initiate execution of the code. In some examples, the computer code comprises a fallback code associated with a previously executing code.

Abstract: Observation and analysis based optimization of software code is disclosed. An expected value is chosen for a dynamic attribute that cannot be determined, prior to execution of the associated software code, to be guaranteed to have that expected value at runtime. An optimized version of the software code is generated, including one or more optimizations based on an assumption that the dynamic attribute will have the expected value. Non-exhaustive examples of a dynamic attribute include a variable type; a location in memory; a location in which a global object, property, or variable is stored; the contents of a global function or method; and a value of a global property or variable. A check is performed during execution of the optimized version of the software code, prior to executing the portion that has been optimized based on the assumption, to verify that the dynamic attribute has the expected value.

Abstract: Techniques for processing computer code are disclosed. In one example, an indication that a computer code is to begin execution at a portion of code other than a starting portion of the code is received, and a runtime state associated with the portion of the code at which execution is to begin is constructed. In some examples, execution of the portion of code is initiated. In some examples, a program counter associated with the portion of the code is used to initiate execution of the code. In some examples, the computer code comprises a fallback code associated with a previously executing code.

Abstract: Techniques for processing source code written in a traditionally interpreted language such as JavaScript, or another dynamic and/or interpreted language, are disclosed. In one example, compiled code associated with the source code is constructed and executed. An assumption on which a specific aspect of the compiled code is based (e.g., an optimization) is tested at a checkpoint of the compiled code. A roll over to fallback code is performed if the test indicates the assumption is not true.

Abstract: A lancing mechanism is adapted to move between a resting, cocking and a puncture position. The lancing mechanism comprises a lancet holder adapted to receive a lancet, a shaft attached to the lancet holder, at least one drive spring and at least one damping spring. The drive spring surrounds at least a portion of the shaft and drives the lancing mechanism from the cocking position to the puncture position. The damping spring moves the lancing mechanism from the puncture position to the resting position. The drive spring is located at least partially within the damping spring.

Abstract: Deferred constant pool generation is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is used to generate a constant pool. In some embodiments, the source code comprises JavaScript, which is used to generate an LLVM or other intermediate representation (IR), which intermediate representation is optimized prior to a constant pool being generated.

Abstract: Delayed insertion of safepoint related code is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is analyzed programmatically to identify a safepoint and insert safepoint related code associated with the safepoint. In some embodiments, analyzing the optimized intermediate representation programmatically comprises determining where to place the safepoint within a program structure of the source code as reflected in the intermediate representation.

Abstract: Optimized storage of function variables in compiled code is disclosed. It is determined that a variable of a first function is required to be available for use by a second function subsequent to return of the first function. Machine code is generated to escape the variable from a storage location in a stack memory to a storage location in a heap memory, prior to the variable being removed from the stack memory, in connection with return of the first function.

Abstract: Variable type knowledge based call specialization is disclosed. An indication is received that a variable that is an argument of a function or operation the behavior of which depends at least in part on a data type of the argument is of a first data type. Machine code that implements a first behavior that corresponds to the first data type, but not a second behavior that corresponds to a second data type other than the first data type, is generated for the function or operation.

Abstract: A device-independent intermediate representation of a source code is generated and stored, e.g., in a memory or other storage mechanism. The stored intermediate representation of the source code is used to generate a device-specific machine code corresponding to the source code. The stored intermediate representation may be updated, e.g., periodically, for example by obtaining an updated version of the source code and compiling the updated source code to generate an updated intermediate representation. The stored intermediate representation may be based on source code received from a device that is synchronized with which a compiling device that generates the device-specific machine code. In some cases, the stored intermediate representation may be used to generate for each of a plurality of devices a corresponding device-specific machine code.