Abstract: Absorbent article including a chassis and fastening tab. The fastening tab includes a carrier, a first fastener having first male fastening elements, and a second fastener. The second fastener includes a backing with first and second opposing surfaces, with second male fastening elements on the first surface. A first portion of the second surface of the backing is connected to the carrier, and a second portion of the second surface of the backing is attached to the topsheet side of the chassis. The carrier is attached to the backsheet side of the chassis. Some fastening laminates, before attachment to the article, have the second portion of the second fastener folded over to face the first portion of the second fastener. Other laminates have the second fastener positioned with its first surface toward the carrier and attached to the carrier with a film.

Abstract: The article includes a thermoplastic layer having opposing first and second side edges and a first surface bearing male fastening elements. The thermoplastic layer is plastically deformed and has a retardance profile having an average retardance along a line from the first edge to a location 500 micrometers from the first edge and a distance from the first edge where 75% of the average retardance is observed of at least 10 micrometers. In some cases, a distance between the first and second side edges is up to 50 millimeters. In some cases, the article is a fastening tab. The method includes providing a thermoplastic film having opposing first and second side edges, with a distance between the opposing side edges of up to 50 millimeters, and stretching the thermoplastic film to form the thermoplastic layer, which is plastically deformed. The first surface of the thermoplastic film bears male fastening elements.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: A method for partial redundancy elimination with a fixed number of temporaries includes determining local data values of program code that describe a temporary memory location, a set of registers, and a set of basic blocks. The method determines global data values of the program code based on the determined local data values of the program code. The method removes a first load of the temporary memory location in a first basic block in the program code. The method adds a second load on a first edge from a second basic block out of the set of basic blocks to a third basic block out of the set of basic blocks in the program code. The method performs a register move on a second edge from the third basic block to the second basic block in the program code.

Abstract: A method for partial redundancy elimination with a fixed number of temporaries includes determining local data values of program code that describe a temporary memory location, a set of registers, and a set of basic blocks. The method determines global data values of the program code based on the determined local data values of the program code. The method removes a first load of the temporary memory location in a first basic block in the program code. The method adds a second load on a first edge from a second basic block out of the set of basic blocks to a third basic block out of the set of basic blocks in the program code. The method performs a register move on a second edge from the third basic block to the second basic block in the program code.

Abstract: The article includes a thermoplastic layer having opposing first and second side edges and a first surface bearing male fastening elements. The thermoplastic layer is plastically deformed and has a retardance profile having an average retardance along a line from the first edge to a location 500 micrometers from the first edge and a distance from the first edge where 75% of the average retardance is observed of at least 10 micrometers. In some cases, a distance between the first and second side edges is up to 50 millimeters. In some cases, the article is a fastening tab. The method includes providing a thermoplastic film having opposing first and second side edges, with a distance between the opposing side edges of up to 50 millimeters, and stretching the thermoplastic film to form the thermoplastic layer, which is plastically deformed. The first surface of the thermoplastic film bears male fastening elements.

Abstract: A method for partial redundancy elimination with a fixed number of temporaries includes determining local data values of program code that describe a temporary memory location, a set of registers, and a set of basic blocks. The method determines global data values of the program code based on the determined local data values of the program code. The method removes a first load of the temporary memory location in a first basic block in the program code. The method adds a second load on a first edge from a second basic block out of the set of basic blocks to a third basic block out of the set of basic blocks in the program code. The method performs a register move on a second edge from the third basic block to the second basic block in the program code.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: Absorbent article including a chassis and fastening tab. The fastening tab includes a carrier, a first fastener having first male fastening elements, and a second fastener. The second fastener includes a backing with first and second opposing surfaces, with second male fastening elements on the first surface. A first portion of the second surface of the backing is connected to the carrier, and a second portion of the second surface of the backing is attached to the topsheet side of the chassis. The carrier is attached to the backsheet side of the chassis. Some fastening laminates, before attachment to the article, have the second portion of the second fastener folded over to face the first portion of the second fastener. Other laminates have the second fastener positioned with its first surface toward the carrier and attached to the carrier with a film.

