US 11,379,488 B2Granted

Energy-efficient decay algorithm for non-volatile memories

AssigneeSap SE

InventorAhmad Hassan

Life of this patent

Estimating the term…

Loading patent…

Abstract

In an example, information about interactions by users, via the graphical user interface, with a plurality of items rendered in the graphical user interface, is obtained, the information including a timestamp of a time and date at which the corresponding interaction occurred. A series of operations is performed upon detecting a condition that triggers a ranking of items rendered in the graphical user interface, for each item for which the condition applies. A ranking score is calculated for the item and a decay is applied to the ranking score by applying a Gaussian distribution, using the timestamp of the item as an origin to the Gaussian distribution, producing a decayed ranking score. The items for which the condition applies are then ranked based on their respective decayed ranking scores and a subset is rendered in the graphical user interface in an order matching the ranking.

Claims20

Dependent claims

A system comprising:

at least one hardware processor;
a non-volatile memory;
and
a computer-readable medium storing instructions that, when executed by the at least one hardware processor, cause the at least one hardware processor to perform operations comprising:
obtaining information obtained via a graphical user interface, the information relating to information about interactions by users with a plurality of items rendered in the graphical user interface, the information including a timestamp of a time and date at which a corresponding interaction occurred;
upon detecting a condition that triggers a ranking of items rendered in the graphical user interface, for each item for which the condition applies:
calculating a ranking score for the item, without ever performing a write operation for the ranking score;
applying a decay to the ranking score by applying a Gaussian distribution to the item, the Gaussian distribution plotting the item as a distribution having interactions on a first axis and time on a second axis, using the timestamp of the item as an origin and a predetermined value as an offset to the Gaussian distribution, the offset causing a shift in the distribution on the second axis, the predetermined value being based on network traffic, to produce a decayed ranking score;
and
ranking the items for which the condition applies based on their respective decayed ranking scores;
rendering at least a subset of items for which the condition occurs in the graphical user interface in an order matching the ranking.

8 more elements

A method comprising:

obtaining information obtained via a graphical user interface, the information relating to information about interactions by users with a plurality of items rendered in the graphical user interface, the information including a timestamp of a time and date at which a corresponding interaction occurred;
upon detecting a condition that triggers a ranking of items rendered in the graphical user interface, for each item for which the condition applies:
calculating a ranking score for the item, without ever performing a write operation for the ranking score;
applying a decay to the ranking score by applying a Gaussian distribution to the item, the Gaussian distribution plotting the item as a distribution having interactions on a first axis and time on a second axis, using the timestamp of the item as an origin and a predetermined value as an offset to the Gaussian distribution, the offset causing a shift in the distribution on the second axis, the predetermined value being based on network traffic, to produce a decayed ranking score;
and
ranking the items for which the condition applies based on their respective decayed ranking scores;
rendering at least a subset of items for which the condition occurs in the graphical user interface in an order matching the ranking.

4 more elements

A non-transitory machine-readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:

obtaining information obtained via a graphical user interface, the information relating to information about interactions by users with a plurality of items rendered in the graphical user interface, the information including a timestamp of a time and date at which a corresponding interaction occurred;
upon detecting a condition that triggers a ranking of items rendered in the graphical user interface, for each item for which the condition applies:
calculating a ranking score for the item, without ever performing a write operation for the ranking score;
applying a decay to the ranking score by applying a Gaussian distribution to the item, the Gaussian distribution plotting the item as a distribution having interactions on a first axis and time on a second axis, using the timestamp of the item as an origin and a predetermined value as an offset to the Gaussian distribution, the offset causing a shift in the distribution on the second axis, the predetermined value being based on network traffic, to produce a decayed ranking score;
and
ranking the items for which the condition applies based on their respective decayed ranking scores;
rendering at least a subset of items for which the condition occurs in the graphical user interface in an order matching the ranking.

4 more elements

Dependencies are inferred from the claim text.