Abstract: A computer-implemented method of permitting authentication of data added to an initial plurality of unique data items stored on a computer, all of the data items being converted via a one-way function to respective equal length unique digests (or hashes); and the hashes being stored as a linked dataset in which the value of each successive hash is dependent on the value of the previous hash combined with a new hash resulting from the hashing of the most recently added data. The most recent hash in the linked dataset (hash chain) is the cumulative result of all previous hashes in their original sequence, each hash in the dataset being unique to the most recently added data. Each cumulative hash is constructed by incorporating one or more pre-existing cumulative hashes into the source data, before the new hash is calculated.

Abstract: A computer-implemented method of permitting authentication of data added to an initial plurality of unique data items stored on a computer, all of the data items being converted via a one-way function to respective equal length unique digests (or hashes); and the hashes being stored as a linked dataset in which the value of each successive hash is dependent on the value of the previous hash combined with a new hash resulting from the hashing of the most recently added data. The most recent hash in the linked dataset (hash chain) is the cumulative result of all previous hashes in their original sequence, each hash in the dataset being unique to the most recently added data. Each cumulative hash is constructed by incorporating one or more pre-existing cumulative hashes into the source data, before the new hash is calculated.

Abstract: In a computer system that includes multiple nodes and multiple logical partitions, a dynamic partition manager computes current memory affinity and potential memory affinity at the request of a logical partition to help the logical partition determine whether a reallocation of resources between nodes may improve memory affinity for the logical partition. If so, the logical partition requests reallocation of resources by the dynamic partition manager so memory affinity for the logical partition is improved.

Abstract: A continuous mixing process is disclosed that provides improved dispersive mixing over conventional mixing processes. The process employs squeeze flow motion around a translating member at a Hencky strain greater than 2 and at a rate corresponding to a Deborah Number greater than 10.

Abstract: An ethylene polymer having a Polydispersity Index of at least about 3.0, a melt index, MI, and a Relaxation Spectrum Index, RSI, such that (RSI)(MI.sup..alpha.) is greater than about 26 when .alpha. is about 0.7, and a Crystallizable Chain Length Distribution Index, L.sub.w /L.sub.n, less than about 3 is provided. Such ethylene polymer has processability equivalent or superior to even conventional high pressure polyethylene at similar melt index, yet need not be made under high pressure reaction conditions.

Abstract: A continuous mixing process is discloses that provides improved dispersive mixing over conventional mixing processes Viscoelastic material is introduced and withdrawn at a constant rate into and out of a housing having a central shaft whereby the shaft has at least one plate extending perpendicularly from the shaft. A drive means is actuated to reciprocate the plate along the axis of the shaft in order to provide a squeezing of material between the plate and the end walls of the housing, or between the plate and annular partitions disposed within the housing. The process employs a squeeze flow motion around the parallel surfaces at a Hencky strain greater than 2 and at a rate corresponding to a Deborah Number greater than 10.