The Procter Gamble Company

Microsoft Technology Licensing, LLC

He Su

Koichi Morimoto

Sridhar Srinivasan

Urmish Popatlal Dalal

Andrew James Sauer

Ju Wang

Shane Kumar Mainali

Krishnan Varadarajan

Jegan Devaraju

Erica Lynne Locke

Quan Zhang

Manish Chablani

Hao Feng

Bin Tong

An absorbent article has a liquid pervious topsheet, a liquid impervious backsheet, an absorbent core disposed between the topsheet and backsheet; first and second opposing longitudinal side edges, a front waist region and a back waist region; and a first and second back ear extending outwardly from the first and longitudinal side edges in the back waist region, respectively. The first and second back ears have an engineering strain greater than about 8% at about or below 2N of force when measured according to the Back Ear Extension Test, and a roughness Ra lower than about 300 μm when measured according to the Roughness Test.

Absorbent article with extensible ears

The present invention relates to a fastening member comprising a base pane, a closure member extending laterally from the base panel, the closure member comprising a closure member upper edge and a closure member lower edge, and a fastening element disposed on the closure member, the fastening element comprising a fastening element upper edge and a fastening element lower edge, wherein the closure member upper edge comprises a concave portion along the fastening element upper edge and the closure member lower edge comprises a convex portion along the fastening element lower edge, and wherein the closure member extends upwardly laterally.

Shaped fastening members and absorbent articles having the same

Anchor tree cross-merge within a distributed storage system. A computer system identifies a data structure that includes (i) a root anchor tree and (ii) an ordered set of anchor trees that are ordered based on their creation, such that a last anchor tree of the ordered set of anchor trees is most-recently created. The data structure stores index data for a set of objects stored in a non-volatile storage. The computer system creates a new anchor tree in the ordered set of anchor trees. The computer system identifies, from a set of delta tables, index data representing one or more objects that are stored on the non-volatile storage. The computer system merges the index data representing the one or more objects into the new anchor tree.

Staging anchor trees for improved concurrency and performance in page range index management

A distributed storage system includes non-volatile storage storing portions of a first object. The first object encompasses data having a first range of addresses and each portion includes data for a respective range of addresses that is a proper subset of the first range. A first data structure stores, for each portion, data indicating the respective range of addresses and a pointer to where the portion is stored. The first data structure includes a root tree and a set of trees ordered by creation data such that a last tree is most-recently created. The non-volatile storage stores received write data and a write buffer stores index data pointing to storage locations of the received write data. An index management system stores the index data from the write buffer into the last tree and, if the ordered set is empty, creates a tree in the ordered set before the storing.

Growing community of inventors

Beijing, China

He Su