Abstract: Methods and apparatuses for producing a zoned and/or layered substrate are described. A method can include providing a first supply of fibers, providing a second supply of fibers, and providing a headbox. The headbox can include a machine direction, a cross-direction, and a first cross-directional divider that separates a first zone of the headbox from a second zone of the headbox in a cross-directional manner. The method can further include transferring the first supply of fibers and the second supply of fibers to the headbox. The method can also include transferring the first supply of fibers and the second supply of fibers through the headbox to provide the substrate.

Abstract: Methods and apparatuses for producing a zoned and/or layered substrate are described. A method can include providing a first supply of fibers, providing a second supply of fibers, and providing a headbox. The headbox can include a machine direction, a cross-direction, and a first cross-directional divider that separates a first zone of the headbox from a second zone of the headbox in a cross-directional manner. The method can further include transferring the first supply of fibers and the second supply of fibers to the headbox. The method can also include transferring the first supply of fibers and the second supply of fibers through the headbox to provide the substrate.

Abstract: Methods and apparatuses for producing a zoned and/or layered substrate are described. A substrate can include a first layer including a first zone, a second zone, and an interface between zones. The first zone can include a plurality of fibers. The second zone can include a plurality of fibers and can be offset from the first zone in a cross-direction. The interface can include at least some of the plurality of fibers of the first zone and at least some of the plurality of fibers of the second zone to provide a purity gradient with a transition width less than 3.8 cm as defined by the Purity Gradient Test Method as described herein.

Abstract: There is set forth herein obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a container of a protected computing environment; obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a processing resource of a computing environment; obtaining a state of the processing resource and provisioning a utility processing resource to include the state of the processing resource; and configuring the computing environment to route data traffic to the utility processing resource.

Abstract: There is set forth herein obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a container of a protected computing environment; obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a processing resource of a computing environment; obtaining a state of the processing resource and provisioning a utility processing resource to include the state of the processing resource; and configuring the computing environment to route data traffic to the utility processing resource.

Abstract: An absorbent article having a fluid-handling system includes a fluid permeable bodyside liner; a fluid impermeable outer cover; an absorbent core disposed between the liner and the outer cover, wherein the absorbent core includes superabsorbent material and optionally fluff pulp; and a core wrap at least partially encircling the absorbent core, wherein the core wrap includes a three-dimensionally patterned, wetlaid, cellulosic tissue nonwoven material. Fibers of the nonwoven material are entirely cellulose fibers, and the core wrap includes opposing core wrap surfaces each having a textured surface. Each surface includes an average material plane, a plurality of ridges extending in a z-direction from the average material plane, and a plurality of grooves alternating with the plurality of ridges, wherein the grooves depth extend in the opposite z-direction from the average material plane.

Abstract: An absorbent article having a fluid-handling system includes a fluid permeable bodyside liner; a fluid impermeable outer cover; an absorbent core disposed between the liner and the outer cover, wherein the absorbent core includes superabsorbent material and optionally fluff pulp; a tissue core wrap encircling the absorbent core; and a distribution sub-layer disposed between the absorbent core and the outer cover and within the core wrap, wherein the distribution sub-layer includes a three-dimensionally patterned, wetlaid, cellulosic tissue nonwoven material. The distribution sub-layer includes opposing distribution sub-layer surfaces each having a textured surface, wherein each surface includes an average material plane, a plurality of ridges extending in a z-direction from the average material plane, and a plurality of grooves alternating with the plurality of ridges, wherein the grooves depth extend in the opposite z-direction from the average material plane.

Abstract: An absorbent article having a fluid-handling system includes a fluid permeable body side liner; a fluid impermeable outer cover; an absorbent core disposed between the liner and the outer cover, wherein the absorbent core includes superabsorbent material and optionally fluff pulp; a synthetic nonwoven surge layer disposed adjacent the liner between the absorbent core and the liner; and a dispersion layer disposed between the surge layer and the absorbent core, wherein the dispersion layer includes a three-dimensionally patterned, wetlaid, cellulosic tissue nonwoven material. The dispersion layer also includes opposing dispersion layer surfaces each having a textured surface, wherein each surface includes an average material plane, a plurality of ridges extending in a z-direction from the average material plane, and a plurality of grooves alternating with the plurality of ridges, wherein the grooves depth extend in the opposite z-direction from the average material plane.

Abstract: There is set forth herein obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a container of a protected computing environment; obtaining data traffic monitoring data, the data traffic monitoring data being in dependence on monitoring of traffic received by a processing resource of a computing environment; obtaining a state of the processing resource and provisioning a utility processing resource to include the state of the processing resource; and configuring the computing environment to route data traffic to the utility processing resource.

Abstract: A method of automatic calibration in which the simulation adapts itself to more closely resemble the actual network is provided. For a given network architecture and a probabilistic customer usage profile a simulation provides an estimate of key performance metrics. These simulated metrics are compared against actual measurements from the network. To the extent that they do not match within a prescribed tolerance, an iterative adaptive calibration procedure is used to perturb slightly the probabilistic model of network usage.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution. Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders.

Abstract: Embodiments of the present invention disclose a secure localization infrastructure using transmitters that can transmit messages at multiple distinct power levels throughout a community of reference points. Transmitters send messages at different power levels in a manner that every location in the system corresponds to a unique set of messages. Received messages are reported back to the localization infrastructure, which then determines location by comparing the messages reported.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders.

Abstract: Embodiments of the present invention disclose a secure localization infrastructure using transmitters that can transmit messages at multiple distinct power levels throughout a community of reference points. Transmitters send messages at different power levels in a manner that every location in the system corresponds to a unique set of messages. Received messages are reported back to the localization infrastructure, which then determines location by comparing the messages reported.

Abstract: Performance optimization of mobile wireless communication networks is complex and typically requires extensive offline modeling and simulation prior to deploying changes that may have unforeseen adverse effects on the live customer network. It is necessary to calibrate the simulation model against the actual network at a level of fidelity such that the engineer is confident that the simulation's response to network changes accurately reflects the results that would be experienced if those changes were deployed in an actual live network. This process is typically quite time consuming and requires significant case-by-case insight into the workings of the actual network as well as the simulation model. We have invented a method of automatic calibration in which the simulation adapts itself to more closely resemble the actual network. For a given network architecture and a probabilistic customer usage profile a simulation provides an estimate of key performance metrics.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.