Abstract: A wetness sensor includes a substrate that carries a tuned RF circuit. The circuit includes a conductive pattern applied to the substrate, a capacitor, and a jumper all disposed on a same side of the substrate. The conductive pattern includes an inductive coil, and an inner and outer terminus. The jumper electrically couples the inner terminus to the outer terminus. The jumper also includes a frangible link which, when contacted by a target fluid, produces a drastic change in the operation of the RF circuit. The drastic change can be interpreted by a remote reader as a “wet” condition. Contact of the frangible link by the target fluid may change the impedance or resistance of the RF circuit by at least a factor of 5, 10, 100, or more, and/or may cause the frangible link to disintegrate to produce an open circuit, and/or may substantially render the RF circuit inoperative.

Abstract: A wetness sensor includes a self-supporting substrate and an electrically conductive trace carried by the substrate. The trace is patterned to provide at least a portion of a tuned RF circuit, which may be disposed on only one side of the substrate and characterized by an impedance or resistance. The trace is not self-supporting. The substrate is adapted to dissolve, swell, or otherwise degrade when contacted by a target fluid. Such degradation produces a drastic change in the operation of the RF circuit, which can be interpreted by a remote reader as a “wet” condition. Contact of the substrate by the target fluid may change the impedance or resistance of the RF circuit by at least a factor of 5, 10, 100, or 1000, and/or may cause the trace to disintegrate so as to provide the RF circuit with an open circuit, and/or may substantially render the RF circuit inoperative.

Abstract: A wetness sensor includes a self-supporting substrate and an electrically conductive trace carried by the substrate. The trace is patterned to provide at least a portion of a tuned RF circuit, which may be disposed on only one side of the substrate and characterized by an impedance or resistance. The trace is not self-supporting. The substrate is adapted to dissolve, swell, or otherwise degrade when contacted by a target fluid. Such degradation produces a drastic change in the operation of the RF circuit, which can be interpreted by a remote reader as a “wet” condition. Contact of the substrate by the target fluid may change the impedance or resistance of the RF circuit by at least a factor of 5, 10, 100, or 1000, and/or may cause the trace to disintegrate so as to provide the RF circuit with an open circuit, and/or may substantially render the RF circuit inoperative.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: A method, executed by a computer, for splitting live register ranges includes identifying one or more H pathways comprising one or more H nodes having high register pressure, identifying an L pathway consisting of two or more L nodes, and inserting register splitting instructions for each symbolic register that is live in both the one or more H pathways and the L pathway, wherein the register splitting instructions are inserted at a starting node of the one or more H pathways. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A method, executed by a computer, for splitting live register ranges includes identifying one or more H pathways comprising one or more H nodes having high register pressure, identifying an L pathway consisting of two or more L nodes, and inserting register splitting instructions for each symbolic register that is live in both the one or more H pathways and the L pathway, wherein the register splitting instructions are inserted at a starting node of the one or more H pathways. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A computer program product for splitting live register ranges includes a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions include instructions for identifying one or more H pathways comprising one or more H nodes having high register pressure using a backwards data flow in the graph, identifying an L pathway consisting of two or more L nodes using a depth first search, and inserting register splitting instructions for each symbolic register that is live in both the one or more H pathways and the L pathway. The register splitting instructions are inserted at a starting node of the one or more H pathways. Register merging instructions are inserted at an ending node of the one or more H pathways.

Abstract: A method, executed by a computer, for splitting live register ranges includes identifying one or more H pathways comprising one or more H nodes having high register pressure using a backwards data flow in the graph, identifying an L pathway consisting of two or more L nodes using a depth first search, and inserting register splitting instructions for each symbolic register that is live in both the one or more H pathways and the L pathway. The register splitting instructions are inserted at a starting node of the one or more H pathways. Register merging instructions are inserted at an ending node of the one or more H pathways.