Patent application number | Description | Published |
20090062760 | Absorbent Article with a Slitted Absorbent Core - The invention relates to slit absorbent articles and the use of slits in absorbent materials to provide improved liquid intake rate, flexibility and softness compared to the unmodified material. The absorbent material, including superabsorbent materials, are particularly useful as absorbent cores in disposable absorbent articles such as diapers, incontinent products, sanitary napkins and the like. | 03-05-2009 |
20090124991 | Body Conforming Disposable Absorbent Article Having Leg Wraps and Internal Topsheet and Method of Making Same - A secondary internal topsheet and leg wrap structure is provided in a disposable absorbent garment such as a diaper or training pants. The leg wrap structure has a base layer, a top layer, and an elastic construction disposed inbetween. The elastic construction includes a plurality of spaced apart elastic elements that are aligned in a generally in generally parallel relation. The leg wrap structure and secondary topsheet provides for the efficient formation of a reservoir and a plurality of fluid dams each capable of capturing a quantity of fluid to minimize the occurrence of fluid leaks from the absorbent article. Methods of forming such absorbent articles are disclosed. | 05-14-2009 |
20110015607 | (BATMAN) DISPOSABLE ABSORBENT ARTICLE HAVING LEG WRAPS AND METHOD OF MAKING SAME - A leg wrap structure is provided in a disposable absorbent garment such as a diaper or training pants. The leg wrap structure has a base layer, a top layer, and an elastic construction disposed therebetween. The elastic construction includes a plurality of spaced apart (e.g. generally equally spaced apart) elastic elements (e.g. strands or threads) that are aligned in a generally in generally parallel relation. Further, the top and base layers define a region of inelasticity. The leg wrap structure provides for the efficient formation of a reservoir and a plurality of fluid dams each capable of capturing a quantity of fluid to minimize the occurrence of fluid leaks from the absorbent article. Methods of forming such absorbent articles are disclosed. | 01-20-2011 |
20120175056 | METHOD OF MAKING AN ABSORBENT COMPOSITE AND ABSORBENT ARTICLES EMPLOYING THE SAME - A method of making an absorbent composite that includes a first fabric, a second fabric, and particles positioned between the two fabrics and absorbent articles made from the absorbent composite. The particles are secured between the two fabric using adhesive, thermal plastic or combinations thereof. The fabrics are bonded together in a manner that limits particle movement between the fabrics. The bond pattern may define pockets or other shapes. In applications in which the bond pattern forms pockets, the particles may be positioned in the pockets. The particles may be SAP particles or other particles with advantageous properties. | 07-12-2012 |
20140316365 | BODY CONFORMING DISPOSABLE ABSORBENT ARTICLE HAVING LEG WRAPS AND INTERNAL TOPSHEET AND METHOD OF MAKING SAME - A secondary internal topsheet and leg wrap structure is provided in a disposable absorbent garment such as a diaper or training pants. The leg wrap structure has a base layer, a top layer, and an elastic construction disposed inbetween. The elastic construction includes a plurality of spaced apart elastic elements that are aligned in a generally in generally parallel relation. The leg wrap structure and secondary topsheet provides for the efficient formation of a reservoir and a plurality of fluid dams each capable of capturing a quantity of fluid to minimize the occurrence of fluid leaks from the absorbent article. Methods of forming such absorbent articles are disclosed. | 10-23-2014 |
Patent application number | Description | Published |
20090100113 | TRANSACTION LOG MANAGEMENT - A transaction processing system comprising a transaction log, a log management policy, a profile and a log manager, and method for managing the transaction log are provided. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks; storing a log management policy including at least one log threshold and a plurality of possible actions associated therewith; and generating a historical profile comprising a set of acceptable values for characteristics of the log resource usage of tasks. Such log resource usage characteristics may include time taken for a task to complete, CPU resource consumed, number of log records made, etc. From a comparison of the profile behaviour to the actual behaviour of a task which has been identified as holding up trimming of the log, the likelihood that the identified task has entered an invalid loop and represents a ‘bad’ transaction instance, rather than simply just taking a long time to complete, can be inferred. Thus the most appropriate action can be selected and taken. | 04-16-2009 |
20090100434 | TRANSACTION MANAGEMENT - A method and transaction processing system for managing transaction processing tasks are provided. The transaction processing system comprises a transaction log, a log management policy, a log manager and a dispatcher. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks and storing a log management policy including at least one log threshold. Usage of the log by transaction processing tasks is then monitored to determine when a log threshold is reached. When a log threshold is reached the active task having the oldest log entry of all active tasks is identified and its dispatching priority is increased. This increases the likelihood that the identified task will be dispatched, and should mean that the task will more quickly reach normal completion. | 04-16-2009 |
20090319593 | Optimized Message Format for Synchronization Flows Between Transaction Processing Systems - Illustrative embodiments provide a computer implemented method, a data processing system and a computer program product for synchronizing flows between transaction processing systems. In one illustrative embodiment, responsive to a failure or interruption in processing between systems, the computer implemented method locates all units of recovery for a particular connection to form a set of identified units of recovery and builds a single message containing the set of identified units of recovery. The computer implemented method further sends the single message from a sending system to a partner system for processing. | 12-24-2009 |
20100185903 | Failure Repetition Avoidance - Avoiding failure repetition in data processing includes storing a sequence of circumstances leading up to a previous failure, monitoring circumstances in a current process, matching a sequence of circumstances in the current process to a stored sequence of circumstances, and applying rules to determine if the current process should proceed. | 07-22-2010 |
20120159457 | VALIDATING RUN-TIME REFERENCES - Identifying conflicting declared invalid runtime references of overlaid data structures of a shared memory area as declared in a program listing. The identifying includes identifying a first data structure and a first parameter list in the program listing. A first routine call and a sequential flow of execution of the first routine call through the program listing in order to write data to the shared memory area are identified. A second data structure and a second parameter list in the program listing are identified. A second routine call and a second sequential flow of execution of the second routine call through the program listing in order to write data to the shared memory area are identified. It is determined whether the second routine call is attempting to overwrite data of the first routine call with the data of the second routine call in the shared memory area. | 06-21-2012 |
20130185262 | TRANSACTION LOG MANAGEMENT - Managing a log-full condition of a transaction log in a transaction processing system, where the transaction log has a plurality of log records each associated with a particular transaction. When a log-full condition is detected, the active transaction having the oldest log entry of all active transactions is identified and logging for all transactions except for the identified transaction is temporarily suspended. A dynamic transaction backout of the identified transaction is initiated, with the writing of a backout record for the identified transaction to the log being delayed. Confirmation that the backout has completed is awaited before trimming the log. Then the delayed backout record for the identified transaction is written to the log, and normal logging is resumed. | 07-18-2013 |
20150242191 | METHOD FOR VALIDATING EQUIVALENT DATA STRUCTURES - Embodiments of the invention relate to a method, system, and computer program product for validating a data structure, comprising: responsive to identifying a data structure in a first programming language, identifying an equivalent data structure in a second programming language; comparing a data definition of the data structure with a data definition of the equivalent data structure; determining an incompatibility between a compared data definition of the data structure and a compared data definition of the equivalent data structure; and responsive to determining an incompatibility, identifying a rule defining an action to be taken in order to correct the incompatibility. | 08-27-2015 |
Patent application number | Description | Published |
20090089339 | TRANSACTION LOG MANAGEMENT - A method and apparatus for managing a log-full condition of a transaction log in a transaction processing system are provided. The transaction log has a plurality of log records each associated with a particular transaction. When a log-full condition is detected, the active transaction having the oldest log entry of all active transactions is identified and logging for all transactions except for the identified transaction is temporarily suspended. A dynamic transaction backout of the identified transaction is initiated, with the writing of a backout record for the identified transaction to the log being delayed. The method waits for confirmation that the backout has completed before trimming the log. Then the delayed backout record for the identified transaction is written to the log and normal logging is resumed. | 04-02-2009 |
20090193280 | Method and System for In-doubt Resolution in Transaction Processing - A method and system are provided for in-doubt resolution in transaction processing involving at least two distributed transaction processing systems. The method includes a resynchronization method when re-establishing a connection between two distributed transaction processing systems. The method includes re-establishing a connection between a first transaction processing system and a second transaction processing system following a failure; the first transaction processing system searching for any unresolved units of recovery and resynchronizing each unresolved unit of recovery with the second transaction processing system; and when the first transaction processing system has finished processing its unresolved units of recovery, the second transaction processing system then searches for any unresolved units of recovery and resynchronizes each unresolved unit of recovery with the first transaction processing system. | 07-30-2009 |
20090193286 | Method and System for In-doubt Resolution in Transaction Processing - A method and system are provided for in-doubt resolution in transaction processing involving at least two distributed transaction processing systems. The method includes an initial exchange of information to establish an identifier for coordinating units of recovery in distributed transaction processing systems. The method includes a first transaction processing system creating a local unit of recovery and sending a request to a second transaction processing system to create a coordinating unit of recovery, the request including an identifier of the local unit of recovery. The second transaction processing system starts a coordinating unit of recovery and recording the identifier in association with the coordinating unit of recovery. In the event of a failure, one of the first and second transaction processing systems uses the identifier to locate the unit of recovery on the other of the first and second transaction processing systems to resynchronize the units of recovery. | 07-30-2009 |
20090240742 | Transaction Log Management - A transaction processing system comprising a transaction log, a log management policy, a profile and a log manager, and method for managing the transaction log are provided. The method comprises maintaining a transaction log of recoverable changes made by transaction processing tasks, each task having an associated transaction type; storing a log management policy including at least one log threshold and a plurality of possible actions associated therewith; and storing a profile of log resource usage characteristics of tasks for different types of transactions. Usage of the log by transaction processing tasks is monitored to determine when a log threshold is reached. The profile indicates the normal logging behaviour of particular types of transaction by identifying ranges of acceptable values for a plurality of log resource usage characteristics. Such characteristics may include time taken for a task to complete, CPU resource consumed, number of log records made, etc. From a comparison of the profile behaviour with the current log resource usage of a task which has been identified as holding up trimming of the log, likelihood that the identified task having entered an invalid loop and represents a ‘bad’ program, rather than simply validly taking a long time to complete can be inferred. Thus the most appropriate action can be selected and taken. | 09-24-2009 |
20120102454 | SOFTWARE DEVELOPMENT - A method, system and computer program product for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program. | 04-26-2012 |
20120124021 | TRANSACTION LOG MANAGEMENT - Managing a log-full condition of a transaction log in a transaction processing system, where the transaction log has a plurality of log records each associated with a particular transaction. When a log-full condition is detected, the active transaction having the oldest log entry of all active transactions is identified and logging for all transactions except for the identified transaction is temporarily suspended. A dynamic transaction backout of the identified transaction is initiated, with the writing of a backout record for the identified transaction to the log being delayed. Confirmation that the backout has completed is awaited before trimming the log. Then the delayed backout record for the identified transaction is written to the log, and normal logging is resumed. | 05-17-2012 |
20120159440 | SOFTWARE DEVELOPMENT - A method for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program. | 06-21-2012 |
20120246518 | OPERATING A COMPUTER SYSTEM - Trace data is periodically written to a trace table. A software trap is run. If the software trap does not fire, a run marker is set to a predefined distance behind a position of an old run marker in the trace table. The trace data is periodically written to the trace table, and, if necessary, earlier written trace table data is overwritten. Most recently written trace data is detected to have reached the run marker and the software trap is run. | 09-27-2012 |
20130013963 | DIAGNOSTIC DATA CAPTURE IN A COMPUTING ENVIRONMENT - A multithreaded computing environment for capturing diagnostic data includes initiating a trap delay component having a delay threshold in response to a monitor determining that the computing environment is in a predetermined invalid state. The multithreaded computing environment for capturing diagnostic data also includes recording, by a first thread, diagnostic data for the computing environment. The trap delay component delays the step of recording diagnostic data until the monitor determines that the predetermined invalid state has been repeated for at least one of a total count or a period corresponding to a predetermined indicator that it is a state other than a transient state of the computing environment. The transient state corresponds to a transition of the computing environment by one or more other threads from a first valid state to a second valid state. | 01-10-2013 |
20130152042 | AUTOMATED AND HEURISTICALLY MANAGED SOLUTION TO QUANTIFY CPU AND PATH LENGTH COST OF INSTRUCTIONS ADDED, CHANGED OR REMOVED BY A SERVICE TEAM - Embodiments of the present invention provide a method, system, and computer program product for qualifying changes to an instruction set in source code. In an embodiment of the invention, a method for quantifying changes to an instruction set in source code can be provided. The method can include receiving text in a code editor as an edit to source code of a computer program querying a data store of code change costs with at least a portion of the edit. The method additionally can include retrieving in response to the query a code change cost associated with the edit. Finally, the method can include displaying in the code editor the retrieved code change cost. | 06-13-2013 |
20130152049 | WARNING OF REGISTER AND STORAGE AREA ASSIGNMENT ERRORS - A system for tracking register and/or storage area assignments and warning a programmer of potential assignment errors. More specifically, the system tracks programmer assignments to registers and storage areas and determines if a register or storage area has been modified prior to a call to a program or process external to the source code being examined. The system notes whether a modified register or storage area is restored to its original value subsequent to the external call. If the register or storage area has not been restored, the system displays a warning of a possible assignment error. | 06-13-2013 |
20130185021 | Automated Performance Data Management and Collection - Performance data for a healthy system is captured and used to create benchmarks that represent behavior of the computing environment in a healthy state. Current behavior (e.g, run-time characteristics) of the computing environment are monitored in an on-going manner, and are compared to the benchmarks. When a benchmark is violated, performance data capture is dynamically and automatically enabled. Or, if performance data is already being captured, then performance data capture may be enabled for a larger subset of possible data. Optionally, performance data capture may be automatically disabled upon detecting that the current behavior of the computing environment has returned to a healthy state where benchmarks are no longer violated. | 07-18-2013 |
20130226526 | Automated Performance Data Management and Collection - Performance data for a healthy system is captured and used to create benchmarks that represent behavior of the computing environment in a healthy state. Current behavior (e.g, run-time characteristics) of the computing environment are monitored in an on-going manner, and are compared to the benchmarks. When a benchmark is violated, performance data capture is dynamically and automatically enabled. Or, if performance data is already being captured, then performance data capture may be enabled for a larger subset of possible data. Optionally, performance data capture may be automatically disabled upon detecting that the current behavior of the computing environment has returned to a healthy state where benchmarks are no longer violated. | 08-29-2013 |
20130318509 | GENERATING OBJECT CODE FROM A CONJOINED ASSEMBLER DIRECTIVE - Receiving assembly language source code for a computer program and identifying within the assembly language source code a conjoined directive that conjoins a load instruction and an assembler directive. The conjoined directive can identify a data structure, a first register, and a second register that contains an address of a location in memory that contains the data structure. Via a processor, the conjoined directive can be processed to create object code that includes operation code that loads into the first register the address of the location in memory that contains the data structure. The object code can be output. | 11-28-2013 |
20140074795 | RECONSTRUCTION OF SYSTEM DEFINITIONAL AND STATE INFORMATION - A determination is made as to whether one of a system definition file data set and a catalog data set is unavailable for orderly restart of an information system. The system definition file data set provides resource definition information for the information system and the catalog data set provides resource state information for the information system. A determination is made that the other of the system definition file data set and the catalog data set is available. The unavailable one of the system definition file data set and the catalog data set is reconstructed by rebuilding the system resource definition and state information used by the unavailable one of the system definition file data set and the catalog data set using system resource information within the other available one of the system definition file data set and the catalog data set. | 03-13-2014 |
20140149483 | DATA READINESS USING INITIATOR REGION LAST COMMIT SELECTION - A portion of a transaction is received at a distributed transaction system from an initiator region. The distributed transaction system operates under a multi-tier two-phase commit protocol. A local unit of work is established that represents the portion of the transaction received from the initiator region. Processing of the local unit of work is invoked with at least one transaction participant. An indication is received from the initiator region to assume a role of transaction coordinator for the transaction. The initiator region is instructed to commit last relative to the at least one transaction participant of the local unit of work. | 05-29-2014 |
20140149484 | DATA READINESS USING INITIATOR REGION LAST COMMIT SELECTION - A portion of a transaction is received at a distributed transaction system from an initiator region. The distributed transaction system operates under a multi-tier two-phase commit protocol. A local unit of work is established that represents the portion of the transaction received from the initiator region. Processing of the local unit of work is invoked with at least one transaction participant. An indication is received from the initiator region to assume a role of transaction coordinator for the transaction. The initiator region is instructed to commit last relative to the at least one transaction participant of the local unit of work. | 05-29-2014 |
20140207739 | RECONSTRUCTION OF SYSTEM DEFINITIONAL AND STATE INFORMATION - A determination is made as to whether one of a system definition file data set and a catalog data set is unavailable for orderly restart of an information system. The system definition file data set provides resource definition information for the information system and the catalog data set provides resource state information for the information system. A determination is made that the other of the system definition file data set and the catalog data set is available. The unavailable one of the system definition file data set and the catalog data set is reconstructed by rebuilding the system resource definition and state information used by the unavailable one of the system definition file data set and the catalog data set using system resource information within the other available one of the system definition file data set and the catalog data set. | 07-24-2014 |
20140258785 | IDENTIFYING A STORAGE LOCATION FOR A STORAGE ADDRESS REQUESTED DURING DEBUGGING - A method for identifying a storage location for a requested storage address. The method includes receiving a request to view data at a storage address and determining the requested storage address corresponding to a plurality of storage locations. The method includes determining whether the requested storage address identifies memory related to a dump file being analyzed by a dump formatter. Then, in response to determining the requested storage address identifies memory related to the dump file being analyzed by the dump formatter, the method includes identifying one of the plurality of storage locations. The method includes directing the request to the identified storage location. | 09-11-2014 |
20150178179 | CREATING TRACE DATA FROM RECENT SOFTWARE OUTPUT AND ACTIVITY - Creating additional trace entries by dynamically processing recently captured output data, working data, and input data to diagnose a software error. Integrating additional trace entries in chronological order with conventional trace entries into a single trace dataset for analysis. | 06-25-2015 |
20150178180 | CREATING TRACE DATA FROM RECENT SOFTWARE OUTPUT AND ACTIVITY - Creating additional trace entries by dynamically processing recently captured output data, working data, and input data to diagnose a software error. Integrating additional trace entries in chronological order with conventional trace entries into a single trace dataset for analysis. | 06-25-2015 |
Patent application number | Description | Published |
20140047204 | PROVIDING SERVICE ADDRESS SPACE FOR DIAGNOSTICS COLLECTION - A method and system are provided for providing a service address space for diagnostics collection. The system includes: a service co-processor attached to a main processor, wherein the service co-processor maintains an independent copy of the main processor's address space in the form of a service address space; and a storage update receiving component for updating the service address space by receiving storage update packets from the main processor and applying these to the service address space. An instruction pipe may be provided between the main processor and the service co-processor. The main processor may include: a service delegation component for delegating collection of diagnostic data to the co-processor by sending a collection command from the main processor to the service co-processor for collection of data from the service address space. | 02-13-2014 |
20140095942 | PROVIDING SERVICE ADDRESS SPACE FOR DIAGNOSTICS COLLECTION - A method and system are provided for providing a service address space for diagnostics collection. The method includes: providing a service co-processor attached to a main processor, wherein the service co-processor maintains an independent copy of the main processor's address space in the form of a service address space; and updating the service address space by receiving storage update packets from the main processor and applying the storage update packets to the service address space. | 04-03-2014 |
20140173356 | PERFORMING DIAGNOSTIC TRACING OF AN EXECUTING APPLICATION TO IDENTIFY SUSPICIOUS POINTER VALUES - Arrangements described herein relate to performing diagnostic tracing of an executing application. A trace entry in trace data can be identified, the trace entry comprising a pointer that refers to a memory address. Whether a value that is, or has been, stored at the memory address is an erroneous value can be determined. Responsive to determining that the value that is, or has been, stored at the memory address is an erroneous value, the pointer can be indicated as being a suspicious value. | 06-19-2014 |
20140173358 | PERFORMING DIAGNOSTIC TRACING OF AN EXECUTING APPLICATION TO IDENTIFY SUSPICIOUS POINTER VALUES - Arrangements described herein relate to performing diagnostic tracing of an executing application. A trace entry in trace data can be identified, the trace entry comprising a pointer that refers to a memory address. Whether a value that is, or has been, stored at the memory address is an erroneous value can be determined. Responsive to determining that the value that is, or has been, stored at the memory address is an erroneous value, the pointer can be indicated as being a suspicious value. | 06-19-2014 |
20140181593 | CORRELATION OF SOURCE CODE WITH SYSTEM DUMP INFORMATION - The present arrangements relate to analyzing a software error. At least one dump file created in response to a crash of software executing on a processing system can be accessed. Based on the dump file, a base version of at least one software module that was loaded when the crash occurred can be identified. Based on the dump file, maintenance that has been applied to the at least one software module also can be identified. A report recommending new corrective maintenance to be applied to the at least one software module can be generated. | 06-26-2014 |
20150324246 | CORRELATION OF SOURCE CODE WITH SYSTEM DUMP INFORMATION - The present arrangements relate to analyzing a software error. At least one dump file created in response to a crash of software executing on a processing system can be accessed. Based on the dump file, a base version of at least one software module that was loaded when the crash occurred can be identified. Based on the dump file, maintenance that has been applied to the at least one software module also can be identified. A report recommending new corrective maintenance to be applied to the at least one software module can be generated. | 11-12-2015 |
20150331738 | PERFORMING DIAGNOSTIC TRACING OF AN EXECUTING APPLICATION TO IDENTIFY SUSPICIOUS POINTER VALUES - Arrangements described herein relate to performing diagnostic tracing of an executing application. A trace entry in trace data can be identified, the trace entry comprising a pointer that refers to a memory address. Whether a value that is, or has been, stored at the memory address is an erroneous value can be determined. Responsive to determining that the value that is, or has been, stored at the memory address is an erroneous value, the pointer can be indicated as being a suspicious value. | 11-19-2015 |
Patent application number | Description | Published |
20140171896 | Disposable Absorbent Article With Elasticized Side Panels, and Method of Making the Same - A disposable absorbent article has a central body that includes an absorbent core, a front longitudinal edge, and a rear longitudinal edge opposite the front longitudinal edge. The disposable absorbent article also has a pair of elasticized side panels that extend longitudinally adjacent opposite lateral sides of the central body. Each side panel has a front longitudinal edge and a rear longitudinal edge opposite the front longitudinal edge, and a front or rear fastening element positioned adjacent the front or rear edge. The front edge of the side panel is positioned closer to the front waist portion than the rear edge. The fastening element is constructed for fastening the front and rear waist portions of the central body when the disposable absorbent article is worn by a user. | 06-19-2014 |
20140276518 | MULTI-LAYERED ABSORBENT ARTICLE - A thin absorbent composite is provided wherein a nonwoven support sheet is hydro-entangled with a carded fiber web to provide a nonwoven substrate. The nonwoven substrate is coated with an absorbent layer comprising microfibrillated cellulose-coated superabsorbent polymer particles. A cover layer is placed above the absorbent layer to provide the absorbent composite. A process for manufacturing the absorbent composite and an absorbent article containing the absorbent composite are also provided. | 09-18-2014 |
20150040367 | Absorbent Article with a Slitted Absorbent Core - The invention relates to slit absorbent articles and the use of slits in absorbent materials to provide improved liquid intake rate, flexibility and softness compared to the unmodified material. The absorbent material, including superabsorbent materials, are particularly useful as absorbent cores in disposable absorbent articles such as diapers, incontinent products, sanitary napkins and the like. | 02-12-2015 |
20150045756 | Absorbent Composite, an Absorbent Article Employing the Same, and Methods, Systems, and Apparatus for Making the Absorbent Composite and/or Article - An absorbent core composite is disclosed for incorporation into a disposable absorbent article. The composite includes a first material layer and a second material layer (preferably nonwoven) partially secured to the first material layer to define at least one pocket therebetween. Preferably, multiple pockets are defined, except in the case of where a generally uniform layer or bed of absorbent is preferred or better suited fro the application. The pocket is said have a fixed initial volume. Further, an aggregate of absorbent particles is provided in the pocket(s) to occupy a portion of the fixed initial volume. The absorbent particles are preferably SAP particles and is characterized by a dry volume associated with a dry state and a swell volume associated with a liquid saturation state. In respect to or for the pocket, the aggregate is characterized by a collective dry volume and a collective swell volume, wherein the pocket has an initial configuration that retains the aggregate therein. | 02-12-2015 |